Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
arXiv:2402.09364 · doi:10.1109/TCOMM.2024.3369731
Abstract
Using a generating function approach, a computationally tractable expression is derived to predict the frame error rate arising at the output of the binary symmetric channel when a number of outer Reed--Solomon codes are concatenated with a number of inner Bose--Ray-Chaudhuri--Hocquenghem codes, thereby obviating the need for time-consuming Monte Carlo simulations. Measuring (a) code performance via the gap to the Shannon limit, (b) decoding complexity via an estimate of the number of operations per decoded bit, and (c) decoding latency by the overall frame length, a code search is performed to determine the Pareto frontier for performance-complexity-latency trade-offs.
arXiv commentAccepted for publication in the IEEE Transactions on Communications
References in corpus (5)
- Low-Complexity Concatenated LDPC-Staircase Codes
- Super-FEC Codes for 40/100 Gbps Networking
- Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
- Concatenated Forward Error Correction with KP4 and Single Parity Check Codes
- Generalized Spatially-Coupled Product-Like Codes Using Zipper Codes With Irregular Degree