Saved in:
Bibliographic Details
Main Authors: Khalifeh, Sarah, Duffy, Ken R., Medard, Muriel
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2412.14017
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915069846093824
author Khalifeh, Sarah
Duffy, Ken R.
Medard, Muriel
author_facet Khalifeh, Sarah
Duffy, Ken R.
Medard, Muriel
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2412_14017
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Turbo product decoding of cubic tensor codes
Khalifeh, Sarah
Duffy, Ken R.
Medard, Muriel
Information Theory
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.
title Turbo product decoding of cubic tensor codes
topic Information Theory
url https://arxiv.org/abs/2412.14017