On the selection of finite alphabet iterative decoders for LDPC codes on the BSC

Ludovic Danjean, David Declercq, Shiva K. Planjery, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

Recently new message passing decoders for LDPC codes, called finite alphabet iterative decoders (FAIDs) were proposed. The messages belong to a finite alphabet and the update functions are simple boolean maps different from the functions used for the belied propagation (BP) decoder. The maps can be chosen using the knowledge of potential trapping sets such that the decoders surpass the BP decoder in the error floor. In this paper, we address the issue of selecting good FAIDs which perform well in the error floor for column weight three codes. We introduce the notion of noisy trapping set which is a generalization based on analyzing the local dynamic behaviour of a given FAID on a trapping set. Using this notion as the core, we provide an iterative greedy algorithm that outputs a set of candidate FAIDs containing potentially good decoders for any given code. To illustrate the appliance of the methodology on several codes, we show that the set of candidate FAIDs contains particularly good FAIDs for different codes with different rates and lengths.

Original languageEnglish (US)
Title of host publication2011 IEEE Information Theory Workshop, ITW 2011
Pages345-349
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE Information Theory Workshop, ITW 2011 - Paraty, Brazil
Duration: Oct 16 2011Oct 20 2011

Other

Other2011 IEEE Information Theory Workshop, ITW 2011
CountryBrazil
CityParaty
Period10/16/1110/20/11

Fingerprint

Message passing

ASJC Scopus subject areas

  • Information Systems

Cite this

Danjean, L., Declercq, D., Planjery, S. K., & Vasic, B. V. (2011). On the selection of finite alphabet iterative decoders for LDPC codes on the BSC. In 2011 IEEE Information Theory Workshop, ITW 2011 (pp. 345-349). [6089476] https://doi.org/10.1109/ITW.2011.6089476

On the selection of finite alphabet iterative decoders for LDPC codes on the BSC. / Danjean, Ludovic; Declercq, David; Planjery, Shiva K.; Vasic, Bane V.

2011 IEEE Information Theory Workshop, ITW 2011. 2011. p. 345-349 6089476.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Danjean, L, Declercq, D, Planjery, SK & Vasic, BV 2011, On the selection of finite alphabet iterative decoders for LDPC codes on the BSC. in 2011 IEEE Information Theory Workshop, ITW 2011., 6089476, pp. 345-349, 2011 IEEE Information Theory Workshop, ITW 2011, Paraty, Brazil, 10/16/11. https://doi.org/10.1109/ITW.2011.6089476
Danjean L, Declercq D, Planjery SK, Vasic BV. On the selection of finite alphabet iterative decoders for LDPC codes on the BSC. In 2011 IEEE Information Theory Workshop, ITW 2011. 2011. p. 345-349. 6089476 https://doi.org/10.1109/ITW.2011.6089476
Danjean, Ludovic ; Declercq, David ; Planjery, Shiva K. ; Vasic, Bane V. / On the selection of finite alphabet iterative decoders for LDPC codes on the BSC. 2011 IEEE Information Theory Workshop, ITW 2011. 2011. pp. 345-349
@inproceedings{e17857bc464244cca38944970bc5d7dc,
title = "On the selection of finite alphabet iterative decoders for LDPC codes on the BSC",
abstract = "Recently new message passing decoders for LDPC codes, called finite alphabet iterative decoders (FAIDs) were proposed. The messages belong to a finite alphabet and the update functions are simple boolean maps different from the functions used for the belied propagation (BP) decoder. The maps can be chosen using the knowledge of potential trapping sets such that the decoders surpass the BP decoder in the error floor. In this paper, we address the issue of selecting good FAIDs which perform well in the error floor for column weight three codes. We introduce the notion of noisy trapping set which is a generalization based on analyzing the local dynamic behaviour of a given FAID on a trapping set. Using this notion as the core, we provide an iterative greedy algorithm that outputs a set of candidate FAIDs containing potentially good decoders for any given code. To illustrate the appliance of the methodology on several codes, we show that the set of candidate FAIDs contains particularly good FAIDs for different codes with different rates and lengths.",
author = "Ludovic Danjean and David Declercq and Planjery, {Shiva K.} and Vasic, {Bane V}",
year = "2011",
doi = "10.1109/ITW.2011.6089476",
language = "English (US)",
isbn = "9781457704376",
pages = "345--349",
booktitle = "2011 IEEE Information Theory Workshop, ITW 2011",

}

TY - GEN

T1 - On the selection of finite alphabet iterative decoders for LDPC codes on the BSC

AU - Danjean, Ludovic

AU - Declercq, David

AU - Planjery, Shiva K.

AU - Vasic, Bane V

PY - 2011

Y1 - 2011

N2 - Recently new message passing decoders for LDPC codes, called finite alphabet iterative decoders (FAIDs) were proposed. The messages belong to a finite alphabet and the update functions are simple boolean maps different from the functions used for the belied propagation (BP) decoder. The maps can be chosen using the knowledge of potential trapping sets such that the decoders surpass the BP decoder in the error floor. In this paper, we address the issue of selecting good FAIDs which perform well in the error floor for column weight three codes. We introduce the notion of noisy trapping set which is a generalization based on analyzing the local dynamic behaviour of a given FAID on a trapping set. Using this notion as the core, we provide an iterative greedy algorithm that outputs a set of candidate FAIDs containing potentially good decoders for any given code. To illustrate the appliance of the methodology on several codes, we show that the set of candidate FAIDs contains particularly good FAIDs for different codes with different rates and lengths.

AB - Recently new message passing decoders for LDPC codes, called finite alphabet iterative decoders (FAIDs) were proposed. The messages belong to a finite alphabet and the update functions are simple boolean maps different from the functions used for the belied propagation (BP) decoder. The maps can be chosen using the knowledge of potential trapping sets such that the decoders surpass the BP decoder in the error floor. In this paper, we address the issue of selecting good FAIDs which perform well in the error floor for column weight three codes. We introduce the notion of noisy trapping set which is a generalization based on analyzing the local dynamic behaviour of a given FAID on a trapping set. Using this notion as the core, we provide an iterative greedy algorithm that outputs a set of candidate FAIDs containing potentially good decoders for any given code. To illustrate the appliance of the methodology on several codes, we show that the set of candidate FAIDs contains particularly good FAIDs for different codes with different rates and lengths.

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

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

U2 - 10.1109/ITW.2011.6089476

DO - 10.1109/ITW.2011.6089476

M3 - Conference contribution

AN - SCOPUS:83655202681

SN - 9781457704376

SP - 345

EP - 349

BT - 2011 IEEE Information Theory Workshop, ITW 2011

ER -