Turbo product decoding of cubic tensor codes
Authors:
- 19 March 2025
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
Long, powerful soft detection forward error correction codes are typically constructed by concatenation of shorter component codes that are decoded through iterative Soft-Input Soft-Output (SISO) procedures. The current gold-standard is Low Density Parity Check (LDPC) codes, which are built from weak single parity check component codes that are capable of producing accurate SO. Due to the recent development of SISO decoders that produce highly accurate SO with codes that have multiple redundant bits, square product code constructions that can avail of more powerful component codes have been shown to be competitive with the LDPC codes in the 5G New Radio standard in terms of decoding performance while requiring fewer iterations to converge. Motivated by applications that require more powerful low-rate codes, in the present paper we explore the possibility of extending this design space by considering the construction and decoding of cubic tensor codes.Keywords
All Related Versions
Funding Information
- Advanced Research Projects Agency
This publication has 32 references indexed in Scilit:
- Block turbo decoding with ORBGRAND2023
- A Survey of FPGA-Based LDPC DecodersIEEE Communications Surveys & Tutorials, 2015
- Underwater Communications2013
- Modern Coding Theory2008
- Wireless Communications2005
- Cyclic redundancy code (CRC) polynomial selection for embedded networks2004
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Near-optimum decoding of product codes: block turbo codesIEEE Transactions on Communications, 1998
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997
- Experimental quantum cryptographyJournal of Cryptology, 1992