Error-Control Mechanisms

  • Irving S. Reed
  • Xuemin Chen
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 508)

Abstract

We are now in the age of digital Information and processing. Digital information has become an asset not only to the business community, but also in all of society. The entire economy and the daily lives of people are more and more dependent on data provided by computers or microprocessors, the digital audio played by compact-disk players and over the internet, the digital television signals broadcast from satellites, etc.. Just as there are techniques on how best to handle physical commodities, there are also efficient methods to manage, transmit, store and retrieve digital information. Among these techniques, no one need be reminded of the importance, not only of the speed of transmission, but also of the accuracy of the information- transfer process. Error-control mechanisms are now an integral part of almost all information-transfer processes. This text addresses the issues of error-control coding in modern digital electronic systems and data networks.

Keywords

Spectral Efficiency Block Code Code Word Turbo Code Convolutional 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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    C. E. Shannon, “A mathematical theory of communication”, Bell Sys. Tech. J., vol. 27, pp.379–423 and 623–656, 1948.MathSciNetMATHGoogle Scholar
  2. [2]
    J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering, John Wiley & Sons, New York, 1965.Google Scholar
  3. [3]
    G. D. Forney, Jr., Concatenated Codes, MIT Press, Cambridge, MA, 1966.Google Scholar
  4. [4]
    R. G. Gallager, “A simple derivation of the coding theorem and some applications”, IEEE trans. Information Theory, vol. IT-11, pp.3–18, Jan. 1965.MathSciNetCrossRefGoogle Scholar
  5. [5]
    G. D. Forney, Jr., “The Viterbi algorithm”, Proc. IEEE, vol. 61, pp.268–278, March 1973.MathSciNetCrossRefGoogle Scholar
  6. [6]
    G. D. Forney, Jr., “Convolutional codes II. Maximum-likelihood decoding”, Information and Control, vol. 25, pp.222–266, 1974.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm”, IEEE Trans. Information Theory, vol. IT-13, pp.260–269, April, 1967.CrossRefGoogle Scholar
  8. [8]
    H. Nyquist, “Certain topics in telegraph transmission theory,” AIEE Trans., pg.617, 1946.Google Scholar
  9. [9]
    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1988.Google Scholar
  10. [10]
    I.S. Reed and G. Solomon, “Polynomial codes over certain finite fields”, SIAM Journal of Applied Mathematics, Vol. 8, pp.300–304, 1960.MathSciNetMATHCrossRefGoogle Scholar
  11. [11]
    I. S. Reed, L.J. Deutsch, LS. Hsu, T.K. Truong, K. Wang, and C.-S. Yeh, “The VLSI implementation of a Reed-Solomon encoder using Berlekamp’s bit-serial multiplier algorithm”, IEEE Trans, on Computers, Vol. C-33, No. 10, Oct. 1984.Google Scholar
  12. [12]
    E. R. Berlekarnp, Algebraic Coding-Theory, McOraw-Ilill, New York, 1968.Google Scholar
  13. [13]
    J. L. Massey, “Shift register synthesis and BCH decoding” IEEE Trans. Inform. Theory, Vol. IT-15, pp. 122–127, 1969.MathSciNetCrossRefGoogle Scholar
  14. [14]
    G. P. Forney, “Final report on a study of a sample sequential decoder” Appendix A, Codex Corp., Watertown, MA, U.S. Annlay Satellite Communication Agency Contract DAA B 07–68-C-0093, April 1968.Google Scholar
  15. [15]
    J. L. Massey and D.J. Costello, Jr., “Nonsystematic convolutional codes for sequential decoding in space applications”, IEEE Trans. Commun., Vol. COM-19, pp. 806–813, 1971.CrossRefGoogle Scholar
  16. [16]
    D. M. Collins, “The subtleties and intricacies of building a constraint-length 15 convolutional decoder”, IEEE Trans. Commun., Vol. COM-40, pp. 1810–1819, 1992.CrossRefGoogle Scholar
  17. [17]
    C. Berroti, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” Proc. 1993 IEEE int. Conf. on Comm., Geneva, Switzerland, pp. 106–107, 1993.Google Scholar
  18. [18]
    G. D. Forney, “Coded modulation for bandlimited channels:’ IEEE Information Theory Society Newsletter, December 1990.Google Scholar
  19. [19]
    CCITT Recommendations V34, 1995.Google Scholar
  20. [20]
    R. Wilson, “Outer limits,” Electronic News, May 1996.Google Scholar
  21. [21]
    U. Black, The V Series Recommendations, Protocols for Data Communications Over the Telephone Network, McGraw-Hill, New York, 1991.Google Scholar
  22. [22]
    G. Ungerbock, “Channel coding with multilevel/phase signals”, IEEE Trans. Inform. Theory, Vol. 28, No.1, pp.55–67, 1982.CrossRefGoogle Scholar
  23. [23]
    I. S. Reed and X. Chen, article Channel Coding, Networking issue of Encyclopedia of Electrical and Electronic Engineering, John Wiley & Sons, Inc. New York, Feb., 1999.Google Scholar
  24. [24]
    G. C. Clark, Jr. and J. B. Cain, Error-Correction Coding for Digital Communications, Plenum Press, New York, 1981.Google Scholar
  25. [25]
    J. Watkinson, The Art of Digital Video, Focal Press, London & Boston, 1990.Google Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Irving S. Reed
    • 1
  • Xuemin Chen
    • 2
  1. 1.University of Southern CaliforniaLos AngelesUSA
  2. 2.General Instrument CorporationSan DiegoUSA

Personalised recommendations