Location of Repository

Review on: Iterative Decoding schemes of LDPC

By 

Abstract

Low-density parity-check (LDPC) code, a very promising near-optimal error correction code (ECC), is being widely considered in next generation industry standards. In this paper, two simple iterative low complexity algorithms for decoding LDPC codes have been explained. These algorithms are implemented using real additions only and also not dependent on power spectral density. Comparison of these algorithms with standard BP algorithm are explained. How these algorithms are useful for standards DVB-S2, T2 and WiMAX are explained. In VLSI implementation these algorithms using shift-LDPC codes these algorithms reduces hardware complexity

Topics: Belief Propagation, iterative decoding, shift LDPC, Tanner graph
Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.414.8749
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ijera.com/papers/Vo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.