DocumentCode :
2266748
Title :
Simplified robust fixed-complexity sphere decoder
Author :
Yuehua Ding ; Yide Wang ; Diouris, Jean-Francois
Author_Institution :
IREENA, Univ. de Nantes, Nantes, France
fYear :
2011
fDate :
Aug. 29 2011-Sept. 2 2011
Firstpage :
116
Lastpage :
120
Abstract :
A simplified robust fixed-complexity sphere decoder (SRFSD) is proposed in this paper. SRFSD reduces the complexity of robust fixed complexity sphere decoder (RFSD) by choosing a detection order minimizing the upper bound of the power of the interference in single expansion (SE) stage. Theoretical proof is given to support the feasibility of SRFSD. Simulation results show that SRFSD retains the robustness of RFSD, and sharply reduces the complexity of RFSD with little sacrifice in bit error rate (BER) performance.
Keywords :
MIMO communication; communication complexity; error statistics; interference suppression; BER; MIMO communication system; SRFSD; bit error rate; simplified robust fixed complexity sphere decoder; single expansion; upper bound minimization; Bit error rate; Complexity theory; Indexes; Iron; Phase shift keying; Robustness; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing Conference, 2011 19th European
Conference_Location :
Barcelona
ISSN :
2076-1465
Type :
conf
Filename :
7073988
Link To Document :
بازگشت