A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes

Khoa Le, Fakhreddine Ghaffari, David Declercq, Bane V Vasic, Chris Winstead

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

7 Citations (Scopus)

Abstract

This paper presents a new high-throughput, low-complexity Bit Flipping (BF) decoder for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel (BSC), called Probabilistic Parallel Bit Flipping (PPBF). The advantage of PPBF comes from the fact that, no global operation is required during the decoding process and from that, all of the computations could be parallelized and localized at the computing units. Also in PPBF, the probabilistic feature in flipping the Variable Node (VN) is incorporated for all satisfaction level of its CN neighbors. This type of probabilistic incorporation makes PPBF more dynamic to correct some error patterns which are unsolvable by other BF decoders. PPBF offers a faster decoding process with an equivalent error correction performance to the Probabilistic Gradient Descent Bit Flipping (PGDBF) decoder, which is better than all so-far introduced BF decoders in BSC channel. A hardware implementation architecture of PPBF is also presented in this paper with detailed circuits for the probabilistic signal generator and processing units. The implementation of PPBF on FPGA confirms that, the PPBF complexity is much lower than that of the PGDBF and even lower than the one of the deterministic Gradient Descent Bit Flipping (GDBF) decoder. The good decoding performance along with the high throughput and low complexity lead PPBF decoder to become a brilliant candidate for the next generation of communication and storage standards.

Original languageEnglish (US)
Title of host publicationProceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017
PublisherIEEE Computer Society
Pages126-131
Number of pages6
Volume2017-October
ISBN (Electronic)9781538628966
DOIs
StatePublished - Dec 5 2017
Event10th International Conference on Advanced Technologies for Communications, ATC 2017 - Quynhon City, Viet Nam
Duration: Oct 18 2017Oct 20 2017

Other

Other10th International Conference on Advanced Technologies for Communications, ATC 2017
CountryViet Nam
CityQuynhon City
Period10/18/1710/20/17

Fingerprint

Throughput
Decoding
Signal generators
Error correction
Field programmable gate arrays (FPGA)
Signal processing
Lead
Hardware
Networks (circuits)
Communication

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Le, K., Ghaffari, F., Declercq, D., Vasic, B. V., & Winstead, C. (2017). A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes. In Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017 (Vol. 2017-October, pp. 126-131). [8167601] IEEE Computer Society. https://doi.org/10.1109/ATC.2017.8167601

A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes. / Le, Khoa; Ghaffari, Fakhreddine; Declercq, David; Vasic, Bane V; Winstead, Chris.

Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017. Vol. 2017-October IEEE Computer Society, 2017. p. 126-131 8167601.

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

