Decoder diversity architectures for finite alphabet iterative decoders

Bane V Vasic, David Declercq, Shiva Kumar Planjery

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages131-135
Number of pages5
Volume2015-April
ISBN (Print)9781479982974
DOIs
Publication statusPublished - Apr 24 2015
Event48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: Nov 2 2014Nov 5 2014

Other

Other48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
CountryUnited States
CityPacific Grove
Period11/2/1411/5/14

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

Vasic, B. V., Declercq, D., & Planjery, S. K. (2015). Decoder diversity architectures for finite alphabet iterative decoders. In Conference Record - Asilomar Conference on Signals, Systems and Computers (Vol. 2015-April, pp. 131-135). [7094412] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2014.7094412