Fast maximum-likelihood decoder for quasi-orthogonal space-time block code

DOI10.1155/2015/654865MaRDI QIDQ1666261zbMATH OpenOpenAlexWikidataFDO

Authors Adel Ahmadi, Siamak Talebi

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1706.03833

Mathematics Subject Classification ID

Decoding (94B35)

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.

Review text

Summary: Motivated by the decompositions of sphere and QR-based methods, in this paper we present an extremely fast maximum-likelihood (ML) detection approach for quasi-orthogonal space-time block code (QOSTBC). The proposed algorithm with a relatively simple design exploits structure of quadrature amplitude modulation (QAM) constellations to achieve its goal and can be extended to any arbitrary constellation. Our decoder utilizes a new 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. Symbols within the search spaces are successively evaluated until the metric is minimized. Simulation results confirm that the proposed decoder's performance is superior to many of the recently published state-of-the-art solutions in terms of complexity level. More specifically, it was possible to verify that application of the new algorithms with 1024-QAM would decrease the computational complexity compared to state-of-the-art solution with 16-QAM.

Recommendations

• Low complexity suboptimal decode algorithms for quasi-orthogonal space time block codes
• Signal constellations for quasi-orthogonal space-time block codes with full diversity
• Power-Balanced Orthogonal Space-Time Block Code
• A quasi-orthogonal space-time block code
• A New Generic Maximum-Likelihood Metric Expression for Space–Time Block Codes With Applications to Decoding

Cites work

• A fast sphere decoding algorithm for space-frequency block codes
• A quasi-orthogonal space-time block code
• Signal constellations for quasi-orthogonal space-time block codes with full diversity

Cited in

(4)

• A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
• Low complexity suboptimal decode algorithms for quasi-orthogonal space time block codes
• A New Generic Maximum-Likelihood Metric Expression for Space–Time Block Codes With Applications to Decoding
• Power-Balanced Orthogonal Space-Time Block Code

This page was built for publication: Fast maximum-likelihood decoder for quasi-orthogonal space-time block code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666261)