Block-Orthogonal Space–Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction
- 1 September 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 5 (8) , 1438-1450
Abstract
Full-rate space time codes (STCs) with rate number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant decoding complexity reduction without performance loss. We show that such complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the QRDM complexity reduction potential. Simulation results of bit error rate (BER) performance against decoding complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-complexity mode, and the code exhibits a desirable complexity saturation property.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Group-Decodable Space-Time Block Codes with Code Rate > 1IEEE Transactions on Communications, 2011
- Space-Time Codes with Block-Orthogonal Structure and Their Simplified ML and Near-ML Decoding2010
- Unbalanced and Balanced 2-Group Decodable Spatial Multiplexing Code2009
- On High-Rate Full-Diversity 2 × 2 Space-Time Codes with Low-Complexity Optimum DetectionIEEE Transactions on Communications, 2009
- New rate-2 STBC design for 2 TX with reduced-complexity maximum likelihood decodingIEEE Transactions on Wireless Communications, 2009
- Four-Group Decodable Space–Time Block CodesIEEE Transactions on Signal Processing, 2007
- Single-symbol maximum likelihood decodable linear STBCsIEEE Transactions on Information Theory, 2006
- On the Search for High-Rate Quasi-Orthogonal Space–Time Block CodeInternational Journal of Wireless Information Networks, 2006
- Quasi-orthogonal STBC with minimum decoding complexityIEEE Transactions on Wireless Communications, 2005
- Layered space-time architecture for wireless communication in a fading environment when using multi-element antennasBell Labs Technical Journal, 2002