Turbo product codes for partial response channels

The partial response channel can be viewed as a rate-1 encoder in which the output alphabet differs from the input alphabet. In serially concatenated coding schemes, the partial response channel can serve as the inner encoder. Recent work has focused on convolutional codes and parity-check codes as the outer code in such serial concatenation schemes. This work focuses instead on the use of product codes as the outer code. Systems using both hard and soft decoding, with both iterative and non-iterative decoding, are presented. Simulation results are presented comparing performance of product codes which use Reed-Solomon and BCH codes as the constituent codes.

[1]  W. Ryan.  Performance of high rate turbo codes on a PR4-equalized magnetic recording channel , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[2]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

[3]  Hongxin Song,et al.  Block turbo codes for magnetic recording channels , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[4]  Paul H. Siegel,et al.  Turbo decoding for partial response channels , 2000, IEEE Trans. Commun..

[5]  Mark C. Reed,et al.  An iterative receiver for the partial response channel , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[6]  E. Eleftheriou,et al.  Channel precoding and low-density parity-check codes for magnetic recording , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[7]  S.W. McLaughlin,et al.  Turbo codes for PR4 and EPR4 magnetic recording , 1998, Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284).

[8]  Jack K. Wolf,et al.  Turbo decoding for partial response channels with media noise , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[10]  Steven W. McLaughlin,et al.  Iterative application of the Chase algorithm on Reed-Solomon product codes , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  Paul H. Siegel,et al.  Turbo decoding for PR4: parallel versus serial concatenation , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[12]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[13]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[14]  J.K. Wolf,et al.  Turbo decoding for partial response channels with colored noise , 1999, IEEE International Magnetics Conference.

[15]  Hongxin Song,et al.  Low density parity check codes for magnetic recording channels , 2000 .