229 research outputs found
Diversity-Multiplexing Tradeoffs in MIMO Relay Channels
A multi-hop relay channel with multiple antenna terminals in a quasi-static
slow fading environment is considered. For both full-duplex and half-duplex
relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is
shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in
the full-duplex relay scenario, the dynamic decode-and-forward (DDF) protocol
is needed to achieve the optimal DMT if the relay is constrained to half-duplex
operation. For the latter case, static protocols are considered as well, and
the corresponding achievable DMT performance is characterized.Comment: To appear at IEEE Global Communications Conf. (Globecom), New
Orleans, LA, Nov. 200
Optimal space-time codes for the MIMO amplify-and-forward cooperative channel
In this work, we extend the non-orthogonal amplify-and-forward (NAF)
cooperative diversity scheme to the MIMO channel. A family of space-time block
codes for a half-duplex MIMO NAF fading cooperative channel with N relays is
constructed. The code construction is based on the non-vanishing determinant
criterion (NVD) and is shown to achieve the optimal diversity-multiplexing
tradeoff (DMT) of the channel. We provide a general explicit algebraic
construction, followed by some examples. In particular, in the single relay
case, it is proved that the Golden code and the 4x4 Perfect code are optimal
for the single-antenna and two-antenna case, respectively. Simulation results
reveal that a significant gain (up to 10dB) can be obtained with the proposed
codes, especially in the single-antenna case.Comment: submitted to IEEE Transactions on Information Theory, revised versio
End-to-End Joint Antenna Selection Strategy and Distributed Compress and Forward Strategy for Relay Channels
Multi-hop relay channels use multiple relay stages, each with multiple relay
nodes, to facilitate communication between a source and destination.
Previously, distributed space-time codes were proposed to maximize the
achievable diversity-multiplexing tradeoff, however, they fail to achieve all
the points of the optimal diversity-multiplexing tradeoff. In the presence of a
low-rate feedback link from the destination to each relay stage and the source,
this paper proposes an end-to-end antenna selection (EEAS) strategy as an
alternative to distributed space-time codes. The EEAS strategy uses a subset of
antennas of each relay stage for transmission of the source signal to the
destination with amplify and forwarding at each relay stage. The subsets are
chosen such that they maximize the end-to-end mutual information at the
destination. The EEAS strategy achieves the corner points of the optimal
diversity-multiplexing tradeoff (corresponding to maximum diversity gain and
maximum multiplexing gain) and achieves better diversity gain at intermediate
values of multiplexing gain, versus the best known distributed space-time
coding strategies. A distributed compress and forward (CF) strategy is also
proposed to achieve all points of the optimal diversity-multiplexing tradeoff
for a two-hop relay channel with multiple relay nodes.Comment: Accepted for publication in the special issue on cooperative
communication in the Eurasip Journal on Wireless Communication and Networkin
A Simple Cooperative Diversity Method Based on Network Path Selection
Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is more than one cooperative relay. We propose a novel
scheme, that alleviates these problems and provides diversity gains on the
order of the number of relays in the network. Our scheme first selects the best
relay from a set of M available relays and then uses this best relay for
cooperation between the source and the destination. We develop and analyze a
distributed method to select the best relay that requires no topology
information and is based on local measurements of the instantaneous channel
conditions. This method also requires no explicit communication among the
relays. The success (or failure) to select the best available path depends on
the statistics of the wireless channel, and a methodology to evaluate
performance for any kind of wireless channel statistics, is provided.
Information theoretic analysis of outage probability shows that our scheme
achieves the same diversity-multiplexing tradeoff as achieved by more complex
protocols, where coordination and distributed space-time coding for M nodes is
required, such as those proposed in [7]. The simplicity of the technique,
allows for immediate implementation in existing radio hardware and its adoption
could provide for improved flexibility, reliability and efficiency in future 4G
wireless systems.Comment: To appear, IEEE JSAC, special issue on 4
Enhancing diversity and multiplexing gains in multi-user wireless relay systems
The demand for higher transmission rates and better quality of service in modern wireless
communications is endless. The use of multiple transmit or /and receive antennas has been
considered as one of the most powerful approaches to facilitate high -speed and high -quality
communications. However, in practical cellular systems, mobile terminals may not be able to
support a multiple- antenna setup. Thus an emerging technique called cooperative diversity is
under consideration to utilize the multi -hop relay concept to realize the advantages of multiple - antenna systems in multi -user single- antenna networks. Cooperative diversity has attracted
much interest in recent years as a very promising direction for future wireless communication
evolution.Due to the fact that in practice terminals cannot transmit and receive simultaneously (i.e. the
half -duplex limitation), the diversity improvement brought by the standard cooperative diversity
transmission protocols is in general accompanied by a multiplexing loss (equivalent to a
reduction in transmission data rate in high signal -to -nose ratio (SNR)). The purpose of this
thesis is to use advanced transmission protocols to provide both good diversity and multiplexing
performance when using the practical repetition -coded decode - and -forward (DF) relaying
strategy in uplink mobile -to -base station transmission of cellular systems.The task is fulfilled by relaxing the orthogonal channel allocation requirement of the standard
protocols and by using two relays to take turns forwarding source information to destination.
We start our analysis from an M- source two -relay one -destination network. Through
diversity -multiplexing tradeoff (DMT) analysis, we prove that for an isolated -relay scenario
and a strong -interference scenario, the considered approach effectively recovers the multiplexing
loss induced by the standard protocols while still obtaining diversity improvement over
direct source -destination transmission without considering relaying.In addition, since the optimal multiplexing gain of the considered system can be achieved by the
above approach, we study further improving diversity performance for a two -source network.
We analyze taking full advantage of the multiple- source structure, multiple -relay structure, and
the capability of affording complex signal processing at the destination (base station). For all
three cases, we prove that the diversity performance of the above approach can be enhanced
without a significant loss of multiplexing performance or using complex coding strategies at
relays. Since the good DMT performance is not affected by source -relay channel conditions,
the protocols discussed in this thesis make relaying more beneficial
Ergodic capacity of the exponentially correlated slotted amplify and forward relay channel
In this paper we analyze the performance degradation of slotted amplify-and-forward protocol in wireless environments with high node density where the number of relays grows asymptotically large. Channel gains between source-destination pairs in such networks can no longer be independent. We analyze the degradation of performance in such wireless environments where channel gains are exponentially correlated by looking at the capacity per channel use. Theoretical results for eigenvalue distribution and the capacity are derived and compared with the simulation results. Both analytical and simulated results show that the capacity given by the asymptotic mutual information decreases with the network density
Cooperative Compute-and-Forward
We examine the benefits of user cooperation under compute-and-forward. Much
like in network coding, receivers in a compute-and-forward network recover
finite-field linear combinations of transmitters' messages. Recovery is enabled
by linear codes: transmitters map messages to a linear codebook, and receivers
attempt to decode the incoming superposition of signals to an integer
combination of codewords. However, the achievable computation rates are low if
channel gains do not correspond to a suitable linear combination. In response
to this challenge, we propose a cooperative approach to compute-and-forward. We
devise a lattice-coding approach to block Markov encoding with which we
construct a decode-and-forward style computation strategy. Transmitters
broadcast lattice codewords, decode each other's messages, and then
cooperatively transmit resolution information to aid receivers in decoding the
integer combinations. Using our strategy, we show that cooperation offers a
significant improvement both in the achievable computation rate and in the
diversity-multiplexing tradeoff.Comment: submitted to IEEE Transactions on Information Theor
- …