Name
Abstract | ||
|---|---|---|
Using a finite field approach, a novel algebraic construction of low-density parity-check (LDPC) convolutional codes with fast encoding property is proposed. According to the matrices of quasi-cyclic (QC) codes constructed based on the multiplicative groups of finite fields and the algebraic property that a binary circulant matrix is isomorphic to a finite ring, we first generate a polynomial-form parity-check matrix of an LDPC convolutional code under a given rate over a given finite field. Then some related modifications are made upon the original polynomial-form matrix to obtain the new one with fast encoding property. Simulation results show that the proposed LDPC convolutional codes have good performance with the iterative belief propagation decoding algorithm. © 2012 IEEE. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/LCOMM.2012.040912.112352 | IEEE Communications Letters |
Keywords | Field | DocType |
Parity check codes,Convolutional codes,Block codes,Polynomials,Simulation,Bit error rate | Finite ring,Discrete mathematics,Convolutional code,Computer science,Low-density parity-check code,Turbo code,Block code,Serial concatenated convolutional codes,Linear code,Belief propagation | Journal |
Volume | Issue | ISSN |
16 | 6 | 1089-7798 |
Citations | PageRank | References |
3 | 0.44 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liwei Mu | 1 | 15 | 0.84 |
| Xingcheng Liu | 2 | 66 | 17.47 |
| Chulong Liang | 3 | 103 | 12.50 |