1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices


          

刊名：電子情報通信学会技術研究報告
作者：Masato TAJIMA（Graduate School of Science and Engineering, University of Toyama）
Koji OKINO（Information Technology Center, University of Toyama）
Takashi MIYAGOSHI（Graduate School of Science and Engineering, University of Toyama）
刊号：734D0133-44
ISSN：0913-5685
出版年：2009
年卷期：2009, vol.109, no.446
页码：153-158
总页数：6
分类号：TN91
关键词：LDPC convolutional codes；Submatrix of a check matrix；1-state error trellis；Decoding complexity
参考中译：
语种：eng
文摘：We consider the decoding of convolutional codes using an error trellis constructed based on a subma-trix of a given check matrix. In the proposed method, the syndrome-subsequence computed using the remaining submatrix is utilized as auxiliary information for decoding. Then the ML error path is correctly decoded using the degenerate error trellis. We also show that the decoding complexity of the proposed method is basically identical with that of the conventional one based on the original error trellis. Next, we apply the method to check matrices with monomial entries proposed by Tanner et ah By choosing any row of the check matrix as the submatrix for error-trellis construction, a 1-state error trellis is obtained. Noting the fact that a likelihood-concentration on the all-zero state and the states with many O's occurs in the error trellis, we present a simplified decoding method based on a 1-state error trellis, from which decoding-complexity reduction is realized.



©2016机械工业出版社（机械工业信息研究院） 京ICP备05055788号-35