A Two-stage Decoding Algorithm for Spatially Coupled Algebraic LDPC Codes
Juewei Wang, Xiao Ma
Abstract
Juewei Wang, Xiao Ma
Abstract
In this paper, we propose a two-stage decoding algorithm for spatially-coupled algebraic low-density paritycheck (LDPC) codes with linear computational complexity, which consists of a sliding-window belief propagation (BP) decoding algorithm and a majority logic decoding algorithm. Simulation results are presented, showing that the error rate performance of SC-LDPC codes can be further improved by the majority logic decoding algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose a two-stage decoding algorithm for spatially-coupled algebraic low-density paritycheck (LDPC) codes with linear computational complexity, which consists of a sliding-window belief propagation (BP) decoding algorithm and a majority logic decoding algorithm. Simulation results are presented, showing that the error rate performance of SC-LDPC codes can be further improved by the majority logic decoding algorithm.
Key concepts: Low-density parity-check code, Decoding methods, Berlekamp–Welch algorithm, Sequential decoding, Algorithm, List decoding, Computer science, Belief propagation