Design of irregular LDPC codes with degree-set and degree-sum distributions

Min Jang, Jin Whan Kang, Sang Hyo Kim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree distribution. As the degree set/sum distribution varies, tradeoff between the performance at the waterfall and that at the error-floor is observed. The trade-off point can be managed by controlling degree-set/sum distribution.

Original languageEnglish
Title of host publication2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012
Pages1925-1930
Number of pages6
DOIs
StatePublished - 2012
Event2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012 - Sydney, NSW, Australia
Duration: 9 Sep 201212 Sep 2012

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Conference

Conference2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012
Country/TerritoryAustralia
CitySydney, NSW
Period9/09/1212/09/12

Fingerprint

Dive into the research topics of 'Design of irregular LDPC codes with degree-set and degree-sum distributions'. Together they form a unique fingerprint.

Cite this