On parameter optimization of product codes for iterative bounded distance decoding with scaled reliability

Alireza Sheikh, Alexandre Graell I Amat, Gianluigi Liva, Alex Alvarado

Research output: Contribution to conferencePaperAcademic

4 Downloads (Pure)

Abstract

We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit error correcting capability provide the best performance-complexity trade-off.
Original languageEnglish
Number of pages4
Publication statusPublished - 2019

Fingerprint

Decoding

Cite this

@conference{9e6b31f71d5949bcb0dd476cdf37f1f2,
title = "On parameter optimization of product codes for iterative bounded distance decoding with scaled reliability",
abstract = "We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit error correcting capability provide the best performance-complexity trade-off.",
author = "Alireza Sheikh and {Graell I Amat}, Alexandre and Gianluigi Liva and Alex Alvarado",
year = "2019",
language = "English",

}

On parameter optimization of product codes for iterative bounded distance decoding with scaled reliability. / Sheikh, Alireza; Graell I Amat, Alexandre; Liva, Gianluigi; Alvarado, Alex .

2019.

Research output: Contribution to conferencePaperAcademic

TY - CONF

T1 - On parameter optimization of product codes for iterative bounded distance decoding with scaled reliability

AU - Sheikh, Alireza

AU - Graell I Amat, Alexandre

AU - Liva, Gianluigi

AU - Alvarado, Alex

PY - 2019

Y1 - 2019

N2 - We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit error correcting capability provide the best performance-complexity trade-off.

AB - We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit error correcting capability provide the best performance-complexity trade-off.

UR - https://arxiv.org/abs/1908.09502

M3 - Paper

ER -