Introduction to Channel Coding

  • Saleh Faruque
Part of the SpringerBriefs in Electrical and Computer Engineering book series (BRIEFSELECTRIC)


Channel coding, also known as forward error control coding (FECC), is a process of detecting and correcting bit errors in digital communication systems. Channel coding is performed both at the transmitter and at the receiver. At the transmit side, channel coding is referred to as encoder, where extra bits (parity bits) are added with the raw data before modulation. At the receive side, channel coding is referred to as the decoder. Channel coding enables the receiver to detect and correct errors, if they occur during transmission due to noise, interference and fading. This book presents the salient concepts, underlying principles and practical realization of channel coding schemes, as listed below:
  • Automatic repeat request (ARQ)

  • Block coding

  • Convolutional coding

  • Concatenated coding

  • Orthogonal coding


Additive White Gaussian Noise Block Code Channel Code Convolutional Code Orthogonal Code 
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. 1.
    Clark GC et al (1981) Error correction coding for digital communications. Plenum Press, New YorkCrossRefGoogle Scholar
  2. 2.
    Blahut RE (1983) Theory and practice of error control codes. Addison-Wesley, ReadingzbMATHGoogle Scholar
  3. 3.
    Ungerboeck G (1982) Channel coding with multilevel/multiphase signals. IEEE Trans Inf Theory IT28:55–67CrossRefGoogle Scholar
  4. 4.
    Lin S, Costello DJ Jr (1983) Error control coding: fundamentals and applications. Prentice-Hall, Englewood CliffsGoogle Scholar
  5. 5.
    Forney GD Jr (1966) Concatenated codes. MIT Press, Cambridge, MA. Azm AA, Kasparian J (1997) Designing a concatenated coding system for reliable satellite and space communications. Computers and Communications, 1997, Proceedings, Second IEEE Symposium on, 1–3 July 1997, pp 364–369Google Scholar
  6. 6.
    Tanenbaum AS (2003) Computer networks. Prentice Hall, Upper Saddle River, p 223. ISBN 0-13-066102-3Google Scholar
  7. 7.
    Frenger P, Parkvall S, Dahlman E (2001) Performance comparison of HARQ with chase combining and incremental redundancy for HSDPA. Vehicular Technology conference, 2001. VTC 2001 Fall. IEEE VTS 54th 3. IEEE Operations Center, Piscataway Township, pp 1829–1833. doi: 10.1109/VTC.2001.956516. ISBN 0-7803-7005-8
  8. 8.
    Wegener I, Pruim RJ (2005) Complexity theory. ISBN 3-540-21045-8, p 260Google Scholar
  9. 9.
    Furst M, Saxe J, Sipser M (1984) Parity, circuits, and the polynomial-time hierarchy. Annu. Intl. Symp. Found. Computer Sci., 1981. Theory Comput Syst 17(1):13–27. doi: 10.1007/BF01744431 MathSciNetzbMATHGoogle Scholar
  10. 10.
    Faruque S (2001) Bi-orthogonal code division multiple access system. US Patent 198,719, 6 Mar 2001Google Scholar
  11. 11.
    Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379–423, 623–656, July, October, 1948Google Scholar

Copyright information

© The Author(s) 2016

Authors and Affiliations

  • Saleh Faruque
    • 1
  1. 1.Department of Electrical EngineeringUniversity of North DakotaGrand ForksUSA

Personalised recommendations