In high-mobility orthogonal frequency division multiplexing (OFDM) systems, rapid channel variation can make the channel state information (CSI) estimated from pilots inaccurate for data subcarriers, leading to a mismatch with their effective channel. To address this issue, this paper proposes a CSI RefineNet receiver, where the CSI is iteratively refined using soft symbol decisions in a data-aided manner. Specifically, a pilot-driven initialization module is first employed to obtain a coarse CSI estimation and the corresponding symbol posterior probabilities. Based on these posteriors, soft data-aided channel observations are constructed over all subcarriers and fused with the initial CSI to refine the channel estimation. The refined CSI is subsequently fed back to the equalization and detection modules, thereby forming an iterative receiver structure. To improve training stability and fully exploit the refinement capability, a two-stage training strategy is also developed. Simulation results demonstrate that the proposed CSI RefineNet receiver achieves superior BER performance and strong robustness under different velocities, modulation orders, and pilot spacing configurations in high-mobility OFDM systems.
Affine frequency division multiplexing (AFDM) has emerged as a promising waveform for next-generation integrated sensing and communication (ISAC) systems. However, it becomes challenging to improve spectral efficiency while simultaneously obtaining accurate channel and sensing-related parameters, particularly in doubly-dispersive channels with fractional delays and fractional Doppler shifts. To tackle this challenge, by formulating the channel estimation task as a multiple measurement vectors (MMV) off-grid sparse recovery problem, we propose a data-aided grid-evolution sparse Bayesian learning (D-GESBL) scheme for channel estimation and sensing under a superimposed pilot framework. Specifically, we develop an efficient data-aided iterative receiver, in which reliably decoded data symbols are fed back as additional pseudo-pilot information to assist channel estimation and sensing. To mitigate off-grid mismatch and improve the overall estimation accuracy, we develop a grid evolution procedure that iteratively adjusts the virtual grids in the discrete affine Fourier (DAF) domain according to the estimated off-grid components. Furthermore, by integrating the generalized approximate message passing (GAMP) algorithm into the proposed SBL framework, we also develop a low-complexity data-aided GAMP–based grid-evolution SBL (D-GAMP-GESBL) algorithm. Finally, the numerical results validate the effectiveness of our proposed schemes and demonstrate their superiority over existing state-of-the-art methods.
Yi-Rui Luo, Yong-Liang Guan, Yao Ge et al.· IEEE Transactions on Communi...· 0 citations
Grant-free random access (GFRA) is a promising solution for massive machine-type communications (mMTC) in future wireless networks. However, reliable user activity detection and channel estimation are critical challenges, particularly when orthogonal time-frequency space (OTFS) modulation is integrated with GFRA to address doubly selective channels induced by high mobility. In this paper, we propose an OTFS-based GFRA framework that exploits the inherent structured sparsity of delay-Doppler channels. By adopting a basis expansion model (BEM), we formulate joint user activity detection and channel estimation as a structured compressive sensing problem. A bi-level sparsity structure is identified, consisting of common sparsity across multiple receive antennas and activation sparsity across mMTC users. To effectively leverage this structure, we construct a two-layer factor graph and develop a structured sparsity expectation propagation (SS-EP) algorithm for efficient Bayesian inference. Simulation results demonstrate that the proposed scheme significantly outperforms existing benchmarks.
Yao Ge, Yirui Luo, Yuhao Chi et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
