Non-binary LDPC codes over finite division near rings
| Autor: | Matthias Korb, Andrew J. Blanksby |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Block code Berlekamp–Welch algorithm Concatenated error correction code 05 social sciences 050209 industrial relations List decoding Data_CODINGANDINFORMATIONTHEORY Sequential decoding Serial concatenated convolutional codes Computer Science::Hardware Architecture 0502 economics and business Low-density parity-check code Algorithm 050203 business & management Decoding methods Computer Science::Information Theory Mathematics |
| Zdroj: | ICT |
| DOI: | 10.1109/ict.2016.7500492 |
| Popis: | It is almost always assumed that the algebraic structure underlying non-binary Low-Density Parity-Check (LDPC) codes are Finite Fields. However, when considering non-binary LDPC belief-propagation (BP) decoding, Finite Fields are actually over constrained. In this contribution, we discuss the minimal requirements of the algebraic structure used for non-binary LDPC decoding which we denote Finite Division Near Ring over a Subtractive Near Group. To verify the requirements, a general Min-Max decoding algorithm is derived that incorporates any algebraic structure fulfilling this minimal requirement set. It is shown that by relaxing the mathematical constraints, the decoding performance of non-binary LDPC codes can be incrementally improved compared to a Finite-Field-based LDPC code without any additional hardware cost. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|