Le, K, Ghaffari, F, Declercq, D, Vasic, BV & Winstead, C 2017, A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes. in Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017. vol. 2017-October, 8167601, IEEE Computer Society, pp. 126-131, 10th International Conference on Advanced Technologies for Communications, ATC 2017, Quynhon City, Viet Nam, 10/18/17. https://doi.org/10.1109/ATC.2017.8167601
Le K, Ghaffari F, Declercq D, Vasic BV, Winstead C. A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes. In Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017. Vol. 2017-October. IEEE Computer Society. 2017. p. 126-131. 8167601 https://doi.org/10.1109/ATC.2017.8167601
Le, Khoa ; Ghaffari, Fakhreddine ; Declercq, David ; Vasic, Bane V ; Winstead, Chris. / A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes. Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017. Vol. 2017-October IEEE Computer Society, 2017. pp. 126-131
@inproceedings{e4a2176995334f18b19ad3aae91ffe28,
title = "A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes",
abstract = "This paper presents a new high-throughput, low-complexity Bit Flipping (BF) decoder for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel (BSC), called Probabilistic Parallel Bit Flipping (PPBF). The advantage of PPBF comes from the fact that, no global operation is required during the decoding process and from that, all of the computations could be parallelized and localized at the computing units. Also in PPBF, the probabilistic feature in flipping the Variable Node (VN) is incorporated for all satisfaction level of its CN neighbors. This type of probabilistic incorporation makes PPBF more dynamic to correct some error patterns which are unsolvable by other BF decoders. PPBF offers a faster decoding process with an equivalent error correction performance to the Probabilistic Gradient Descent Bit Flipping (PGDBF) decoder, which is better than all so-far introduced BF decoders in BSC channel. A hardware implementation architecture of PPBF is also presented in this paper with detailed circuits for the probabilistic signal generator and processing units. The implementation of PPBF on FPGA confirms that, the PPBF complexity is much lower than that of the PGDBF and even lower than the one of the deterministic Gradient Descent Bit Flipping (GDBF) decoder. The good decoding performance along with the high throughput and low complexity lead PPBF decoder to become a brilliant candidate for the next generation of communication and storage standards.",
author = "Khoa Le and Fakhreddine Ghaffari and David Declercq and Vasic, {Bane V} and Chris Winstead",
year = "2017",
month = "12",
day = "5",
doi = "10.1109/ATC.2017.8167601",
language = "English (US)",
volume = "2017-October",
pages = "126--131",
booktitle = "Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - A novel high-throughput, low-complexity bit-flipping decoder for LDPC codes

AU - Le, Khoa

AU - Ghaffari, Fakhreddine

AU - Declercq, David

AU - Vasic, Bane V

AU - Winstead, Chris

PY - 2017/12/5

Y1 - 2017/12/5

N2 - This paper presents a new high-throughput, low-complexity Bit Flipping (BF) decoder for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel (BSC), called Probabilistic Parallel Bit Flipping (PPBF). The advantage of PPBF comes from the fact that, no global operation is required during the decoding process and from that, all of the computations could be parallelized and localized at the computing units. Also in PPBF, the probabilistic feature in flipping the Variable Node (VN) is incorporated for all satisfaction level of its CN neighbors. This type of probabilistic incorporation makes PPBF more dynamic to correct some error patterns which are unsolvable by other BF decoders. PPBF offers a faster decoding process with an equivalent error correction performance to the Probabilistic Gradient Descent Bit Flipping (PGDBF) decoder, which is better than all so-far introduced BF decoders in BSC channel. A hardware implementation architecture of PPBF is also presented in this paper with detailed circuits for the probabilistic signal generator and processing units. The implementation of PPBF on FPGA confirms that, the PPBF complexity is much lower than that of the PGDBF and even lower than the one of the deterministic Gradient Descent Bit Flipping (GDBF) decoder. The good decoding performance along with the high throughput and low complexity lead PPBF decoder to become a brilliant candidate for the next generation of communication and storage standards.

AB - This paper presents a new high-throughput, low-complexity Bit Flipping (BF) decoder for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel (BSC), called Probabilistic Parallel Bit Flipping (PPBF). The advantage of PPBF comes from the fact that, no global operation is required during the decoding process and from that, all of the computations could be parallelized and localized at the computing units. Also in PPBF, the probabilistic feature in flipping the Variable Node (VN) is incorporated for all satisfaction level of its CN neighbors. This type of probabilistic incorporation makes PPBF more dynamic to correct some error patterns which are unsolvable by other BF decoders. PPBF offers a faster decoding process with an equivalent error correction performance to the Probabilistic Gradient Descent Bit Flipping (PGDBF) decoder, which is better than all so-far introduced BF decoders in BSC channel. A hardware implementation architecture of PPBF is also presented in this paper with detailed circuits for the probabilistic signal generator and processing units. The implementation of PPBF on FPGA confirms that, the PPBF complexity is much lower than that of the PGDBF and even lower than the one of the deterministic Gradient Descent Bit Flipping (GDBF) decoder. The good decoding performance along with the high throughput and low complexity lead PPBF decoder to become a brilliant candidate for the next generation of communication and storage standards.

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

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

U2 - 10.1109/ATC.2017.8167601

DO - 10.1109/ATC.2017.8167601

M3 - Conference contribution

VL - 2017-October

SP - 126

EP - 131

BT - Proceedings of the 2017 International Conference on Advanced Technologies for Communications, ATC 2017

PB - IEEE Computer Society

ER -