Serially concatenated belief propagation decoder for low‐density parity‐check codes

A new decoding strategy of belief propagation (BP) for low‐density parity‐check codes is presented by serially concatenating the traditional simultaneous decoding (also known as flooding) and the informed dynamic decoding (IDD) (e.g. node‐wise residual belief propagation (NW RBP) or informed variable‐to‐check (IVC) RBP). The frame error rates (FER) and bit error rates (BER) of the concatenated BP decoder outperform that of the non‐concatenated single decoder. In addition, as the signal‐to‐noise ratio (SNR) increases, the average number of decoding iterations required for the concatenated BP decoder decreases, and tends to merge with that of the first sub‐decoder in the high SNR region. Moreover, since the IDD strategies concerned in this paper require extra effort for the residual computation, and the sequential updating of IDD is much more time consuming than the simultaneous updating of flooding. Therefore, compared with using a single IDD, serially concatenating flooding and IDD reduces both the approximate decoding complexity and the decoding latency because the concatenated decoder is still dominated by the sub‐decoder flooding.