Phase-Aware Code-Aided EM Algorithm for Blind Channel Estimation in PSK-Modulated OFDM

• URL: http://arxiv.org/abs/2511.21340v1
• Date: Wed, 26 Nov 2025 12:46:34 GMT
• Title: Phase-Aware Code-Aided EM Algorithm for Blind Channel Estimation in PSK-Modulated OFDM
• Authors: Chin-Hung Chen, Ivana Nikoloska, Wim van Houtum, Yan Wu, Alex Alvarado,
• Abstract summary: This paper presents a fully blind phase-aware expectation-maximization (EM) algorithm for OFDM systems with the phase-shift keying (PSK) modulation.
• Score: 3.792575603976365
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents a fully blind phase-aware expectation-maximization (EM) algorithm for OFDM systems with the phase-shift keying (PSK) modulation. We address the well-known local maximum problem of the EM algorithm for blind channel estimation. This is primarily caused by the unknown phase ambiguity in the channel estimates, which conventional blind EM estimators cannot resolve. To overcome this limitation, we propose to exploit the extrinsic information from the decoder as model evidence metrics. A finite set of candidate models is generated based on the inherent symmetries of PSK modulation, and the decoder selects the most likely candidate model. Simulation results demonstrate that, when combined with a simple convolutional code, the phase-aware EM algorithm reliably resolves phase ambiguity during the initialization stage and reduces the local convergence rate from 80% to nearly 0% in frequency-selective channels with a constant phase ambiguity. The algorithm is invoked only once after the EM initialization stage, resulting in negligible additional complexity during subsequent turbo iterations.

Related papers

• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Multi-Fidelity Delayed Acceptance: hierarchical MCMC sampling for Bayesian inverse problems combining multiple solvers through deep neural networks [0.3499870393443268]
  Inverse uncertainty quantification (UQ) tasks are computationally demanding when dealing with physics-based models.<n>Data-driven surrogate models may help reduce evaluation costs, but their utility is often limited by the expense of generating high-fidelity data.<n>We propose a Multi-Fidelity Delayed Acceptance scheme for Bayesian inverse problems.
  arXiv  Detail & Related papers  (2025-12-18T11:32:16Z)
• Robust Blind Channel Estimation for Bursty Impulsive Noise with a Constrained EM Approach [6.278835867567429]
  Impulsive noise (IN) commonly generated by power devices can severely degrade the performance of wireless receivers.<n>This paper examines blind channel estimation methods based on the expectation-maximization (EM) algorithm tailored for scenarios impacted by bursty IN.
  arXiv  Detail & Related papers  (2025-03-22T07:39:21Z)
• Quantum Phase Estimation without Controlled Unitaries [0.0]
  We demonstrate the use of adapted classical phase retrieval algorithms to perform control-free quantum phase estimation. We numerically investigate the feasibility of both approaches for estimating the spectrum of the Fermi-Hubbard model.
  arXiv  Detail & Related papers  (2024-10-28T20:37:01Z)
• Sub-linear Regret in Adaptive Model Predictive Control [56.705978425244496]
  We present STT-MPC (Self-Tuning Tube-based Model Predictive Control), an online oracle that combines the certainty-equivalence principle and polytopic tubes. We analyze the regret of the algorithm, when compared to an algorithm initially aware of the system dynamics.
  arXiv  Detail & Related papers  (2023-10-07T15:07:10Z)
• Multi-kernel Correntropy-based Orientation Estimation of IMUs: Gradient Descent Methods [3.8286082196845466]
  Correntropy-based descent gradient (CGD) and correntropy-based decoupled orientation estimation (CDOE) Traditional methods rely on the mean squared error (MSE) criterion, making them vulnerable to external acceleration and magnetic interference. New algorithms demonstrate significantly lower computational complexity than Kalman filter-based approaches.
  arXiv  Detail & Related papers  (2023-04-13T13:57:33Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Formal Controller Synthesis for Markov Jump Linear Systems with Uncertain Dynamics [64.72260320446158]
  We propose a method for synthesising controllers for Markov jump linear systems. Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS. We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
  arXiv  Detail & Related papers  (2022-12-01T17:36:30Z)
• Non-Coherent Over-the-Air Decentralized Gradient Descent [0.0]
  Implementing Decentralized Gradient Descent in wireless systems is challenging due to noise, fading, and limited bandwidth. This paper introduces a scalable DGD algorithm that eliminates the need for scheduling, topology information, or CSI.
  arXiv  Detail & Related papers  (2022-11-19T19:15:34Z)
• Statistical Approach to Quantum Phase Estimation [62.92678804023415]
  We introduce a new statistical and variational approach to the phase estimation algorithm (PEA) Unlike the traditional and iterative PEAs which return only an eigenphase estimate, the proposed method can determine any unknown eigenstate-eigenphase pair. We show the simulation results of the method with the Qiskit package on the IBM Q platform and on a local computer.
  arXiv  Detail & Related papers  (2021-04-21T00:02:00Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Model Predictive Control for Finite Input Systems using the D-Wave Quantum Annealer [4.83782736808514]
  The D-Wave quantum annealer has emerged as a novel computational architecture that is attracting significant interest. We present a model predictive control (MPC) algorithm using a quantum annealer. Two practical applications, namely stabilization of a spring-mass-damper system and dynamic audio quantization, are demonstrated.
  arXiv  Detail & Related papers  (2020-01-06T05:11:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.