5,646 research outputs found
Code diversity in multiple antenna wireless communication
The standard approach to the design of individual space-time codes is based
on optimizing diversity and coding gains. This geometric approach leads to
remarkable examples, such as perfect space-time block codes, for which the
complexity of Maximum Likelihood (ML) decoding is considerable. Code diversity
is an alternative and complementary approach where a small number of feedback
bits are used to select from a family of space-time codes. Different codes lead
to different induced channels at the receiver, where Channel State Information
(CSI) is used to instruct the transmitter how to choose the code. This method
of feedback provides gains associated with beamforming while minimizing the
number of feedback bits. It complements the standard approach to code design by
taking advantage of different (possibly equivalent) realizations of a
particular code design. Feedback can be combined with sub-optimal low
complexity decoding of the component codes to match ML decoding performance of
any individual code in the family. It can also be combined with ML decoding of
the component codes to improve performance beyond ML decoding performance of
any individual code. One method of implementing code diversity is the use of
feedback to adapt the phase of a transmitted signal as shown for 4 by 4
Quasi-Orthogonal Space-Time Block Code (QOSTBC) and multi-user detection using
the Alamouti code. Code diversity implemented by selecting from equivalent
variants is used to improve ML decoding performance of the Golden code. This
paper introduces a family of full rate circulant codes which can be linearly
decoded by fourier decomposition of circulant matrices within the code
diversity framework. A 3 by 3 circulant code is shown to outperform the
Alamouti code at the same transmission rate.Comment: 9 page
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
- ā¦