期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 56, 期 1, 页码 316-331出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2009.2034784
关键词
Braided convolutional codes; codes on graphs; convolutional permutor; free distance; iterative decoding; turbo-like codes
资金
- National Science Foundation (NSF) [CCR02-05310]
- U.S. Army [DAAD16-02-C-0057]
- NASA [NNG05GH73G]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据