Decoder diversity architectures for finite alphabet iterative decoders

Bane Vasić; David Declercq; Shiva Kumar Planjery

doi:10.1109/ACSSC.2014.7094412

Decoder diversity architectures for finite alphabet iterative decoders

Bane Vasić, David Declercq, Shiva Kumar Planjery

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We present a finite alphabet iterative decoders (FAIDs), a new type of decoders for low-density parity check (LDPC) codes, which outperform much more complex belief-propagation-based counterparts in the error floor region. The FAID variable node update is a simple Boolean map, and we show that by varying this map one can achieve a class of decoders capable of correcting wide range of distinct error patterns uncorrectable by a single FAID. We call this concept decoding diversity, and present a low-complexity architecture and error performance analysis of the FAID diversity decoder for column-weight three LDPC codes on the binary symmetric channel.

Original language	English (US)
Title of host publication	Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	131-135
Number of pages	5
ISBN (Electronic)	9781479982974
DOIs	https://doi.org/10.1109/ACSSC.2014.7094412
State	Published - Apr 24 2015
Event	48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 2 2014 → Nov 5 2014

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2015-April
ISSN (Print)	1058-6393

Other

Other	48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/Territory	United States
City	Pacific Grove
Period	11/2/14 → 11/5/14

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/ACSSC.2014.7094412

Cite this

Vasić, B., Declercq, D., & Planjery, S. K. (2015). Decoder diversity architectures for finite alphabet iterative decoders. In M. B. Matthews (Ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers (pp. 131-135). Article 7094412 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2015-April). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2014.7094412

Decoder diversity architectures for finite alphabet iterative decoders. / Vasić, Bane; Declercq, David; Planjery, Shiva Kumar.
Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. ed. / Michael B. Matthews. IEEE Computer Society, 2015. p. 131-135 7094412 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2015-April).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Vasić, B, Declercq, D & Planjery, SK 2015, Decoder diversity architectures for finite alphabet iterative decoders. in MB Matthews (ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers., 7094412, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2015-April, IEEE Computer Society, pp. 131-135, 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/2/14. https://doi.org/10.1109/ACSSC.2014.7094412

Vasić B, Declercq D, Planjery SK. Decoder diversity architectures for finite alphabet iterative decoders. In Matthews MB, editor, Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society. 2015. p. 131-135. 7094412. (Conference Record - Asilomar Conference on Signals, Systems and Computers). doi: 10.1109/ACSSC.2014.7094412

@inproceedings{fa041496ec1e4bcfaeaac3a5d4dad991,

title = "Decoder diversity architectures for finite alphabet iterative decoders",

abstract = "We present a finite alphabet iterative decoders (FAIDs), a new type of decoders for low-density parity check (LDPC) codes, which outperform much more complex belief-propagation-based counterparts in the error floor region. The FAID variable node update is a simple Boolean map, and we show that by varying this map one can achieve a class of decoders capable of correcting wide range of distinct error patterns uncorrectable by a single FAID. We call this concept decoding diversity, and present a low-complexity architecture and error performance analysis of the FAID diversity decoder for column-weight three LDPC codes on the binary symmetric channel.",

author = "Bane Vasi{\'c} and David Declercq and Planjery, {Shiva Kumar}",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 ; Conference date: 02-11-2014 Through 05-11-2014",

year = "2015",

month = apr,

day = "24",

doi = "10.1109/ACSSC.2014.7094412",

language = "English (US)",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "131--135",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Decoder diversity architectures for finite alphabet iterative decoders

AU - Vasić, Bane

AU - Declercq, David

AU - Planjery, Shiva Kumar

PY - 2015/4/24

Y1 - 2015/4/24

N2 - We present a finite alphabet iterative decoders (FAIDs), a new type of decoders for low-density parity check (LDPC) codes, which outperform much more complex belief-propagation-based counterparts in the error floor region. The FAID variable node update is a simple Boolean map, and we show that by varying this map one can achieve a class of decoders capable of correcting wide range of distinct error patterns uncorrectable by a single FAID. We call this concept decoding diversity, and present a low-complexity architecture and error performance analysis of the FAID diversity decoder for column-weight three LDPC codes on the binary symmetric channel.

AB - We present a finite alphabet iterative decoders (FAIDs), a new type of decoders for low-density parity check (LDPC) codes, which outperform much more complex belief-propagation-based counterparts in the error floor region. The FAID variable node update is a simple Boolean map, and we show that by varying this map one can achieve a class of decoders capable of correcting wide range of distinct error patterns uncorrectable by a single FAID. We call this concept decoding diversity, and present a low-complexity architecture and error performance analysis of the FAID diversity decoder for column-weight three LDPC codes on the binary symmetric channel.

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

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

U2 - 10.1109/ACSSC.2014.7094412

DO - 10.1109/ACSSC.2014.7094412

M3 - Conference contribution

AN - SCOPUS:84940493154

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 131

EP - 135

BT - Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers

A2 - Matthews, Michael B.

PB - IEEE Computer Society

T2 - 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

Y2 - 2 November 2014 through 5 November 2014

ER -

Decoder diversity architectures for finite alphabet iterative decoders

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this