Low complexity maximum likelihood decoding for orthogonal space-time block codes using non-square and rotated quadrature amplitude modulation. Issue 5 (4th May 2021)

• Record Type: Journal Article
• Authors: Surendar, M.
• Is Part Of: International journal of electronics. Volume 108:Issue 5(2021)
• Page Start: 777
• Page End: 794
• Publication Date: 2021-05-04
• Subjects: Orthogonal space-time block codes (OSTBCs) -- maximum likelihood decoding -- M-ary quadrature amplitude modulation (M-QAM) -- real-valued lattice representations -- constellation; Electronics -- Periodicals; Electronic control -- Periodicals; 621.381
• DOI: 10.1080/00207217.2020.1818840
• Languages: English
• ISSNs: 0020-7217

Abstract

ABSTRACT: High diversity gain can be achieved for orthogonal space-time block codes (OSTBCs) using rotated QAM constellations at a cost of high Maximum Likelihood (ML) decoding complexity. Thus far, low complexity ML decoding algorithms were proposed only for OSTBCs with square QAM constellations. In this paper, an algorithm has been proposed to reduce the ML decoding complexity of OSTBCs with non-square and rotated QAM constellations. The ML formulation using real-valued lattice representations is modified in such a way that the complexity depends upon the number of real values required to construct the alphabet of any constellation. Arithmetic progression and symmetry are the two elementary characteristics observed in the real numbers of the alphabets. Based on these characteristics, a new approach called Add and accumulate method has been proposed which drastically reduces the complexity to O 1 and O 3 without sacrificing the performance.