Reduced complexity decoding algorithm of LDPC codes using node elimination

Joon Sung Kim, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a modified belief propagation algorithm that uses node elimination for bit nodes of large log-likelihood ratio. With this algorithm, we can reduce decoding complexity and improve performance by enhancing the cycle properties. Simulation results show that the decoding complexity is reduced and the proposed algorithm outperforms the belief propagation algorithm in the high-Eb/No region.

Original languageEnglish
Title of host publication2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006
DOIs
Publication statusPublished - 2006
Event10th IEEE Singapore International Conference on Communications Systems, ICCS 2006 - Singapore, Singapore
Duration: 2006 Oct 302006 Nov 1

Publication series

Name2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006

Other

Other10th IEEE Singapore International Conference on Communications Systems, ICCS 2006
CountrySingapore
CitySingapore
Period06/10/3006/11/1

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Reduced complexity decoding algorithm of LDPC codes using node elimination'. Together they form a unique fingerprint.

Cite this