Failures and Error Floors of Iterative Decoders

Bane V Vasic, Shashi Kiran Chilappagari, Dung Viet Nguyen

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

This chapter presents a study of graph substructures and corresponding error patterns involved in decoding failures on various channels under different iterative message passing and linear programming decoding algorithms. The intriguing structural dependence among these subgraphs, called trapping sets, suggests a comprehensive framework for studying the error floor performance of LDPC codes, as well as for designing codes with guaranteed error floor performance on the binary symmetric channel, additive white Gaussian noise channel and other channels. The problem treated in this chapter is one of the major challenges in modern coding theory. The topological relationship among trapping sets advances our fundamental understanding of the relationship between graphical code representations and the performance of iterative decoding algorithms on several core channel models. In particular, it serves as a foundation for elucidating the relationship between various decoding algorithms and lead to the design of LDPC codes with a superior performance in the error floor region.

Original languageEnglish (US)
Title of host publicationChannel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications
PublisherElsevier Inc.
Pages299-341
Number of pages43
ISBN (Print)9780123972231, 9780123964991
DOIs
StatePublished - Jun 26 2014

Fingerprint

Decoding
Iterative decoding
Message passing
Linear programming

Keywords

  • Belief propagation
  • Bit flipping
  • Error correction codes
  • Error floor
  • Iterative decoding
  • LDPC codes
  • Linear programming decoding
  • Low-density parity check codes
  • Message passing
  • Trapping sets

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Vasic, B. V., Chilappagari, S. K., & Nguyen, D. V. (2014). Failures and Error Floors of Iterative Decoders. In Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications (pp. 299-341). Elsevier Inc.. https://doi.org/10.1016/B978-0-12-396499-1.00006-6

Failures and Error Floors of Iterative Decoders. / Vasic, Bane V; Chilappagari, Shashi Kiran; Nguyen, Dung Viet.

Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications. Elsevier Inc., 2014. p. 299-341.

Research output: Chapter in Book/Report/Conference proceedingChapter

Vasic, BV, Chilappagari, SK & Nguyen, DV 2014, Failures and Error Floors of Iterative Decoders. in Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications. Elsevier Inc., pp. 299-341. https://doi.org/10.1016/B978-0-12-396499-1.00006-6
Vasic BV, Chilappagari SK, Nguyen DV. Failures and Error Floors of Iterative Decoders. In Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications. Elsevier Inc. 2014. p. 299-341 https://doi.org/10.1016/B978-0-12-396499-1.00006-6
Vasic, Bane V ; Chilappagari, Shashi Kiran ; Nguyen, Dung Viet. / Failures and Error Floors of Iterative Decoders. Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications. Elsevier Inc., 2014. pp. 299-341
@inbook{db7e4f2f3a774224a1ed98d46f83bb57,
title = "Failures and Error Floors of Iterative Decoders",
abstract = "This chapter presents a study of graph substructures and corresponding error patterns involved in decoding failures on various channels under different iterative message passing and linear programming decoding algorithms. The intriguing structural dependence among these subgraphs, called trapping sets, suggests a comprehensive framework for studying the error floor performance of LDPC codes, as well as for designing codes with guaranteed error floor performance on the binary symmetric channel, additive white Gaussian noise channel and other channels. The problem treated in this chapter is one of the major challenges in modern coding theory. The topological relationship among trapping sets advances our fundamental understanding of the relationship between graphical code representations and the performance of iterative decoding algorithms on several core channel models. In particular, it serves as a foundation for elucidating the relationship between various decoding algorithms and lead to the design of LDPC codes with a superior performance in the error floor region.",
keywords = "Belief propagation, Bit flipping, Error correction codes, Error floor, Iterative decoding, LDPC codes, Linear programming decoding, Low-density parity check codes, Message passing, Trapping sets",
author = "Vasic, {Bane V} and Chilappagari, {Shashi Kiran} and Nguyen, {Dung Viet}",
year = "2014",
month = "6",
day = "26",
doi = "10.1016/B978-0-12-396499-1.00006-6",
language = "English (US)",
isbn = "9780123972231",
pages = "299--341",
booktitle = "Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications",
publisher = "Elsevier Inc.",

}

TY - CHAP

T1 - Failures and Error Floors of Iterative Decoders

AU - Vasic, Bane V

AU - Chilappagari, Shashi Kiran

AU - Nguyen, Dung Viet

PY - 2014/6/26

Y1 - 2014/6/26

N2 - This chapter presents a study of graph substructures and corresponding error patterns involved in decoding failures on various channels under different iterative message passing and linear programming decoding algorithms. The intriguing structural dependence among these subgraphs, called trapping sets, suggests a comprehensive framework for studying the error floor performance of LDPC codes, as well as for designing codes with guaranteed error floor performance on the binary symmetric channel, additive white Gaussian noise channel and other channels. The problem treated in this chapter is one of the major challenges in modern coding theory. The topological relationship among trapping sets advances our fundamental understanding of the relationship between graphical code representations and the performance of iterative decoding algorithms on several core channel models. In particular, it serves as a foundation for elucidating the relationship between various decoding algorithms and lead to the design of LDPC codes with a superior performance in the error floor region.

AB - This chapter presents a study of graph substructures and corresponding error patterns involved in decoding failures on various channels under different iterative message passing and linear programming decoding algorithms. The intriguing structural dependence among these subgraphs, called trapping sets, suggests a comprehensive framework for studying the error floor performance of LDPC codes, as well as for designing codes with guaranteed error floor performance on the binary symmetric channel, additive white Gaussian noise channel and other channels. The problem treated in this chapter is one of the major challenges in modern coding theory. The topological relationship among trapping sets advances our fundamental understanding of the relationship between graphical code representations and the performance of iterative decoding algorithms on several core channel models. In particular, it serves as a foundation for elucidating the relationship between various decoding algorithms and lead to the design of LDPC codes with a superior performance in the error floor region.

KW - Belief propagation

KW - Bit flipping

KW - Error correction codes

KW - Error floor

KW - Iterative decoding

KW - LDPC codes

KW - Linear programming decoding

KW - Low-density parity check codes

KW - Message passing

KW - Trapping sets

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

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

U2 - 10.1016/B978-0-12-396499-1.00006-6

DO - 10.1016/B978-0-12-396499-1.00006-6

M3 - Chapter

AN - SCOPUS:84942010937

SN - 9780123972231

SN - 9780123964991

SP - 299

EP - 341

BT - Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Communications

PB - Elsevier Inc.

ER -