Suppressing Error Floors in SCPPM via an Efficient CRC-aided List Viterbi Decoding Algorithm

List Viterbi decoders are a very effective way to improve the performance of block codes in combination with an error detection outer code. In this work, we combine an efficient serial list Viterbi decoder design with an existing serially-concatenated, convolutionally-encoded, pulse position modulat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2023 12th International Symposium on Topics in Coding (ISTC) s. 1 - 5
Hlavní autoři: Antonini, Amaael, Sui, Wenhui, Towell, Brendan, Divsalar, Dariush, Hamkins, Jon, Wesel, Richard D.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 04.09.2023
Témata:
Channel codes
Complexity theory
Convolutional codes
Decoding
Error probability
Feature extraction
list decoding
space Comms
Space communications
Viterbi algorithm
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:List Viterbi decoders are a very effective way to improve the performance of block codes in combination with an error detection outer code. In this work, we combine an efficient serial list Viterbi decoder design with an existing serially-concatenated, convolutionally-encoded, pulse position modulated code (SCPPM) used in space communication, that exhibits poor performance because of an error floor. The SCPPM code features a 32-bit CRC that provides powerful error detection capability and an outer four-state convolutional code that makes it suitable for a list Viterbi decoder. The system's code is very long, consisting of 15, 120 bits, which renders a high complexity decoder impractical, while the high error detection allows for a list decoder with very low undetected error probability. We use a very efficient list Viterbi decoder algorithm to avoid most of the redundant operations to produce low complexity serial list Viterbi decoder. The combined system reduces the error floor, moderately for the original version of the system, and completely suppresses it when the code length is increased to four times longer.
DOI:10.1109/ISTC57237.2023.10273548