Toward a Preferred 4 x 4 Space-Time Block Code: A Performance-Versus-Complexity Sweet Spot with Linear-Filter Decoding
Authors:
- 22 February 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 61 (5) , 1847-1855
Abstract
We develop a new 4 × 4 Hadamard-precoded quasi-orthogonal space-time block code (QO-STBC) that enables highly effective near-maximum-likelihood (near-ML) reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate minimization is being used to optimize the code rotation angle. Detailed computational complexity evaluation of the decoder in terms of real multiplications and additions shows significant complexity reduction for symbol alphabet sizes of interest. Numerical and simulation studies demonstrate negligible bit-error-rate degradation compared to the state-of-the-art in bit-error-rate by ML decoded 4 × 4 codewords.Keywords
This publication has 23 references indexed in Scilit:
- On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding ComplexityIEEE Transactions on Information Theory, 2009
- A New Restricted Full-Rank Single-Symbol Decodable Design for Four Transmit AntennasIEEE Signal Processing Letters, 2008
- Space–Time Block Codes Achieving Full Diversity With Linear ReceiversIEEE Transactions on Information Theory, 2008
- MMSE optimal algebraic space-time codesIEEE Transactions on Wireless Communications, 2008
- Maximum Likelihood Detection of Quasi-Orthogonal Space-Time Block Codes: Analysis and Simplification2008
- Optimising quasi-orthogonal STBC through group-constrained linear transformationIET Communications, 2007
- Quasi-orthogonal STBC with minimum decoding complexityIEEE Transactions on Wireless Communications, 2005
- Rectangular co-ordinate interleaved orthogonal designs2004
- Improved quasi-orthogonal codes through constellation rotationIEEE Transactions on Communications, 2003
- A quasi-orthogonal space-time block codeIEEE Transactions on Communications, 2001