We present two new iterative decoding algorithms for channels affected by strong phase
noise and compare them with the best existing algorithms proposed in the literature. The …

In this paper, we introduce a low-complexity carrier phase estimation algorithm to be
integrated into the data decoder of a turbo-coded modem employing a linear modulation …

The introduction of turbo and low-density parity-check (LDPC) codes with iterative decoding
that almost attain Shannon capacity challenges the synchronization subsystems of a data …

This contribution considers turbo synchronization, that is to say, the use of soft data
information to estimate parameters like carrier phase, frequency, or timing offsets of a …

We propose a technique to reduce the number of trellis states in BCJR-type algorithms, ie,
algorithms. with a structure similar to that of the well-known algorithm by Bahl, Cocke …

We recently introduced a noise-centric algorithm, Guessing Random Additive Noise
Decoding (GRAND), that identifies a Maximum Likelihood (ML) decoding for arbitrary code …

The design and implementation of error correcting codes has long been informed by two
fundamental results: Shannon's 1948 capacity theorem, which established that long codes …

In this tutorial paper, we first review the main information-theoretic results on channels
affected by a time-varying phase noise. The main MAP symbol detection algorithms to be …

The paper contains a systematic investigation of practical coding strategies for noncoherent
communication over fading channels, guided by explicit comparisons with information …

We propose novel techniques to reduce the complexity of the well-known Bahl, Cocke,
Jelinek, and Raviv (BCJR) algorithm when it is employed as a detection algorithm in turbo …