ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Nonlinear Product Codes and Their Low Complexity Iterative Decoding

  • Kim, Hae-Sik (Department of Communications Systems, Infolab21, Lancaster University) ;
  • Markarian, Garik (Department of Communications Systems, Infolab21, Lancaster University) ;
  • Da Rocha, Valdemar C. Jr. (Department of Electronics and Systems, Federal University of Pernambuco)
  • Received : 2009.11.04
  • Accepted : 2010.02.18
  • Published : 2010.08.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N-dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well-known nonlinear Nordstrom-Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of $10^{-6}$ when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom-Robinson codes has an effective gain of about 0.7 dB at a BER of $10^{-5}$ when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi-cyclic codes.

Keywords

References

  1. R. Pyndiah, "Near-Optimum Decoding of Product Codes: Block Turbo Codes," IEEE Trans. Commun., vol. 46, no. 8, Aug. 1998, pp. 1003-1010. https://doi.org/10.1109/26.705396
  2. D. Williams et al., "IEEE 802.16.3 PHY Utilizing Turbo Product Codes," IEEE 802.16 Broadband Wireless Access Working Group, Ottawa, Canada, IEEE 802.16.3p-01/05, Jan. 17, 2001.
  3. ESTI, "ETSI HiperMAN: Physical (PHY) layer," TS 102 177, v1.4.1, Nov. 2007.
  4. HomePlug Alliance, "HomePlug 1.0 Specifications," June 2001.
  5. IEEE 802.16 TGm, "IEEE 802.16m-07/001r1, Work Plan for Development of IEEE P802.16m Draft Standard & IMTAdvanced Submission," July 19, 2007.
  6. IEEE, "IEEE Standard for Local and Metropolitan Area Networks-Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems," IEEE std 802.16e-2005, Feb. 28, 2006.
  7. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon Limit Error-Correcting Coding and Decoding," Proc. Int. Commun. Conf., Geneva, Switzerland, May 1993, pp. 1064-1070.
  8. R.G. Gallager, Low Density Parity Check Codes, Cambridge, USA: MIT Press, 1963.
  9. D. Divsalar et al., "Performance Analysis of Turbo Codes," Military Commun. Conf., vol. 1, Nov. 1995, pp. 91-96.
  10. F.P. Preparata, "A Class of Optimum Nonlinear Double-Error-Correcting Code," Information and Control, vol. 13, issue 4, Oct. 1968, pp. 378-400. https://doi.org/10.1016/S0019-9958(68)90874-7
  11. A.M. Kerdock, "A Class of Low-Rate Nonlinear Codes," Information and Control, vol. 20, no. 2, Mar. 1972, pp. 182-187. https://doi.org/10.1016/S0019-9958(72)90376-2
  12. O. Amrani, "Nonlinear Codes: The Product Construction," IEEE Trans. Comm., vol. 55, Oct. 2007, pp. 1845-1851. https://doi.org/10.1109/TCOMM.2007.906365
  13. Haesik Kim, Garik Markarian, and Valdemar C. da Rocha Jr. "Nonlinear Turbo Product Codes," Simposio Brasileiro de Telecomunicaçoes (SBrT''07), Recife/PE, Brazil, Sept. 2007.
  14. A.W. Nordstrom and J.P. Robinson, "An Optimum Nonlinear Code," Information and Control, vol. 11, nos. 5-6, Nov.-Dec. 1967, pp. 613-616. https://doi.org/10.1016/S0019-9958(67)90835-2
  15. A. Roger Hammon et al., "The Z4-Linearity of Kerdock, Preparata, Goethals, and Related Codes," IEEE Trans. Inform. Theory, vol. 40, no. 2, 1994, pp. 301-319. https://doi.org/10.1109/18.312154
  16. G.D. Forney, N. Sloane, and M.D. Trott, "The Nordstrom-Robinson Code is the Binary Image of the Octacode," Coding and Quantization: DIMACS/IEEE Workshop, Oct. 19-21, 1992, Amer. Math. Soc., edited by R. Calderbank, G. D. Forney, Jr., and N. Moayeri, 1993, pp. 19-26.
  17. G. Markarian and B. Honary, "The Nordstrom-Robinson Code is a (8, 4) GAC over Z4," Proc. Third UK/Australian Int. Symp. DSP for Commun. Syst., Warwick, 1994.
  18. V.S. Pless, W.C. Huffman, and R.A. Brualdi, The Handbook of Coding Theory, Elsevier Science Publishers, 1998.
  19. B. Honary and G. Markarian, Trellis Decoding of Block Codes: A Practical Approach, Kluwer Academic Publishers, 1997.
  20. Y. Berger and Y. Be''ery, "The Twisted Squaring Construction, Trellis Complexity, and Generalized Weights of BCH and QR Codes," IEEE Trans. Inform. Theory, vol. 42, no. 6, Nov. 1996, pp. 1817-1827. https://doi.org/10.1109/18.556677
  21. G.D. Forney, Jr., "Coset Codes–-Part I: Introduction and Geometrical Classification," IEEE Trans. Inform. Theory, vol. 34, no. 5, Sept. 1988, pp. 1123-1151. https://doi.org/10.1109/18.21245
  22. G.D. Forney, Jr., "Coset Codes–-Part II: Binary Lattices and Related Codes," IEEE Trans. Inform. Theory, vol. 34, no. 5, Sept. 1988, pp. 1152-1187. https://doi.org/10.1109/18.21246
  23. T. Fujiwara et al., "A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes," IEEE Trans. Inform. Theory, vol. 44, 1998, pp.714-729. https://doi.org/10.1109/18.661515
  24. H.T. Moorthy, S. Lin, and G.T. Uehara, "Good Trellises for IC Implementation of Viterbi Decoders for Linear Block Codes," IEEE Trans. Comm., vol. 45, 1997, pp. 52-63. https://doi.org/10.1109/26.554286
  25. R.J. McEliece, "On the BCJR Trellis for Linear Block Codes," IEEE Trans. Inform. Theory, vol. 42, 1996, pp. 1072-1092. https://doi.org/10.1109/18.508834
  26. I. Reuven and Y. Be''ery, "Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes," IEEE Trans. Information Theory, vol. 44, no. 2, Mar. 1998, pp. 580-598. https://doi.org/10.1109/18.661506
  27. A. Lafourcade and A. Vardy, "Lower Bounds on Trellis Complexity of Block Codes," IEEE Trans. Inf. Theory, vol. 41, no. 6, Nov. 1995, pp. 1938-1954. https://doi.org/10.1109/18.476318
  28. S. Lin and D. J. Costello, Jr., Error Control Coding, Pearson Prentice Hall, 2004.
  29. T.A. Gulliver and V.K. Bhargava, "A Systematic (16, 8) Code for Correcting Double Errors and Detecting Triple-Adjacent Errors," IEEE Trans. Computers, vol. 42, no. 1, Jan. 1993, pp. 109-112. https://doi.org/10.1109/12.192220
  30. G.C. Clark and J.B. Cain, Error-Correction Coding for Digital Communications, New York: Plenum Press, 1981.

Cited by

  1. An Application Study to the Ciphers Weighed in Faithful Transmission vol.128, pp.None, 2011, https://doi.org/10.4028/www.scientific.net/amm.128-129.637