He Sun 0008

dblp:93/2604-8 · DBLP profile ↗
← Back
13ranked-venue papers
9as first author
12since 2021 · last 2026
0000-0002-2886-0438ORCID · verified

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

Computer networks · 13 · 9 first-author · 12 since 2021
YearPublicationVenuePosition
2026 Channel Gain Map Reconstruction Based on Virtual Scatterer Model
He Sun 0008, Lipeng Zhu 0001, Jie Xu 0002, Rui Zhang 0006
ICC1
2026 Channel Gain Map Estimation Based on 3-D Virtual Scatterer Model
abstract
This paper proposes an efficient method for modeling and reconstructing the channel gain map (CGM) based on virtual scatterers. Specifically, we develop a virtual scatterer model to characterize the channel gain distribution in three-dimensional (3D) space, by capturing the multi-path propagation environment structure and exploiting the angular-domain spatial correlation of scatterer response. In this model, the CGM is represented as a function over a set of tunable parameters for virtual scatterers, including their number, positions, and scatterer response coefficients (SRCs), which can be estimated from a limited number of channel gain measurements at a given set of locations within the region of interest. This new representation offers a flexible and scalable modeling framework for efficient and accurate CGM reconstruction. Furthermore, we propose a progressive estimation algorithm to acquire the scatterers’ parameters. In this algorithm, we gradually increase the number of virtual scatterers to balance the computational complexity and reconstruction accuracy, and derive the closed-form solutions of SRCs with any given number and positions of virtual scatterers. In addition, by exploiting the spatial correlation of scatterer response, we propose a Gaussian process regression (GPR)-based inference method to predict the SRCs that cannot be directly estimated. Finally, ray-tracing-based simulation results under realistic physical environments validate the effectiveness of the proposed method, demonstrating that it achieves higher reconstruction accuracy compared to conventional CGM estimation approaches, especially for the scenario with limited channel measurements.
He Sun 0008, Lipeng Zhu 0001, Jie Xu 0002, Rui Zhang 0006
IEEE Trans. Wirel. Commun.1
2026 Joint Antenna Positioning and Beamforming for Movable Antenna Array Aided Ground Station in Low-Earth Orbit Satellite Communication
abstract
This paper proposes a new architecture for the low-earth orbit (LEO) satellite ground station aided by movable antenna (MA) array. Unlike conventional fixed-position antenna (FPA), the MA array can flexibly adjust antenna positions to reconfigure array geometry, for more effectively mitigating interference and improving communication performance in ultra-dense LEO satellite networks. To reduce movement overhead, we configure antenna positions at the antenna initialization stage, which remain unchanged during the whole communication period of the ground station. To this end, an optimization problem is formulated to maximize the average achievable rate of the ground station by jointly optimizing its antenna position vector (APV) and time-varying beamforming weights, i.e., antenna weight vectors (AWVs). To solve the resulting non-convex optimization problem, we adopt the Lagrangian dual transformation and quadratic transformation to reformulate the objective function into a more tractable form. Then, we develop an efficient block coordinate descent-based iterative algorithm that alternately optimizes the APV and AWVs until convergence is reached. Simulation results demonstrate that our proposed MA scheme significantly outperforms traditional FPA by increasing the achievable rate at ground stations under various system setups, thus providing an efficient solution for interference mitigation in future ultra-dense LEO satellite communication networks.
Lipeng Zhu 0001, Shuai Han 0002, He Sun 0008, Rui Zhang 0006
IEEE Trans. Wirel. Commun.4
2026 Multiuser Communications Aided by Cross-Linked Movable Antenna Array: Architecture and Optimization
abstract
Movable antenna (MA) has been regarded as a promising technology to enhance wireless communication performance by enabling flexible antenna movement. However, the hardware cost of conventional MA systems scales with the number of movable elements due to the need for independently controllable driving components. To reduce hardware cost, we propose in this paper a novel architecture named cross-linked MA (CL-MA) array, which enables the collective movement of multiple antennas in both horizontal and vertical directions. To evaluate the performance benefits of the CL-MA array, we consider an uplink multiuser communication scenario. Specifically, we aim to minimize the total transmit power while satisfying a given minimum rate requirement for each user by jointly optimizing the horizontal and vertical antenna position vectors (APVs), the receive combining at the base station (BS), and the transmit power of users. A globally lower bound on the total transmit power is derived, with closed-form solutions for the APVs obtained under the condition of a single channel path for each user. For the more general case of multiple channel paths, we develop a low-complexity algorithm based on discrete antenna position optimization. Additionally, to further reduce antenna movement overhead, a statistical channel-based antenna position optimization approach is proposed, allowing for unchanged APVs over a long time period. Simulation results demonstrate that the proposed CL-MA schemes significantly outperform conventional fixed-position antenna (FPA) systems and closely approach the theoretical lower bound on the total transmit power. Compared to the instantaneous channel-based CL-MA optimization, the statistical channel-based approach incurs a slight performance loss but achieves significantly lower movement overhead, making it an appealing solution for practical wireless systems.
Lipeng Zhu 0001, He Sun 0008, Wenyan Ma, Zhenyu Xiao, Rui Zhang 0006
IEEE Trans. Wirel. Commun.2
2025 Cross-Linked Movable Antenna Array Aided Multiuser Communications
abstract
Movable antenna (MA) has been regarded as a promising technology to enhance wireless communication performance by enabling flexible antenna movement. To reduce hardware cost, we propose in this paper a novel architecture named cross-linked MA (CL-MA) array, which enables the collective movement of multiple antennas in both horizontal and vertical directions. To evaluate the performance benefits of the CL-MA array, we consider an uplink multiuser communication scenario. Specifically, we aim to minimize the total transmit power while satisfying a given minimum rate requirement for each user by jointly optimizing the horizontal and vertical antenna position vectors (APVs), the receive combining at the base station (BS), and the transmit power of users. To solve this challenging non-convex optimization problem, we develop a low-complexity algorithm based on discrete antenna position optimization. Additionally, to further reduce antenna movement overhead, a statistical channel-based antenna position optimization approach is proposed, allowing for quasi-static APVs over a long time period. Simulation results demonstrate that the proposed CL-MA schemes significantly outperform conventional fixed-position antenna (FPA) systems and closely approach the theoretical lower bound on the total transmit power. Compared to the instantaneous channel-based CL-MA optimization, the statistical channel-based approach incurs a slight performance loss but achieves significantly lower movement overhead, making it an appealing solution for practical wireless systems.
Lipeng Zhu 0001, He Sun 0008, Wenyan Ma, Zhenyu Xiao, Rui Zhang 0006
GLOBECOM2
2025 RSRP Measurement Based Channel Autocorrelation Estimation for IRS-Aided Wideband Communication
abstract
The passive and frequency-flat reflection of IRS, as well as the high-dimensional IRS-reflected channels, have posed significant challenges for efficient IRS channel estimation, especially in wideband communication systems with significant multi-path channel delay spread. To address these challenges, we propose a novel neural network (NN)-empowered framework for IRS channel autocorrelation matrix estimation in wideband orthogonal frequency division multiplexing (OFDM) systems. This framework relies only on the easily accessible reference signal received power (RSRP) measurements at users in existing wideband communication systems, without requiring additional pilot transmission. Based on the estimates of channel autocorrelation matrix, the passive reflection of IRS is optimized to maximize the average user received signal-to-noise ratio (SNR) over all subcarriers in the OFDM system. Numerical results verify that the proposed algorithm significantly outperforms existing power-measurement-based IRS reflection designs in wideband channels.
He Sun 0008, Lipeng Zhu 0001, Weidong Mei, Rui Zhang 0006
WCNC1
2025 Power-Measurement-Based Channel Autocorrelation Estimation for IRS-Assisted Wideband Communications
abstract
Channel state information (CSI) is essential to the performance optimization of intelligent reflecting surface (IRS)-aided wireless communication systems. However, the passive and frequency-flat reflection of IRS, as well as the high-dimensional IRS-reflected channels, have posed practical challenges for efficient IRS channel estimation, especially in wideband communication systems with significant multi-path channel delay spread. To tackle the above challenge, we propose a novel neural network (NN)-empowered IRS channel estimation and passive reflection design framework for the wideband orthogonal frequency division multiplexing (OFDM) communication system based only on the user’s reference signal received power (RSRP) measurements with time-varying random IRS training reflections. As RSRP is readily accessible in existing communication systems, our proposed channel estimation method does not require additional pilot transmission in IRS-aided wideband communication systems. In particular, we show that the average received signal power over all OFDM subcarriers at the user terminal can be represented as the prediction of a single-layer NN composed of multiple subnetworks with the same structure, such that the autocorrelation matrix of the wideband IRS channel can be recovered as their weights via supervised learning. To exploit the potential sparsity of the channel autocorrelation matrix, a progressive training method is proposed by gradually increasing the number of subnetworks until a desired accuracy is achieved, thus reducing the training complexity. Based on the estimates of IRS channel autocorrelation matrix, the IRS passive reflection is then optimized to maximize the average channel power gain over all subcarriers. Numerical results indicate the effectiveness of the proposed IRS channel autocorrelation matrix estimation and passive reflection design under wideband channels, which can achieve significant performance improvement compared to the existing IRS reflection designs based on user power measurements.
He Sun 0008, Lipeng Zhu 0001, Weidong Mei, Rui Zhang 0006
IEEE Trans. Wirel. Commun.1
2025 Channel Gain Map Estimation for Wireless Networks Based on Scatterer Model
abstract
Channel gain map (CGM) contains crucial large-scale fading information regarding wireless channels at specific frequency bands in wireless networks. Traditional CGM construction methods require either detailed propagation environment information or numerous channel measurements, rendering them practically cumbersome to implement. To overcome such difficulties, we propose in this paper a novel scatterer-based CGM construction framework to characterize the large-scale channel fading in a spatial region by estimating the scatterer responses from a few channel gain measurements at designated locations in the region. In particular, the region is divided into equally-spaced grids so as to smooth out the small-scale fading by averaging the channel power gain within each grid. As the average channel power gain within each grid can be expressed as a function of large-scale multi-path channel parameters such as the scatterer response coefficients and path-loss coefficients, an iterative algorithm is proposed to estimate these parameters based on only a sufficient number of channel gain measurements taken at random locations around each scatterer. Specifically, the proposed algorithm decomposes the parameter estimation problem into a set of univariate or linear estimation subproblems, which can be efficiently solved by one-dimensional (1D) line search and least-squares methods. Based on the estimated channel parameters, the CGM over the whole region can be estimated by calculating the average channel power gain for each grid. Simulation results under both the two-dimensional (2D) multipath channel model and the practical three-dimensional (3D) ray-tracing channel model verify that the proposed scatterer-based channel gain characterization can accurately capture the large-scale channel gain spatial distribution within a region, and the proposed CGM estimation framework outperforms other channel-measurement-based benchmarks in terms of estimation accuracy, while requiring a significantly reduced number of measurements.
He Sun 0008, Lipeng Zhu 0001, Rui Zhang 0006
IEEE Trans. Wirel. Commun.1
2024 Power Measurement-Based Channel Estimation for IRS-Enhanced Wireless Coverage
abstract
Intelligent reflecting surface (IRS) has been recognized as a transformative technology for enabling smart and reconfigurable radio environment cost-effectively by leveraging its controllable passive reflection. In this paper, we study an IRS-assisted coverage enhancement problem for a given region, aiming to optimize the passive reflection of the IRS for improving the average communication performance in the region by accounting for both deterministic and random channels in the environment. To this end, we first derive the closed-form expression of the average received signal power in terms of the deterministic base station (BS)-IRS-user cascaded channels over all user locations, and propose an IRS-aided coverage enhancement framework to facilitate the estimation of such deterministic channels for IRS passive reflection design. Specifically, to avoid the exorbitant overhead of estimating the cascaded channels at all possible user locations, a location selection method is first proposed to select only a set of typical user locations for channel estimation by exploiting the channel spatial correlation in the region. To estimate the deterministic cascaded channels at the selected user locations, conventional IRS channel estimation methods require additional pilot signals, which not only results in high system training overhead but also may not be compatible with the existing communication protocols. To overcome this issue, we further propose a single-layer neural network (NN)-enabled IRS channel estimation method in this paper, based on only the average received signal power measurements at each selected location corresponding to different IRS random training reflections, which can be offline implemented in current wireless systems. Based on the estimated channels, the IRS passive reflection is then optimized to maximize the average received signal power over the selected locations. Numerical results demonstrate that our proposed scheme can significantly improve the coverage performance of the target region and outperform the existing power-measurement-based IRS reflection designs.
He Sun 0008, Lipeng Zhu 0001, Weidong Mei, Rui Zhang 0006
IEEE Trans. Wirel. Commun.1
2023 User Power Measurement Based IRS Channel Estimation via Single-Layer Neural Network
abstract
One main challenge for implementing intelligent reflecting surface (IRS) aided communications lies in the difficulty to obtain the channel knowledge for the base station (BS)-IRS-user cascaded links, which is needed to design high-performance IRS reflection in practice. Traditional methods for estimating IRS cascaded channels are usually based on the additional pilot signals received at the BS/users, which increase the system training overhead and also may not be compatible with the current communication protocols. To tackle this challenge, we propose in this paper a new single-layer neural network (NN)-enabled IRS channel estimation method based on only the knowledge of users' individual received signal power measurements corresponding to different IRS random training reflections, which are easily accessible in current wireless systems. To evaluate the effectiveness of the proposed channel estimation method, we design the IRS reflection for data transmission based on the estimated cascaded channels in an IRS-aided multiuser communication system. Numerical results show that the proposed IRS channel estimation and reflection design can significantly improve the minimum received signal-to-noise ratio (SNR) among all users, as compared to existing power measurement based designs.
He Sun 0008, Weidong Mei, Lipeng Zhu 0001, Rui Zhang 0006
GLOBECOM1
2022 Reduced-Complexity Successive-Cancellation Decoding for Polar Codes on Channels With Insertions and Deletions
abstract
In this paper, a simplified successive cancellation (SC) decoding algorithm for polar codes on insertion/deletion error channels is proposed. First, the SC decoding is designed to decode polar codes on insertion/deletion channels and the joint weight distribution is derived to measure the occurrence probability of different scenarios. Some scenarios with small occurrence probability can be pruned to obtain lower decoding complexity with negligible performance loss. Inspired by this, a fixed pruning strategy (FPS) is proposed to reduce the decoding complexity, which can prune as many scenarios as possible with the given performance requirement. By exploiting the periodicity of the joint weight distribution, the upper bound of the block error rate of the pruned SC decoding is derived. Furthermore, according to the convergence of the upper bound, a dynamic self-adjusting pruning strategy is designed to further reduce the decoding complexity and improve the flexibility of the pruning algorithm. Simulation results show that the decoding complexity of the proposed pruning-based decoding algorithms is significantly reduced compared to the state-of-the-art scenario simplified SC decoding algorithm.
He Sun 0008, Rongke Liu, Kuangda Tian, Bin Dai 0004
IEEE Trans. Commun.1
2021 Deletion Error Correction based on Polar Codes in Skyrmion Racetrack Memory
abstract
Skyrmion racetrack memory (Sk-RM) is a new storage technology in which skyrmions are used to represent data bits to provide high storage density. During the reading procedure, the skyrmion is driven by a current and sensed by a fixed read head. However, synchronization errors may happen if the skyrmion does not pass the read head on time. In this paper, a polar coding scheme is proposed to correct the synchronization errors in the Sk-RM. Firstly, we build two error correction models for the reading operation of Sk-RM. By connecting polar codes with the marker codes, the number of deletion errors can be determined. We also redesign the decoding algorithm to recover the information bits from the readout sequence, where a tighter bound of the segmented deletion errors is derived and a novel parity check strategy is designed for better decoding performance. Simulation results show that the proposed coding scheme can efficiently improve the decoding performance.
He Sun 0008, Rongke Liu, Kuangda Tian, Tong Zou, Baoping Feng
WCNC1
2020 Simplified Successive-Cancellation List Decoding of Non-Binary Polar Codes with Rate-1 Node
abstract
In this paper, one of the constituent codes, Rate-1 node, is used to simplify Successive-Cancellation List (SCL) decoding of non-binary polar codes for reducing the decoding complexity. First, we derive the Logarithmic Likelihood Ratio based (LLR-based) path metric of non-binary polar codes in SCL decoding. Then we propose that the path metric only depends on the LLR value at the top of Rate-1 node tree, which avoids traversing a complete decoding tree in non-binary SCL decoding. Finally, we design a novel reliability metric, which is used to select the unreliable symbols from the LLRs at the top of Rate-1 node tree. By the proposed metric, we select the unreliable symbols to generate the candidate paths, which avoids splitting paths for all symbols of Rate-1 node in the conventional SCL decoding. Simulation results show that the proposed non-binary SCL decoding reduces significantly the computation and time complexity without the performance loss.
Baoping Feng, Rongke Liu, He Sun 0008
WCNC3