Construction of IRA-LDPC codes based on identity column vectors
| Autor: | Bo Zhou, Kai Tao, Kun Liang, Li Peng |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
Computer science 020206 networking & telecommunications 020302 automobile design & engineering 02 engineering and technology Base (topology) Identity column Matrix decomposition Parity-check matrix Matrix (mathematics) 0203 mechanical engineering 0202 electrical engineering electronic engineering information engineering Code (cryptography) Low-density parity-check code Computer Science::Information Theory Sparse matrix |
| Zdroj: | 2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN). |
| DOI: | 10.1109/iccsn.2017.8230087 |
| Popis: | A random-like framework of the IRA-LDPC codes based on the identity column vectors (ICV) was defined and created. A new family of the IRA-LDPC codes under the constraint of the framework was investigated using algebraic and random methods. Its structural features is that the large-sized sparse parity check matrix Hd corresponding to the information bits is extruded into two smaller-sized easy-to-compute matrices, respectively called base matrix and position matrix. The minimum decomposable unit of the parity-check matrix H is the ICV which can provide a wider selection range of code rates than the most extensively studied QC-LDPC codes. Some conditions for the IRA-LDPC code not to have any 4-girth were considered. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|