Wei Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Wei Zhang has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Taejoon Kim
School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA
4 shared publications - David J. Love
Purdue University, West Lafayette, USA
2 shared publications - Wee Peng Tay
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
2 shared publications Yulong Gao
2 shared publications- Chengjie Li
Southwest Minzu University
1 shared publication - Enhao Chen
Shenzhen University
1 shared publication
Latest Publications
- 18 March 2025
- Published by Elsevier in Neurocomputing
- Vol. 636
Channel pruning for convolutional neural networks using l 0 -norm constraints
- 18 March 2025
- Published by Elsevier in Neurocomputing
- Vol. 636
Channel pruning for convolutional neural networks using l 0 -norm constraints
- Top Cited Papers
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (11) , 3089-3093
Channel Estimation for Movable-Antenna MIMO Systems via Tensor Decomposition
In this letter, we investigate the channel estimation problem for MIMO wireless communication systems with movable antennas (MAs) at both the transmitter (Tx) and receiver (Rx). To achieve high channel estimation accuracy with low pilot training overhead, we propose a tensor decomposition-based method for estimating the parameters of multi-path channel components, including their azimuth and elevation angles, as well as complex gain coefficients, thereby reconstructing the wireless channel between any pair of Tx and Rx MA positions in the Tx and Rx regions. First, we introduce a two-stage Tx-Rx successive antenna movement pattern for pilot training, such that the received pilot signals in both stages can be expressed as a third-order tensor. Then, we obtain the factor matrices of the tensor via the canonical polyadic decomposition, and thereby estimate the angle/gain parameters for enabling the channel reconstruction between arbitrary Tx/Rx MA positions. In addition, we analyze the uniqueness condition of the tensor decomposition, which ensures the complete channel reconstruction between the whole Tx and Rx regions based on the channel measurements at only a finite number of Tx/Rx MA positions. Finally, simulation results are presented to evaluate the proposed tensor decomposition-based method as compared to existing methods, in terms of channel estimation accuracy and pilot overhead.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (11) , 3089-3093
Top Cited PapersChannel Estimation for Movable-Antenna MIMO Systems via Tensor Decomposition
In this letter, we investigate the channel estimation problem for MIMO wireless communication systems with movable antennas (MAs) at both the transmitter (Tx) and receiver (Rx). To achieve high channel estimation accuracy with low pilot training overhead, we propose a tensor decomposition-based method for estimating the parameters of multi-path channel components, including their azimuth and elevation angles, as well as complex gain coefficients, thereby reconstructing the wireless channel between any pair of Tx and Rx MA positions in the Tx and Rx regions. First, we introduce a two-stage Tx-Rx successive antenna movement pattern for pilot training, such that the received pilot signals in both stages can be expressed as a third-order tensor. Then, we obtain the factor matrices of the tensor via the canonical polyadic decomposition, and thereby estimate the angle/gain parameters for enabling the channel reconstruction between arbitrary Tx/Rx MA positions. In addition, we analyze the uniqueness condition of the tensor decomposition, which ensures the complete channel reconstruction between the whole Tx and Rx regions based on the channel measurements at only a finite number of Tx/Rx MA positions. Finally, simulation results are presented to evaluate the proposed tensor decomposition-based method as compared to existing methods, in terms of channel estimation accuracy and pilot overhead.
- 4 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (10) , 15140-15155
A Novel Domain Transformation Based on Iterative Rotation for Linear Time-Variant Fading Channels
An effective precoding method stands as an imperative task, for the dynamic fluctuations inherent in fading channels that have a huge impact on communication systems. This paper introduces a novel transformation method for constructing a domain based on rotation matrices, termed Iterative Rotation Orthogonal Transformation (IROT). Our method centers on investigating the key factor in determining symbol decision accuracy, which is the distribution of noise energy superimposed on each symbol within a symbol block. The optimal distribution is influenced not only by channel fading but also by the average signal-to-noise ratio (SNR). By employing linear equalization, we quantitatively evaluate the impact of the domain transformation method on noise energy distribution. When the SNR surpasses a specific threshold, the symbol error rate (SER) reaches its minimum through the average allocation of noise energy. To achieve controllable adjustments of the noise energy, IROT constructs a unitary matrix by a double-layer iteration. Then we calculate the SNR threshold and analyze the complexity and convergence of IROT. Furthermore, we proposed the inverse balanced IROT to improve the SER performance at low SNR. The simulation results show the superior SER performance of IROT compared to other domain transformation and pre-equalization methods.
- 4 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (10) , 15140-15155
A Novel Domain Transformation Based on Iterative Rotation for Linear Time-Variant Fading Channels
An effective precoding method stands as an imperative task, for the dynamic fluctuations inherent in fading channels that have a huge impact on communication systems. This paper introduces a novel transformation method for constructing a domain based on rotation matrices, termed Iterative Rotation Orthogonal Transformation (IROT). Our method centers on investigating the key factor in determining symbol decision accuracy, which is the distribution of noise energy superimposed on each symbol within a symbol block. The optimal distribution is influenced not only by channel fading but also by the average signal-to-noise ratio (SNR). By employing linear equalization, we quantitatively evaluate the impact of the domain transformation method on noise energy distribution. When the SNR surpasses a specific threshold, the symbol error rate (SER) reaches its minimum through the average allocation of noise energy. To achieve controllable adjustments of the noise energy, IROT constructs a unitary matrix by a double-layer iteration. Then we calculate the SNR threshold and analyze the complexity and convergence of IROT. Furthermore, we proposed the inverse balanced IROT to improve the SER performance at low SNR. The simulation results show the superior SER performance of IROT compared to other domain transformation and pre-equalization methods.
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (2) , 2156-2170
Successful Recovery Performance Guarantees of SOMP Under the -Norm of Noise
The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. However, compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent, especially in the scenario of unbounded noise. In this paper, we present a new study based on the mutual incoherence property (MIP) for performance analysis of noisy SOMP when the measurement matrix and sparse signal are deterministic. Specifically, when noise is bounded, we provide the condition on which the exact support recovery is guaranteed in terms of the MIP. When noise is unbounded, we instead derive a bound on the successful recovery probability (SRP) that depends on the specific distribution of the $\ell _{2}$ -norm of the noise matrix. Then we focus on the typical case when noise is random Gaussian, and show that the lower bound of SRP follows Tracy-Widom law distribution. The analysis reveals the number of measurements, noise level, the number of sparse vectors, and the value of mutual coherence that are required to guarantee a predefined recovery performance. Theoretically, we show that the mutual coherence of the measurement matrix must decrease proportionally to the noise standard deviation, and the number of sparse vectors needs to grow proportionally to the noise variance. Finally, we extensively validate the derived analysis through numerical simulations.
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (2) , 2156-2170
Successful Recovery Performance Guarantees of SOMP Under the -Norm of Noise
The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. However, compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent, especially in the scenario of unbounded noise. In this paper, we present a new study based on the mutual incoherence property (MIP) for performance analysis of noisy SOMP when the measurement matrix and sparse signal are deterministic. Specifically, when noise is bounded, we provide the condition on which the exact support recovery is guaranteed in terms of the MIP. When noise is unbounded, we instead derive a bound on the successful recovery probability (SRP) that depends on the specific distribution of the $\ell _{2}$ -norm of the noise matrix. Then we focus on the typical case when noise is random Gaussian, and show that the lower bound of SRP follows Tracy-Widom law distribution. The analysis reveals the number of measurements, noise level, the number of sparse vectors, and the value of mutual coherence that are required to guarantee a predefined recovery performance. Theoretically, we show that the mutual coherence of the measurement matrix must decrease proportionally to the noise standard deviation, and the number of sparse vectors needs to grow proportionally to the noise variance. Finally, we extensively validate the derived analysis through numerical simulations.
- 18 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (12) , 8859-8875
Approximate Maximum-Likelihood RIS-Aided Positioning
A reconfigurable intelligent surface (RIS) allows a reflection transmission path between a base station (BS) and user equipment (UE). In wireless localization, this reflection path aids in positioning accuracy, especially when the line-of-sight (LOS) path is subject to severe blockage and fading. In this paper, we develop a RIS-aided positioning framework to locate a UE in environments where the LOS path may or may not be available. We first estimate the RIS-aided channel parameters from the received signals at the UE. To infer the UE position and clock bias from the estimated channel parameters, we propose a fusion method consisting of weighted least squares over the estimates of the LOS and reflection paths. We show that this approximates the maximum likelihood estimator under the large-sample regime and when the estimates from different paths are independent. We then optimize the RIS phase shifts to improve the positioning accuracy and extend the proposed approach to the case with multiple BSs and UEs. We derive Cramér–Rao bound (CRB) and demonstrate numerically that our proposed positioning method approaches the CRB.
- 18 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (12) , 8859-8875
Approximate Maximum-Likelihood RIS-Aided Positioning
A reconfigurable intelligent surface (RIS) allows a reflection transmission path between a base station (BS) and user equipment (UE). In wireless localization, this reflection path aids in positioning accuracy, especially when the line-of-sight (LOS) path is subject to severe blockage and fading. In this paper, we develop a RIS-aided positioning framework to locate a UE in environments where the LOS path may or may not be available. We first estimate the RIS-aided channel parameters from the received signals at the UE. To infer the UE position and clock bias from the estimated channel parameters, we propose a fusion method consisting of weighted least squares over the estimates of the LOS and reflection paths. We show that this approximates the maximum likelihood estimator under the large-sample regime and when the estimates from different paths are independent. We then optimize the RIS phase shifts to improve the positioning accuracy and extend the proposed approach to the case with multiple BSs and UEs. We derive Cramér–Rao bound (CRB) and demonstrate numerically that our proposed positioning method approaches the CRB.
- 20 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (6) , 4063-4077
MMV-Based Sequential AoA and AoD Estimation for Millimeter Wave MIMO Channels
The fact that the millimeter-wave (mmWave) multiple-input multiple-output (MIMO) channel has sparse support in the spatial domain has motivated recent compressed sensing (CS)-based mmWave channel estimation methods, where the angles of arrivals (AoAs) and angles of departures (AoDs) are quantized using angle dictionary matrices. However, the existing CS-based methods usually obtain the estimation result through one-stage channel sounding that have two limitations: (i) the requirement of large-dimensional dictionary and (ii) unresolvable quantization error. These two drawbacks are irreconcilable; improvement of the one implies deterioration of the other. To address these challenges, we propose, in this paper, a two-stage method to estimate the AoAs and AoDs of mmWave channels. In the proposed method, the channel estimation task is divided into two stages, Stage I and Stage II. Specifically, in Stage I, the AoAs are estimated by solving a multiple measurement vectors (MMV) problem. In Stage II, based on the estimated AoAs, the receive sounders are designed to estimate AoDs. The dimension of the angle dictionary in each stage can be reduced, which in turn reduces the computational complexity substantially. We then analyze the successful recovery probability (SRP) of the proposed method, revealing the superiority of the proposed framework over the existing one-stage CS-based methods. We further enhance the reconstruction performance by performing resource allocation between the two stages. We also overcome the unresolvable quantization error issue present in the prior techniques by applying the atomic norm minimization method to each stage of the proposed two-stage approach. The simulation results illustrate the substantially improved performance with low complexity of the proposed two-stage method.
- 20 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (6) , 4063-4077
MMV-Based Sequential AoA and AoD Estimation for Millimeter Wave MIMO Channels
The fact that the millimeter-wave (mmWave) multiple-input multiple-output (MIMO) channel has sparse support in the spatial domain has motivated recent compressed sensing (CS)-based mmWave channel estimation methods, where the angles of arrivals (AoAs) and angles of departures (AoDs) are quantized using angle dictionary matrices. However, the existing CS-based methods usually obtain the estimation result through one-stage channel sounding that have two limitations: (i) the requirement of large-dimensional dictionary and (ii) unresolvable quantization error. These two drawbacks are irreconcilable; improvement of the one implies deterioration of the other. To address these challenges, we propose, in this paper, a two-stage method to estimate the AoAs and AoDs of mmWave channels. In the proposed method, the channel estimation task is divided into two stages, Stage I and Stage II. Specifically, in Stage I, the AoAs are estimated by solving a multiple measurement vectors (MMV) problem. In Stage II, based on the estimated AoAs, the receive sounders are designed to estimate AoDs. The dimension of the angle dictionary in each stage can be reduced, which in turn reduces the computational complexity substantially. We then analyze the successful recovery probability (SRP) of the proposed method, revealing the superiority of the proposed framework over the existing one-stage CS-based methods. We further enhance the reconstruction performance by performing resource allocation between the two stages. We also overcome the unresolvable quantization error issue present in the prior techniques by applying the atomic norm minimization method to each stage of the proposed two-stage approach. The simulation results illustrate the substantially improved performance with low complexity of the proposed two-stage method.
- 25 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (11) , 2562-2566
Cost-Efficient RIS-Aided Channel Estimation via Rank-One Matrix Factorization
A reconfigurable intelligent surface (RIS) consists of massive meta elements, which can improve the performance of future wireless communication systems. Existing RIS-aided channel estimation methods try to estimate the cascaded channel directly, incurring high computational and training overhead especially when the number of elements of RIS is extremely large. In this letter, we propose a cost-efficient channel estimation method via rank-one matrix factorization (MF). Specifically, if the RIS is employed near base station (BS), it is found that the RIS-aided channel can be factorized into a product of low-dimensional matrices. To estimate these factorized matrices, we propose alternating minimization and gradient descent approaches to obtain the near optimal solutions. Compared to directly estimating the cascaded channel, the proposed MF method reduces training overhead substantially. Finally, the numerical simulations show the effectiveness of the proposed MF method.
- 25 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (11) , 2562-2566
Cost-Efficient RIS-Aided Channel Estimation via Rank-One Matrix Factorization
A reconfigurable intelligent surface (RIS) consists of massive meta elements, which can improve the performance of future wireless communication systems. Existing RIS-aided channel estimation methods try to estimate the cascaded channel directly, incurring high computational and training overhead especially when the number of elements of RIS is extremely large. In this letter, we propose a cost-efficient channel estimation method via rank-one matrix factorization (MF). Specifically, if the RIS is employed near base station (BS), it is found that the RIS-aided channel can be factorized into a product of low-dimensional matrices. To estimate these factorized matrices, we propose alternating minimization and gradient descent approaches to obtain the near optimal solutions. Compared to directly estimating the cascaded channel, the proposed MF method reduces training overhead substantially. Finally, the numerical simulations show the effectiveness of the proposed MF method.
- 1 October 2019
- Published by Elsevier in Signal Processing
- Vol. 163, 123-131
Leveraging subspace information for low-rank matrix reconstruction
- 1 October 2019
- Published by Elsevier in Signal Processing
- Vol. 163, 123-131
Leveraging subspace information for low-rank matrix reconstruction
- Open Access
- 1 January 2019
- Published by Infocommunications Journal in Infocommunications journal
- No. 1,p. 38-44
Minimum BER Criterion Based Robust Blind Separation for MIMO Systems
- 1 January 2019
- Published by Infocommunications Journal in Infocommunications journal
- No. 1,p. 38-44
Open AccessMinimum BER Criterion Based Robust Blind Separation for MIMO Systems
- 10 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (11) , 5814-5827
Leveraging the Restricted Isometry Property: Improved Low-Rank Subspace Decomposition for Hybrid Millimeter-Wave Systems
Communication at millimeter wave frequencies will be one of the essential new technologies in 5G. Acquiring an accurate channel estimate is the key to facilitate advanced millimeter wave hybrid multiple-input multiple-output (MIMO) precoding techniques. Millimeter wave MIMO channel estimation, however, suffers from a considerably increased channel use overhead. This happens due to the limited number of radio frequency (RF) chains that prevent the digital baseband from directly accessing the signal at each antenna. To address this issue, recent research has focused on adaptive closed-loop and two-way channel estimation techniques. In this paper, unlike the prior approaches, we study a non-adaptive, hence rather simple, open-loop millimeter wave MIMO channel estimation technique. We present a random phase rotation design of channel subspace sampling signals and show that they obey the restricted isometry property (RIP) with high probability. We then formulate the channel estimation as a low-rank subspace decomposition problem and, based on the RIP, show that the proposed framework reveals resilience to a low signal-to-noise ratio. It is revealed that the required number of channel uses ensuring a bounded estimation error is linearly proportional to the degrees of freedom of the channel, whereas it converges to a constant value if the number of RF chains can grow proportionally to the channel dimension while keeping the channel rank fixed. In particular, we show that the tighter the RIP characterization the lower the channel estimation error is. We also devise an iterative technique that effectively finds a suboptimal, but stationary, solution to the formulated problem. The proposed technique is shown to have improved channel estimation accuracy with a substantially low channel use overhead as compared to that of previous closed-loop and two-way adaptation techniques.
- 10 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (11) , 5814-5827
Leveraging the Restricted Isometry Property: Improved Low-Rank Subspace Decomposition for Hybrid Millimeter-Wave Systems
Communication at millimeter wave frequencies will be one of the essential new technologies in 5G. Acquiring an accurate channel estimate is the key to facilitate advanced millimeter wave hybrid multiple-input multiple-output (MIMO) precoding techniques. Millimeter wave MIMO channel estimation, however, suffers from a considerably increased channel use overhead. This happens due to the limited number of radio frequency (RF) chains that prevent the digital baseband from directly accessing the signal at each antenna. To address this issue, recent research has focused on adaptive closed-loop and two-way channel estimation techniques. In this paper, unlike the prior approaches, we study a non-adaptive, hence rather simple, open-loop millimeter wave MIMO channel estimation technique. We present a random phase rotation design of channel subspace sampling signals and show that they obey the restricted isometry property (RIP) with high probability. We then formulate the channel estimation as a low-rank subspace decomposition problem and, based on the RIP, show that the proposed framework reveals resilience to a low signal-to-noise ratio. It is revealed that the required number of channel uses ensuring a bounded estimation error is linearly proportional to the degrees of freedom of the channel, whereas it converges to a constant value if the number of RF chains can grow proportionally to the channel dimension while keeping the channel rank fixed. In particular, we show that the tighter the RIP characterization the lower the channel estimation error is. We also devise an iterative technique that effectively finds a suboptimal, but stationary, solution to the formulated problem. The proposed technique is shown to have improved channel estimation accuracy with a substantially low channel use overhead as compared to that of previous closed-loop and two-way adaptation techniques.