Finite alphabet iterative decoders-Part I

Decoding beyond belief propagation on the binary symmetric channel

Shiva Kumar Planjery, David Declercq, Ludovic Danjean, Bane V Vasic

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the binary symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or log-likelihoods and the variable node update functions do not mimic the BP decoder. Rather, the update functions are maps designed using the knowledge of potentially harmful subgraphs that could be present in a given code, thereby rendering these decoders capable of outperforming the BP in the error floor region. On certain column-weight-three codes of practical interest, we show that there exist {FAIDs that surpass the floating-point BP decoder in the error floor region while requiring only three bits of precision for the representation of the messages}. Hence, FAIDs are able to achieve a superior performance at much lower complexity. We also provide a methodology for the selection of FAIDs that is not code-specific, but gives a set of candidate FAIDs containing potentially good decoders in the error floor region for any column-weight-three code. We validate the code generality of our methodology by providing particularly good three-bit precision FAIDs for a variety of codes with different rates and lengths.

Original languageEnglish (US)
Article number6600695
Pages (from-to)4033-4045
Number of pages13
JournalIEEE Transactions on Communications
Volume61
Issue number10
DOIs
StatePublished - Oct 2013

Fingerprint

Decoding
Iterative decoding

Keywords

  • belief propagation
  • binary symmetric channel
  • error floor
  • finite precision iterative decoding
  • Low-density parity-check codes
  • trapping sets

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Finite alphabet iterative decoders-Part I : Decoding beyond belief propagation on the binary symmetric channel. / Planjery, Shiva Kumar; Declercq, David; Danjean, Ludovic; Vasic, Bane V.

In: IEEE Transactions on Communications, Vol. 61, No. 10, 6600695, 10.2013, p. 4033-4045.

Research output: Contribution to journalArticle

Planjery, Shiva Kumar ; Declercq, David ; Danjean, Ludovic ; Vasic, Bane V. / Finite alphabet iterative decoders-Part I : Decoding beyond belief propagation on the binary symmetric channel. In: IEEE Transactions on Communications. 2013 ; Vol. 61, No. 10. pp. 4033-4045.
@article{b018dd572caf48cfa6d30776b0b21ec1,
title = "Finite alphabet iterative decoders-Part I: Decoding beyond belief propagation on the binary symmetric channel",
abstract = "We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the binary symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or log-likelihoods and the variable node update functions do not mimic the BP decoder. Rather, the update functions are maps designed using the knowledge of potentially harmful subgraphs that could be present in a given code, thereby rendering these decoders capable of outperforming the BP in the error floor region. On certain column-weight-three codes of practical interest, we show that there exist {FAIDs that surpass the floating-point BP decoder in the error floor region while requiring only three bits of precision for the representation of the messages}. Hence, FAIDs are able to achieve a superior performance at much lower complexity. We also provide a methodology for the selection of FAIDs that is not code-specific, but gives a set of candidate FAIDs containing potentially good decoders in the error floor region for any column-weight-three code. We validate the code generality of our methodology by providing particularly good three-bit precision FAIDs for a variety of codes with different rates and lengths.",
keywords = "belief propagation, binary symmetric channel, error floor, finite precision iterative decoding, Low-density parity-check codes, trapping sets",
author = "Planjery, {Shiva Kumar} and David Declercq and Ludovic Danjean and Vasic, {Bane V}",
year = "2013",
month = "10",
doi = "10.1109/TCOMM.2013.090513.120443",
language = "English (US)",
volume = "61",
pages = "4033--4045",
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 I

T2 - Decoding beyond belief propagation on the binary symmetric channel

AU - Planjery, Shiva Kumar

AU - Declercq, David

AU - Danjean, Ludovic

AU - Vasic, Bane V

PY - 2013/10

Y1 - 2013/10

N2 - We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the binary symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or log-likelihoods and the variable node update functions do not mimic the BP decoder. Rather, the update functions are maps designed using the knowledge of potentially harmful subgraphs that could be present in a given code, thereby rendering these decoders capable of outperforming the BP in the error floor region. On certain column-weight-three codes of practical interest, we show that there exist {FAIDs that surpass the floating-point BP decoder in the error floor region while requiring only three bits of precision for the representation of the messages}. Hence, FAIDs are able to achieve a superior performance at much lower complexity. We also provide a methodology for the selection of FAIDs that is not code-specific, but gives a set of candidate FAIDs containing potentially good decoders in the error floor region for any column-weight-three code. We validate the code generality of our methodology by providing particularly good three-bit precision FAIDs for a variety of codes with different rates and lengths.

AB - We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the binary symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or log-likelihoods and the variable node update functions do not mimic the BP decoder. Rather, the update functions are maps designed using the knowledge of potentially harmful subgraphs that could be present in a given code, thereby rendering these decoders capable of outperforming the BP in the error floor region. On certain column-weight-three codes of practical interest, we show that there exist {FAIDs that surpass the floating-point BP decoder in the error floor region while requiring only three bits of precision for the representation of the messages}. Hence, FAIDs are able to achieve a superior performance at much lower complexity. We also provide a methodology for the selection of FAIDs that is not code-specific, but gives a set of candidate FAIDs containing potentially good decoders in the error floor region for any column-weight-three code. We validate the code generality of our methodology by providing particularly good three-bit precision FAIDs for a variety of codes with different rates and lengths.

KW - belief propagation

KW - binary symmetric channel

KW - error floor

KW - finite precision iterative decoding

KW - Low-density parity-check codes

KW - trapping sets

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

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

U2 - 10.1109/TCOMM.2013.090513.120443

DO - 10.1109/TCOMM.2013.090513.120443

M3 - Article

VL - 61

SP - 4033

EP - 4045

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 10

M1 - 6600695

ER -