Quadrature Spatial Modulation Decoding Complexity: Study and Reduction

This letter presents the computational complexity reduction of the maximum likelihood-quadrature spatial modulation (QSM-ML) decoder as compared with the conventional SM-ML. Furthermore, a novel reduced-complexity (RC) sphere decoder algorithm, especially designed for QSM decoders, is proposed. It i...

Full description

Saved in:
Bibliographic Details
Published in:IEEE wireless communications letters Vol. 6; no. 3; pp. 378 - 381
Main Authors: Al-Nahhal, Ibrahim, Dobre, Octavia A., Ikki, Salama S.
Format: Journal Article
Language:English
Published: IEEE 01.06.2017
Subjects:
Bit error rate
complexity analysis
Complexity theory
Decoding
Maximum likelihood estimation
Modulation
Multiple-input multiple-output (MIMO)
quadrature spatial modulation (QSM)
Receiving antennas
spatial modulation (SM)
sphere decoder (SD)
ISSN:2162-2337, 2162-2345
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter presents the computational complexity reduction of the maximum likelihood-quadrature spatial modulation (QSM-ML) decoder as compared with the conventional SM-ML. Furthermore, a novel reduced-complexity (RC) sphere decoder algorithm, especially designed for QSM decoders, is proposed. It is shown that the QSM-RC algorithm achieves the optimum QSM-ML bit error ratio performance. Using Monte Carlo simulations and mathematical analysis, at the same spectral efficiency and with notable superior performance, it is shown that the QSM-ML and QSM-RC decoders provide at least 50% and up to 96% reduction in the number of visited nodes, respectively, compared to the SM-ML decoder.
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2017.2694420