Limited feedback unitary precoding for orthogonal space-time block codes
Top Cited Papers
- 20 December 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 53 (1) , 64-73
- https://doi.org/10.1109/tsp.2004.838928
Abstract
Orthogonal space-time block codes (OSTBCs) are a class of easily decoded space-time codes that achieve full diversity order in Rayleigh fading channels. OSTBCs exist only for certain numbers of transmit antennas and do not provide array gain like diversity techniques that exploit transmit channel information. When channel state information is available at the transmitter, though, precoding the space-time codeword can be used to support different numbers of transmit antennas and to improve array gain. Unfortunately, transmitters in many wireless systems have no knowledge about current channel conditions. This motivates limited feedback precoding methods such as channel quantization or antenna subset selection. This paper investigates a limited feedback approach that uses a codebook of precoding matrices known a priori to both the transmitter and receiver. The receiver chooses a matrix from the codebook based on current channel conditions and conveys the optimal codebook matrix to the transmitter over an error-free, zero-delay feedback channel. A criterion for choosing the optimal precoding matrix in the codebook is proposed that relates directly to minimizing the probability of symbol error of the precoded system. Low average distortion codebooks are derived based on the optimal codeword selection criterion. The resulting design is found to relate to the famous applied mathematics problem of subspace packing in the Grassmann manifold. Codebooks designed by this method are proven to provide full diversity order in Rayleigh fading channels. Monte Carlo simulations show that limited feedback precoding performs better than antenna subset selection.Keywords
This publication has 41 references indexed in Scilit:
- Grassmannian beamforming for multiple-input multiple-output wireless systemsIEEE Transactions on Information Theory, 2003
- Grassmannian frames with applications to coding and communicationApplied and Computational Harmonic Analysis, 2003
- Bounds on packings of spheres in the Grassmann manifoldIEEE Transactions on Information Theory, 2002
- Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channelIEEE Transactions on Information Theory, 2002
- Generalized linear precoder and decoder design for MIMO channels using the weighted MMSE criterionIEEE Transactions on Communications, 2001
- Systematic design of unitary space-time constellationsIEEE Transactions on Information Theory, 2000
- Capacity of a mobile multiple-antenna communication link in Rayleigh flat fadingIEEE Transactions on Information Theory, 1999
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Vector Quantization and Signal CompressionPublished by Springer Nature ,1992
- Distributions of Matrix Variates and Latent Roots Derived from Normal SamplesThe Annals of Mathematical Statistics, 1964