Research of Low-Density Parity-Check Decode Algorithms for Digital Subscriber Lines

Decoding algorithm complexity influences the application of low-density parity-check (LDPC) codes. This article investigated the Belief-Propagation and improved decode algorithms for a subclass of binary LDPC that can be encoded linearly. Through the comparison of decoding performance, a low complexity one with good performance is preferred. It is shown that the incorporation of LDPC coding techniques into Digital Subscriber Line (DSL) systems appears to be possible.