Abstract | ||
---|---|---|
Space shift keying (SSK) modulation and its extension, the generalized SSK (GSSK), present an attractive framework for the emerging large-scale MIMO systems in reducing hardware costs. In SSK, the maximum likelihood (ML) detector incurs considerable computational complexities. We propose a compressed sensing based detector, NCS, by formulating the SSK-type detection criterion as a convex optimization problem. The proposed NCS requires only O(n tN rN t) complexity, outperforming the O(N rN tN nt t}) complexity in the ML detector, at the cost of slight fidelity degradation. Simulations are conducted to substantiate the analytical derivation and the detection accuracy. © 2012 IEEE. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/LCOMM.2012.091212.121319 | IEEE Communications Letters |
Keywords | Field | DocType |
MIMO,Modulation,Transmitting antennas,Vectors,Complexity theory,Receiving antennas,Compressed sensing | Fidelity,Phase modulation,Control theory,Computer science,MIMO,Modulation,Real-time computing,Electronic engineering,Convex optimization,Detector,Compressed sensing,Computational complexity theory | Journal |
Volume | Issue | ISSN |
16 | 10 | 1089-7798 |
Citations | PageRank | References |
28 | 1.08 | 9 |
Authors | ||
7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chia-Mu Yu | 1 | 242 | 29.59 |
Sung-Hsien Hsieh | 2 | 48 | 13.71 |
Han-Wen Liang | 3 | 50 | 3.99 |
Chun-shien Lu | 4 | 1238 | 104.71 |
Wei-Ho Chung | 5 | 517 | 68.70 |
Sy-Yen Kuo | 6 | 2304 | 245.46 |
Soo-Chang Pei | 7 | 2054 | 241.11 |