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.

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 47; číslo 7; s. 2993 - 2995
Hlavní autoři: Duan, L., Rimoldi, B.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Additives
Algorithms
Channels
Codes
Concatenated coding
Decoding
Gaussian
Information theory
Mathematical analysis
Noise
Turbo codes
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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