Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation

Rajesh RAMANATHAN; Partha Sharathi MALLICK; Thiruvengadam SUNDARAJAN JAYARAMAN

doi:10.1587/transfun.E101.A.632

Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation

Rajesh RAMANATHAN, Partha Sharathi MALLICK, Thiruvengadam SUNDARAJAN JAYARAMAN

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.3 pp.632-635

Publication Date: 2018/03/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E101.A.632

Type of Manuscript: LETTER

Category: Communication Theory and Signals

Cite this

Copy

Rajesh RAMANATHAN, Partha Sharathi MALLICK, Thiruvengadam SUNDARAJAN JAYARAMAN, "Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation" in IEICE TRANSACTIONS on Fundamentals, vol. E101-A, no. 3, pp. 632-635, March 2018, doi: 10.1587/transfun.E101.A.632.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.632/_p

Copy

@ARTICLE{e101-a_3_632,
author={Rajesh RAMANATHAN, Partha Sharathi MALLICK, Thiruvengadam SUNDARAJAN JAYARAMAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation},
year={2018},
volume={E101-A},
number={3},
pages={632-635},
abstract={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.},
keywords={},
doi={10.1587/transfun.E101.A.632},
ISSN={1745-1337},
month={March},}

Copy

TY - JOUR
TI - Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 632
EP - 635
AU - Rajesh RAMANATHAN
AU - Partha Sharathi MALLICK
AU - Thiruvengadam SUNDARAJAN JAYARAMAN
PY - 2018
DO - 10.1587/transfun.E101.A.632
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2018
AB - 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.
ER -