Finite Alphabet Iterative Decoders - Part II

Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity

David Declercq, Bane V Vasic, Shiva Kumar Planjery, Erbao Li

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation (BP) in the error floor region on the binary symmetric channel (BSC) with much lower complexity. In this paper, we introduce a novel scheme with the objective of guaranteeing the correction of a given and potentially large number of errors on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs utilized by the scheme is judiciously chosen to ensure that individual decoders have different decoding dynamics and correct different error patterns. Consequently, they can collectively correct a diverse set of error patterns, which is referred to as decoder diversity. We provide a systematic method to generate the set of FAIDs for decoder diversity on a given code based on the knowledge of the most harmful trapping sets present in the code. Using the well-known column-weight-three (155,64) Tanner code with d{min} = 20 as an example, we describe the method in detail and show, by means of exhaustive simulation, that the guaranteed error correction capability on short length LDPC codes can be significantly increased with decoder diversity.

Original languageEnglish (US)
Article number6600720
Pages (from-to)4046-4057
Number of pages12
JournalIEEE Transactions on Communications
Volume61
Issue number10
DOIs
StatePublished - Oct 2013

Fingerprint

Error correction
Decoding

Keywords

  • decoder diversity
  • error floor
  • finite alphabet iterative decoder
  • guaranteed error correction
  • Low-density parity-check codes
  • Tanner QC-LDPC code
  • trapping sets

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Finite Alphabet Iterative Decoders - Part II : Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity. / Declercq, David; Vasic, Bane V; Planjery, Shiva Kumar; Li, Erbao.

In: IEEE Transactions on Communications, Vol. 61, No. 10, 6600720, 10.2013, p. 4046-4057.

Research output: Contribution to journalArticle

@article{e84cb0a582c74d3a95d81bda76337226,
title = "Finite Alphabet Iterative Decoders - Part II: Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity",
abstract = "Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation (BP) in the error floor region on the binary symmetric channel (BSC) with much lower complexity. In this paper, we introduce a novel scheme with the objective of guaranteeing the correction of a given and potentially large number of errors on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs utilized by the scheme is judiciously chosen to ensure that individual decoders have different decoding dynamics and correct different error patterns. Consequently, they can collectively correct a diverse set of error patterns, which is referred to as decoder diversity. We provide a systematic method to generate the set of FAIDs for decoder diversity on a given code based on the knowledge of the most harmful trapping sets present in the code. Using the well-known column-weight-three (155,64) Tanner code with d{min} = 20 as an example, we describe the method in detail and show, by means of exhaustive simulation, that the guaranteed error correction capability on short length LDPC codes can be significantly increased with decoder diversity.",
keywords = "decoder diversity, error floor, finite alphabet iterative decoder, guaranteed error correction, Low-density parity-check codes, Tanner QC-LDPC code, trapping sets",
author = "David Declercq and Vasic, {Bane V} and Planjery, {Shiva Kumar} and Erbao Li",
year = "2013",
month = "10",
doi = "10.1109/TCOMM.2013.090513.120444",
language = "English (US)",
volume = "61",
pages = "4046--4057",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Finite Alphabet Iterative Decoders - Part II

T2 - Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity

AU - Declercq, David

AU - Vasic, Bane V

AU - Planjery, Shiva Kumar

AU - Li, Erbao

PY - 2013/10

Y1 - 2013/10

N2 - Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation (BP) in the error floor region on the binary symmetric channel (BSC) with much lower complexity. In this paper, we introduce a novel scheme with the objective of guaranteeing the correction of a given and potentially large number of errors on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs utilized by the scheme is judiciously chosen to ensure that individual decoders have different decoding dynamics and correct different error patterns. Consequently, they can collectively correct a diverse set of error patterns, which is referred to as decoder diversity. We provide a systematic method to generate the set of FAIDs for decoder diversity on a given code based on the knowledge of the most harmful trapping sets present in the code. Using the well-known column-weight-three (155,64) Tanner code with d{min} = 20 as an example, we describe the method in detail and show, by means of exhaustive simulation, that the guaranteed error correction capability on short length LDPC codes can be significantly increased with decoder diversity.

AB - Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation (BP) in the error floor region on the binary symmetric channel (BSC) with much lower complexity. In this paper, we introduce a novel scheme with the objective of guaranteeing the correction of a given and potentially large number of errors on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs utilized by the scheme is judiciously chosen to ensure that individual decoders have different decoding dynamics and correct different error patterns. Consequently, they can collectively correct a diverse set of error patterns, which is referred to as decoder diversity. We provide a systematic method to generate the set of FAIDs for decoder diversity on a given code based on the knowledge of the most harmful trapping sets present in the code. Using the well-known column-weight-three (155,64) Tanner code with d{min} = 20 as an example, we describe the method in detail and show, by means of exhaustive simulation, that the guaranteed error correction capability on short length LDPC codes can be significantly increased with decoder diversity.

KW - decoder diversity

KW - error floor

KW - finite alphabet iterative decoder

KW - guaranteed error correction

KW - Low-density parity-check codes

KW - Tanner QC-LDPC code

KW - trapping sets

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

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

U2 - 10.1109/TCOMM.2013.090513.120444

DO - 10.1109/TCOMM.2013.090513.120444

M3 - Article

VL - 61

SP - 4046

EP - 4057

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 10

M1 - 6600720

ER -