DocumentCode :
1998892
Title :
Reduced Complexity Sphere Decoder for Spatial Modulation Detection Receivers
Author :
Younis, Abdelhamid ; Mesleh, Raed ; Haas, Harald ; Grant, Peter M.
Author_Institution :
Inst. for Digital Commun., Univ. of Edinburgh, Edinburgh, UK
fYear :
2010
fDate :
6-10 Dec. 2010
Firstpage :
1
Lastpage :
5
Abstract :
In this paper a novel detection algorithm for spatial modulation (SM) based on sphere decoder (SD) tree search idea is proposed. The aim is to reduce the receiver complexity of the existing optimal decoder while maintaining an optimum performance. The algorithm performs a maximum likelihood (ML) search, only over those points that lie inside a sphere, centered at the received signal, of given radius. It is shown with the aid of analytical derivations, that for a SNR (signal-to-noise ratio) between 2~dB and 18~dB at least 45% and up to 85% reduction in the number of complex operations can be achieved with a close to optimal bit-error-ratio (BER) performance.
Keywords :
MIMO communication; error statistics; maximum likelihood decoding; modulation; radio receivers; tree searching; MIMO; bit-error-ratio; maximum likelihood search; optimal decoder; receiver complexity; reduced complexity sphere decoder; signal-to-noise ratio; spatial modulation detection receivers; sphere decoder tree search idea; Complexity theory; Decoding; Euclidean distance; Modulation; Receiving antennas; Signal to noise ratio; Transmitting antennas;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location :
Miami, FL
ISSN :
1930-529X
Print_ISBN :
978-1-4244-5636-9
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2010.5683993
Filename :
5683993
Link To Document :
بازگشت