Recently, a new structure of low density parity check (LDPC) code named raptor-like LDPC code has attracted much attention. It has better performance at low code rate. In this paper, a novel decoding scheme for raptor-like LDPC code is proposed. First, the Gaussian approximation density evolution (GADE) algorithm is used to track and analyze the message transmission during the decoding process. It is found that certain log likelihood ratio (LLR) messages can be approximated by “zero” setting in the early iteration of raptor-like LDPC decoding. In other words, some column and row operations could be eliminated without compromise the performance. Next, we propose a new decoding scheme, which can skip unnecessary column and row operations. In comparison with the traditional belief propagation (BP)-based LDPC decoding scheme, the proposed scheme can reduce the decoding complexity. Additionally, a new algorithm is developed to facilitate the selection of the early iteration number. With this novel design, the proposed decoding scheme performs almost the same as the traditional BP-based scheme. To proof the concept, the raptor-like LDPC codes in the ATSC3.0 digital TV system are used to evaluate the proposed scheme, in comparison with the traditional BP-based schemes, i.e., sum-product algorithm (SPA), offset min-sum algorithm (OMSA), and normalized min-sum algorithm (NMSA). The simulation results confirm that the proposed scheme can reduce the decoding complexity without sacrifice in performance for all SPA, OMSA, and NMSA methods. About 10% complexity reduction can be achieved. This will reduce the buttery consumption for Internet of Things (IoT) and handheld devices.
Read full abstract