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

Regular Section

Low Complexity Compressive Sensing Greedy Detection of Generalized Quadrature Spatial Modulation

Rajesh RAMANATHAN, Partha Sharathi MALLICK, Thiruvengadam SUNDARAJAN JAYARAMAN

著者情報

キーワード: quadrature spatial modulation, orthogonal matching pursuit, compressive sensing, sparse signal

ジャーナル認証あり

2018 年 E101.A 巻 3 号 p. 632-635

DOI https://doi.org/10.1587/transfun.E101.A.632

詳細

抄録

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.

責任著者(Corresponding author)

J-STAGEへの登録はこちら（無料）