Efficient realization of probabilistic gradient descent bit flipping decoders

Khoa Le; David Declercq; Fakhreddine Ghaffari; Christian Spagnol; Emmanuel Popovici; Predrag Ivanis; Bane V Vasic

doi:10.1109/ISCAS.2015.7168928

Efficient realization of probabilistic gradient descent bit flipping decoders

Khoa Le, David Declercq, Fakhreddine Ghaffari, Christian Spagnol, Emmanuel Popovici, Predrag Ivanis, Bane V Vasic

Electrical and Computer Engineering

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

12 Scopus citations

Abstract

In this paper, several implementations of the recently introduced PGDBF decoder for LDPC codes are proposed. In [2], the authors show that using randomness in bit-flipping decoders can greatly improve the error correction performance. In this paper, two models of random generators are proposed and compared through hardware implementation and performance simulation. A conventional implementation of the random generator through LFSR as a first design, and a new approach using binary sequences that are produced by the LDPC decoder, named IVRG, as second design. We show that both implementation of the PGDBF improve greatly the error correction performance, while maintaining the same large throughtput. However, the performance gain requires a large hardware overhead in the case of LFSR-PGDBF, while the overhead is limited to only 10% in the case of the IVRG-PGDBF.

Original language	English (US)
Title of host publication	Proceedings - IEEE International Symposium on Circuits and Systems
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1494-1497
Number of pages	4
Volume	2015-July
ISBN (Print)	9781479983919
DOIs	https://doi.org/10.1109/ISCAS.2015.7168928
State	Published - Jul 27 2015
Event	IEEE International Symposium on Circuits and Systems, ISCAS 2015 - Lisbon, Portugal Duration: May 24 2015 → May 27 2015

Other

Other	IEEE International Symposium on Circuits and Systems, ISCAS 2015
Country	Portugal
City	Lisbon
Period	5/24/15 → 5/27/15

Fingerprint

Keywords

bit-flipping
LDPC decoders
PGDBF
random generators

ASJC Scopus subject areas

Electrical and Electronic Engineering

Cite this

Le, K., Declercq, D., Ghaffari, F., Spagnol, C., Popovici, E., Ivanis, P., & Vasic, B. V. (2015). Efficient realization of probabilistic gradient descent bit flipping decoders. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 2015-July, pp. 1494-1497). [7168928] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCAS.2015.7168928

Efficient realization of probabilistic gradient descent bit flipping decoders. / Le, Khoa; Declercq, David; Ghaffari, Fakhreddine; Spagnol, Christian; Popovici, Emmanuel; Ivanis, Predrag; Vasic, Bane V.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2015-July Institute of Electrical and Electronics Engineers Inc., 2015. p. 1494-1497 7168928.

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

Le, K, Declercq, D, Ghaffari, F, Spagnol, C, Popovici, E, Ivanis, P & Vasic, BV 2015, Efficient realization of probabilistic gradient descent bit flipping decoders. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 2015-July, 7168928, Institute of Electrical and Electronics Engineers Inc., pp. 1494-1497, IEEE International Symposium on Circuits and Systems, ISCAS 2015, Lisbon, Portugal, 5/24/15. https://doi.org/10.1109/ISCAS.2015.7168928

@inproceedings{58e5b753cc394094aff8897e3b41d401,

title = "Efficient realization of probabilistic gradient descent bit flipping decoders",

abstract = "In this paper, several implementations of the recently introduced PGDBF decoder for LDPC codes are proposed. In [2], the authors show that using randomness in bit-flipping decoders can greatly improve the error correction performance. In this paper, two models of random generators are proposed and compared through hardware implementation and performance simulation. A conventional implementation of the random generator through LFSR as a first design, and a new approach using binary sequences that are produced by the LDPC decoder, named IVRG, as second design. We show that both implementation of the PGDBF improve greatly the error correction performance, while maintaining the same large throughtput. However, the performance gain requires a large hardware overhead in the case of LFSR-PGDBF, while the overhead is limited to only 10% in the case of the IVRG-PGDBF.",

keywords = "bit-flipping, LDPC decoders, PGDBF, random generators",

author = "Khoa Le and David Declercq and Fakhreddine Ghaffari and Christian Spagnol and Emmanuel Popovici and Predrag Ivanis and Vasic, {Bane V}",

year = "2015",

month = jul

day = "27",

doi = "10.1109/ISCAS.2015.7168928",

language = "English (US)",

isbn = "9781479983919",

volume = "2015-July",

pages = "1494--1497",

booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE International Symposium on Circuits and Systems, ISCAS 2015 ; Conference date: 24-05-2015 Through 27-05-2015",

}

TY - GEN

T1 - Efficient realization of probabilistic gradient descent bit flipping decoders

AU - Le, Khoa

AU - Declercq, David

AU - Ghaffari, Fakhreddine

AU - Spagnol, Christian

AU - Popovici, Emmanuel

AU - Ivanis, Predrag

AU - Vasic, Bane V

PY - 2015/7/27

Y1 - 2015/7/27

N2 - In this paper, several implementations of the recently introduced PGDBF decoder for LDPC codes are proposed. In [2], the authors show that using randomness in bit-flipping decoders can greatly improve the error correction performance. In this paper, two models of random generators are proposed and compared through hardware implementation and performance simulation. A conventional implementation of the random generator through LFSR as a first design, and a new approach using binary sequences that are produced by the LDPC decoder, named IVRG, as second design. We show that both implementation of the PGDBF improve greatly the error correction performance, while maintaining the same large throughtput. However, the performance gain requires a large hardware overhead in the case of LFSR-PGDBF, while the overhead is limited to only 10% in the case of the IVRG-PGDBF.

AB - In this paper, several implementations of the recently introduced PGDBF decoder for LDPC codes are proposed. In [2], the authors show that using randomness in bit-flipping decoders can greatly improve the error correction performance. In this paper, two models of random generators are proposed and compared through hardware implementation and performance simulation. A conventional implementation of the random generator through LFSR as a first design, and a new approach using binary sequences that are produced by the LDPC decoder, named IVRG, as second design. We show that both implementation of the PGDBF improve greatly the error correction performance, while maintaining the same large throughtput. However, the performance gain requires a large hardware overhead in the case of LFSR-PGDBF, while the overhead is limited to only 10% in the case of the IVRG-PGDBF.

KW - bit-flipping

KW - LDPC decoders

KW - PGDBF

KW - random generators

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

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

U2 - 10.1109/ISCAS.2015.7168928

DO - 10.1109/ISCAS.2015.7168928

M3 - Conference contribution

AN - SCOPUS:84946203171

SN - 9781479983919

VL - 2015-July

SP - 1494

EP - 1497

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Circuits and Systems, ISCAS 2015

Y2 - 24 May 2015 through 27 May 2015

ER -

Access to Document

10.1109/ISCAS.2015.7168928