Memory-efficient sum-product decoding of LDPC codes

@article{Sankar2004MemoryefficientSD,
  title={Memory-efficient sum-product decoding of LDPC codes},
  author={Hari Sankar and Krishna R. Narayanan},
  journal={IEEE Transactions on Communications},
  year={2004},
  volume={52},
  pages={1225-1230}
}
Low-density parity-check (LDPC) codes perform very close to capacity for long lengths on several channels. However, the amount of memory (fixed-point numbers that need to be stored) required for implementing the message-passing algorithm increases linearly as the number of edges in the graph increases. In this letter, we propose a decoding algorithm for decoding LDPC codes that reduces the memory requirement at the decoder. The proposed decoding algorithm can be analyzed using density evolution… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
23 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Similar Papers

Loading similar papers…