arXiv subjects

Toan-Van Nguyen

Publications and source records attributed to Toan-Van Nguyen.

6 recordsLinked to original sources

arXiv2026

Variational Bayesian Data Detection for Multiuser MIMO Systems Corrupted by Phase Noises

Phase noise (PN), arising from imperfect local oscillators, introduces multiplicative distortions that degrade the performance of communication systems. In uplink multiuser multiple-input multiple-output (MIMO) systems, this impairment is further compounded by the presence of independent oscillators at each transmit and receive antenna, each contributing an uncorrelated noise component. Existing PN compensation algorithms at the receiver either rely on linearization approximations that lose accuracy under severe PN conditions, or incur computational complexity that scales prohibitively with the number of antennas. To address these limitations, we propose a variational Bayes (VB) framework for joint PN estimation and data detection in uplink MIMO systems. We develop VB-based detectors that treat noise statistics as latent variables, and reformulate the inference problem by absorbing the transmitter PN into the transmitted signal, treating the resulting composite variable as the inference target. Under von Mises priors, this reformulation yields exact closed-form conjugate posterior updates, from which we derive an improved detector achieving superior performance at low complexity. Simulation results demonstrate that the proposed VB algorithm achieves lower symbol error rates than the Self-Interference Whitening (SIW) algorithm and conventional phase-noise-unaware detectors across a wide range of channel conditions, modulation orders, and PN severities, while remaining computationally scalable to large MIMO deployments.

cs.IT↗

arXiv2026

Semi-Gridless Variational Bayes Channel Estimation in XL-MIMO: Near-Field Modeling and Inference

Extremely large antenna arrays and high-frequency operation are two key technologies that advance performance metrics such as higher data rates, lower latency, and wider coverage in sixth-generation communications. However, the adoption of these technologies fundamentally changes the characteristics of wavefronts, forcing communication systems to operate in the near-field region. The transition from planar far-field communications to spherical near-field propagation necessitates novel channel estimation algorithms to fully exploit the unique features of spherical wavefronts for advanced transceiver design. To this end, we propose a novel semi-gridless channel estimation approach based on a variational Bayesian (VB) inference framework. Specifically, we reformulate the near-field channel model for both uniform linear arrays and uniform planar arrays into separate direction-of-arrival (DoAs) and distance components. Building on these new representations, we employ a gridless approach for DoAs estimation using a von Mises distribution, and a coarse-to-fine grid search for distance estimation. We then develop a semi-gridless variational Bayesian (SG-VB) algorithm with efficient update rules that enables accurate channel reconstruction. Simulation results validate the effectiveness of the proposed SG-VB algorithm, demonstrating enhanced near-field channel reconstruction accuracy and superior estimation performance for both DoAs and distance components embedded in near-field channels.

eess.SP↗

arXiv2025

Variational Bayesian Channel Estimation and Data Detection for Cell-Free Massive MIMO with Low-Resolution Quantized Fronthaul Links

We study the joint channel estimation and data detection (JED) problem in a cell-free massive multiple-input multiple-output (CF-mMIMO) network, where access points (APs) communicate with a central processing unit (CPU) over fronthaul links. However, the bandwidth of these links is limited, and thus, presents challenges to the applicability of CF-mMIMO, especially with an ever-increasing number of users. To address this, we propose a method based on variational Bayesian (VB) inference for performing the JED process, where the APs forward low-resolution quantized versions of the signals to the CPU. We consider two approaches: \emph{quantization-and-estimation} (Q-E) and \emph{estimation-and-quantization} (E-Q). In the Q-E approach, each AP uses a low-bit quantizer to quantize the signal before forwarding it to the CPU, while in the E-Q approach, each AP first performs local channel estimation and then sends a low-bit quantized version of the estimated channel to the CPU. We evaluate the performance of our VB-based approach under perfect fronthaul link (PFL) with unquantized received signals, Q-E, and E-Q in terms of symbol error rate (SER), normalized mean square error (NMSE) of the channel estimation, computational complexity, and fronthaul signaling overhead. We also compare these results with those of the linear minimum mean squared error (LMMSE) method under the PFL scenario. Our numerical results show that both the VB(Q-E) and VB(E-Q) approaches achieve superior performance compared to LMMSE(PFL), benefiting from the nonlinear modeling inherent in VB. Furthermore, the VB(Q-E) method outperforms VB(E-Q) due to errors in the local channel estimation process at the APs within the VB(E-Q) approach.

eess.SP↗

arXiv2025

