Low-complexity low-density parity check decoding algorithm for high-speed very large scale integration implementation
F. Angarita, J. Marín-Roig, Vicenç Almenar, Javier Valls · IET Communications · 2012
This study proposes a new low-complexity decoding algorithm for low-density parity check codes, which is a variation of the offset min-sum algorithm and achieves a similar performance with lower hardware cost. A finite precision study is presented and the hardware cost of the implementation of three very large scale integration architectures is evaluated. As a conclusion, the proposed algorithm achieves similar performance with an area saving of around 18, 10 and 14% for the memory-based partially parallel, fully parallel and sliced message passing implementations, respectively.