An Algebraic Construction of Quasi-Cyclic LDPC Codes Based on the Conjugates of Primitive Elements over Finite Fields
| Autor: | Nauman Ali Khan, Muhammad Asif, Wuyang Zhou, Zain ul Abiden Akhtar, Juma Saidi Ally |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
05 social sciences 050801 communication & media studies 020206 networking & telecommunications 02 engineering and technology Belief propagation symbols.namesake 0508 media and communications Additive white Gaussian noise Finite field 0202 electrical engineering electronic engineering information engineering symbols Low-density parity-check code Algebraic number Algorithm Decoding methods Computer Science::Information Theory Communication channel Shift register |
| Zdroj: | 2018 IEEE 18th International Conference on Communication Technology (ICCT). |
| DOI: | 10.1109/icct.2018.8600012 |
| Popis: | Recently, there have been major developments in utilizing the finite fields to construct Low-density Parity-check (LDPC) codes. In this correspondence, an algebraic approach based on the conjugates of primitive elements over finite fields to construct Quasi-Cyclic (QC) Low-Density Parity-Check codes is presented. Proposed QC-LDPC codes provide an excellent error performance with Belief Propagation (BP) decoding over an Additive White Gaussian Noise (AWGN) channel. Based on numerical results, the performance analysis shows that the proposed QC-LDPC codes perform as well as the randomly constructed Progressive edge growth (PEG) LDPC codes and algebraic QC-LDPC in the lower signal-to-noise ratio (SNR) region but outperform their counterparts in the higher SNR region. Also, the codes constructed are QC in nature, so the encoding can be done with shift register circuits having linear complexity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|