Accumulated Cross Parallel Cascaded Single Parity Check (A-CPSPC) code is a new error correction code with a simple coding structure and good bit error rate performance. This paper proposes a low-complexity maximum a posteriori (MAP) local decoding algorithm for the local coding structure of A-CPSPC code. This method uses the sum-product algorithm (SPA) based on the bidirectional message passing principle for local decoding, eliminating the impact of short loops on local decoding performance. Analysis and simulation show that the traditional belief propagation algorithm is not suitable for A-CPSPC code. The local decoding algorithm proposed in this paper has the same performance as the local decoding algorithm based on the BCJR algorithm, and has lower complexity.
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore