Title :
Iterative reduced-search decoding for coded partial-response channels
Author :
Qin, Zhiliang ; Zou, Xiaoxin
Author_Institution :
Data Storage Inst., Singapore
fDate :
10/1/2008 12:00:00 AM
Abstract :
The full-complexity soft-input/soft-output (SISO) detector based on the BCJR algorithm for coded partial-response channels has a computational complexity growing exponentially with channel memory length. In this letter, we propose a low complexity soft-output channel detector based on the Chase decoding algorithm, which was previously applied to decode turbo product codes. At each iteration, the proposed detector forms a candidate list using all possible combinations of bit patterns in the weakest indices based on tentative hard estimates and a priori information fed back from the outer decoder. To demonstrate the performance/complexity tradeoff of the proposed detector, simulation results over rate-8/9 turbo-coded EPR4 and ME/sup 2/PR4 channels are presented, respectively. It is shown that the proposed detector can significantly reduce the computational complexity with only a small performance loss compared to the BCJR algorithm.
Keywords :
channel coding; computational complexity; decoding; equalisers; turbo codes; BCJR algorithm; Chase decoding algorithm; SISO; computational complexity; decoding; partial-response channels; soft-input/soft-output detector; turbo product codes; AWGN; Additive white noise; Computational complexity; Detectors; Gaussian noise; Intersymbol interference; Iterative decoding; Matched filters; Noise level; Turbo codes; Chase decoding; local search; turbo codes; turbo equalization;
Journal_Title :
Communications, IEEE Transactions on
Conference_Location :
10/1/2008 12:00:00 AM
DOI :
10.1109/TCOMM.2008.060427