Papers
Topics
Authors
Recent
Search
2000 character limit reached

Precoded Polar Product Codes

Published 9 Feb 2024 in cs.IT and math.IT | (2402.06767v1)

Abstract: Precoded polar product codes are proposed, where selected component codes enable successive cancellation list decoding to generate bit-wise soft messages efficiently for iterative decoding while targeting optimized distance spectrum as opposed to eBCH or polar component codes. Rate compatibility is a byproduct of $1$-bit granularity in the component code design.

Authors (1)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. P. Elias, “Error-free coding,” IRE Trans. Inf. Theory, vol. PGIT-4, pp. 29–37, Sep. 1954.
  2. N. Abramson, “Cascade decoding of cyclic product codes,” IEEE Trans. Commun. Tech., vol. 16, no. 3, pp. 398–402, Jun. 1968.
  3. R. M. Pyndiah, “Near-optimum decoding of product codes: block turbo codes,” IEEE Trans. Commun., vol. 46, no. 8, pp. 1003–1010, Aug. 1998.
  4. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1,” in Proc. IEEE Int. Conf. on Commun., vol. 2, 1993, pp. 1064–1070.
  5. H. Nickl, J. Hagenauer, and F. Burkert, “Approaching shannon’s capacity limit by 0.27 db using hamming codes in a ’turbo’-decoding scheme,” in Proc. of IEEE Int. Symp. on Inf. Theory, 1997, pp. 12–.
  6. J. Li, K. R. Narayanan, and C. N. Georghiades, “Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity,” IEEE Trans. Inf. Theory, vol. 50, no. 1, pp. 31–46, Jan. 2004.
  7. Y.-Y. Jian, H. D. Pfister, and K. R. Narayanan, “Approaching capacity at high rates with iterative hard-decision decoding,” IEEE Trans. Inf. Theory, vol. 63, no. 9, pp. 5752–5773, 2017.
  8. C. Argon and S. McLaughlin, “A parallel decoder for low latency decoding of turbo product codes,” IEEE Commun. Lett., vol. 6, no. 2, pp. 70–72, 2002.
  9. F. Chiaraluce and R. Garello, “Extended Hamming product codes analytical performance evaluation for low error rate applications,” IEEE Trans. Wireless Commun., vol. 3, no. 6, pp. 2353–2361, Nov. 2004.
  10. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory, vol. 20, no. 2, pp. 284–287, Mar. 1974.
  11. X. Tang and R. Koetter, “Performance of iterative algebraic decoding of codes defined on graphs: An initial investigation,” in IEEE Inf. Theory Workshop, Sep. 2007, pp. 254–259.
  12. C. Häger and H. D. Pfister, “Approaching miscorrection-free performance of product codes with anchor decoding,” IEEE Trans. Commun., vol. 66, no. 7, pp. 2797–2808, Jul. 2018.
  13. H. Mukhtar, A. Al-Dweik, and A. Shami, “Turbo product codes: Applications, challenges, and future directions,” IEEE Communications Surveys & Tutorials, vol. 18, no. 4, pp. 3052–3069, 2016.
  14. E. Arıkan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.
  15. I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, May 2015.
  16. P. Trifonov and V. Miloslavskaya, “Polar subcodes,” IEEE Journal on Selected Areas in Communications, vol. 34, no. 2, pp. 254–266, 2016.
  17. E. Arıkan, “From sequential decoding to channel polarization and back again,” CoRR, vol. abs/1908.09594, 2019. [Online]. Available: http://arxiv.org/abs/1908.09594
  18. M. C. Coşkun, G. Durisi, T. Jerkovits, G. Liva, W. Ryan, B. Stein, and F. Steiner, “Efficient error-correcting codes in the short blocklength regime,” Elsevier Phys. Commun., vol. 34, pp. 66–79, Jun. 2019.
  19. V. Miloslavskaya and B. Vucetic, “Design of short polar codes for SCL decoding,” IEEE Trans. Commun., vol. 68, no. 11, pp. 6657–6668, 2020.
  20. T. Koike-Akino, C. Cao, Y. Wang, K. Kojima, D. S. Millar, and K. Parsons, “Irregular polar turbo product coding for high-throughput optical interface,” in 2018 Optical Fiber Communications Conference and Exposition (OFC), 2018, pp. 1–3.
  21. V. Bioglio, C. Condo, and I. Land, “Construction and decoding of product codes with non-systematic polar codes,” in 2019 IEEE Wireless Communications and Networking Conference (WCNC), 2019, pp. 1–6.
  22. R. Andrew, “The weight distributions of some product codes,” in Proc. of IEEE Int. Symp. on Inf. Theory, 2000, pp. 226–.
  23. G. Caire, G. Taricco, and G. Battail, “Weight distribution and performance of the iterated product of single-parity-check codes,” in IEEE GLOBECOM, Nov. 1994, pp. 206–211.
  24. L. Tolhuizen, “More results on the weight enumerator of product codes,” IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2573–2577, 2002.
  25. M. El-Khamy and R. Garello, “On the weight enumerator and the maximum likelihood performance of linear product codes,” CoRR, vol. abscs/0601095, 2006. [Online]. Available: http://arxiv.org/abs/cs/0601095
  26. M. C. Coşkun, G. Liva, A. Graell i Amat, M. Lentmaier, and H. D. Pfister, “Successive cancellation decoding of single parity-check product codes: Analysis and improved decoding,” IEEE Trans. Inf. Theory, vol. 69, no. 2, pp. 823–841, 2023.
  27. D. M. Rankin and T. A. Gulliver, “Single parity check product codes,” IEEE Trans. Commun., vol. 49, no. 8, pp. 1354–1362, Aug. 2001.
  28. D. M. Rankin, T. A. Gulliver, and D. P. Taylor, “Asymptotic performance of single parity-check product codes,” IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2230–2235, Sep. 2003.
  29. C. Condo, “Iterative soft-input soft-output decoding with ordered reliability bits grand,” in 2022 IEEE Globecom Workshops (GC Wkshps), 2022, pp. 510–515.
  30. A. Straßhofer, D. Lentner, G. Liva, and A. G. i. Amat, “Soft-information post-processing for chase-pyndiah decoding based on generalized mutual information,” in Int. Symp. on Topics in Coding (ISTC), 2023, pp. 1–5.
  31. P. Yuan, M. Médard, K. Galligan, and K. R. Duffy, “Soft-output (so) grand and long, low rate codes to outperform 5 LDPCs,” CoRR, vol. abs/2310.10737, 2023. [Online]. Available: http://arxiv.org/abs/2310.10737
  32. M. El-Khamy, “The average weight enumerator and the maximum likelihood performance of product codes,” in Int. Conf. on Wireless Networks, Commun. and Mobile Computing, vol. 2, June 2005, pp. 1587–1592.
  33. A. J. Salomon and O. Amrani, “Augmented product codes and lattices: Reed-Muller codes and Barnes-Wall lattices,” IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3918–3930, Nov. 2005.
  34. M. C. Coşkun, T. Jerkovits, and G. Liva, “Successive cancellation list decoding of product codes with Reed-Muller component codes,” IEEE Commun. Lett., vol. 23, no. 11, pp. 1972–1976, 2019.
  35. M. Lentmaier, G. Liva, E. Paolini, and G. Fettweis, “From product codes to structured generalized LDPC codes,” in Proc. Chinacom, Beijing, China, Aug. 2010.
  36. D. Chase, “Class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inf. Theoryy, vol. 18, no. 1, pp. 170–182, 1972.
  37. C. Condo, V. Bioglio, H. Hafermann, and I. Land, “Practical product code construction of polar codes,” IEEE Transactions on Signal Processing, vol. 68, pp. 2004–2014, 2020.
  38. K. R. Duffy, J. Li, and M. Médard, “Capacity-achieving guessing random additive noise decoding,” IEEE Trans. Inf. Theory, vol. 65, no. 7, pp. 4023–4040, 2019.
Citations (3)
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 0 likes about this paper.

Sign Up for Free