Computer Science – Information Theory
Scientific paper
2009-12-28
Computer Science
Information Theory
5 pages, submitted to the 2010 IEEE International Symposium on Information Theory
Scientific paper
We consider the decoding of convolutional codes using an error trellis constructed based on a submatrix 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 al. 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 0'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.
Miyagoshi Takashi
Okino Koji
Tajima Masato
No associations
LandOfFree
1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with 1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-91420