Abstract
It is well known that a good trade-off between coding gain and complexity can be achieved by serial concatenated codes proposed by Forney [1]. A serial concatenated code is one that applies two levels of coding, an inner and an outer code linked by an inter-leaver. This approach has been used in space communications, with convolutional codes as the inner code and low redundancy Reed-Solomon codes as the outer code. The primary reason for using a concatenated code is to achieve a low error rate with an overall decoding complexity lower than that required for a single code of the corresponding performance. The low complexity is attained by decoding each component code separately. As the inner decoder generates burst errors an interleaver is typically incorporated between the two codes to decorrelate the received symbols affected by burst errors. Another application of concatenation is using a bandwidth efficient trellis code as an inner code [2] or concatenating two convolutional codes [3]. In decoding these concatenated codes, the inner decoder may use a soft-input/soft-output decoding algorithm to produce soft decisions for the outer decoder.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
R. H. Deng and D. J. Costello, “High rate concatenated coding systems using bandwidth efficient trellis inner codes,” IEEE Trans. Commun., vol. 37, no. 5, May 1989, pp. 420–427.
J. Hagenauer and P. Hoeher, “Concatenated Viterbi decoding,” in Proc. 4th Joint Swedish-Soviet Int. Workshop on Inform. Theory, Gotland, Sweden, Studenlitteratur, Lund, Aug. 1989, pp. 29–33.
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes(1),” in Proc. ICC’93, Geneva, Switzerland, May 1993, pp. 1064–1070.
C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding: Turbo-codes,” IEEE Trans. Commun., vol. 44, no. 10, Oct. 1996, pp. 1261–1271.
D. Divsalar and F. Pollara, “Turbo codes for PCS applications,” in Proc. ICC’95, Seattle, WA, June 1995, pp. 54–59.
P. Robertson, “Illuminating the structure of parallel concatenated recursive systematic (TURBO) codes,” in Proc. GLOBECOM’94, San Francisco, CA, Nov. 1994, pp. 1298–1303.
A. S. Barbulescu and S. S. Pietrobon, “Interleaver design for turbo codes,” Electron. Lett., vol. 30, no. 25, Dec. 1994, p. 2107.
A. S. Barbulescu and S. S. Pietrobon, “Terminating the trellis of turbo-codes in the same state,” Electron. Lett, vol. 31, no. 1, Jan. 1995, pp. 22–23.
A. S. Barbulescu and S. S. Pietrobon, “Interleaver design for three dimensional turbo codes,” in Proc. 1995 IEEE ISIT, Whistler, BC, Canada, Sep. 1995, p. 37.
O. Joerssen and H. Meyr, “Terminating the trellis of turbo-codes,” Electron. Lett, vol. 30, no. 16, Aug. 1994, pp. 1285–1286.
D. Divsalar and F. Pollara, “On the design of turbo codes,” TDA Progress Report 42-123, Jet Propulsion Lab., Nov. 1995, pp. 99–121.
S. Benedetto and G. Montorsi, “Unveiling turbo-codes: Some results on parallel concatenated coding schemes,” IEEE Trans. Inform. Theory, vol. 42, no. 2, Mar. 1996, pp. 409–428.
S. Benedetto and G. Montorsi, “Design of parallel concatenated convolutional codes,” IEEE Trans. Commun., vol. 44, no. 5, May 1996, pp. 591–600.
S. Benedetto, R. Garello, and Guido Montorsi, “A search for good convolutional codes to be used in the construction of turbo codes,” IEEE Trans. Commun., vol. 46, no. 9, Sep. 1998, pp. 1101–1105.
J. G. Proakis, Digital Communications, 2nd Ed., McGraw-Hill, New York, 1989.
D. Divsalar, S. Dolinar, R. J. McEliece, and F. Pollara, “Transfer function bounds on the performance of turbo codes,” TDA Progress Report 42-123, Jet Propulsion Lab., Aug. 1995, pp. 44–55.
T. M. Duman and M. Salehi, “New performance bounds for turbo codes,” IEEE Trans. Commun., vol. 46, no. 6, June 1998, pp. 717–723.
A. M. Viterbi and A. J. Viterbi, “Improved union bound on linear codes for the input-binary AWGN channel with applications to turbo-codes,” in Proc. IEEE 1998 ISIT, MIT, MA, Aug. 1998, p. 29.
I. Sason and S. Shamai(shitz), “Improved upper bounds on the performance of parallel and serial concatenated turbo codes,” in Proc. IEEE 1998 ISIT, MIT, MA, Aug. 1998, p. 30.
A. J. Viterbi, “Convolutional codes and their performance in communications systems,” IEEE Trans. Commun., vol. 19, no. 5, Oct. 1971, pp. 751–772.
P. Thitimajshima, “Les codes convolutifs recursifs systematiques et leur application a la concatenation parallele,” (in French), Ph.D. no. 284, University de Bretagne Occidentale, Brest, France, Dec. 1993.
D. Divsalar and R. J. McEliece, “The effective free distance of turbo codes,” Electron. lett., vol. 32, no. 5, Feb. 1996, pp. 445–446.
L. C. Perez, J. Seghers, and D. J. Costello, Jr., “A distance spectrum interpretation of turbo codes,” IEEE Trans. Inform. Theory, vol. 42, no. 6, Nov. 1996, pp. 1698–1709.
J. Yuan, B. Vucetic, and W. Feng, “Combined turbo codes and interleaver design,” IEEE Trans. Commun., vol. 47, no. 4, Apr. 1999, pp. 484–487.
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding,” IEEE Trans. Inform. Theory, vol. 44, no. 3, May 1998, pp. 909–926.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Vucetic, B., Yuan, J. (2000). Turbo Coding Performance Analysis and Code Design. In: Turbo Codes. The Springer International Series in Engineering and Computer Science, vol 559. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4469-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4469-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7013-0
Online ISBN: 978-1-4615-4469-2
eBook Packages: Springer Book Archive