Forced Convergence Decoding of LDPC Codes – EXIT Chart Analysis and Combination with Node Complexity Reduction Techniques

Conference: European Wireless 2005 - 11th European Wireless Conference 2005 - Next Generation wireless and Mobile Communications and Services
04/10/2006 - 04/13/2005 at Nicosia, Cyprus

Proceedings: European Wireless 2005

Pages: 8Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Zimmermann, Ernesto; Rave, Wolfgang; Fettweis, Gerhard (Dresden University of Technology, Vodafone Chair Mobile Communications Systems, 01062 Dresden, Germany)

Recently, the concept of forced convergence decoding for Low-Density Parity-Check Codes has been introduced. Restricting the message passing in the iterative process to the nodes that still significantly contribute to the decoding result, this approach allows for substantial reduction in decoding complexity at negligible deterioration in performance. We analyze this novel technique using EXIT charts and show how it compares to and can be combined with other complexity reduction techniques. Our findings imply that forced convergence works effectively in conjunction with other complexity reduction techniques while retaining its attractiveness in terms of the complexity-performance trade-off.