Efficient Hardware Implementation of Probabilistic Gradient Descent Bit-Flipping

Khoa Le, Fakhreddine Ghaffari, David Declercq, Bane Vasic

Research output: Research - peer-reviewArticle

  • 1 Citations

Abstract

This paper deals with the hardware implementation of the recently introduced Probabilistic Gradient-Descent Bit-Flipping (PGDBF) decoder. The PGDBF is a new type of hard-decision decoder for Low-Density Parity-Check (LDPC) code, with improved error correction performance thanks to the introduction of deliberate random perturbation in the computing units. In the PGDBF, the random perturbation operates during the bit-flipping step, with the objective to avoid the attraction of so-called trapping-sets of the LDPC code. In this paper, we propose an efficient hardware architecture which minimizes the resource overhead needed to implement the random perturbations of the PGDBF. Our architecture is based on the use of a Short Random Sequence (SRS) that is duplicated to fully apply the PGDBF decoding rules, and on an optimization of the maximum finder unit. The generation of good SRS is crucial to maintain the outstanding decoding performance of PGDBF, and we propose two different methods with equivalent hardware overheads, but with different behaviors on different LDPC codes. Our designs show that the improved PGDBF performance gains can be obtained with a very small additional complexity, therefore providing a competitive hard-decision LDPC decoding solution for current standards.

LanguageEnglish (US)
Article number7786873
Pages906-917
Number of pages12
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume64
Issue number4
DOIs
StatePublished - Apr 1 2017

Fingerprint

Hardware
Decoding
Error correction

Keywords

  • Gradient descent bit-flipping
  • high throughput decoder
  • low complexity implementation
  • low-density parity-check codes
  • random generation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Efficient Hardware Implementation of Probabilistic Gradient Descent Bit-Flipping. / Le, Khoa; Ghaffari, Fakhreddine; Declercq, David; Vasic, Bane.

In: IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 64, No. 4, 7786873, 01.04.2017, p. 906-917.

Research output: Research - peer-reviewArticle

@article{f2379f46316b4aab8a13617976aee9c0,
title = "Efficient Hardware Implementation of Probabilistic Gradient Descent Bit-Flipping",
abstract = "This paper deals with the hardware implementation of the recently introduced Probabilistic Gradient-Descent Bit-Flipping (PGDBF) decoder. The PGDBF is a new type of hard-decision decoder for Low-Density Parity-Check (LDPC) code, with improved error correction performance thanks to the introduction of deliberate random perturbation in the computing units. In the PGDBF, the random perturbation operates during the bit-flipping step, with the objective to avoid the attraction of so-called trapping-sets of the LDPC code. In this paper, we propose an efficient hardware architecture which minimizes the resource overhead needed to implement the random perturbations of the PGDBF. Our architecture is based on the use of a Short Random Sequence (SRS) that is duplicated to fully apply the PGDBF decoding rules, and on an optimization of the maximum finder unit. The generation of good SRS is crucial to maintain the outstanding decoding performance of PGDBF, and we propose two different methods with equivalent hardware overheads, but with different behaviors on different LDPC codes. Our designs show that the improved PGDBF performance gains can be obtained with a very small additional complexity, therefore providing a competitive hard-decision LDPC decoding solution for current standards.",
keywords = "Gradient descent bit-flipping, high throughput decoder, low complexity implementation, low-density parity-check codes, random generation",
author = "Khoa Le and Fakhreddine Ghaffari and David Declercq and Bane Vasic",
year = "2017",
month = "4",
doi = "10.1109/TCSI.2016.2633581",
volume = "64",
pages = "906--917",
journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",
issn = "1549-8328",
number = "4",

}

TY - JOUR

T1 - Efficient Hardware Implementation of Probabilistic Gradient Descent Bit-Flipping

AU - Le,Khoa

AU - Ghaffari,Fakhreddine

AU - Declercq,David

AU - Vasic,Bane

PY - 2017/4/1

Y1 - 2017/4/1

N2 - This paper deals with the hardware implementation of the recently introduced Probabilistic Gradient-Descent Bit-Flipping (PGDBF) decoder. The PGDBF is a new type of hard-decision decoder for Low-Density Parity-Check (LDPC) code, with improved error correction performance thanks to the introduction of deliberate random perturbation in the computing units. In the PGDBF, the random perturbation operates during the bit-flipping step, with the objective to avoid the attraction of so-called trapping-sets of the LDPC code. In this paper, we propose an efficient hardware architecture which minimizes the resource overhead needed to implement the random perturbations of the PGDBF. Our architecture is based on the use of a Short Random Sequence (SRS) that is duplicated to fully apply the PGDBF decoding rules, and on an optimization of the maximum finder unit. The generation of good SRS is crucial to maintain the outstanding decoding performance of PGDBF, and we propose two different methods with equivalent hardware overheads, but with different behaviors on different LDPC codes. Our designs show that the improved PGDBF performance gains can be obtained with a very small additional complexity, therefore providing a competitive hard-decision LDPC decoding solution for current standards.

AB - This paper deals with the hardware implementation of the recently introduced Probabilistic Gradient-Descent Bit-Flipping (PGDBF) decoder. The PGDBF is a new type of hard-decision decoder for Low-Density Parity-Check (LDPC) code, with improved error correction performance thanks to the introduction of deliberate random perturbation in the computing units. In the PGDBF, the random perturbation operates during the bit-flipping step, with the objective to avoid the attraction of so-called trapping-sets of the LDPC code. In this paper, we propose an efficient hardware architecture which minimizes the resource overhead needed to implement the random perturbations of the PGDBF. Our architecture is based on the use of a Short Random Sequence (SRS) that is duplicated to fully apply the PGDBF decoding rules, and on an optimization of the maximum finder unit. The generation of good SRS is crucial to maintain the outstanding decoding performance of PGDBF, and we propose two different methods with equivalent hardware overheads, but with different behaviors on different LDPC codes. Our designs show that the improved PGDBF performance gains can be obtained with a very small additional complexity, therefore providing a competitive hard-decision LDPC decoding solution for current standards.

KW - Gradient descent bit-flipping

KW - high throughput decoder

KW - low complexity implementation

KW - low-density parity-check codes

KW - random generation

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

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

U2 - 10.1109/TCSI.2016.2633581

DO - 10.1109/TCSI.2016.2633581

M3 - Article

VL - 64

SP - 906

EP - 917

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

T2 - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1549-8328

IS - 4

M1 - 7786873

ER -