Reduced complexity decoding algorithm of LDPC codes using node elimination

Joon Sung Kim; Hong Yeop Song

doi:10.1109/ICCS.2006.301432

Reduced complexity decoding algorithm of LDPC codes using node elimination

Joon Sung Kim, Hong Yeop Song

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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-E_b/N_o region.

Original language	English
Title of host publication	2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006
DOIs	https://doi.org/10.1109/ICCS.2006.301432
Publication status	Published - 2006
Event	10th IEEE Singapore International Conference on Communications Systems, ICCS 2006 - Singapore, Singapore Duration: 2006 Oct 30 → 2006 Nov 1

Publication series

Name	2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006

Other

Other	10th IEEE Singapore International Conference on Communications Systems, ICCS 2006
Country/Territory	Singapore
City	Singapore
Period	06/10/30 → 06/11/1

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Communication
Electrical and Electronic Engineering

Access to Document

10.1109/ICCS.2006.301432

Cite this

@inproceedings{d6fa6c1b973b49f8b5c6db04bccb5926,

title = "Reduced complexity decoding algorithm of LDPC codes using node elimination",

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.",

author = "Kim, {Joon Sung} and Song, {Hong Yeop}",

year = "2006",

doi = "10.1109/ICCS.2006.301432",

language = "English",

isbn = "1424404118",

series = "2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006",

booktitle = "2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006",

note = "10th IEEE Singapore International Conference on Communications Systems, ICCS 2006 ; Conference date: 30-10-2006 Through 01-11-2006",

}

Kim, JS & Song, HY 2006, Reduced complexity decoding algorithm of LDPC codes using node elimination. in 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006., 4085727, 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006, 10th IEEE Singapore International Conference on Communications Systems, ICCS 2006, Singapore, Singapore, 06/10/30. https://doi.org/10.1109/ICCS.2006.301432

Reduced complexity decoding algorithm of LDPC codes using node elimination. / Kim, Joon Sung; Song, Hong Yeop.
2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006. 4085727 (2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Reduced complexity decoding algorithm of LDPC codes using node elimination

AU - Kim, Joon Sung

AU - Song, Hong Yeop

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46949108510&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46949108510&partnerID=8YFLogxK

U2 - 10.1109/ICCS.2006.301432

DO - 10.1109/ICCS.2006.301432

M3 - Conference contribution

AN - SCOPUS:46949108510

SN - 1424404118

SN - 9781424404117

T3 - 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006

BT - 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006

T2 - 10th IEEE Singapore International Conference on Communications Systems, ICCS 2006

Y2 - 30 October 2006 through 1 November 2006

ER -

Reduced complexity decoding algorithm of LDPC codes using node elimination

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this