Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad
2016-05-01
|
| Series: | Journal of Engineering |
| Subjects: | |
| Online Access: | http://joe.uobaghdad.edu.iq/index.php/main/article/view/220 |
| Summary: | The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated. |
|---|---|
| ISSN: | 1726-4073 2520-3339 |