Abstract
To achieve efficient soft-decision decoding for two-dimensional product and array codes, an adaptive decoding scheme is proposed. In the scheme, the special structure of these codes has been fully exploited, resulting in a method for effective use of combined hard-and soft-decision decoding of component codes. As a result, a substantial reduction in decoding complexity is obtained, especially when channel conditions are good. We will show that the decoding algorithm presented can guarantee bounded soft distance performance, while simulation results indicate even better decoding performance and an improvement over similar previous decoding methods. Turbo decoding is about 1 dB better in performance, but at the cost of a very significant increase in complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.R. Bahl, J. Cocke, F. Jelinek and J. Raviv, “ Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, IT-20, pp. 284–287, 1974.
J.K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, Vol. IT-24, pp. 7680, Jan. 1978.
H.T. Moorthy, S. Lin, and G.T. Uehara, G. “Good trellises for IC implementation of Viterbi decoders for linear block codes,” IEEE Trans. on Comms., COM-45, pp. 52–63, 1997.
E. Prange, “The use of information sets in decoding cyclic codes,” IRE Trans. IT-18, pp. 55–59, 1962.
G.D. Forney, Concatenated Codes, Cambridge,MA: M.I.T. Press, 1966(a).
D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, IT-18, pp. 170–179, 1974.
L.D. Rudolph, C.R.P. Hartmann, T.-Y. Hwang and N.Q. Duc,“ Algebraic analog decoding of linear binary codes,” IEEE Trans. Inform. Theory, IT-25, pp. 430–440, July 1979.
J. Snyders and Y. Beery, “Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes,” IEEE Trans. Inform. Theory. IT-35, pp. 963–975, 1989.
M.P.C. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics,” IEEE Trans. Inform. Theory, IT-41, pp. 1379–1396. Sept. 1995.
E.J. Weldon, “Decoding binary block codes on Q-ary output channels,” IEEE Trans. Inform. Theory, IT-17, pp. 713–718, 1971.
S.M. Reddy and J.P. Robinson, “Random error and burst correction by iterated codes,” IEEE Trans. Inform. Theory, IT-18, pp. 182–185, Jan. 1972.
P.G. Farrell, “An survey of array error control codes,” Europ. Trans. Telecomm. and Related Tech. (ETT), vol. 3, No. 5, pp. 441–451, 1992.
S. Wainberg, “Error-erasure decoding of product codes,” IEEE Trans. Inform. Theory, IT-18, pp. 821–823, 1972.
C.C.H. Yu and D. Costello, Jr., “Generalised minimum distance decoding algorithms for Q-ary output channels,” IEEE Trans. Inform. Theory, IT-26, pp. 238–243, March 1980.
O. Amrani and Y. Be’ery, “Soft decision decoding of binary product codes,” preprint.
X.-H. Peng and P.G. Farrell, “Adaptive soft-decision decoding for array codes,” Europ. Trans. Telecomm., vol. 12, No. 6, pp. 487–500, Nov.-Dec. 2001.
G.C. Clark and J.B. Cain, Error Correcting Codes for Digital Communications, Plenum Press, 1981.
Hagenauer, J. Offer E., and Papke, L., “Iterative Decoding of Binary Block and Convolutional Codes”, IEEE Transactions on Information Theory, vol. 42, No 2, pp. 429–445, March 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Peng, XH., Farrell, P.G., Coulton, P. (2002). Adaptive Soft-Decision Decoding In Two Dimensions. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_18
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3585-7_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5289-9
Online ISBN: 978-1-4757-3585-7
eBook Packages: Springer Book Archive