Error-and-Erasure Decoding of Product and Staircase Codes

03/09/2021
by   Lukas Rapp, et al.
0

High-rate product codes (PCs) and staircase codes (SCs) are ubiquitous codes in high-speed optical communication achieving near-capacity performance on the binary symmetric channel (BSC). Their success is mostly due to very efficient iterative decoding algorithm that require very little complexity. In this paper, we extend the density evolution (DE) analysis for PCs and SCs to a channel with ternary output and ternary message passing, where the third symbol marks an erasure. We investigate the performance of a standard error-and-erasure decoder and of two simplifications using DE. The proposed analysis can be used to find component code configurations and quantizer levels for the channel output. We also show how the use of even-weight BCH subcodes as component codes can improve the decoding performance at high rates. The DE results are verified by Monte-Carlo simulations, which show that additional coding gains of up to 0.6 dB are possible by ternary decoding, at only a small additional increase in complexity compared to traditional binary message passing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2022

Error-and-erasure Decoding of Product and Staircase Codes with Simplified Extrinsic Message Passing

The decoding performance of product codes (PCs) and staircase codes (SCC...
research
01/09/2019

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding

We propose a binary message passing decoding algorithm for product codes...
research
06/06/2019

Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes

We present a novel decoding algorithm for q-ary low-density parity-check...
research
08/16/2023

Soft-Information Post-Processing for Chase-Pyndiah Decoding Based on Generalized Mutual Information

Chase-Pyndiah decoding is widely used for decoding product codes. Howeve...
research
05/18/2022

Sparse superposition codes with rotational invariant coding matrices for memoryless channels

We recently showed in [1] the superiority of certain structured coding m...
research
11/15/2021

Neural Normalized Min-Sum Message-Passing vs. Viterbi Decoding for the CCSDS Line Product Code

The Consultative Committee for Space Data Systems (CCSDS) 141.11-O-1 Lin...
research
02/09/2022

Sparse superposition codes under VAMP decoding with generic rotational invariant coding matrices

Sparse superposition codes were originally proposed as a capacity-achiev...

Please sign up or login with your details

Forgot password? Click here to reset