DocumentCode :
459353
Title :
Reduced-Complexity BCJR Algorithm for Turbo Equalization
Author :
Fertonani, Dario ; Barbieri, Alan ; Colavolpe, Giulio
Author_Institution :
UniversitÃ\xa0 di Parma, Dipartimento di Ingegneria dell´´Informazione, Parco Area delle Scienze 181/A, I-43100 Parma, Italy. Email: dario.fertonani@nemo.unipr.it
Volume :
3
fYear :
2006
fDate :
38869
Firstpage :
1237
Lastpage :
1242
Abstract :
We present innovative techniques to reduce the complexity of the well known BCJR detection algorithm applied on channels affected by intersymbol interference. On a general channel with mixed phase, we independently perform two reduced trellis searches in the forward and backward recursions, and propose a modified completion stage for combining them. When iterative detection/decoding is performed, the reduced searches are defined on the basis of a probabilistic criterion which provides a noticeable performance improvement with respect to the other reduced-complexity algorithms. On the other hand, for channels with minimum phase, we show that the simplified backward recursion can operate on the same set of paths selected during the forward search. Computer simulations confirm the effectiveness of the proposed algorithms in various turbo equalization schemes.
Keywords :
Algorithm design and analysis; Approximation algorithms; Computer simulation; Detection algorithms; Fading; Intersymbol interference; Iterative algorithms; Iterative decoding; Performance loss; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2006. ICC '06. IEEE International Conference on
Conference_Location :
Istanbul
ISSN :
8164-9547
Print_ISBN :
1-4244-0355-3
Electronic_ISBN :
8164-9547
Type :
conf
DOI :
10.1109/ICC.2006.254917
Filename :
4024309
Link To Document :
بازگشت