On the Performance of Rate-Compatible LDPC Codes under All-Integer Quantization Decoding

Abstract

From a practical point of view, quantization is necessary for the design of any low-complexity LDPC decoder. However, the quantization scheme with the minimum computational complexity called all-integer quantization has not been well investigated since, intuitively, it seems to significantly degrade the decoding performance. It is found in this work that the utilization of 4-bit all-integer quantization for MSA-based LDPC decoder is adequate to achieve the decoding performance of the nonquantized case which can be considered as the lower bound on the decoding performance. Moreover, this simple quantization scheme can also be applied to the hardware and cost-efficient rate-compatible LDPC codes.