Performance-Complexity-Latency Trade-offs of Concatenated RS-SDBCH Codes

TL;DR

A semi-analytical formula is derived for estimating the decoded frame error rate (FER) at the output of the additive white Gaussian noise channel, obviating the need for time-consuming Monte Carlo simulations.

Abstract

Performance-complexity-latency trade-off curves for rate-0.88 concatenated outer Reed--Solomon codes and inner Chase-algorithm-based soft-decision Bose--Ray-Chaudhuri--Hocquenghem codes with PAM4 constellation using bit-interleaved coded modulation and multilevel coding coded modulation schemes over the AWGN channel are presented.

Figures (3)

• Figure 1: Example of an RS-SDBCH concatenated coding system with $M=4$ outer RS(5, 3) codes, over a $B$-bit symbol alphabet and $m=5$ inner BCH($n,4B$) codes. Here, $L_{i,j}=1$ for all $i\in[M]$, $j\in[m]$. Each square represents one ($B$-bit) RS symbol.
• Figure 2: FER versus input SNR for RS-SDBCH codes (with code parameters as indicated) with PAM4 modulation using BICM and MLC over the AWGN channel.
• Figure 3: Performance-complexity-latency trade-offs of Pareto-efficient RS-SDBCH codes with rate $0.88\pm 0.005$. Each curve shows operating points with the maximum latency indicated.