20,024 research outputs found
A joint time-invariant filtering approach to the linear Gaussian relay problem
In this paper, the linear Gaussian relay problem is considered. Under the
linear time-invariant (LTI) model the problem is formulated in the frequency
domain based on the Toeplitz distribution theorem. Under the further assumption
of realizable input spectra, the LTI Gaussian relay problem is converted to a
joint design problem of source and relay filters under two power constraints,
one at the source and the other at the relay, and a practical solution to this
problem is proposed based on the projected subgradient method. Numerical
results show that the proposed method yields a noticeable gain over the
instantaneous amplify-and-forward (AF) scheme in inter-symbol interference
(ISI) channels. Also, the optimality of the AF scheme within the class of
one-tap relay filters is established in flat-fading channels.Comment: 30 pages, 10 figure
Trading Wireless Information and Power Transfer: Relay Selection to Minimize the Outage Probability
This paper studies the outage probability minimization problem for a multiple
relay network with energy harvesting constraints. The relays are hybrid nodes
used for simultaneous wireless information and power transfer from the source
radio frequency (RF) signals. There is a trade-off associated with the amount
of time a relay node is used for energy and information transfer. Large
intervals of information transfer implies little time for energy harvesting
from RF signals and thus, high probability of outage events. We propose relay
selection schemes for a cooperative system with a fixed number of RF powered
relays. We address both causal and non-causal channel state information cases
at the relay--destination link and evaluate the trade-off associated with
information/power transfer in the context of minimization of outage
probability.Comment: IEEE GlobalSiP, 201
Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems
In this paper, we consider a cognitive multi-hop relay secondary user (SU)
system sharing the spectrum with some primary users (PU). The transmit power as
well as the hop selection of the cognitive relays can be dynamically adapted
according to the local (and causal) knowledge of the instantaneous channel
state information (CSI) in the multi-hop SU system. We shall determine a low
complexity, decentralized algorithm to maximize the average end-to-end
throughput of the SU system with dynamic spatial reuse. The problem is
challenging due to the decentralized requirement as well as the causality
constraint on the knowledge of CSI. Furthermore, the problem belongs to the
class of stochastic Network Utility Maximization (NUM) problems which is quite
challenging. We exploit the time-scale difference between the PU activity and
the CSI fluctuations and decompose the problem into a master problem and
subproblems. We derive an asymptotically optimal low complexity solution using
divide-and-conquer and illustrate that significant performance gain can be
obtained through dynamic hop selection and power control. The worst case
complexity and memory requirement of the proposed algorithm is O(M^2) and
O(M^3) respectively, where is the number of SUs
- …