The iterative turbo decoding algorithm has fixed points

It is shown that the iterative decoding algorithm proposed to decode "turbo codes" has fixed points regardless of the specific constituent codes and regardless of the noise variance of the additive white Gaussian noise (AWGN) channel.

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 47; no. 7; pp. 2993 - 2995
Main Authors: Duan, L., Rimoldi, B.
Format: Journal Article
Language:English
Published: New York IEEE 01.11.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Additives
Algorithms
Channels
Codes
Concatenated coding
Decoding
Gaussian
Information theory
Mathematical analysis
Noise
Turbo codes
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is shown that the iterative decoding algorithm proposed to decode "turbo codes" has fixed points regardless of the specific constituent codes and regardless of the noise variance of the additive white Gaussian noise (AWGN) channel.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ISSN:0018-9448
1557-9654
DOI:10.1109/18.959276