1,672 research outputs found
Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels
Transmit signal and bandwidth optimization is considered in multiple-antenna
relay channels. Assuming all terminals have channel state information, the
cut-set capacity upper bound and decode-and-forward rate under full-duplex
relaying are evaluated by formulating them as convex optimization problems. For
half-duplex relays, bandwidth allocation and transmit signals are optimized
jointly. Moreover, achievable rates based on the compress-and-forward
transmission strategy are presented using rate-distortion and Wyner-Ziv
compression schemes. It is observed that when the relay is close to the source,
decode-and-forward is almost optimal, whereas compress-and-forward achieves
good performance when the relay is close to the destination.Comment: 16 pages, 10 figure
When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network
We develop and analyze new cooperative strategies for ad hoc networks that
are more spectrally efficient than classical DF cooperative protocols. Using
analog network coding, our strategies preserve the practical half-duplex
assumption but relax the orthogonality constraint. The introduction of
interference due to non-orthogonality is mitigated thanks to precoding, in
particular Dirty Paper coding. Combined with smart power allocation, our
cooperation strategies allow to save time and lead to more efficient use of
bandwidth and to improved network throughput with respect to classical RDF/PDF.Comment: 7 pages, 7 figure
The Approximate Capacity of the MIMO Relay Channel
Capacity bounds are studied for the multiple-antenna complex Gaussian relay
channel with t1 transmitting antennas at the sender, r2 receiving and t2
transmitting antennas at the relay, and r3 receiving antennas at the receiver.
It is shown that the partial decode-forward coding scheme achieves within
min(t1,r2) bits from the cutset bound and at least one half of the cutset
bound, establishing a good approximate expression of the capacity. A similar
additive gap of min(t1 + t2, r3) + r2 bits is shown to be achieved by the
compress-forward coding scheme.Comment: 8 pages, 5 figures, submitted to the IEEE Transactions on Information
Theor
Study of Gaussian Relay Channels with Correlated Noises
In this paper, we consider full-duplex and half-duplex Gaussian relay
channels where the noises at the relay and destination are arbitrarily
correlated. We first derive the capacity upper bound and the achievable rates
with three existing schemes: Decode-and-Forward (DF), Compress-and-Forward
(CF), and Amplify-and-Forward (AF). We present two capacity results under
specific noise correlation coefficients, one being achieved by DF and the other
being achieved by direct link transmission (or a special case of CF). The
channel for the former capacity result is equivalent to the traditional
Gaussian degraded relay channel and the latter corresponds to the Gaussian
reversely-degraded relay channel. For CF and AF schemes, we show that their
achievable rates are strictly decreasing functions over the negative
correlation coefficient. Through numerical comparisons under different channel
settings, we observe that although DF completely disregards the noise
correlation while the other two can potentially exploit such extra information,
none of the three relay schemes always outperforms the others over different
correlation coefficients. Moreover, the exploitation of noise correlation by CF
and AF accrues more benefit when the source-relay link is weak. This paper also
considers the optimal power allocation problem under the correlated-noise
channel setting. With individual power constraints at the relay and the source,
it is shown that the relay should use all its available power to maximize the
achievable rates under any correlation coefficient. With a total power
constraint across the source and the relay, the achievable rates are proved to
be concave functions over the power allocation factor for AF and CF under
full-duplex mode, where the closed-form power allocation strategy is derived.Comment: 24 pages, 7 figures, submitted to IEEE Transactions on Communication
Relay-assisted Multiple Access with Full-duplex Multi-Packet Reception
The effect of full-duplex cooperative relaying in a random access multiuser
network is investigated here. First, we model the self-interference incurred
due to full-duplex operation, assuming multi-packet reception capabilities for
both the relay and the destination node. Traffic at the source nodes is
considered saturated and the cooperative relay, which does not have packets of
its own, stores a source packet that it receives successfully in its queue when
the transmission to the destination has failed. We obtain analytical
expressions for key performance metrics at the relay, such as arrival and
service rates, stability conditions, and average queue length, as functions of
the transmission probabilities, the self interference coefficient, and the
links' outage probabilities. Furthermore, we study the impact of the relay node
and the self-interference coefficient on the per-user and aggregate throughput,
and the average delay per packet. We show that perfect self-interference
cancelation plays a crucial role when the SINR threshold is small, since it may
result to worse performance in throughput and delay comparing with the
half-duplex case. This is because perfect self-interference cancelation can
cause an unstable queue at the relay under some conditions.Comment: Accepted for publication in the IEEE Transactions on Wireless
Communication
On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel
We study the half-duplex multiple-relay channel (HD-MRC) where every node can
either transmit or listen but cannot do both at the same time. We obtain a
capacity upper bound based on a max-flow min-cut argument and achievable
transmission rates based on the decode-forward (DF) coding strategy, for both
the discrete memoryless HD-MRC and the phase-fading HD-MRC. We discover that
both the upper bound and the achievable rates are functions of the
transmit/listen state (a description of which nodes transmit and which
receive). More precisely, they are functions of the time fraction of the
different states, which we term a schedule. We formulate the optimal scheduling
problem to find an optimal schedule that maximizes the DF rate. The optimal
scheduling problem turns out to be a maximin optimization, for which we propose
an algorithmic solution. We demonstrate our approach on a four-node
multiple-relay channel, obtaining closed-form solutions in certain scenarios.
Furthermore, we show that for the received signal-to-noise ratio degraded
phase-fading HD-MRC, the optimal scheduling problem can be simplified to a max
optimization.Comment: Author's final version (to appear in IEEE Transactions on Information
Theory
- …