DocumentCode :
3141932
Title :
The Spherical Bound Stack Decoder
Author :
Ben-Othman, G.R. ; Ouertani, Rym ; Salah, Abdellatif
Author_Institution :
TELECOM ParisTech, Paris
fYear :
2008
fDate :
12-14 Oct. 2008
Firstpage :
322
Lastpage :
327
Abstract :
In this work, we are interested in the decoding of MIMO systems by using sequential decoders. These ones consist on tree search algorithms and were originally used to decode binary codes. They were rediscovered and adapted to MIMO systems by Murugan and al. We are interested here in the stack decoder. We propose a new sequential decoder that we call the spherical-bound stack decoder (SB-Stack) combining the stack decoder search strategy and the sphere decoder search region. We show that the SB-stack achieves the ML performance with a reduced complexity compared to the original stack and the sphere decoder. Furthermore by introducing the bias parameter the SB-stack offers a range of performances going from ML to ZF-DFE with proportional complexities.
Keywords :
MIMO systems; binary codes; decision feedback equalisers; maximum likelihood decoding; search problems; sequential decoding; trees (mathematics); MIMO system decoding; ML performance; ZF-DFE performance; bias parameter; binary codes; sequential decoders; spherical bound stack decoder; tree search algorithm; Binary codes; Computer networks; Decoding; IEEE members; Lattices; MIMO; Mobile communication; Mobile computing; Performance loss; Telecommunication computing; Complexity reduction; ML; Sequantial decoding; Sphere decoder; Stack algorithm; Tree search;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking and Communications, 2008. WIMOB '08. IEEE International Conference on Wireless and Mobile Computing,
Conference_Location :
Avignon
Print_ISBN :
978-0-7695-3393-3
Electronic_ISBN :
978-0-7695-3393-3
Type :
conf
DOI :
10.1109/WiMob.2008.115
Filename :
4654256
Link To Document :
بازگشت