A Low Complexity Decoding Algorithm for Accumulated-Crossover Parallel-concatenated SPC Codes
累加交叉并行级联单奇偶校验码的低复杂度译码算法

Accumulated-Crossover Parallel-concatenated SPC (A-CPSPC) Codes, which have good bit error rate performance and simple encoding structure, is a class of novel error-correcting codes. A Maximum A Posteriori (MAP) algorithm based on the Sum-Product Algorithm (SPA), is proposed to solve the local decoding, and to eliminate the effect of short cycles. Analysis and simulation results show that the conventional Belief Propagation (BP) decoding algorithm is not suitable for A-CPSPC codes, and the proposed local decoding algorithm can achieve the same performance as the one based on the BCJR algorithm, but has much lower complexity.