Xuehui Dong

dblp:183/5564 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 2 first-author · 4 since 2021
YearPublicationVenuePosition
2026 Frequency-Space Channel Estimation and Spatial Equalization in Wideband Fluid Antenna System
abstract
The Fluid Antenna System (FAS) overcomes the spatial degree-of-freedom limitations of conventional static antenna arrays in wireless communications.This capability critically depends on acquiring full Channel State Information across all accessible ports. Existing studies focus exclusively on narrowband FAS, performing channel estimation solely in the spatial domain. This work proposes a channel estimation and spatial equalization framework for wideband FAS, revealing for the first time an inherent group-sparse structure in aperture-limited FAS channels. First, we establish a group-sparse recovery framework for space-frequency characteristics in FAS, formally characterizing leakage-induced sparsity degradation from limited aperture and bandwidth as a structured group-sparsity problem. By deriving dictionary-adapted group restricted isometry property, we prove tight recovery bounds for a convex ℓ1/ℓ2-mixed norm optimization formulation that preserves leakage-aware sparsity patterns. Second, we develop a descending correlation group orthogonal matching pursuit algorithm that systematically relaxes leakage constraints to reduce subcoherence. This approach enables FSC recovery with accelerated convergence and superior performance compared to conventional compressive sensing methods like OMP or GOMP. Third, we formulate spatial equalization as a mixed-integer linear programming problem, complement this with a greedy algorithm maintaining near-optimal performance. Simulation results demonstrate the proposed channel estimation algorithm effectively resolves energy misallocation and enables recovery of weak details, achieving superior recovery accuracy and convergence rate. The SE framework suppresses deep fading phenomena and largely reduces time consumption overhead while maintaining equivalent link reliability.
Xuehui Dong, Kai Wan 0001, Shuangyang Li, Robert C. Qiu, Giuseppe Caire
IEEE J. Sel. Areas Commun.1
2025 Aperture Efficiency-Oriented Multi-Hop RIS Design for Enhanced Wireless Signal Transmissions
Rujing Xiong, Jialong Lu, Kai Wan 0001, Xuehui Dong, Gui Zhou, Tiebin Mi, Robert C. Qiu
IEEE Trans. Commun.5
2024 Wireless Communications in Cavity: A Reconfigurable Boundary Modulation based Approach
abstract
This paper explores the potential wireless communication applications of Reconfigurable Intelligent Surfaces (RIS) in reverberant wave propagation environments. Unlike in free space, we utilize the sensitivity to boundaries of the enclosed electromagnetic (EM) field and the equivalent perturbation of RISs. For the first time, we introduce the framework of reconfigurable boundary modulation in the cavities. We have proposed a robust boundary modulation scheme that exploits the continuity of object motion and the mutation of the codebook switch, which achieves pulse position modulation (PPM) by RIS-generated equivalent pulses for wireless communication in cavities. This approach achieves around 2 Mbps bit rate in the prototype and demonstrates strong resistance to channel's frequency selectivity resulting in an extremely low bit error rate (BER).
Xuehui Dong, Bokai Lai, Rujing Xiong, Tiebin Mi, Robert C. Qiu
ICC1
2024 Optimal Discrete Beamforming of RIS-Aided Wireless Communications: An Inner Product Maximization Approach
abstract
This paper studies the beamforming optimization challenge in reconfigurable intelligent surface (RIS)-aided multiple-input single-output (MISO) systems, where the RIS phase configuration is discrete. Conventional optimization meth-ods for this discrete optimization problem necessitate resource-intensive exponential search and thus fall within the universal (NP-hard) category. We formally define this task as a discrete inner product maximization problem. Leveraging the inherent structure of this problem, we propose an efficient divide-and-sort (Da$S$) search algorithm to reach the global optimality for the maximization problem. The complexity of the proposed algorithm can be minimized to$\mathrm{O}(2^{B}N)$, a linear correlation with the count of phase discrete levels$2^{B}$and reflecting units$N$. This is notably lower than the exhaustive search complexity of$\mathcal{O}(2^{BN})$. Numerical evaluations and experiments over real prototype also demonstrate the efficiency of the proposed DaS algorithm. Finally, by using the proposed algorithm, we show that over some resolution quantization level on each RIS unit (4-bit and above), there is no noticeable difference in power gains between continuous and discrete phase configurations.
Rujing Xiong, Xuehui Dong, Tiebin Mi, Kai Wan 0001, Robert C. Qiu
WCNC2