Braided convolutional codes: a new class of turbo-like codes

Authors:
Wei Zhang;Michael Lentmaier;Kamil Sh. Zigangirov;Daniel J. Costello
Affiliations:
QUALCOMM Incorporated, San Diego, CA and Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany and Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;University of Notre Dame, Notre Dame, IN and Lund University, Lund, Sweden and Institute for Problems of Information Transmission, Moscow, Russia;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 9
Cited 1

Topics in matrix analysis

Topics in matrix analysis
Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Braided block codes

IEEE Transactions on Information Theory
Unveiling turbo codes: some results on parallel concatenated coding schemes

IEEE Transactions on Information Theory
Expander codes

IEEE Transactions on Information Theory - Part 1
Time-varying periodic convolutional codes with low-density parity-check matrix

IEEE Transactions on Information Theory
On expander codes

IEEE Transactions on Information Theory
An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes

IEEE Journal on Selected Areas in Communications

Braided block codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

We present a new class of iteratively decodable turbolike 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.