Complexity-Reduced Algorithms for LDPC Decoder for DVB-S2 Systems

  • Choi, Eun-A (Digital Broadcasting Research Division, ETRI) ;
  • Jung, Ji-Won (Department of Radio and Science Engineering, Korea Maritime University) ;
  • Kim, Nae-Soo (Telematics/USN Research Division, ETRI) ;
  • Oh, Deock-Gil (Digital Broadcasting Research Division, ETRI)
  • Received : 2005.03.23
  • Published : 2005.10.31

Abstract

This paper proposes two kinds of complexity-reduced algorithms for a low density parity check (LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.

Keywords

References

  1. IRE Trans. Information Theory v.8 Low-Density Parity-Check Codes Gallager, R.G.
  2. Electron. Letter v.32 Near Shannon Limit Performance of Low-Density Parity-Check Codes Mackay, D.J.C.;Neal, R.M.
  3. IEEE Trans. Information Theory v.42 Expander Codes Sipser, M.;Spielman, D.A.
  4. IEEE Trans. Information Theory v.47 Efficient Encoding of Low-Density Parity Check Codes Richardson, T.;Urbanke, R.
  5. Proc. EUROCOMM 2000 Constructing Low-Density Parity-Check Codes Bond, J.W.;Hui, S.;Schmidt, H.
  6. IEEE Trans. Information Theory v.45 no.2 Good Error-Correcting Codes Based on Very Sparse Matrics David Mavkay, J.C.