• Cheng-Chi Wong
  • Hsie-Chia Chang


A successful transfer of information over a physical channel or a transmission medium involves a series of procedures. The model of data transmission can be depicted as Fig. 1.1. Generally, it consists of a transmitter, a channel, and a receiver. The elements inside the transmitter and receiver are utilized to guarantee reliable and efficient transmission. For less resources usage, the source encoder uses a shorter symbol sequence to replace the source information, while the source decoder performs the data decompression. When data pass through the channel, they will suffer from the channel noise and may become incorrect. To make sure the accurate information can be delivered to the destination, the channel encoder will transform its inputs into a structured sequence where parity check symbols are introduced. With these redundancies, the channel decoder is capable of recovering the messages even though the received data contain errors caused by channel impairments. In addition to the elements for signal processing, the transmitter needs a modulator to translate the data into analog forms which is suitable for transmission; and the receiver uses a demodulator to convert the channel outputs back to quantized symbols. All of the components determine the quality of data transmission. The development of the corresponding techniques will lead to the advancement of communication systems.


Data Block Parity Check Turbo Code Convolutional Code Extrinsic Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 75.
    C.-C. Wong and H.-C. Chang, “Reconfigurable turbo decoder with parallel architecture for 3GPP LTE system,” IEEE Trans. Circuits Syst. II, vol. 57, no. 7, pp. 566–570, Jul. 2010.MathSciNetCrossRefGoogle Scholar
  2. 1.
    C. E. Shannon, “A mathematical theory of communication (Part I),” Bell Syst. Tech. J., vol. 27, pp. 379–428, Jul. 1948.MathSciNetCrossRefMATHGoogle Scholar
  3. 76.
    C.-C. Wong and H.-C. Chang, “High-efficiency processing schedule for parallel turbo decoders using QPP interleaver,” IEEE Trans. Circuits Syst. I, vol. 58, no. 6, pp. 1412–1420, Jun. 2011.MathSciNetCrossRefGoogle Scholar
  4. 2.
    C. E. Shannon, “A mathematical theory of communication (Part II),” Bell Syst. Tech.J., vol. 27, pp. 623–656, Oct. 1948.MathSciNetCrossRefGoogle Scholar
  5. 77.
    S. Dolinar and D. Divsalar, “Weight distribution of turbo codes using random and nonrandom permutations,” Jet Propulsion Lab., TDA Progress Report 42–122, Aug. 1995.Google Scholar
  6. 3.
    R. J. McEliece, The theory of information and coding, 2nd ed. Cambridge, UK: Cambridge University Press, 2004.Google Scholar
  7. 78.
    S. Crozier, “New high-spread high-distance interleavers for turbo-codes,” in Proc. 20th Biennial Symp. on Communications, May 2000, pp. 3–7.Google Scholar
  8. 4.
    S. Lin and D. J. Costello, Jr., Error control coding: fundamentals and applications, 2nd ed. Englewood Cliffs, NJ: Pearson-Hall, 2004.Google Scholar
  9. 79.
    S. Crozier, P. Guinand, and A. Hunt, “Estimating the minimum distance of turbo-codes using double and triple impulse methods,” IEEE Commun. Lett., vol. 9, no. 7, pp. 631–633, Jul. 2005.CrossRefGoogle Scholar
  10. 5.
    C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: turbo-codes,” in IEEE Proc. Int. Conf. on Communications, May 1993, pp. 1064–1070.Google Scholar
  11. 6.
    D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electronics Letters, vol. 33, no. 6, pp. 457–458, Mar. 1997.CrossRefGoogle Scholar
  12. 7.
    D. J. Costello, Jr. and G. D. Forney, Jr., “Channel coding: The road to channel capacity,” Proc. IEEE, vol. 95, no. 6, pp. 1150–1177, Jun. 2007.CrossRefGoogle Scholar
  13. 9.
    K. Gracie and M.-H. Hamon, “Turbo and turbo-like codes: Principles and applications in telecommunications,” Proc. IEEE, vol. 95, no. 6, pp. 1228–1254, Jun. 2007.CrossRefGoogle Scholar
  14. 15.
    Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding, 3rd Generation Partnership Project Std. TS 36.212 v11.0.0, 2012.Google Scholar
  15. 17.
    IEEE Standards for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, Inst. Electrical and Electronics Engineers (IEEE) Std. IEEE 802.16m-2009, 2009.Google Scholar
  16. 18.
    O. Y. Takeshita, “On maximum contention-free interleavers and permutation polynomials over integer rings,” IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1249–1253, Mar. 2006.MathSciNetCrossRefGoogle Scholar
  17. 19.
    C. Weiß, C. Bettstetter, S. Riedel, and D. J. Costello, Jr., “Turbo decoding with tail-biting trellises,” in IEEE Proc. URSI Int. Symp. on Signals, Systems, and Electronics, Oct. 1998, pp. 343–348.Google Scholar
  18. 20.
    C. Berrou, Y. Saouter, C. Douillard, S. Kerouédan et al., “Desiging good permutations for turbo codes: toward a single model,” in IEEE Int. Conf. on Communications, Jun. 2004, pp. 341–345.Google Scholar
  19. 21.
    L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory, vol. IT-20, pp. 284–287, Mar. 1974.MathSciNetCrossRefGoogle Scholar
  20. 22.
    J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429–445, Mar. 1996.CrossRefMATHGoogle Scholar
  21. 23.
    W. Koch and A. Baier, “Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference,” in IEEE Global Telecommunications Conf. Google Scholar
  22. 25.
    P. Robertson, E. Villebrun, and P. Hoeher, “A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” in IEEE Proc. Int. Conf. on Communications, Jun. 1995, pp. 1009–1013.Google Scholar
  23. 26.
    L. Papke and P. Robertson, “Improved decoding with the SOVA in a parallel concatenated (turbo-code) scheme,” in IEEE Proc. Int. Conf. on Communications, Jun. 1996, pp. 102–106.Google Scholar
  24. 27.
    J. Vogt and A. Finger, “Improving the Max-Log-MAP turbo decoder,” IET Electronics Letters, vol. 36, no. 23, pp. 1937–1937, Nov. 2000.CrossRefGoogle Scholar
  25. 28.
    S. A. Barbulescu, “Iterative decoding of turbo codes and other concatenated codes,” Ph.D. dissertation, University of South Australia, 1996.Google Scholar
  26. 29.
    A. J. Viterbi, “An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes,” IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 260–264, Feb. 1998.CrossRefGoogle Scholar
  27. 30.
    R. Y. Shao, S. Lin, and P. C. Fossorier, “Two simple stopping criteria for turbo decoding,” IEEE Trans. Commun., vol. 47, no. 8, pp. 1117–1120, Aug. 1999.CrossRefMATHGoogle Scholar
  28. 31.
    Y. Wu, B. D. Woener, and W. J. Ebel, “A simple stopping criteria for turbo decoding,” IEEE Commun. Lett., vol. 4, no. 8, pp. 258–260, Aug. 2000.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Cheng-Chi Wong
    • 1
  • Hsie-Chia Chang
    • 1
  1. 1.Department of Electronics EngineeringNational Chiao-Tung UniversityHsinchuTaiwan

Personalised recommendations