Abstract
As discussed in Chapter 1, one of the goals of coding research is to find a class of codes and associated decoders such that the probability of error could be made to decrease exponentially at all rates less than channel capacity while the decoding complexity increased only algebraically. Thus the discovery of such codes would make it possible to achieve an exponential tradeoff of performance vs. complexity.
Keywords
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 via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
G. D. Forney, Jr., Concatenated Codes, Cambridge, MA: MIT Press, 1966.
J. L. Massey, “Deep space communications and coding: a match made in heaven,” in Advanced Methods for Satellite and Deep Space Communication, Lecture Notes in Control and Information Sciences, Vol. 182, Berlin: Springer-Verlag, 1992.
S. Lin and D. Costello, Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice Hail, Inc., 1983.
J. Hagenauer, E. Offer, and L. Papke, “Matching Viterbi decoders and Reed-Solomon decoders in a concatenated system,” in Reed Solomon Codes and Their Applications, New York: IEEE Press, 1994.
Grand Alliance HDTV System Specification, April 14, 1994.
ITU-T Telecommunication Standardization Sector of ITU, “Digital multi-programmer systems for television sound and data services for cable distribution”—Television and sound transmission, ITU-T Recommendation J.83, Oct. 1995.
Prodan, R. et al., “Analysis of Cable System Digital Transmission Characteristics,” NCTA Technical Papers, 1994.
ITU-T Recommendation H.222.0 (1995) ∣ ISO/IEC 13818-1: 1996, Information technology—generic coding of moving pictures and associated audio information systems.
E. Paaske, “Improved decoding for a concatenated coding system recommended by CCSDS,” IEEE Trans. Communication, Vol. 38, pp.1138–1144, Aug. 1990.
O. M. Collins and M. Hizlan, “Determinate state convolutional codes”, IEEE Trans. Communications, vol. 41, pp.1785–1794, Dec. 1993.
J. Hagenauer and P. Hoeher, “A Viterbi algorithm with soft-decision outputs and its applications,” in Proc. 1989 IEEE Global Communication Conference, pp.47.1.1–47.1.7, Dallas, TX, Nov. 1989.
R. J. McEliece and L. Swanson, “Reed-Solomon codes and exploration of the solar system,” in Reed-Solomon Codes and Their Applications, IEEE Press, pp.25–40, 1994.
J. Hagenauer, E. Offer, and L. Papke, “Matching Viterbi decoders and Reed-Solomon decoders in concatenated systems,” in Reed-Solomon Codes and Their Applications, IEEE Press, pp.242–271, 1994.
C. Eerrou, A. Glaneux, and P. Thitimasjshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes(1),” in Proc, IEEE Int. Conf. on Communications (Geneva, Switzerland, May 1993), pp.1064–1070.
T. Cover and J. Thomas, Elements of information Theory, New York: Wiley Interscience, 1991.
P. Jung and M. Nahan, “Performance evaluation of turbo codes for short frame transmission Systems,” Electronics Letters, vol.30, pp. 111–113, Jan. 1994.
P. Sung, “Comparison of turbo-code decoders applied to short frame transmission systems,” IEEE J. Select. Areas Comm., vol-14, pp.530–537, Apr.1996.
D. Divealar and F. Pollara, “Multiple turbo codes,” in Proc, IEEE MILCOM (San Diego, CA, 1995), pp.279–285.
S. Benedetto and U. Montorsi, “Unveiling turbo codes: Some results on parallel concatenated coding schemes,” IEEE Trans. Inform. Theory, vol.42, pp. 409–428, Mar.1996.
A. Barbulescu and S. Pietrobon, “Terminating the trellis of turbo-codes in the same state,” Electronics Letters, vol.31, pp.22–23, Jan.1995.
W. Blackert, E. Hall, and S. Wilson, “Turbo code termination and interleaver conditions,” Electronics Letters, vol. 31, pp.2082–2083, Nov.1995.
B. Robertson, “Improving decoder and code structure of parallel concatenated recursive systematic (turbo) codes,” in Proc, IEEE Int. Conf on Universal Personal Communications (1994), pp.183–187.
C. Berron, P. Combelles, P. Penard, B. Talibart. “An IC for turbo-codes encoding and decoding,” in Proc, IEEE Int. Solid-State Circuits Conf. (1995), pp.90–91.
A. Barbulescu and S. Pietrobon, “Interleaver design for turbo codes,” Electronics Letters, vol.30, pp.2107–2108, Dec.1994.
A. Barbulescu and S. Pietrobon, “Rate compatible turbo codes,” Electronics Letters, vol.31, pp.535–536, Mar.1995.
S. Proalds, Digital Communications, third edition. New York: McGraw-Hill, Inc., 1995.
S. Wicker, Error Control Systems for Digital Communication and Storage. Englewood Cliffs, NJ: Prentice Hall, Inc., 1995.
L. Bahl, S. Cocke, F. Jeinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol.20, pp.248–287, Mar.1974.
C. Berrou, P. Adde, E. Angui, and S. Faudeil, “A low complexity soft-output Viterbi decoder architecture,” in Proc, IEEE Int. Conf. on Communications (Geneva, Switzerland, May 1993), pp. 737–740.
P. Jung, “Novel low complexity decoder for turbo-codes,” Electronics Letters, vol.31, pp.86–87, Jan.1995.
J. Hagenauer, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, vol.42, pp.429–445, Mar. 1996.
J. Hagenauer and L. Papke, “Decoding turbo codes with the soft-output Vit9rbi algorithm (SOYA),” in Proc, Int. Symp. on Inform. Theory (Trondheim, Norway, June 1994), p.164.
C. Berron and P. Combelles, “Digital television: Hierarchical channel coding using turbo-codes,” in Proc, IEEE Int. Conf. on Communications (New Orleans, LA, May 1994), pp.737–740.
S. Goff, A. Glavietix, and C. Berrou, “Turbo-codes and high spectral efficiency modulation,” in Proc, IEEE Int. Conf. on Communications (New Orleans, LA, May 1994), pp.645–649.
O. M. Collins, “The subtleties and intricacies of building a constraint length 15 convolutional decoder,” IEEE Trans. Communication, Vol. 41, pp.1785–1794, Dec. 1993.
J. Hagenauer, “The turbo principle: Tutorial introduction and state of the art,” in Proc Int. Symp. Turbo Codes, pp.1–11, Brest, France, Sept. 1997.
F. Burkert, G. Caire, J. Hagenauer, and G. Lechner, “Turbo decoding with unequal error protection applied to GSM speech coding,” in Proc. 1996 IEEE Global Communications conf., pp.2044–2048, London, U.K., Nov. 1996.
R. Herzog, A. Schmidbauer, and J. Hagenauer, “Iterative decoding and despreading improves CDMA-systems using M-ary orthogonal modulation and FEC”, in Proc 1997 IEEE Int. Conf. Communication, Montreal, Canada, June 1997.
D. Watola, “JPL Turbo decoder”, http://www331.jpl.nasa.gov/public/TurboDecoder.html
IEEE Project 802.14/a, “Cable-TV access method and physical layer specification”, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Reed, I.S., Chen, X. (1999). Concatenated Coding Systems and Turbo Codes. In: Error-Control Coding for Data Networks. The Springer International Series in Engineering and Computer Science, vol 508. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5005-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5005-1_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7273-8
Online ISBN: 978-1-4615-5005-1
eBook Packages: Springer Book Archive