Overlapped message passing for quasi-cyclic low-density parity check codes

Yanni Chen; Keshab K. Parhi

doi:10.1109/TCSI.2004.826194

Overlapped message passing for quasi-cyclic low-density parity check codes

Yanni Chen, Keshab K. Parhi

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

125 Scopus citations

Abstract

In this paper, a systematic approach is proposed to develop a high throughput decoder for quasi-cyclic low-density parity check (LDPC) codes, whose parity check matrix is constructed by circularly shifted identity matrices. Based on the properties of quasi-cyclic LDPC codes, the two stages of belief propagation decoding algorithm, namely, check node update and variable node update, could be overlapped and thus the overall decoding latency is reduced. To avoid the memory access conflict, the maximum concurrency of the two stages is explored by a novel scheduling algorithm. Consequently, the decoding throughput could be increased by about twice assuming dual-port memory is available.

Original language	English (US)
Pages (from-to)	1106-1113
Number of pages	8
Journal	IEEE Transactions on Circuits and Systems I: Regular Papers
Volume	51
Issue number	6
DOIs	https://doi.org/10.1109/TCSI.2004.826194
State	Published - Jun 2004

Bibliographical note

Funding Information:
Manuscript received June 11, 2003; revised December 6, 2003. This work was supported by the Army Research Office under Grant DA/DAAD19-01-1-0705. This paper was presented in part at the ACM Great Lake Symposium on VLSI, April 26–29, 2003, Washington, DC. This paper was recommended by Associate Editor Y. Wang.

Keywords

High throughput
Low-density parity check (LDPC) codes
Overlapped message passing (MP)
Quasi-cyclic codes

Access

10.1109/TCSI.2004.826194

Cite this

@article{8b317aa60cf44faebc3ffe3d831edebc,

title = "Overlapped message passing for quasi-cyclic low-density parity check codes",

abstract = "In this paper, a systematic approach is proposed to develop a high throughput decoder for quasi-cyclic low-density parity check (LDPC) codes, whose parity check matrix is constructed by circularly shifted identity matrices. Based on the properties of quasi-cyclic LDPC codes, the two stages of belief propagation decoding algorithm, namely, check node update and variable node update, could be overlapped and thus the overall decoding latency is reduced. To avoid the memory access conflict, the maximum concurrency of the two stages is explored by a novel scheduling algorithm. Consequently, the decoding throughput could be increased by about twice assuming dual-port memory is available.",

keywords = "High throughput, Low-density parity check (LDPC) codes, Overlapped message passing (MP), Quasi-cyclic codes",

author = "Yanni Chen and Parhi, {Keshab K.}",

note = "Funding Information: Manuscript received June 11, 2003; revised December 6, 2003. This work was supported by the Army Research Office under Grant DA/DAAD19-01-1-0705. This paper was presented in part at the ACM Great Lake Symposium on VLSI, April 26–29, 2003, Washington, DC. This paper was recommended by Associate Editor Y. Wang.",

year = "2004",

month = jun,

doi = "10.1109/TCSI.2004.826194",

language = "English (US)",

volume = "51",

pages = "1106--1113",

journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",

issn = "1549-8328",

number = "6",

}

TY - JOUR

T1 - Overlapped message passing for quasi-cyclic low-density parity check codes

AU - Chen, Yanni

AU - Parhi, Keshab K.

N1 - Funding Information: Manuscript received June 11, 2003; revised December 6, 2003. This work was supported by the Army Research Office under Grant DA/DAAD19-01-1-0705. This paper was presented in part at the ACM Great Lake Symposium on VLSI, April 26–29, 2003, Washington, DC. This paper was recommended by Associate Editor Y. Wang.

PY - 2004/6

Y1 - 2004/6

N2 - In this paper, a systematic approach is proposed to develop a high throughput decoder for quasi-cyclic low-density parity check (LDPC) codes, whose parity check matrix is constructed by circularly shifted identity matrices. Based on the properties of quasi-cyclic LDPC codes, the two stages of belief propagation decoding algorithm, namely, check node update and variable node update, could be overlapped and thus the overall decoding latency is reduced. To avoid the memory access conflict, the maximum concurrency of the two stages is explored by a novel scheduling algorithm. Consequently, the decoding throughput could be increased by about twice assuming dual-port memory is available.

AB - In this paper, a systematic approach is proposed to develop a high throughput decoder for quasi-cyclic low-density parity check (LDPC) codes, whose parity check matrix is constructed by circularly shifted identity matrices. Based on the properties of quasi-cyclic LDPC codes, the two stages of belief propagation decoding algorithm, namely, check node update and variable node update, could be overlapped and thus the overall decoding latency is reduced. To avoid the memory access conflict, the maximum concurrency of the two stages is explored by a novel scheduling algorithm. Consequently, the decoding throughput could be increased by about twice assuming dual-port memory is available.

KW - High throughput

KW - Low-density parity check (LDPC) codes

KW - Overlapped message passing (MP)

KW - Quasi-cyclic codes

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

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

U2 - 10.1109/TCSI.2004.826194

DO - 10.1109/TCSI.2004.826194

M3 - Article

AN - SCOPUS:3042549356

VL - 51

SP - 1106

EP - 1113

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1549-8328

IS - 6

ER -

Overlapped message passing for quasi-cyclic low-density parity check codes

Abstract

Bibliographical note

Keywords

Access

Other files and links

Fingerprint

Cite this