VLSI implementation-oriented (3,k)-regular low-density parity-check codes

T. Zhang, Keshab K Parhi

Research output: Contribution to conferencePaper

59 Citations (Scopus)

Abstract

In the past few years, Gallager's Low-Density Parity-Check (LDPC) codes received a lot of attention and many efforts have been devoted to analyze and improve their error-correcting performance. However, little consideration has been given to the LDPC decoder VLSI implementation. The straightforward fully parallel decoder architecture usually incurs too high complexity for many practical purposes and should be transformed to a partly parallel realization. Unfortunately, due to the randomness of LDPC codes, it's nearly impossible to develop an effective transformation for an arbitrary given LDPC code. In this paper, we propose a joint code and decoder design approach to construct a class of (3,k)-regular LDPC codes which exactly fit to a partly parallel decoder implementation and have a very good performance. Moreover, for such LDPC codes, we propose a systematic efficient encoding scheme by effectively exploiting the sparseness of its parity check matrix.

Original languageEnglish (US)
Pages25-36
Number of pages12
StatePublished - Jan 1 2001
EventIEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001 - Antwerp, Belgium
Duration: Oct 26 2001Oct 28 2001

Other

OtherIEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001
CountryBelgium
CityAntwerp
Period10/26/0110/28/01

Fingerprint

Parallel architectures

Cite this

Zhang, T., & Parhi, K. K. (2001). VLSI implementation-oriented (3,k)-regular low-density parity-check codes. 25-36. Paper presented at IEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001, Antwerp, Belgium.

VLSI implementation-oriented (3,k)-regular low-density parity-check codes. / Zhang, T.; Parhi, Keshab K.

2001. 25-36 Paper presented at IEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001, Antwerp, Belgium.

Research output: Contribution to conferencePaper

Zhang, T & Parhi, KK 2001, 'VLSI implementation-oriented (3,k)-regular low-density parity-check codes' Paper presented at IEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001, Antwerp, Belgium, 10/26/01 - 10/28/01, pp. 25-36.
Zhang T, Parhi KK. VLSI implementation-oriented (3,k)-regular low-density parity-check codes. 2001. Paper presented at IEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001, Antwerp, Belgium.
Zhang, T. ; Parhi, Keshab K. / VLSI implementation-oriented (3,k)-regular low-density parity-check codes. Paper presented at IEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001, Antwerp, Belgium.12 p.
@conference{f0a851b57d1e452196d6834f2133acf9,
title = "VLSI implementation-oriented (3,k)-regular low-density parity-check codes",
abstract = "In the past few years, Gallager's Low-Density Parity-Check (LDPC) codes received a lot of attention and many efforts have been devoted to analyze and improve their error-correcting performance. However, little consideration has been given to the LDPC decoder VLSI implementation. The straightforward fully parallel decoder architecture usually incurs too high complexity for many practical purposes and should be transformed to a partly parallel realization. Unfortunately, due to the randomness of LDPC codes, it's nearly impossible to develop an effective transformation for an arbitrary given LDPC code. In this paper, we propose a joint code and decoder design approach to construct a class of (3,k)-regular LDPC codes which exactly fit to a partly parallel decoder implementation and have a very good performance. Moreover, for such LDPC codes, we propose a systematic efficient encoding scheme by effectively exploiting the sparseness of its parity check matrix.",
author = "T. Zhang and Parhi, {Keshab K}",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
pages = "25--36",
note = "IEEE Workshop on Signal Processing Systems- Design and Implementation-(SIPS) 2001 ; Conference date: 26-10-2001 Through 28-10-2001",

}

TY - CONF

T1 - VLSI implementation-oriented (3,k)-regular low-density parity-check codes

AU - Zhang, T.

AU - Parhi, Keshab K

PY - 2001/1/1

Y1 - 2001/1/1

N2 - In the past few years, Gallager's Low-Density Parity-Check (LDPC) codes received a lot of attention and many efforts have been devoted to analyze and improve their error-correcting performance. However, little consideration has been given to the LDPC decoder VLSI implementation. The straightforward fully parallel decoder architecture usually incurs too high complexity for many practical purposes and should be transformed to a partly parallel realization. Unfortunately, due to the randomness of LDPC codes, it's nearly impossible to develop an effective transformation for an arbitrary given LDPC code. In this paper, we propose a joint code and decoder design approach to construct a class of (3,k)-regular LDPC codes which exactly fit to a partly parallel decoder implementation and have a very good performance. Moreover, for such LDPC codes, we propose a systematic efficient encoding scheme by effectively exploiting the sparseness of its parity check matrix.

AB - In the past few years, Gallager's Low-Density Parity-Check (LDPC) codes received a lot of attention and many efforts have been devoted to analyze and improve their error-correcting performance. However, little consideration has been given to the LDPC decoder VLSI implementation. The straightforward fully parallel decoder architecture usually incurs too high complexity for many practical purposes and should be transformed to a partly parallel realization. Unfortunately, due to the randomness of LDPC codes, it's nearly impossible to develop an effective transformation for an arbitrary given LDPC code. In this paper, we propose a joint code and decoder design approach to construct a class of (3,k)-regular LDPC codes which exactly fit to a partly parallel decoder implementation and have a very good performance. Moreover, for such LDPC codes, we propose a systematic efficient encoding scheme by effectively exploiting the sparseness of its parity check matrix.

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

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

M3 - Paper

SP - 25

EP - 36

ER -