Background:
Low-density parity-check (LDPC) codes have received significant interest in a variety of communication systems due to their superior performance and reasonable decoding complexity.
Methods:
A novel collection of punctured codes decoding (CPCD) technique that considers a code as a collection of its punctured codes is proposed. Two forms of CPCD, serial CPCD that decodes each punctured code serially and parallel CPCD that decodes each punctured code in parallel, are discussed.
Results:
It is demonstrated that both serial and parallel CPCD have about the same decoding complexity compared with standard sum product algorithm (SPA) decoding. It is also demonstrated that while serial CPCD has about the same decoding delay compared with standard SPA decoding, parallel CPCD can decrease the decoding delay, however, at the expense of processing power.
Conclusion:
Numerical results demonstrate that CPCD can significantly improve the performance, or significantly increase the code rate of low-density parity-check (LDPC) codes.
