2000 character limit reached
A Fully-Unrolled LDPC Decoder Based on Quantized Message Passing (1510.04589v1)
Published 15 Oct 2015 in cs.IT and math.IT
Abstract: In this paper, we propose a finite alphabet message passing algorithm for LDPC codes that replaces the standard min-sum variable node update rule by a mapping based on generic look-up tables. This mapping is designed in a way that maximizes the mutual information between the decoder messages and the codeword bits. We show that our decoder can deliver the same error rate performance as the conventional decoder with a much smaller message bit-width. Finally, we use the proposed algorithm to design a fully unrolled LDPC decoder hardware architecture.