DocumentCode :
2267592
Title :
Braided convolutional codes
Author :
Wei Zhang ; Lentmaier, M. ; Costello, D.J. ; Zigangirov, K.S.
Author_Institution :
Dept. of Electr. Eng., Notre Dame Univ., IN
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
592
Lastpage :
596
Abstract :
We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided 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.
Keywords :
Markov processes; convolutional codes; iterative decoding; turbo codes; Markov permutors; braided convolutional codes; convergence behavior; iterative decoding; statistical analysis; turbo codes; Aerospace engineering; Block codes; Convergence; Convolutional codes; Encoding; Iterative decoding; Navigation; Pipelines; Statistical analysis; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523404
Filename :
1523404
Link To Document :
بازگشت