Fast Maximum-Likelihood Decoder for 4*4 Quasi-Orthogonal Space-Time Block Code

TL;DR

This paper presents two efficient maximum-likelihood decoding algorithms for 4x4 quasi-orthogonal space-time block codes, significantly reducing computational complexity while maintaining performance, especially with high-order QAM constellations.

Contribution

Introduces two novel ML decoding algorithms that exploit code structure and noise statistics to reduce complexity for 4x4 QOSTBC, applicable to arbitrary constellations.

Findings

Decoders outperform recent methods in complexity

Application with 1024-QAM reduces computational load

Algorithms are effective for arbitrary constellations

Abstract

This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). The first algorithm with a relatively simple design exploits structure of quadrature amplitude modulation (QAM) constellations to achieve its goal and the second algorithm, though somewhat more complex, can be applied to any arbitrary constellation. Both decoders utilize a novel decomposition technique for ML metric which divides the metric into independent positive parts and a positive interference part. Search spaces of symbols are substantially reduced by employing the independent parts and statistics of noise. Finally, the members of search spaces are successively evaluated until the metric is minimized. Simulation results confirm that the proposed decoder is superior to some of the most recently published methods in terms of complexity level. More specifically, the results verified that application of the new algorithm with 1024-QAM would require reduced computational complexity compared to state-of-the-art solution with 16-QAM.