Split non-binary LDPC codes

Adrian Voicila (1) , David Declercq (2) , François Verdier (3) , Marc Fossorier (1) , Pascal Urard (4)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 ICI
3 ASTRE [Cergy-Pontoise]
4 STMicroelectronics

In this paper, we propose and study a new family of error-correcting codes. These achieve excellent error performance under an iterative decoding over the binary-input noisy channel and solves the memory space requirements problem of the non-binary LDPC decoders. We named this class of codes, Split non-binary LDPC codes. The main particularity of this new family of codes is that the variable and the check nodes are not defined over the same finite field GF(2p), like in the case of classical non-binary LDPC codes. The class of Split non-binary LDPC codes is obviously larger than that of existing types of codes, which gives more degrees of freedom to find good codes when the existing codes show their limits. We provide two examples of interesting split NB-LDPC codes.

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Adrian Voicila, David Declercq, François Verdier, Marc Fossorier, Pascal Urard. Split non-binary LDPC codes. International Symposium on Information Theory (ISIT'08), Jul 2008, Toronto, Canada. pp.955-959, ⟨10.1109/ISIT.2008.4595128⟩. ⟨hal-00524752⟩