Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0812.4642

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

Masato Tajima, Koji Okino, Takashi Miyagoshi

Published Dec 26, 2008• 1 citation
arXivHTMLPDF

Abstract

Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the entries in H(D) are all monomials and several rows (columns) have monomial factors. Let us cyclically shift the rows of H. Then the parity-check matrix H'(D) corresponding to the modified matrix H' defines another convolutional code. However, its free distance is lower-bounded by the minimum distance of the original QC code. Also, each row (column) of H'(D) has a factor different from the one in H(D). We show that the state-space complexity of the error-trellis associated with H'(D) can be significantly reduced by controlling the row shifts applied to H with the error-correction capability being preserved.

DOI
10.48550/arxiv.0812.4642

Related papers

Error-trellis state complexity of LDPC convolutional codes based on circulant matrices

Masato Tajima, Koji Okino, Takashi Miyagoshi

Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the entries in H(D) are all monomials and several rows (columns) have monomial factors. Let us cyclically shift the rows of H. Then the parity-check matrix H'(D) corresponding to the modified matrix H' defines another convolutional code. However, its free distance is lower-bounded by the minimum distance of the original QC code. Also, each row (column) of H'(D) has a factor different from the one in H(D). We show that the statespace complexity of the error-trellis associated with H'(D) can be significantly reduced by controlling the row shifts applied to H with the error-correction capability being preserved.

International Symposium on Information Theory and its Applications•Oct 1, 2010•2 citations

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

Masato Tajima, Koji Okino, Takashi Miyagoshi

Abstract — Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the entries in H(D) are all monomials and several rows (columns) have monomial factors. Let us cyclically shift the rows of H. Then the parity-check matrix H ′ (D) corresponding to the modified matrix H ′ defines another convolutional code. However, its free distance is lower-bounded by the minimum distance of the original QC code. Also, each row (column) of H ′ (D) has a factor different from the one in H(D). We show that the statespace complexity of the error-trellis associated with H ′ (D) can be significantly reduced by controlling the row shifts applied to H with the error-correction capability being preserved. I.

IEICE Technical Report; IEICE Tech. Rep.•Mar 2, 2009•3 citations

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

Masato Tajima, Koji Okino, Takashi Miyagoshi

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.

arXiv:0912.4995•Dec 28, 2009•0 citations

QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns

Mohammad Hesam Tadayon, Mohammad Mohammadi

In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.

International Journal of Information & Communication Technology Research•Jun 15, 2016•0 citations

Type-III LDPC Convolutional Codes

Morteza Esmaeili, Mohammad Gholami

A class of geometrically structured quasi-cyclic low-density parity-check codes with a cylinder structure graph and girth 12 is considered. The parity-check matrix of such a code consists of blocks of zeros and cir-culant permutation matrices. A class of convolutional codes is assigned to these codes. The convolutional form generator matrix of these codes is obtained by elementary row and column operations. It is shown that the free distance of the obtained convolutional codes is equal to the minimum distance of their bock code counterparts.

•Jan 1, 2009•1 citation

Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences

正登 田島, 浩二 沖野, 立人 村山

In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor (with indeterminate D), we show that the associated tail-biting error-trellis can be reduced by cyclically shifting the corresponding error-subsequence by l (the power of D) time units. We see that the resulting reduced error-trellis is again tail-biting. Moreover, we show that reduction is also possible using backward-shifted error-subsequences.

arXiv:1401.2496•IEICE technical report. Speech•Jan 11, 2014•0 citations
Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the entries in H(D) are all monomials and several rows (columns) have monomial factors. Let us cyclically shift the rows of H. Then the parity-check matrix H'(D) corresponding to the modified matrix H' defines another convolutional code. However, its free distance is lower-bounded by the minimum distance of the original QC code. Also, each row (column) of H'(D) has a factor different from the one in H(D). We show that the state-space complexity of the error-trellis associated with H'(D) can be significantly reduced by controlling the row shifts applied to H with the error-correction capability being preserved.
Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the entries in H(D) are all monomials and several rows (columns) have monomial factors. Let us cyclically shift the rows of H. Then the parity-check matrix H'(D) corresponding to the modified matrix H' defines another convolutional code. However, its free distance is lower-bounded by the minimum distance of the original QC code. Also, each row (column) of H'(D) has a factor different from the one in H(D). We show that the statespace complexity of the error-trellis associated with H'(D) can be significantly reduced by controlling the row shifts applied to H with the error-correction capability being preserved.
Abstract — Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the entries in H(D) are all monomials and several rows (columns) have monomial factors. Let us cyclically shift the rows of H. Then the parity-check matrix H ′ (D) corresponding to the modified matrix H ′ defines another convolutional code. However, its free distance is lower-bounded by the minimum distance of the original QC code. Also, each row (column) of H ′ (D) has a factor different from the one in H(D). We show that the statespace complexity of the error-trellis associated with H ′ (D) can be significantly reduced by controlling the row shifts applied to H with the error-correction capability being preserved. I.
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.
In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.
A class of geometrically structured quasi-cyclic low-density parity-check codes with a cylinder structure graph and girth 12 is considered. The parity-check matrix of such a code consists of blocks of zeros and cir-culant permutation matrices. A class of convolutional codes is assigned to these codes. The convolutional form generator matrix of these codes is obtained by elementary row and column operations. It is shown that the free distance of the obtained convolutional codes is equal to the minimum distance of their bock code counterparts.
In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor (with indeterminate D), we show that the associated tail-biting error-trellis can be reduced by cyclically shifting the corresponding error-subsequence by l (the power of D) time units. We see that the resulting reduced error-trellis is again tail-biting. Moreover, we show that reduction is also possible using backward-shifted error-subsequences.