Construction and iterative decoding of LDPC codes over rings for phase-noisy channels
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
IEEE Transactions on Communications
IEEE Transactions on Signal Processing
Belief propagation with Gaussian priors for pilot-assisted communication over fading ISI channels
IEEE Transactions on Wireless Communications
Feedforward data-aided phase noise estimation from a DCT basis expansion
EURASIP Journal on Wireless Communications and Networking - Special issue on synchronization in wireless communications
Monte Carlo solutions for blind phase noise estimation
EURASIP Journal on Wireless Communications and Networking - Special issue on synchronization in wireless communications
Optimal filtering in pilot-aided carrier recovery
Research Letters in Communications
Time-frequency packing for linear modulations: spectral efficiency and practical detection schemes
IEEE Transactions on Communications
Adaptive iterative detectors for phase-uncertain channels via variational bounding
IEEE Transactions on Communications
IEEE Transactions on Communications
Smoothing PLLs for QAM dynamical phase estimation
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Bias-free phase tracking with linear and nonlinear systems
IEEE Transactions on Wireless Communications
EURASIP Journal on Wireless Communications and Networking
Iterative decoding in Factor Graph representation using Particle Filtering
Digital Signal Processing
Spectrum Sensing in the Presence of RF Impairments in Cognitive Radio
International Journal of Interdisciplinary Telecommunications and Networking
Hi-index | 0.08 |
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 proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass function of the information bits given the channel output. In order to overcome the problems due to the presence in the factor graph of continuous random variables, we apply the method of canonical distributions . Several choices of canonical distributions have been considered in the literature. Well-known approaches consist of discretizing continuous variables or treating them as jointly Gaussian, thus obtaining a Kalman estimator. Our first new approach, based on the Fourier series expansion of the phase probability density function, yields better complexity/performance tradeoff with respect to the usual discretized-phase method. Our second new approach, based on the Tikhonov canonical distribution, yields near-optimal performance at very low complexity and is shown to be much more robust than the Kalman method to the placement of pilot symbols in the coded frame. We present numerical results for binary LDPC codes and LDPC-coded modulation, with particular reference to some phase-noise models and coded-modulation formats standardized in the next-generation satellite Digital Video Broadcasting (DVB-S2). These results show that our algorithms achieve near-coherent performance at very low complexity without requiring any change to the existing DVB-S2 standard.