Q-ary LDPC decoders with reduced complexity

X. H. Shen; Chung Ming Lau

Q-ary LDPC decoders with reduced complexity

X. H. Shen
, Chung Ming Lau

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

Abstract

Q-ary low-density parity-check (LDPC) codes achieve exceptional error performance at the expense of computation simplicity. Solutions to accelerate the decoding process have become one of the focuses in literature. In this paper, a decoding method is proposed, based on the subcode concept, to speed up the dominant iterative process. The method leads to speed improvement with moderate error-performance penalty.

Original language	English
Title of host publication	15th International Conference on Advanced Communication Technology
Subtitle of host publication	Smart Services with Internet of Things!, ICACT 2013 - Proceeding
Pages	941-946
Number of pages	6
Publication status	Published - 22 Apr 2013
Event	15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013 - PyeongChang, Korea, Republic of Duration: 27 Jan 2013 → 30 Jan 2013

Conference

Conference	15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013
Country/Territory	Korea, Republic of
City	PyeongChang
Period	27/01/13 → 30/01/13

Keywords

Bit error rate
complexity
LDPC code
q-ary LDPC code
subcode

ASJC Scopus subject areas

Electrical and Electronic Engineering

Cite this

@inproceedings{0c42e9e857da4027b232af3cadc66658,

title = "Q-ary LDPC decoders with reduced complexity",

abstract = "Q-ary low-density parity-check (LDPC) codes achieve exceptional error performance at the expense of computation simplicity. Solutions to accelerate the decoding process have become one of the focuses in literature. In this paper, a decoding method is proposed, based on the subcode concept, to speed up the dominant iterative process. The method leads to speed improvement with moderate error-performance penalty.",

keywords = "Bit error rate, complexity, LDPC code, q-ary LDPC code, subcode",

author = "Shen, \{X. H.\} and Lau, \{Chung Ming\}",

year = "2013",

month = apr,

day = "22",

language = "English",

isbn = "9788996865018",

pages = "941--946",

booktitle = "15th International Conference on Advanced Communication Technology",

note = "15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013 ; Conference date: 27-01-2013 Through 30-01-2013",

}

Shen, XH & Lau, CM 2013, Q-ary LDPC decoders with reduced complexity. in 15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013 - Proceeding., 6488335, pp. 941-946, 15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013, PyeongChang, Korea, Republic of, 27/01/13.

Q-ary LDPC decoders with reduced complexity. / Shen, X. H.; Lau, Chung Ming.
15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013 - Proceeding. 2013. p. 941-946 6488335.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Q-ary LDPC decoders with reduced complexity

AU - Shen, X. H.

AU - Lau, Chung Ming

PY - 2013/4/22

Y1 - 2013/4/22

N2 - Q-ary low-density parity-check (LDPC) codes achieve exceptional error performance at the expense of computation simplicity. Solutions to accelerate the decoding process have become one of the focuses in literature. In this paper, a decoding method is proposed, based on the subcode concept, to speed up the dominant iterative process. The method leads to speed improvement with moderate error-performance penalty.

AB - Q-ary low-density parity-check (LDPC) codes achieve exceptional error performance at the expense of computation simplicity. Solutions to accelerate the decoding process have become one of the focuses in literature. In this paper, a decoding method is proposed, based on the subcode concept, to speed up the dominant iterative process. The method leads to speed improvement with moderate error-performance penalty.

KW - Bit error rate

KW - complexity

KW - LDPC code

KW - q-ary LDPC code

KW - subcode

UR - https://www.scopus.com/pages/publications/84876228011

M3 - Conference article published in proceeding or book

SN - 9788996865018

SP - 941

EP - 946

BT - 15th International Conference on Advanced Communication Technology

T2 - 15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013

Y2 - 27 January 2013 through 30 January 2013

ER -

Q-ary LDPC decoders with reduced complexity

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this