Generalised sphere decoding for spatial modulation

Abdelhamid Younis; Sinan Sinanovic; Raed Mesleh; Marco Di Renzo; Harald Haas

doi:10.1109/TCOMM.2013.061013.120547

Generalised sphere decoding for spatial modulation

Abdelhamid Younis, Sinan Sinanovic, Raed Mesleh, Marco Di Renzo, Harald Haas

Research output: Contribution to journal › Article

Abstract

In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of Bit Error Ratio (BER) and computational complexity. Using Monte Carlo simulations and mathematical analysis, it is shown that by carefully choosing the initial radius the proposed sphere decoder algorithms offer the same BER as ML detection, with a significant reduction in the computational complexity. A tight closed form expression for the BER performance of SM-SD is derived in the paper, along with an algorithm for choosing the initial radius which provides near to optimum performance.

Original language	English
Pages (from-to)	2805-2815
Number of pages	11
Journal	IEEE Transactions on Communications
Volume	61
Issue number	7
DOIs	https://doi.org/10.1109/TCOMM.2013.061013.120547
Publication status	Published - Jul 2013

Fingerprint

Keywords

algorithms
sphere decoding
spatial modulation

Cite this

Younis, A., Sinanovic, S., Mesleh, R., Di Renzo, M., & Haas, H. (2013). Generalised sphere decoding for spatial modulation. IEEE Transactions on Communications, 61(7), 2805-2815. https://doi.org/10.1109/TCOMM.2013.061013.120547

@article{1abd9d58c0814dd88f19c5bc6a425bea,

title = "Generalised 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) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of Bit Error Ratio (BER) and computational complexity. Using Monte Carlo simulations and mathematical analysis, it is shown that by carefully choosing the initial radius the proposed sphere decoder algorithms offer the same BER as ML detection, with a significant reduction in the computational complexity. A tight closed form expression for the BER performance of SM-SD is derived in the paper, along with an algorithm for choosing the initial radius which provides near to optimum performance. ",

keywords = "algorithms , sphere decoding, spatial modulation ",

author = "Abdelhamid Younis and Sinan Sinanovic and Raed Mesleh and {Di Renzo}, Marco and Harald Haas",

year = "2013",

month = jul,

doi = "10.1109/TCOMM.2013.061013.120547",

language = "English",

volume = "61",

pages = "2805--2815",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Generalised sphere decoding for spatial modulation

AU - Younis, Abdelhamid

AU - Sinanovic, Sinan

AU - Mesleh, Raed

AU - Di Renzo, Marco

AU - Haas, Harald

PY - 2013/7

Y1 - 2013/7

N2 - In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of Bit Error Ratio (BER) and computational complexity. Using Monte Carlo simulations and mathematical analysis, it is shown that by carefully choosing the initial radius the proposed sphere decoder algorithms offer the same BER as ML detection, with a significant reduction in the computational complexity. A tight closed form expression for the BER performance of SM-SD is derived in the paper, along with an algorithm for choosing the initial radius which provides near to optimum performance.

AB - In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of Bit Error Ratio (BER) and computational complexity. Using Monte Carlo simulations and mathematical analysis, it is shown that by carefully choosing the initial radius the proposed sphere decoder algorithms offer the same BER as ML detection, with a significant reduction in the computational complexity. A tight closed form expression for the BER performance of SM-SD is derived in the paper, along with an algorithm for choosing the initial radius which provides near to optimum performance.

KW - algorithms

KW - sphere decoding

KW - spatial modulation

U2 - 10.1109/TCOMM.2013.061013.120547

DO - 10.1109/TCOMM.2013.061013.120547

M3 - Article

VL - 61

SP - 2805

EP - 2815

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 7

ER -

Documents and Links

10.1109/TCOMM.2013.061013.120547