High-performance, low-complexity decoding of generalized low-density parity-check codes

Tong Zhang, Keshab K Parhi

Research output: Contribution to conferencePaper

9 Citations (Scopus)

Abstract

A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager's Low-Density Parity-Check (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD code are heavily dependent on the employed SISO decoding algorithm. In this paper, we show that Max-Log-MAP is an attractive SISO decoding algorithm for GLD coding scheme, considering the trade-off between performance and complexity in the practical implementations. A normalized Max-Log-MAP is presented to improve the GLD code performance significantly compared with using conventional Max-Log-MAP. Moreover, we propose two techniques, decoding task scheduling and reduced search Max-Log-MAP, to effectively reduce the decoding complexity without any performance degradation.

Original languageEnglish (US)
Pages181-185
Number of pages5
StatePublished - Dec 1 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

Fingerprint

Decoding
code
Scheduling
trade-off
Degradation

Cite this

Zhang, T., & Parhi, K. K. (2001). High-performance, low-complexity decoding of generalized low-density parity-check codes. 181-185. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.

High-performance, low-complexity decoding of generalized low-density parity-check codes. / Zhang, Tong; Parhi, Keshab K.

2001. 181-185 Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.

Research output: Contribution to conferencePaper

Zhang, T & Parhi, KK 2001, 'High-performance, low-complexity decoding of generalized low-density parity-check codes' Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States, 11/25/01 - 11/29/01, pp. 181-185.
Zhang T, Parhi KK. High-performance, low-complexity decoding of generalized low-density parity-check codes. 2001. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.
Zhang, Tong ; Parhi, Keshab K. / High-performance, low-complexity decoding of generalized low-density parity-check codes. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.5 p.
@conference{6d84291cf1e64e829a9d5f70c48b17e4,
title = "High-performance, low-complexity decoding of generalized low-density parity-check codes",
abstract = "A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager's Low-Density Parity-Check (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD code are heavily dependent on the employed SISO decoding algorithm. In this paper, we show that Max-Log-MAP is an attractive SISO decoding algorithm for GLD coding scheme, considering the trade-off between performance and complexity in the practical implementations. A normalized Max-Log-MAP is presented to improve the GLD code performance significantly compared with using conventional Max-Log-MAP. Moreover, we propose two techniques, decoding task scheduling and reduced search Max-Log-MAP, to effectively reduce the decoding complexity without any performance degradation.",
author = "Tong Zhang and Parhi, {Keshab K}",
year = "2001",
month = "12",
day = "1",
language = "English (US)",
pages = "181--185",
note = "IEEE Global Telecommunicatins Conference GLOBECOM'01 ; Conference date: 25-11-2001 Through 29-11-2001",

}

TY - CONF

T1 - High-performance, low-complexity decoding of generalized low-density parity-check codes

AU - Zhang, Tong

AU - Parhi, Keshab K

PY - 2001/12/1

Y1 - 2001/12/1

N2 - A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager's Low-Density Parity-Check (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD code are heavily dependent on the employed SISO decoding algorithm. In this paper, we show that Max-Log-MAP is an attractive SISO decoding algorithm for GLD coding scheme, considering the trade-off between performance and complexity in the practical implementations. A normalized Max-Log-MAP is presented to improve the GLD code performance significantly compared with using conventional Max-Log-MAP. Moreover, we propose two techniques, decoding task scheduling and reduced search Max-Log-MAP, to effectively reduce the decoding complexity without any performance degradation.

AB - A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager's Low-Density Parity-Check (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD code are heavily dependent on the employed SISO decoding algorithm. In this paper, we show that Max-Log-MAP is an attractive SISO decoding algorithm for GLD coding scheme, considering the trade-off between performance and complexity in the practical implementations. A normalized Max-Log-MAP is presented to improve the GLD code performance significantly compared with using conventional Max-Log-MAP. Moreover, we propose two techniques, decoding task scheduling and reduced search Max-Log-MAP, to effectively reduce the decoding complexity without any performance degradation.

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

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

M3 - Paper

SP - 181

EP - 185

ER -