In spatial modulation (SM) and quadrature SM (QSM), the maximum-likelihood (ML) decoder provides the optimum solution with high decoding complexity at the receiver side. This paper presents a novel low-complexity algorithm for decoding the SM and QSM symbols, referred to as the min-max algorithm. This is an intelligent searching algorithm, particularly designed for the tree-search of the SM and QSM decoders. The proposed algorithm expands the minimum Euclidean distance (ED) by adding a single node at each step, without considering the order of the branches. The expanding process stops if the minimum ED occurs at the end of a fully expanded branch. It is shown that the proposed algorithm achieves the optimum ML bit error rate performance with a significant reduction in the decoding complexity comparing with SM-ML and QSM-ML, as well as other existing sphere decoding algorithms. Simulations and mathematical analysis are provided to assess the decoding performance and complexity of the proposed algorithm.
Low Complexity Decoders for Spatial and Quadrature Spatial Modulations - Invited Paper
01.06.2018
464665 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Improved Quadrature Spatial Modulation
IEEE | 2017
|Spatial light modulators and applications (Invited Paper) [2321-187]
British Library Conference Proceedings | 1994
|Temporal-spatial optical information processing (Invited Paper) [3137-34]
British Library Conference Proceedings | 1997
|Constellation Design for Quadrature Spatial Modulation
IEEE | 2017
|