Analysis of the asymptotic iterative decoding performance of turbo codes

Summary, in English

We analyse the iterative decoding performance of conventional rate R=1/3 turbo codes, when both code length and number of iterations tend to infinity. To obtain a rigorous bound on the iterative limit, we introduce a two-phase decoding algorithm which can be analyzed asymptotically

• Författare: Michael Lentmaier; Dmitri Truhachev; Kamil Zigangirov
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2001
• Språk: Engelska
• Publikation/Tidskrift/Serie: [Host publication title missing]
• Länkar: http://dx.doi.org/10.1109/ISIT.2001.936053
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: turbo codes; density evolution
• Conference name: IEEE International Symposium on Information Theory (ISIT), 2001
• Conference date: 2001-06-24 - 2001-06-29
• Conference place: Washington, DC, United States
• Status: Published
• Forskningsgrupp: Telecommunication Theory
• ISBN/ISSN/Övrigt: ISBN: 0-7803-7123-2