Abstract
Turbo equalization is an iterative approach to perform joint equalization and decoding of data, which is protected by error correction code and transmitted over intersymbol interference (ISI) channels. Turbo equalization for Reed Solomon (RS) code, which is a popular error-correction code in wireless communication and recording systems, is seldom discussed in the literature. In this paper, we investigate the computational complexity and performance of turbo equalization which exploits three different kinds of equalization algorithms, i.e., BCJR, M-BCJR and linear minimum mean square error (LMMSE) algorithms. An adaptive belief propagation (ABP) algorithm is used for the decoding of RS code. Simulation results show that, the complexities of the LMMSE and M-BCJR based equalizers are much lower than that of the BCJR based equalizer, and at the same time the performance loss is still acceptable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
