Sequential turbo decoding for PR-equalized magnetic recording channels

In this paper, we consider the use of sequential decoding methods to reduce the complexity of the channel decoder for turbo coded magnetic recording channels. The partial response equalized magnetic recording channel is suitably preceded to give a recursive structure for the channel trellis. The soft-in/soft-out twin stack decoding technique is then used to decode this recursive trellis. Simulation results show that the performance of the proposed decoding technique is within 0.6 dB for a PR4 channel and within 1.1 dB for a EPR4 channel in comparison to the BCJR decoder, while the complexity of the decoder decreases by a factor 1/(number of channel states).

[1]  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).

[2]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  L. L. McPheters,et al.  Precoded PRML serial concatenation, and iterative (turbo) decoding for digital magnetic recording , 1999, IEEE International Magnetics Conference.

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

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

[6]  F. Jelinek Fast sequential decoding algorithm using a stack , 1969 .

[7]  Steven W. McLaughlin,et al.  Twin-stack decoding of recursive systematic convolutional codes , 2001, IEEE Trans. Commun..