arXiv subjects

Simon Obermüller

Publications and source records attributed to Simon Obermüller.

3 recordsLinked to original sources

arXiv2026

Chase-like Decoding: Test-Pattern Design and Performance Analysis

Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. We evaluate different test-pattern sets for Chase-like decoding. Structured sets, such as Chase-II patterns or patterns chosen by logistic weight, are analyzed using order statistics, while arbitrary sets are evaluated by calculating covered-space probabilities and by performing Monte Carlo simulation. We further propose an algorithm that designs test-pattern sets to cover likely error patterns, achieving comparable performance with half the number of test patterns compared with conventional sets for high-rate BCH codes.

cs.IT↗

arXiv2025

Soft-Output from Covered Space Decoding of Product Codes

In this work, we propose a new soft-input soft-output decoder called soft-output from covered space (SOCS) decoder. It estimates the a posteriori reliability based on the space explored by a list decoder, i.e., the set of vectors for which the list decoder knows whether they are codewords. This approach enables a more accurate calculation of the a posteriori reliability and results in gains of up to 0.25$\,$dB for turbo product decoding with SOCS compared to Chase-Pyndiah decoding.

cs.IT↗

arXiv2025

Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel

For asynchronous transmission of short blocks, preambles for packet detection contribute a non-negligible overhead. To reduce the required preamble length, joint detection and decoding (JDD) techniques have been proposed that additionally utilize the payload part of the packet for detection. In this paper, we analyze two instances of JDD, namely hybrid preamble and energy detection (HyPED) and decoder-aided detection (DAD). While HyPED combines the preamble with energy detection for the payload, DAD also uses the output of a channel decoder. For these systems, we propose novel achievability and converse bounds for the rates over the binary-input additive white Gaussian noise (BI-AWGN) channel. Moreover, we derive a general bound on the required blocklength for JDD. Both the theoretical bound and the simulation of practical codebooks show that the rate of DAD quickly approaches that of synchronous transmission.

cs.IT↗