Variational Bayesian Inference for Time-Varying Massive MIMO Channels: Estimation and Detection

Massive multiple-input multiple-output (MIMO) stands as a key technology for advancing performance metrics such as data rate, reliability, and spectrum efficiency in the fifth generation (5G) and beyond of wireless networks. However, its efficiency depends greatly on obtaining accurate channel state information. This task becomes particularly challenging with increasing user mobility. In this paper, we focus on an uplink scenario in which a massive MIMO base station serves multiple high-mobility users. We leverage variational Bayesian(VB) inference for joint channel estimation and data detection(JED), tailored for time-varying channels. In particular, we use the VB framework to provide approximations of the true posterior distributions. To cover more real-world scenarios, we assume the time correlation coefficients associated with the channels are unknown. Our simulations demonstrate the efficacy of our proposed VB-based approach in tracking these unknown time correlation coefficients. We present two processing strategies within the VB framework: online and block processing strategies. The online strategy offers a low-complexity solution for a given time slot, requiring only the knowledge of the parameters/statistics within that time slot. In contrast, the block processing strategy focuses on the entire communication block and processes all received signals together to reduce channel estimation errors. Additionally, we introduce an interleaved structure for the online processing strategy to further enhance its performance. Finally, we conduct a comparative analysis of our VB approach against the linear minimum mean squared error(LMMSE), the Kalman Filter(KF), and the expectation propagation(EP) methods in terms of symbol error rate(SER) and channel normalized mean squared error(NMSE). Our findings reveal that our VB framework surpasses these benchmarks across the performance metrics.

eess.SP↗

arXiv2024

MIMO Detection with Spatial Sigma-Delta ADCs: A Variational Bayesian Approach

The spatial Sigma-Delta ($\Sigma\Delta$) architecture can be leveraged to reduce the quantization noise and enhance the effective resolution of few-bit analog-to-digital converters (ADCs) at certain spatial frequencies of interest. Utilizing the variational Bayesian (VB) inference framework, this paper develops novel data detection algorithms tailored for massive multiple-input multiple-output (MIMO) systems with few-bit $\Sigma\Delta$ ADCs and angular channel models, where uplink signals are confined to a specific angular sector. We start by modeling the corresponding Bayesian networks for the $1^{\mathrm{st}}$- and $2^{\mathrm{nd}}$-order $\Sigma\Delta$ receivers. Next, we propose an iterative algorithm, referred to as Sigma-Delta variational Bayes (SD-VB), for MIMO detection, offering low-complexity updates through closed-form expressions of the variational densities of the latent variables. We also study the impact of mutual coupling on the performance of the proposed SD-VB algorithms when the antenna spacing is reduced. Simulation results show that the proposed $2^{\mathrm{nd}}$-order SD-VB algorithm delivers the best symbol error rate (SER) performance while maintaining the same computational complexity as in unquantized systems, matched-filtering VB with conventional quantization, and linear minimum mean-squared error (LMMSE) methods. Moreover, the $1^{\mathrm{st}}$- and $2^{\mathrm{nd}}$-order SD-VB algorithms achieve their lowest SER at an antenna separation of one-fourth wavelength for a fixed number of antenna elements. The effects of mutual coupling, the steering angle of the $\Sigma\Delta$ architecture, the number of ADC resolution bits, and the number of antennas and users are also extensively analyzed.

eess.SP↗

arXiv2022

An Efficient Deep CNN Design for EH Short-Packet Communications in Multihop Cognitive IoT Networks

In this paper, we design an efficient deep convolutional neural network (CNN) to improve and predict the performance of energy harvesting (EH) short-packet communications in multi-hop cognitive Internet-of-Things (IoT) networks. Specifically, we propose a Sum-EH scheme that allows IoT nodes to harvest energy from either a power beacon or primary transmitters to improve not only packet transmissions but also energy harvesting capabilities. We then build a novel deep CNN framework with feature enhancement-collection blocks based on the proposed Sum-EH scheme to simultaneously estimate the block error rate (BLER) and throughput with high accuracy and low execution time. Simulation results show that the proposed CNN framework achieves almost exactly the BLER and throughput of Sum-EH one, while it considerably reduces computational complexity, suggesting a real-time setting for IoT systems under complex scenarios. Moreover, the designed CNN model achieves the root-mean-square-error (RMSE) of ${1.33\times10^{-2}}$ on the considered dataset, which exhibits the lowest RMSE compared to the deep neural network and state-of-the-art machine learning approaches.

cs.IT↗