Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation

Rajesh RAMANATHAN  Partha Sharathi MALLICK  Thiruvengadam SUNDARAJAN JAYARAMAN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.3   pp.632-635
Publication Date: 2018/03/01
Online ISSN: 1745-1337
Type of Manuscript: LETTER
Category: Communication Theory and Signals
quadrature spatial modulation,  orthogonal matching pursuit,  compressive sensing,  sparse signal,  

Full Text: PDF(299.4KB)
>>Buy this Article

In this letter, we propose a generalized quadrature spatial modulation technique (GQSM) which offers additional bits per channel use (bpcu) gains and a low complexity greedy detector algorithm, structured orthogonal matching pursuit (S-OMP)- GQSM, based on compressive sensing (CS) framework. Simulation results show that the bit error rate (BER) performance of the proposed greedy detector is very close to maximum likelihood (ML) and near optimal detectors based on convex programming.