Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Higher-Order Staircase Codes (2312.13415v5)

Published 20 Dec 2023 in cs.IT and math.IT

Abstract: We generalize staircase codes and tiled diagonal zipper codes, preserving their key properties while allowing each coded symbol to be protected by arbitrarily many component codewords rather than only two. This generalization which we term "higher-order staircase codes" arises from the marriage of two distinct combinatorial objects: difference triangle sets and finite-geometric nets, which have typically been applied separately to code design. We demonstrate one possible realization of these codes, obtaining powerful, high-rate, low-error-floor, and low-complexity coding schemes based on simple iterative syndrome-domain decoding of coupled Hamming component codes. We anticipate that the proposed codes could improve performance--complexity--latency tradeoffs in high-throughput communications applications, most notably fiber-optic, in which classical staircase codes and zipper codes have been applied. We consider the construction of difference triangle sets having minimum scope and sum-of-lengths, which lead to memory-optimal realizations of higher-order staircase codes. These results also enable memory reductions for early families of convolutional codes constructed from difference triangle sets.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (24)
  1. M. Shehadeh, F. R. Kschischang, and A. Y. Sukmadji, “Generalized staircase codes with arbitrary bit degree,” https://arxiv.org/abs/2310.16165, Oct. 2023, to be presented at 2024 Opt. Fiber Commun. Conf. (OFC 2024).
  2. B. P. Smith, A. Farhood, A. Hunt, F. R. Kschischang, and J. Lodge, “Staircase codes: FEC for 100 Gb/s OTN,” J. Lightw. Technol., vol. 30, no. 1, pp. 110–117, 2012.
  3. A. Y. Sukmadji, U. Martínez-Peñas, and F. R. Kschischang, “Zipper codes,” J. Lightw. Technol., vol. 40, no. 19, pp. 6397–6407, 2022.
  4. M. Qiu, L. Yang, Y. Xie, and J. Yuan, “Terminated staircase codes for NAND flash memories,” IEEE Trans. Commun., vol. 66, no. 12, pp. 5861–5875, 2018.
  5. J. Robinson and A. Bernstein, “A class of binary recurrent codes with limited error propagation,” IEEE Trans. Inf. Theory, vol. 13, no. 1, pp. 106–113, 1967.
  6. G. N. Alfarano, J. Lieb, and J. Rosenthal, “Construction of LDPC convolutional codes via difference triangle sets,” Des., Codes Cryptography”, vol. 89, pp. 2235–2254, 2021.
  7. S. J. Johnson and S. R. Weller, “Codes for iterative decoding from partial geometries,” IEEE Trans. Commun., vol. 52, no. 2, pp. 236–243, 2004.
  8. A. Gruner and M. Huber, “Low-density parity-check codes from transversal designs with improved stopping set distributions,” IEEE Trans. Commun., vol. 61, no. 6, pp. 2190–2200, 2013.
  9. O. E. Geyer and O. Sahin, “Methods and apparatus for error-correcting difference-triangle-set product convolutional codes,” U.S. Patent US11 799 499B2, Oct., 2023.
  10. D. J. Costello, D. G. M. Mitchell, P. M. Olmos, and M. Lentmaier, “Spatially coupled generalized LDPC codes: Introduction and overview,” in IEEE 10th Int. Symp. Turbo Codes Iterative Inf. Process. (ISTC), 2018.
  11. R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533–547, 1981.
  12. A. Dimitromanolakis, “Analysis of the Golomb ruler and the Sidon set problems, and determination of large, near-optimal Golomb rulers,” Diploma Thesis, Technical University of Crete, 2002.
  13. C. Fougstedt and P. Larsson-Edefors, “Energy-efficient high-throughput VLSI architectures for product-like codes,” J. Lightw. Technol., vol. 37, no. 2, pp. 477–485, 2019.
  14. W. Liu, J. Rho, and W. Sung, “Low-power high-throughput BCH error correction VLSI design for multi-level cell NAND flash memories,” in IEEE Workshop Signal Process. Syst. Des. and Implementation, 2006, pp. 303–308.
  15. A. Y. Sukmadji, F. R. Kschischang, and M. Shehadeh, “Generalized spatially-coupled product-like codes using zipper codes with irregular degree,” in IEEE GLOBECOM Workshop, Dec. 2023.
  16. M. Barakatain, Y. Hashemi, B. Karimi, H. Ebrahimzad, and C. Li, “Low-complexity zipper-LDPC and low-latency zipper-BCH concatenated codes,” J. Lightw. Technol., 2023.
  17. S. Li, K. El-Sankary, A. Karami, and D. Truhachev, “Area- and power-efficient staircase encoder implementation for high-throughput fiber-optical communications,” IEEE Trans. VLSI Syst., vol. 28, no. 3, pp. 843–847, 2020.
  18. Q. Xie, Z. Luo, S. Xiao, K. Wang, and Z. Yu, “High-throughput zipper encoder for 800G optical communication system,” in 2021 IEEE Int. Conf. Integr. Circuits, Technol. Appl. (ICTA), 2021, pp. 214–215.
  19. Y. M. Chee and C. J. Colbourn, “Constructions for difference triangle sets,” IEEE Trans. Inf. Theory, vol. 43, no. 4, pp. 1346–1349, 1997.
  20. T. Skolem, “On certain distributions of integers in pairs with given differences,” Mathematica Scandinavica, vol. 5, pp. 57–68, 1957.
  21. E. S. O’Keefe, “Verification of a conjecture of Th. Skolem,” Mathematica Scandinavica, vol. 9, pp. 80–82, 1961.
  22. T. Kløve, “Bounds and construction for difference triangle sets,” IEEE Trans. Inf. Theory, vol. 35, no. 4, pp. 879–886, 1989.
  23. L. M. Zhang and L. Schmalen, “Feed-forward staircase codes,” in 11th Int. ITG Conf. Syst., Commun. Coding, 2017.
  24. L. M. Zhang, D. Truhachev, and F. R. Kschischang, “Spatially coupled split-component codes with iterative algebraic decoding,” IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 205–224, 2018.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now