Skip to main content
Log in

Decoding algorithms for shortened-extended turbo product codes in WiMAX systems

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

The component codes of turbo product codes inWiMAX systems are extended Hamming codes and single parity check codes as well as their shortened forms. In this paper, three novel iterative decoding algorithms based on Chase, MAP algorithms and their combination are proposed for shortened-extended turbo product codes. The iterative decoding algorithm based on Chase algorithm is proposed to reduce the decoding complexity without any performance loss. An efficient MAP algorithm is then proposed to decode the component codes of shortened single parity check codes and shortened-extended Hamming codes. A comprehensive performance comparison of the proposed decoding schemes is conducted for three typical classes of turbo product codes in WiMAX OFDMA systems. The suitable decoding algorithms are recommended for different classes based on the simulation results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Elias P. Error-free coding. IRE Trans Inf Theory, 1954, 4: 29–37

    Article  MathSciNet  Google Scholar 

  2. http://ieee802.org/16/pubs/80216-2004.html

  3. Intelsat. Intelat Earth Station Standards (IESS). Performance characteristics for broadband VSAT (BVSAT) digital carries. Document IESS-313. Approval date: 08 Auguest 2000

  4. Li J, Narayanan K R, Kurtas E, et al. On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels. IEEE Trans Commun, 2002, 50: 723–734

    Article  Google Scholar 

  5. http://www.ieee802.org/22

  6. Yi C, Lee J H. Interleaving and decoding scheme for a product code for a mobile data communication. IEEE Trans Commun, 1997, 45: 144–147

    Article  Google Scholar 

  7. Pyndiah R. Near optimum decoding of product codes: block turbo codes. IEEE Trans Commun, 1998, 46(8): 1003–1010

    Article  MATH  Google Scholar 

  8. Hagenauer J, Offer E, Papke L. Iterative decoding of binary block and convolutional codes. IEEE Trans Inf Theory, 1996, 42: 429–445

    Article  MATH  Google Scholar 

  9. Rankin D M, Gulliver T A. Single parity check product codes. IEEE Trans Commun, 2001, 49: 1354–1362

    Article  MATH  Google Scholar 

  10. Rankin D M, Gulliver T A, Taylor D P. Asymptotic performance of single parity check product codes. IEEE Trans Inf Theory, 2003, 49: 2230–2235

    Article  MathSciNet  Google Scholar 

  11. Battail G, Decouvelaere M C, Goldlewski P. Replication decoding. IEEE Trans Inf Theory, 1979, 25: 332–345

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to ChangLong Xu.

Additional information

Supported by the National Natural Science Foundation of China (Grant No. 50534060), the National High-Tech Research & Development Program of China (Grant No. 2007AA01Z259), and the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University (Grant No. W200816) and State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications (Grant No. SKLNST-2008-1-11)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, C., Yang, W. & Ye, W. Decoding algorithms for shortened-extended turbo product codes in WiMAX systems. Sci. China Ser. F-Inf. Sci. 52, 2415–2423 (2009). https://doi.org/10.1007/s11432-009-0209-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-009-0209-3

Keywords

Navigation