Combined optimization scheme for degree distributions of LDPC codes

Jin Soo Park; Min Kyu Song; Hong Yeop Song

doi:10.1109/APCC.2013.6765996

Combined optimization scheme for degree distributions of LDPC codes

Jin Soo Park, Min Kyu Song, Hong Yeop Song

Department of Electrical and Electronic Engineering

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

Abstract

In this paper, we propose an optimization scheme for degree distributions of LDPC codes that combines differential evolution and iterative simplex algorithm. In the proposed scheme, we find good check and variable nodes degree distribution and threshold by using differential evolution, and then, we further optimize check and variable nodes degree distribution that has enhanced code rate by using an iterative simplex algorithm. An iterative simplex algorithm consists of two simplex algorithms, optimizing ρ(x) and λ(x), respectively and iteratively. Some simulation results show that the proposed scheme finds degree distributions, better than those obtained by the differential evolution only, in terms of threshold and/or code rate. As an application of the proposed scheme, we report some new degree distributions with some new maximum degrees.

Original language	English
Title of host publication	2013 19th Asia-Pacific Conference on Communications, APCC 2013
Publisher	IEEE Computer Society
Pages	485-489
Number of pages	5
ISBN (Print)	9781467360500
DOIs	https://doi.org/10.1109/APCC.2013.6765996
Publication status	Published - 2013 Jan 1
Event	2013 19th Asia-Pacific Conference on Communications, APCC 2013 - Denpasar, Indonesia Duration: 2013 Aug 29 → 2013 Aug 31

Publication series

Name	2013 19th Asia-Pacific Conference on Communications, APCC 2013

Other

Other	2013 19th Asia-Pacific Conference on Communications, APCC 2013
Country	Indonesia
City	Denpasar
Period	13/8/29 → 13/8/31

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Access to Document

10.1109/APCC.2013.6765996

Cite this

Park, J. S., Song, M. K., & Song, H. Y. (2013). Combined optimization scheme for degree distributions of LDPC codes. In 2013 19th Asia-Pacific Conference on Communications, APCC 2013 (pp. 485-489). [6765996] (2013 19th Asia-Pacific Conference on Communications, APCC 2013). IEEE Computer Society. https://doi.org/10.1109/APCC.2013.6765996

@inproceedings{d12cb8baa077473f995fe5e888e29b0f,

title = "Combined optimization scheme for degree distributions of LDPC codes",

abstract = "In this paper, we propose an optimization scheme for degree distributions of LDPC codes that combines differential evolution and iterative simplex algorithm. In the proposed scheme, we find good check and variable nodes degree distribution and threshold by using differential evolution, and then, we further optimize check and variable nodes degree distribution that has enhanced code rate by using an iterative simplex algorithm. An iterative simplex algorithm consists of two simplex algorithms, optimizing ρ(x) and λ(x), respectively and iteratively. Some simulation results show that the proposed scheme finds degree distributions, better than those obtained by the differential evolution only, in terms of threshold and/or code rate. As an application of the proposed scheme, we report some new degree distributions with some new maximum degrees.",

author = "Park, {Jin Soo} and Song, {Min Kyu} and Song, {Hong Yeop}",

year = "2013",

month = jan,

day = "1",

doi = "10.1109/APCC.2013.6765996",

language = "English",

isbn = "9781467360500",

series = "2013 19th Asia-Pacific Conference on Communications, APCC 2013",

publisher = "IEEE Computer Society",

pages = "485--489",

booktitle = "2013 19th Asia-Pacific Conference on Communications, APCC 2013",

address = "United States",

note = "2013 19th Asia-Pacific Conference on Communications, APCC 2013 ; Conference date: 29-08-2013 Through 31-08-2013",

}

Park, JS, Song, MK & Song, HY 2013, Combined optimization scheme for degree distributions of LDPC codes. in 2013 19th Asia-Pacific Conference on Communications, APCC 2013., 6765996, 2013 19th Asia-Pacific Conference on Communications, APCC 2013, IEEE Computer Society, pp. 485-489, 2013 19th Asia-Pacific Conference on Communications, APCC 2013, Denpasar, Indonesia, 13/8/29. https://doi.org/10.1109/APCC.2013.6765996

Combined optimization scheme for degree distributions of LDPC codes. / Park, Jin Soo; Song, Min Kyu; Song, Hong Yeop.

2013 19th Asia-Pacific Conference on Communications, APCC 2013. IEEE Computer Society, 2013. p. 485-489 6765996 (2013 19th Asia-Pacific Conference on Communications, APCC 2013).

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

TY - GEN

T1 - Combined optimization scheme for degree distributions of LDPC codes

AU - Park, Jin Soo

AU - Song, Min Kyu

AU - Song, Hong Yeop

PY - 2013/1/1

Y1 - 2013/1/1

N2 - In this paper, we propose an optimization scheme for degree distributions of LDPC codes that combines differential evolution and iterative simplex algorithm. In the proposed scheme, we find good check and variable nodes degree distribution and threshold by using differential evolution, and then, we further optimize check and variable nodes degree distribution that has enhanced code rate by using an iterative simplex algorithm. An iterative simplex algorithm consists of two simplex algorithms, optimizing ρ(x) and λ(x), respectively and iteratively. Some simulation results show that the proposed scheme finds degree distributions, better than those obtained by the differential evolution only, in terms of threshold and/or code rate. As an application of the proposed scheme, we report some new degree distributions with some new maximum degrees.

AB - In this paper, we propose an optimization scheme for degree distributions of LDPC codes that combines differential evolution and iterative simplex algorithm. In the proposed scheme, we find good check and variable nodes degree distribution and threshold by using differential evolution, and then, we further optimize check and variable nodes degree distribution that has enhanced code rate by using an iterative simplex algorithm. An iterative simplex algorithm consists of two simplex algorithms, optimizing ρ(x) and λ(x), respectively and iteratively. Some simulation results show that the proposed scheme finds degree distributions, better than those obtained by the differential evolution only, in terms of threshold and/or code rate. As an application of the proposed scheme, we report some new degree distributions with some new maximum degrees.

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

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

U2 - 10.1109/APCC.2013.6765996

DO - 10.1109/APCC.2013.6765996

M3 - Conference contribution

AN - SCOPUS:84902357251

SN - 9781467360500

T3 - 2013 19th Asia-Pacific Conference on Communications, APCC 2013

SP - 485

EP - 489

BT - 2013 19th Asia-Pacific Conference on Communications, APCC 2013

PB - IEEE Computer Society

T2 - 2013 19th Asia-Pacific Conference on Communications, APCC 2013

Y2 - 29 August 2013 through 31 August 2013

ER -