Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity

David Declercq (1) , Erbao Li (1) , Shiva K. Planjery (1, 2) , Bane Vasic (2)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 ECE - Department of Electrical and Computer Engineering [Tucson]

We introduce a generic approach, called FAID diversity, for improving the error correction capability of regular low-density parity check codes, beyond the belief propagation performance. The method relies on operating a set of finite alpha- bet iterative decoders (FAID). The message-passing update rules are interpreted as discrete dynamical systems, and are judiciously chosen to ensure that decoders have different dynamics on a specific finite-length code. An algorithm is proposed which uses random jumps in the iterative message passing trajectories, such that the system is not trapped in periodic attractors. We show by simulations that the FAID diversity approach with random jumps has the potential of approaching the performance of maximum- likelihood decoding for finite-length regular, column-weight three codes.

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

David Declercq, Erbao Li, Shiva K. Planjery, Bane Vasic. Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity. ITW'12, Sep 2012, Lausanne, Switzerland. ⟨hal-00764115⟩