Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability

05/14/2018
by   Alireza Sheikh, et al.
0

We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved.

READ FULL TEXT

page 1

page 2

page 3

research
08/26/2019

On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability

We use density evolution to optimize the parameters of binary product co...
research
02/10/2019

Binary Message Passing Decoding of Product-like Codes

We propose a novel binary message passing decoding algorithm for product...
research
06/28/2018

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

We study low-complexity iterative decoding algorithms for product codes....
research
06/24/2019

A novel soft-aided bit-marking decoder for product codes

We introduce a novel soft-aided hard-decision decoder for product codes ...
research
05/29/2020

Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

We propose a novel soft-aided iterative decoding algorithm for product c...
research
08/05/2020

Novel High-Throughput Decoding Algorithms for Product and Staircase Codes based on Error-and-Erasure Decoding

Product codes (PCs) and staircase codes (SCCs) are conventionally decode...
research
01/09/2020

On Decoding Using Codewords of the Dual Code

We present novel decoding schemes for hard and soft decision decoding of...

Please sign up or login with your details

Forgot password? Click here to reset