XYXianghao Yu

Xianghao Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xianghao Yu has a total of 52 co-authors. Here are the top co-authors by number of shared publications:

  • Jie Xu

    School of Science and Engineering (SSE), Shenzhen Future Network of Intelligence Institute (FNii-Shenzhen), and Guangdong Provincial Key Laboratory of Future Networks of Intelligence, The Chinese University of Hong Kong (Shenzhen), Shenzhen, Guangdong, China

    6 shared publications
  • Jun Zhang

    Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

    6 shared publications
  • Shenghui Song

    Department of Electronic and Computer Engineering, the Hong Kong University of Science and Technology, Hong Kong, China

    6 shared publications
  • Khaled B. Letaief

    Dept. of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong

    5 shared publications
  • Hengtao He

    Dept. of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong

    4 shared publications
  • Derrick Wing Kwan Ng

    University of New South Wales

    3 shared publications

Latest Publications

  • Open Access

    MIMO Beam Map Reconstruction via Toeplitz-Structured Matrix-Vector Tensor Decomposition

    by Hao Sun, Junting Chen, Xianghao Yu

    As wireless networks progress toward sixthgeneration (6G), understanding the spatial distribution of directional beam coverage becomes increasingly important for beam management and link optimization. Multiple-input multipleoutput (MIMO) beam map provides such spatial awareness, yet accurate construction under sparse measurements remains difficult due to incomplete spatial coverage and strong angular variations. This paper presents a tensor decomposition approach for reconstructing MIMO beam map from limited measurements. By transforming measurements from a Cartesian coordinate system into a polar coordinate system, we uncover a matrix-vector outer-product structure associated with different propagation conditions. Specifically, we mathematically demonstrate that the matrix factor, representing beam-space gain, exhibits an intrinsic Toeplitz structure due to the shift-invariant nature of array responses, and the vector factor captures distance-dependent attenuation. Leveraging these structural priors, we formulate a regularized tensor decomposition problem to jointly reconstruct line-of-sight (LOS), reflection, and obstruction propagation conditions. Simulation results confirm that the proposed method significantly enhances data efficiency, achieving a normalized mean square error (NMSE) reduction of over 20% compared to state-of-the-art baselines, even under sparse sampling regimes.

  • Open Access

    Near-Field Communication with Massive Movable Antennas: An Electrostatic Equilibrium Perspective

    by Shicong Liu, Xianghao Yu, Shenghui Song, Khaled B. Letaief

    Recent advancements in large-scale position-reconfigurable antennas have opened up new dimensions to effectively utilize the spatial degrees of freedom (DoFs) of wireless channels. However, the deployment of existing antenna placement schemes is primarily hindered by their limited scalability and frequently overlooked near-field effects in large-scale antenna systems. In this paper, we propose a novel antenna placement approach tailored for near-field massive multiple-input multiple-output systems, which effectively exploits the spatial DoFs to enhance spectral efficiency. For that purpose, we first reformulate the antenna placement problem in the angular domain, resulting in a weighted Fekete problem. We then derive the optimality condition and reveal that the {optimal} antenna placement is in principle an electrostatic equilibrium problem. To further reduce the computational complexity of numerical optimization, we propose an ordinary differential equation (ODE)-based framework to efficiently solve the equilibrium problem. In particular, the optimal antenna positions are characterized by the roots of the polynomial solutions to specific ODEs in the normalized angular domain. By simply adopting a two-step eigenvalue decomposition (EVD) approach, the optimal antenna positions can be efficiently obtained. Furthermore, we perform an asymptotic analysis when the antenna size tends to infinity, which yields a closed-form solution. Simulation results demonstrate that the proposed scheme efficiently harnesses the spatial DoFs of near-field channels with prominent gains in spectral efficiency and maintains robustness against system parameter mismatches. In addition, the derived asymptotic closed-form {solution} closely approaches the theoretical optimum across a wide range of practical scenarios.

  • Open Access

    Detection in Bistatic ISAC with Deterministic Sensing and Gaussian Information Signals

    by Xianxin Song, Xianghao Yu, Jie Xu, Derrick Wing Kwan Ng

    Integrated sensing and communications (ISAC) is a disruptive technology enabling future sixth-generation (6G) networks. This paper investigates target detection in a bistatic ISAC system, in which the base station (BS) transmits superimposed ISAC signals comprising both Gaussian information-bearing and deterministic sensing components to simultaneously provide communication and sensing functionalities. First, we develop a Neyman-Pearson (NP)-based detector that effectively utilizes both the deterministic sensing and random communication signals. Closed-form analysis reveals that both signal components contribute to improving the overall detection performance. Subsequently, we optimize the BS transmit beamforming to maximize the detection probability, subject to a minimum signal-to-interference-plus-noise ratio (SINR) constraint for the communication user (CU) and a total transmit power budget at the BS. The resulting non-convex beamforming optimization problem is addressed via semi-definite relaxation (SDR) and successive convex approximation (SCA) techniques. Simulation results demonstrate the superiority of the proposed NP-based detector, which leverages both types of signals, over benchmark schemes that treat information signals as interference. They also reveal that a higher communication-rate threshold directs more transmit power to Gaussian information-bearing signals, thereby diminishing deterministic-signal power and weakening detection performance.

  • Open Access

    Structure-Aware Near-Field Radio Map Recovery via RBF-Assisted Matrix Completion

    by Hao Sun, Xianghao Yu, Junting Chen

    This paper proposes a novel structure-aware matrix completion framework assisted by radial basis function (RBF) interpolation for near-field radio map construction in extremely large multiple-input multiple-output (XL-MIMO) systems. Unlike the far-field scenario, near-field wavefronts exhibit strong dependencies on both angle and distance due to spherical wave propagation, leading to complicated variations in received signal strength (RSS). To effectively capture the intricate spatial variations structure inherent in near-field environments, a regularized RBF interpolation method is developed to enhance radio map reconstruction accuracy. Leveraging theoretical insights from interpolation error analysis of RBF, an inverse μ-law-inspired nonuniform sampling strategy is introduced to allocate measurements adaptively, emphasizing regions with rapid RSS variations near the transmitter. To further exploit the global low-rank structure in the near-field radio map, we integrate RBF interpolation with nuclear norm minimization (NNM)-based matrix completion. A robust Huberized leave-one-out cross-validation (LOOCV) scheme is then proposed for adaptive selection of the tolerance parameter, facilitating optimal fusion between RBF interpolation and matrix completion. The integration of local variation structure modeling via RBF interpolation and global low-rank structure exploitation via matrix completion yields a structure-aware framework that substantially improves the accuracy of near-field radio map reconstruction. Extensive simulations demonstrate that the proposed approach achieves over 10% improvement in normalized mean squared error (NMSE) compared to standard interpolation and matrix completion methods under varying sampling densities and shadowing conditions.

  • Open Access

    Active IRS-Enabled Integrated Sensing and Communications with Extended Targets

    by Yuan Fang, Xianxin Song, Huazhou Hou, Ziguo Zhong, Xianghao Yu, Jie Xu, Yongming Huang

    This paper studies the active intelligent reflecting surface (IRS)-enabled integrated sensing and communications (ISAC), in which an active IRS is deployed to assist the base station (BS) in serving multiple communication users (CUs) and simultaneously sensing an \emph{extended} target at the non-line-of-sight (NLoS) area of the BS. The active IRS has the capability of amplifying the reflected signals so as to overcome significant reflection path loss in NLoS communication and sensing. In particular, we derive the sensing Cramér-Rao bound (CRB) for estimating the target response matrix. Accordingly, we jointly optimize the transmit beamforming at the BS and the reflective beamforming at the active IRS to minimize the sensing CRB, subject to the signal-to-interference-plus-noise ratio (SINR) requirements at the CUs, the transmit power budgets at the BS and active IRS, as well as the power amplification gain constraints at the active IRS. The CRB minimization problem is highly non-convex and thus difficult to solve in general. To address this challenge, we first focus on two specified conditions by considering the sensing-only scenario via ignoring the SINR constraints for communications, for which the closed-form optimal transmit beamforming is derived. Then, we propose two efficient alternating optimization (AO)-based algorithms to obtain high-quality solutions for the general ISAC scenarios. Next, we analyze the inherent relationship between the power scaling at the BS and the amplification scaling at the active IRS. It is shown that the active IRS always amplifies the signal using the maximum amplification gain under practical system settings. Finally, numerical results are provided to verify the effectiveness of the proposed AO-based algorithms and the benefits of active IRS-enabled ISAC compared to its passive IRSs counterparts.

  • Open Access

    CRB-Rate Tradeoff for Bistatic ISAC with Gaussian Information and Deterministic Sensing Signals

    by Xianxin Song, Xianghao Yu, Jie Xu, Derrick Wing Kwan Ng

    In this paper, we investigate a bistatic integrated sensing and communications (ISAC) system, consisting of a multi-antenna base station (BS), a multi-antenna sensing receiver, a single-antenna communication user (CU), and a point target to be sensed. Specifically, the BS transmits a superposition of Gaussian information and deterministic sensing signals. The BS aims to deliver information symbols to the CU, while the sensing receiver aims to estimate the target's direction-of-arrival (DoA) with respect to the sensing receiver by processing the echo signals. For the sensing receiver, we assume that only the sequences of the deterministic sensing signals and the covariance matrix of the information signals are perfectly known, whereas the specific realizations of the information signals remain unavailable. Under this setup, we first derive the corresponding Cramér-Rao bounds (CRBs) for DoA estimation and propose practical estimators to accurately estimate the target's DoA. Subsequently, we formulate the transmit beamforming design as an optimization problem aiming to minimize the CRB, subject to a minimum signal-to-interference-plus-noise ratio (SINR) requirement at the CU and a maximum transmit power constraint at the BS. When the BS employs only Gaussian information signals, the resulting beamforming optimization problem is convex, enabling the derivation of an optimal solution. In contrast, when both Gaussian information and deterministic sensing signals are transmitted, the resulting problem is non-convex and a locally optimal solution is acquired by exploiting successive convex approximation (SCA). Finally, numerical results demonstrate that employing Gaussian information signals leads to a notable performance degradation for target sensing and the proposed transmit beamforming design achieves a superior ISAC performance boundary compared with various benchmark schemes.

  • Open Access

    Joint Radiation Power, Antenna Position, and Beamforming Optimization for Pinching-Antenna Systems with Motion Power Consumption

    by Yiming Xu, Dongfang Xu, Xianghao Yu, Shenghui Song, Zhiguo Ding, Robert Schober

    Pinching-antenna systems (PASS) have been recently proposed to improve the performance of wireless networks by reconfiguring both the large-scale and small-scale channel conditions. However, existing studies ignore the physical constraints of antenna placement and assume fixed antenna radiation power. To fill this research gap, this paper investigates the design of PASS taking into account the motion power consumption of pinching-antennas (PAs) and the impact of adjustable antenna radiation power. To that end, we minimize the average power consumption for a given quality-of-service (QoS) requirement, by jointly optimizing the antenna positions, antenna radiation power ratios, and transmit beamforming. To the best of the authors' knowledge, this is the first work to consider radiation power optimization in PASS, which provides an additional degree of freedom (DoF) for system design. The cases with both continuous and discrete antenna placement are considered, where the main challenge lies in the fact that the antenna positions affect both the magnitude and phase of the channel coefficients of PASS, making system optimization very challenging. To tackle the resulting unique obstacles, an alternating direction method of multipliers (ADMM)-based framework is proposed to solve the problem for continuous antenna movement, while its discrete counterpart is formulated as a mixed integer nonlinear programming (MINLP) problem and solved by the block coordinate descent (BCD) method. Simulation results validate the performance enhancement achieved by incorporating PA movement power assumption and adjustable radiation power into PASS design, while also demonstrating the efficiency of the proposed optimization framework. The benefits of PASS over conventional multiple-input multiple-output (MIMO) systems in mitigating the large-scale path loss and inter-user interference is also revealed.

  • Open Access

    Exploiting Both Pilots and Data Payloads for Integrated Sensing and Communications

    by Chen Xu, Xianghao Yu, Fan Liu, Shi Jin

    Integrated sensing and communications (ISAC) is one of the key enabling technologies in future sixth-generation (6G) networks. Current ISAC systems predominantly rely on deterministic pilot signals within the signal frame to accomplish sensing tasks. However, these pilot signals typically occupy only a small portion, e.g., 0.15% to 25%, of the time-frequency resources. To enhance the system utility, a promising solution is to repurpose the extensive random data payload signals for sensing tasks. In this paper, we analyze the ISAC performance of a multi-antenna system where both deterministic pilot and random data symbols are employed for sensing tasks. By capitalizing on random matrix theory (RMT), we first derive a semi-closed-form asymptotic expression of the ergodic linear minimum mean square error (ELMMSE). Then, we formulate an ISAC precoding optimization problem to minimize the ELMMSE, which is solved via a specifically tailored successive convex approximation (SAC) algorithm. To provide system insights, we further derive a closed-form expression for the asymptotic ELMMSE at high signal-to-noise ratios (SNRs). Our analysis reveals that, compared with conventional sensing implemented by deterministic signals, the sensing performance degradation induced by random signals is critically determined by the ratio of the transmit antenna size to the data symbol length. Based on this result, the ISAC precoding optimization problem at high SNRs is transformed into a convex optimization problem that can be efficiently solved. Simulation results validate the accuracy of the derived asymptotic expressions of ELMMSE and the performance of the proposed precoding schemes. Particularly, by leveraging data payload signals for sensing tasks, the sensing error is reduced by up to 5.6 dB compared to conventional pilot-based sensing.

  • Open Access

    Digital Twin Enhanced Deep Reinforcement Learning for Intelligent Omni-Surface Configurations in MU-MIMO Systems

    by Xiaowen Ye, Xianghao Yu, Liqun Fu

    Intelligent omni-surface (IOS) is a promising technique to enhance the capacity of wireless networks, by reflecting and refracting the incident signal simultaneously. Traditional IOS configuration schemes, relying on all sub-channels' channel state information and user equipments' mobility, are difficult to implement in complex realistic systems. Existing works attempt to address this issue employing deep reinforcement learning (DRL), but this method requires a lot of trial-and-error interactions with the external environment for efficient results and thus cannot satisfy the real-time decision-making. To enable model-free and real-time IOS control, this paper puts forth a new framework that integrates DRL and digital twins. DeepIOS, a DRL based IOS configuration scheme with the goal of maximizing the sum data rate, is first developed to jointly optimize the phase-shift and amplitude of IOS in multi-user multiple-input-multiple-output systems. Thereafter, to further reduce the computational complexity, DeepIOS introduces an action branch architecture, which separately decides two optimization variables in parallel. Finally, a digital twin module is constructed through supervised learning as a pre-verification platform for DeepIOS, such that the decision-making's real-time can be guaranteed. The formulated framework is a closed-loop system, in which the physical space provides data to establish and calibrate the digital space, while the digital space generates experience samples for DeepIOS training and sends the trained parameters to the IOS controller for configurations. Numerical results show that compared with random and MAB schemes, the proposed framework attains a higher data rate and is more robust to different settings. Furthermore, the action branch architecture reduces DeepIOS's computational complexity, and the digital twin module improves the convergence speed and run-time.

  • Open Access

    Exploiting Moving Arrays for Near-Field Sensing

    by Yilong Chen, Zixiang Ren, Xianghao Yu, Lei Liu, Jie Xu

    This letter exploits moving arrays to enable nearfield multiple-input multiple-output (MIMO) sensing via a limited number of antenna elements. We consider a scenario where a base station (BS) is equipped with a uniform linear array (ULA) on a moving platform. The objective is to locate a point target in the two-dimensional (2D) space by leveraging the near-field channel characteristics created by the movement of antenna arrays. Under this setup, we analyze the Cramer-Rao bound (CRB) for estimating the target's 2D coordinate, which provides the fundamental sensing performance limits for localization. It is revealed that our proposed design with a moving array achieves a CRB that is proportional to the CRB obtained by an equivalent extremely large ULA matching the platform's size. This shows that the movement of antenna array significantly enlarges its effective aperture to enable near-field sensing. Numerical results show that the proposed moving array design substantially enhances the target estimation performance compared to the conventional fixed array benchmark.