Ldpc Code Decoding Algorithm Based On The Apsk (psk) Modulation

In this paper, we propose a Fast Min-Sum Algorithm for the decoding of APSK modulation Low-Density Parity-Check (LDPC) codes. The Belief Propagation (BP) Algorithm for the decoding of BPSK modulation LDPC codes can be simplified using Min-sum Algorithm, which greatly reduces the implemention complexity. But the computation complexity of the Min-Sum Algorithm will greatly increase when it is used for decoding the APSK modulation LDPC codes. We analyzed the characteristic of the Min-Sum Algorithm for decoding the APSK modulation LDPC codes and developed a so called Fast Min-Sum Algorithm which greatly reduces the computation complexity. Finally, we suggest a way to improve the performance of the Fast Min-Sum Algorithm by adding a correction term. The simulation performance of the improved Fast Min-Sum Algorithm even better than the BP Algorithm's.