Stream-oriented turbo codes

A stream-oriented parallel concatenated convolutional (turbo) code (PCCC) is examined. The stream encoder uses continuous encoding with the the interleaver(s) viewed as a finite state permuters (FSPs). With this encoding architecture, block interleaver design is reexamined and convolutional interleavers are considered. Decoding is performed using a pipelined architecture where each constituent decoder uses a continuous version of the symbol-by-symbol MAP decoding algorithm. Performance and implementation issues are discussed and comparisons made to the traditional block decoding architecture. Finally, stream PCCC design using convolutional interleavers is examined based on performance and implementation.

[1]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[2]  Roberto Garello,et al.  The Trellis Complexity of Turbo Codes , 1997 .

[3]  S. S. Pietrobon,et al.  Interleaver design for turbo codes , 1994 .

[4]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[5]  Sergio Benedetto,et al.  Design of parallel concatenated convolutional codes , 1996, IEEE Trans. Commun..

[6]  S. S. Pietrobon,et al.  Interleaver design for three dimensional turbo codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[7]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[8]  Peter Jung,et al.  Comparison of Turbo-Code Decoders Applied to Short Frame Transmission Systems , 1996, IEEE J. Sel. Areas Commun..

[9]  D. Divsalar,et al.  Turbo codes for deep-space communications , 1995 .

[10]  W. J. Blackert,et al.  TURBO CODE TERMINATION AND INTERLEAVER CONDITIONS , 1995 .

[11]  Gerard Battail.  A Conceptual Framework for Understanding Turbo Codes , 1998, IEEE J. Sel. Areas Commun..

[12]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[13]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[14]  Patrick Robertson,et al.  Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[15]  Dariush Divsalar,et al.  Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes , 1996 .

[16]  S.G. Wilson,et al.  An upper bound on turbo code free distance , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[17]  Jr. G. Forney,et al.  Burst-Correcting Codes for the Classic Bursty Channel , 1971 .

[18]  Sergio Benedetto,et al.  Performance of continuous and blockwise decoded turbo codes , 1997, IEEE Communications Letters.

[19]  John L. Ramsey.  Realization of optimum interleavers , 1970, IEEE Trans. Inf. Theory.

[20]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[21]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

[22]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.