Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 14 Feb 2024 in cs.IT and math.IT | (2402.09364v2)

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. “802.3-2022 – IEEE standard for Ethernet,” IEEE Standard, pp. 1–7025, Jul. 2022.
  2. L. Yang, J. Tian, B. Wu, Z. Wang, and H. Ren, “An RS-BCH concatenated FEC code for beyond 400 Gb/s networking,” in IEEE Comput. Soc. Annu. Symp. VLSI (ISVLSI), Jul. 2022, pp. 212–216.
  3. S. Bhoja, V. Parthasarathy, and S. Wang, “FEC codes for 400 Gbps 802.3bs,” IEEE P802.3bs 200 GbE & 400 GbE Task Force, 2014. [Online]. Available: https://www.ieee802.org/3/bs/public/14_11/parthasarathy_3bs_01a_1114.pdf
  4. M. Chagnon, S. Lessard, and D. V. Plant, “336 Gb/s in direct detection below KP4 FEC threshold for intra data center applications,” IEEE Photon. Technol. Lett., vol. 28, no. 20, pp. 2233–2236, Oct. 2016.
  5. D. J. Costello Jr. and G. D. Forney Jr., “Channel coding: The road to channel capacity,” Proc. IEEE, vol. 95, no. 6, pp. 1150–1177, Jun. 2007.
  6. J. P. Odenwalder, “Concatenated Reed–Solomon/Viterbi channel coding for advanced planetary missions: Analysis, simulations, and test,” 1974, submitted to JPL by Linkabit Corp.
  7. D. Divsalar and J. H. Yuen, “Performance of concatenated Reed–Solomon/Viterbi channel coding,” Jet Propulsion Laboratory, TDA Progress Report 42-71, Jul. 1982. [Online]. Available: https://ipnpr.jpl.nasa.gov/progress_report/42-71/71K.PDF
  8. “Telemetry channel coding,” Consultative Committee for Space Data Systems, CCSDS Historical Document, Jun. 2001.
  9. “TM synchronization and channel coding–—summary of concept and rationale,” Consultative Committee for Space Data Systems, Informational Report, Jun. 2020.
  10. P. Hershey, A. Ephremides, and R. Khatri, “Performance of RS-BCH concatenated codes and BCH single-stage codes on an interference satellite channel,” IEEE Trans. Commun., vol. 35, no. 5, pp. 550–556, May 1987.
  11. J. Justesen, “Class of constructive asymptotically good algebraic codes,” IEEE Trans. Inf. Theory, vol. 18, no. 5, pp. 652–656, Sep. 1972.
  12. R. S. Elagooz, A. Mahran, S. Gasser, and M. Aboul-Dahab, “Efficient low-complexity decoding of CCSDS Reed–Solomon codes based on Justesen’s concatenation,” IEEE Access, vol. 7, pp. 49 596–49 603, Apr. 2019.
  13. D. Yuan, L. Zhang, and C. Gao, “Performance analysis of RS-BCH concatenated codes in Rayleigh fading channel,” in Fifth Asia-Pacific Conf. on Commun., vol. 1, Oct. 1999, pp. 677–679.
  14. J. Freudenberger, U. Kaiser, and J. Spinner, “Concatenated code constructions for error correction in non-volatile memories,” in Int. Symp. on Signals, Syst., and Electron., Oct. 2012, pp. 1–6.
  15. G. Tzimpragos, C. Kachris, I. B. Djordjevic, M. Cvijetic, D. Soudris, and I. Tomkos, “A survey on FEC codes for 100 G and beyond optical networks,” IEEE Commun. Surveys Tuts., vol. 18, no. 1, pp. 209–221, 2016.
  16. L. Liu, S. Song, and Z. Wang, “A novel interleaving scheme for concatenated codes on burst-error channel,” in 27th Asia Pacific Conf. Commun. (APCC), Oct. 2022, pp. 309–314.
  17. Q. Hu, C. Sun, and H.-A. Zhao, “10Gb/s RS-BCH concatenated codec with parallel strategies for fiber communications,” in Int. Conf. Commun., Circuits and Syst. (ICCCAS), Jul. 2010, pp. 303–307.
  18. M. Barakatain and F. R. Kschischang, “Low-complexity concatenated LDPC-staircase codes,” J. Lightw. Technol., vol. 36, no. 12, pp. 2443–2449, Jun. 2018.
  19. ——, “Low-complexity rate- and channel-configurable concatenated codes,” J. Lightw. Technol., vol. 39, no. 7, pp. 1976–1983, Apr. 2021.
  20. A. Nedelcu, S. Calabrò, Y. Lin, and N. Stojanović, “Concatenated SD-Hamming and KP4 codes in DCN PAM4 4×200 Gbps/lane,” in 2022 Eur. Conf. Opt. Commun. (ECOC), Sep. 2022, pp. 1–4.
  21. “Forward error correction for high bit-rate DWDM submarine systems,” International Telecommunication Union, Standard, Feb. 2004.
  22. Z. Wang, “Super-FEC codes for 40/100 Gbps networking,” IEEE Commun. Lett., vol. 16, no. 12, pp. 2056–2059, Dec. 2012.
  23. K. Lee, H.-G. Kang, J.-I. Park, and H. Lee, “A high-speed low-complexity concatenated BCH decoder architecture for 100 Gb/s optical communications,” J. Signal Process. Syst., vol. 66, pp. 43–55, Aug. 2010.
  24. M. Barakatain, D. Lentner, G. Böcherer, and F. R. Kschischang, “Performance-complexity tradeoffs of concatenated FEC for higher-order modulation,” J. Lightw. Technol., vol. 38, no. 11, pp. 2944–2953, Jun. 2020.
  25. T. Kasami, T. Takata, K. Yamashita, T. Fujiwara, and S. Lin, “On bit-error probability of a concatenated coding scheme,” IEEE Trans. Commun., vol. 45, no. 5, pp. 536–543, May 1997.
  26. S. Benedetto and G. Montorsi, “Unveiling turbo codes: some results on parallel concatenated coding schemes,” IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 409–428, Mar. 1996.
  27. D. Lentner, E. B. Yacoub, S. Calabrò, G. Böcherer, N. Stojanović, and G. Kramer, “Concatenated forward error correction with KP4 and single parity check codes,” J. Lightw. Technol., vol. 41, no. 17, pp. 5641–5652, Sep. 2023.
  28. G. Ricciutelli, T. Jerkovits, M. Baldi, F. Chiaraluce, and G. Liva, “Analysis of the block error probability of concatenated polar code ensembles,” IEEE Trans. Commun., vol. 67, no. 9, pp. 5953–5962, Sep. 2019.
  29. X. Wang, X. He, and H. Ren, “BER objective for beyond 400GbE,” IEEE 802.3 Beyond 400 Gb/s Ethernet Study Group, 2021. [Online]. Available: https://www.ieee802.org/3/B400G/public/21_03/wang_b400g_01a_210315.pdf
  30. R. J. McEliece and L. Swanson, “On the decoder error probability for Reed-Solomon codes (corresp.),” IEEE Trans. Inf. Theory, vol. 32, no. 5, pp. 701–703, Sep. 1986.
  31. A. Y. Sukmadji, F. R. Kschischang, and M. Shehadeh, “Generalized spatially-coupled product-like codes using zipper codes with irregular degree,” in GLOBECOM Workshop, Dec. 2023.
  32. W. W. Peterson, “On the weight structure and symmetry of BCH codes,” J. Ins. Elec. Communs. Engr. (Japan), vol. 50, pp. 1183–1190, 1967.
  33. D. Sarwate and N. Shanbhag, “High-speed architectures for Reed-Solomon decoders,” IEEE Trans. VLSI Syst., vol. 9, no. 5, pp. 641–655, Oct. 2001.
  34. G. D. Forney Jr., “On decoding BCH codes,” IEEE Trans. Inf. Theory, vol. 11, no. 4, pp. 549–557, Oct. 1965.
  35. F. Polkinghorn Jr., “Decoding of double and triple error correcting Bose-Chaudhuri codes (corresp.),” IEEE Trans. Inf. Theory, vol. 12, no. 4, pp. 480–481, Oct. 1966.
  36. F. Yan and C. Ko, “Method for finding roots of quartic equation with application to RS codes,” Electron. Lett., vol. 34, pp. 2399–2400, Dec. 1998.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.

Sign Up for Free