Skip to Main content Skip to Navigation
Conference papers

Sphere Decoding for Spatial Modulation

Abstract : In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML-) optimum detectors, which foresee an exhaustive search of the whole search space and have a complexity that linearly increases with the product of number of transmit-antenna, receive-antenna, and size of the modulation scheme. Three SDs specifically designed for SM are proposed and analyzed in terms of Bit Error Probability (BEP) and computational complexity. By judiciously choosing some key parameters, e.g., the radius of the sphere centered around the received signal, it is shown that the proposed algorithms offer the same BEP as ML-optimum detection, with a significant reduction of the computational complexity. Also, it is shown that none of the proposed SDs is always superior to the others, but the best SD to use depends on the system setup, i.e., the number of transmit-antenna, receive-antenna, and the size of the modulation scheme. The computational complexity trade-off offered by the proposed solutions is studied via analysis and simulation, and numerical results are shown to validate our findings.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00658689
Contributor : Marco Di Renzo <>
Submitted on : Friday, January 20, 2012 - 12:39:57 AM
Last modification on : Wednesday, September 16, 2020 - 4:42:48 PM
Long-term archiving on: : Saturday, April 21, 2012 - 2:21:01 AM

File

ICC-2011c.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Abdelhamid Younis, Marco Di Renzo, Raed Mesleh, Harald Haas. Sphere Decoding for Spatial Modulation. IEEE International Conference on Communications (ICC 2011), Jun 2011, Kyoto, Japan. pp.1-6, ⟨10.1109/icc.2011.5963484⟩. ⟨hal-00658689⟩

Share

Metrics

Record views

512

Files downloads

535