Performance-Complexity-Latency Trade-offs of Concatenated RS-SDBCH Codes
Alvin Y. Sukmadji, Frank R. Kschischang
TL;DR
This paper analyzes the trade-offs between performance, complexity, and latency in concatenated RS-SDBCH coding schemes with PAM4 modulation over AWGN channels, providing detailed curves for various configurations.
Contribution
It presents comprehensive trade-off curves for concatenated Reed-Solomon and SDBCH codes with PAM4, highlighting their performance and complexity characteristics.
Findings
Trade-off curves illustrate performance vs. complexity and latency.
Concatenated codes achieve favorable trade-offs in specific configurations.
Insights into optimal coding schemes for low-latency, high-performance communication.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEmbedded Systems Design Techniques · Parallel Computing and Optimization Techniques