Unrolled layered architectures for non-surjective finite alphabet iterative decoders

This paper proposes cost efficient very high throughput layered decoding architecture for array quasi-cyclic Low-Density Parity-Check (QC-LDPC) codes, targeting tens of Gbps data rates. The targeted throughput is achieved by employing layer unrolling, with pipeline stages inserted in between layers. In order to obtain improved hardware efficiency for the decoder, multiple codewords are processed simultaneously. This leads to increased memory overhead. In order to reduce the associated cost, approximate message storage using Non Surjective-Finite Alphabet Iterative Decoding (NS-FAID) compression tables is employed. Cost efficiency is achieved by hardwired interconnects, compressed message storage using the NS-FAID, as well the A Posteriori Log-Likelihood Ratio (AP-LLR) message memory removal. Several compression tables are evaluated using the Throughput to Area Ratio (TAR) metric.

[1]  Ahsan Aziz,et al.  High-Throughput FPGA-Based QC-LDPC Decoder Architecture , 2015, 2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall).

[2]  David Declercq,et al.  High Throughput FPGA Implementation for regular Non-Surjective Finite Alphabet Iterative Decoders , 2017, 2017 IEEE International Conference on Communications Workshops (ICC Workshops).

[3]  S. Litsyn,et al.  An efficient message-passing schedule for LDPC decoding , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[4]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[5]  David Declercq,et al.  FPGA design of high throughput LDPC decoder based on imprecise Offset Min-Sum decoding , 2015, 2015 IEEE 13th International New Circuits and Systems Conference (NEWCAS).

[6]  David Declercq,et al.  Non-surjective finite alphabet iterative decoders , 2016, 2016 IEEE International Conference on Communications (ICC).

[7]  Rüdiger L. Urbanke,et al.  The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..

[8]  Norbert Wehn,et al.  A new dimension of parallelism in ultra high throughput LDPC decoding , 2013, SiPS 2013 Proceedings.

[9]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[10]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[11]  Oana Boncalo,et al.  Ultra High Throughput Unrolled Layered Architecture for QC-LDPC Decoders , 2017, 2017 IEEE Computer Society Annual Symposium on VLSI (ISVLSI).

[12]  Manabu Hagiwara,et al.  Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices" , 2009, IEEE Trans. Inf. Theory.

[13]  Kai Zhang,et al.  High-throughput layered decoder implementation for quasi-cyclic LDPC codes , 2009, IEEE Journal on Selected Areas in Communications.

[14]  Valentin Savin,et al.  Chapter 4 – LDPC Decoders , 2014 .