Braided Convolutional Codes: A New Class of Turbo-Like Codes
Författare
Summary, in English
We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.
Avdelning/ar
Publiceringsår
2010
Språk
Engelska
Sidor
316-331
Publikation/Tidskrift/Serie
IEEE Transactions on Information Theory
Volym
56
Issue
1
Fulltext
- Available as PDF - 378 kB
- Download statistics
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- turbo-like codes
- iterative decoding
- free distance
- convolutional permutor
- Braided convolutional codes
- codes on graphs
Status
Published
Forskningsgrupp
- Information Theory
ISBN/ISSN/Övrigt
- ISSN: 0018-9448