Yi Jiang
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
Research Subjects
Yi Jiang has a total of 84 co-authors. Here are the top co-authors by number of shared publications:
- Xin Wang
Fudan University
9 shared publications - Wei Zhang
Shanghai Institute of Microsystem and Information Technology and the Science and Technology on Micro-System Laboratory, Chinese Academy of Sciences, Shanghai, china
6 shared publications - Bin Zhou
Shanghai Institute of Microsystem and Information Technology and the Science and Technology on Micro-System Laboratory, Chinese Academy of Sciences, Shanghai, china
5 shared publications - Wanchen Hu
Key Laboratory for Information Science of Electromagnetic Waves (MoE), College of Future Information Technology, Fudan University, Shanghai, China
4 shared publications - Cheng Du
Department of Communication Science and Engineering, School of Information Science and Technology, Key Laboratory for Information Science of Electromagnetic Waves (MoE), Fudan University, Shanghai, China
3 shared publications - Tianyi Zhang
Department of Communication Science and Engineering, Key Laboratory for Information Science of Electromagnetic Waves (MoE), School of Information Science and Technology, Fudan University, Shanghai, China
3 shared publications
Latest Publications
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3557-3574
Complexity-Scalable Near-Optimal Transceiver Design for Massive MIMO-BICM Systems
The 6th generation (6G) and future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes crucial. In this paper, we propose a novel complexity-scalable transceiver design for MIMO systems exploiting bit-interleaved coded modulation (termed MIMO-BICM systems). The proposed scheme leverages the channel bidiagonalization decomposition (CBD), based on which an optimization framework for the precoder and post-processor is developed for maximizing the mutual information (MI) with finite-alphabet inputs. Particularly, we unveil that the desired precoder and post-processor behave distinctively different with respect to the operating signal-to-noise ratio (SNR), where the equivalent channel condition number (ECCN) serves as an effective indicator for the overall achievable rate performance. Specifically, at low SNRs, diagonal transmission with a large ECCN is advantageous, while at high SNRs, uniform subchannel gains with a small ECCN are preferred. This allows us to further propose a low-complexity generalized parallel CBD design (GP-CBD) based on the Givens rotation according to a well-approximated closed-form performance metric on the achievable rates that takes into account the insights from the ECCN. Numerical results validate the superior performance of the proposed scheme in terms of achievable rate and bit error rate (BER), compared to state-of-the-art designs across various modulation and coding schemes (MCSs).
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3557-3574
Complexity-Scalable Near-Optimal Transceiver Design for Massive MIMO-BICM Systems
The 6th generation (6G) and future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes crucial. In this paper, we propose a novel complexity-scalable transceiver design for MIMO systems exploiting bit-interleaved coded modulation (termed MIMO-BICM systems). The proposed scheme leverages the channel bidiagonalization decomposition (CBD), based on which an optimization framework for the precoder and post-processor is developed for maximizing the mutual information (MI) with finite-alphabet inputs. Particularly, we unveil that the desired precoder and post-processor behave distinctively different with respect to the operating signal-to-noise ratio (SNR), where the equivalent channel condition number (ECCN) serves as an effective indicator for the overall achievable rate performance. Specifically, at low SNRs, diagonal transmission with a large ECCN is advantageous, while at high SNRs, uniform subchannel gains with a small ECCN are preferred. This allows us to further propose a low-complexity generalized parallel CBD design (GP-CBD) based on the Givens rotation according to a well-approximated closed-form performance metric on the achievable rates that takes into account the insights from the ECCN. Numerical results validate the superior performance of the proposed scheme in terms of achievable rate and bit error rate (BER), compared to state-of-the-art designs across various modulation and coding schemes (MCSs).
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 7688-7702
Data-Assisted Channel Estimation and Prediction Using CRB-KF for mmWave Communications
This paper proposes a novel channel estimation and prediction framework for millimeter-wave (mmWave) communications. For time-invariant channels, we develop the fast Fourier transform - gradient descent (FFT-GD) algorithm, leveraging the channel sparsity to efficiently estimate the parameters, including the angles-of-arrival (AoAs) and the complex gains. To enhance estimation accuracy, we propose the data-assisted FFT-GD (DAFG) algorithm, which jointly performs data detection and channel estimation within an expectation-maximization (EM) framework. For time-variant channels, we innovate with a Cramér-Rao bound Kalman filter (CRB-KF)-based DAFG algorithm, incorporating an autoregressive (AR) model to exploit temporal correlations of the parameters for channel prediction. This approach effectively addresses the nonlinearity challenge associated with mmWave channel parameters, resulting in improved estimation accuracy. Simulation results show that both FFT-GD and DAFG methods approach the CRB, and the CRB-KF-based DAFG maintains channel estimation accuracy across multiple frames.
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 7688-7702
Data-Assisted Channel Estimation and Prediction Using CRB-KF for mmWave Communications
This paper proposes a novel channel estimation and prediction framework for millimeter-wave (mmWave) communications. For time-invariant channels, we develop the fast Fourier transform - gradient descent (FFT-GD) algorithm, leveraging the channel sparsity to efficiently estimate the parameters, including the angles-of-arrival (AoAs) and the complex gains. To enhance estimation accuracy, we propose the data-assisted FFT-GD (DAFG) algorithm, which jointly performs data detection and channel estimation within an expectation-maximization (EM) framework. For time-variant channels, we innovate with a Cramér-Rao bound Kalman filter (CRB-KF)-based DAFG algorithm, incorporating an autoregressive (AR) model to exploit temporal correlations of the parameters for channel prediction. This approach effectively addresses the nonlinearity challenge associated with mmWave channel parameters, resulting in improved estimation accuracy. Simulation results show that both FFT-GD and DAFG methods approach the CRB, and the CRB-KF-based DAFG maintains channel estimation accuracy across multiple frames.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14931-14944
Parametric MIMO-OFDM Channel Estimation: A Quasi Neural Network Approach
This paper presents a quasi-neural network (Quasi-NN) approach for parametric channel estimation in multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. A unified Quasi-NN framework is proposed for both the single-user (SU) and the multi-user (MU) scenarios, enabling the joint estimation of the direction of arrival, direction of departure, time delay, complex gain, and the number of multipaths. The artificial neural network-like structure of the Quasi-NN allows the application of the backpropagation algorithm while requiring only real-time pilot signals for online network training. Furthermore, considering the issue of high pilot overhead in MU MIMO-OFDM systems, we develop a location assisted Quasi-NN (LA-QNN) that utilizes a location-parameter database to reduce the pilot overhead while maintaining accurate channel estimation. Simulation results show that the proposed Quasi-NN approaches the Cramér Rao bound, and the proposed LA-QNN scheme provides a better balance between channel estimation performance and pilot overhead in the MU scenario.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14931-14944
Parametric MIMO-OFDM Channel Estimation: A Quasi Neural Network Approach
This paper presents a quasi-neural network (Quasi-NN) approach for parametric channel estimation in multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. A unified Quasi-NN framework is proposed for both the single-user (SU) and the multi-user (MU) scenarios, enabling the joint estimation of the direction of arrival, direction of departure, time delay, complex gain, and the number of multipaths. The artificial neural network-like structure of the Quasi-NN allows the application of the backpropagation algorithm while requiring only real-time pilot signals for online network training. Furthermore, considering the issue of high pilot overhead in MU MIMO-OFDM systems, we develop a location assisted Quasi-NN (LA-QNN) that utilizes a location-parameter database to reduce the pilot overhead while maintaining accurate channel estimation. Simulation results show that the proposed Quasi-NN approaches the Cramér Rao bound, and the proposed LA-QNN scheme provides a better balance between channel estimation performance and pilot overhead in the MU scenario.
- 15 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 601-616
Optimal Beamforming for MIMO DFRC Systems With Transmit Covariance Constraints
This paper optimizes the beamforming design of a downlink multiple-input multiple-output (MIMO) dual-function radar-communication (DFRC) system to maximize the weighted communication sum-rate under a prescribed transmit covariance constraint for radar performance guarantee. In the single-user case, we show that the transmit covariance constraint implies the existence of inherent orthogonality among the transmit beamforming vectors in use. Then, leveraging Cauchy’s interlace theorem, we derive the globally optimal transmit and receive beamforming solution in closed form. In the multi-user case, we exploit the connection between the weighted sum-rate and weighted minimum mean squared error (MMSE) to reformulate the intended problem, and develop a block-coordinate-descent (BCD) algorithm to iteratively compute the transmit beamforming and receive beamforming solutions. Under this approach, we reveal that the optimal receive beamforming is given by the classic MMSE one and the optimal transmit beamforming design amounts to solving an orthogonal Procrustes problem, thereby allowing for closed-form solutions to subproblems in each BCD step and fast convergence of the proposed algorithm to a high-quality (near-optimal) overall beamforming design. Numerical results demonstrate the superiority of our approach to the existing methods, with at least 40% higher sum-rate under a multi-user MIMO setting in the high signal-to-noise regime.
- 15 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 601-616
Optimal Beamforming for MIMO DFRC Systems With Transmit Covariance Constraints
This paper optimizes the beamforming design of a downlink multiple-input multiple-output (MIMO) dual-function radar-communication (DFRC) system to maximize the weighted communication sum-rate under a prescribed transmit covariance constraint for radar performance guarantee. In the single-user case, we show that the transmit covariance constraint implies the existence of inherent orthogonality among the transmit beamforming vectors in use. Then, leveraging Cauchy’s interlace theorem, we derive the globally optimal transmit and receive beamforming solution in closed form. In the multi-user case, we exploit the connection between the weighted sum-rate and weighted minimum mean squared error (MMSE) to reformulate the intended problem, and develop a block-coordinate-descent (BCD) algorithm to iteratively compute the transmit beamforming and receive beamforming solutions. Under this approach, we reveal that the optimal receive beamforming is given by the classic MMSE one and the optimal transmit beamforming design amounts to solving an orthogonal Procrustes problem, thereby allowing for closed-form solutions to subproblems in each BCD step and fast convergence of the proposed algorithm to a high-quality (near-optimal) overall beamforming design. Numerical results demonstrate the superiority of our approach to the existing methods, with at least 40% higher sum-rate under a multi-user MIMO setting in the high signal-to-noise regime.
- 12 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. PP (00906778) , 1
Quasi-Neural Network-based Decoder for Single-Carrier Communications
This paper proposes a novel algorithm, named a quasi-neural network-based decoder (QNN-decoder), for a single-carrier communication system. The algorithm is designed for an inter-symbol-interference (ISI) channel that a trellis diagram can model. According to the trellis diagram, a quasi-neural network (QNN) is built to acquire the likelihoods of the received samples enabling the subsequent decoding. The QNN-decoder differs from artificial neural network (ANN) based algorithms, such as the online learning trellis diagram (OLTD), as it doesn’t rely on data but instead utilizes the physical system model. This means the QNN-decoder can use a much shorter pilot to train its network via backpropagation than OLTD. Meanwhile, the QNN-decoder doesn’t require explicit channel state information (CSI) or statistics of interference and noise. Instead, it can efficiently suppress non-Gaussian interference by learning the CSI and interference and noise statistics. Simulation results verify the QNN-decoder outperforms the state-of-the-art methods and approaches the performance limits provided by the conventional Viterbi with perfect CSI in Gaussian noise only. The QNN-detector outperforms the conventional Viterbi and OLTD with non-Gaussian interference. A few redundant nodes make the QNN-decoder robust to channel length uncertainty, and it may be easily extended to a multi-antenna system for even greater interference suppression.
- 12 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. PP (00906778) , 1
Quasi-Neural Network-based Decoder for Single-Carrier Communications
This paper proposes a novel algorithm, named a quasi-neural network-based decoder (QNN-decoder), for a single-carrier communication system. The algorithm is designed for an inter-symbol-interference (ISI) channel that a trellis diagram can model. According to the trellis diagram, a quasi-neural network (QNN) is built to acquire the likelihoods of the received samples enabling the subsequent decoding. The QNN-decoder differs from artificial neural network (ANN) based algorithms, such as the online learning trellis diagram (OLTD), as it doesn’t rely on data but instead utilizes the physical system model. This means the QNN-decoder can use a much shorter pilot to train its network via backpropagation than OLTD. Meanwhile, the QNN-decoder doesn’t require explicit channel state information (CSI) or statistics of interference and noise. Instead, it can efficiently suppress non-Gaussian interference by learning the CSI and interference and noise statistics. Simulation results verify the QNN-decoder outperforms the state-of-the-art methods and approaches the performance limits provided by the conventional Viterbi with perfect CSI in Gaussian noise only. The QNN-detector outperforms the conventional Viterbi and OLTD with non-Gaussian interference. A few redundant nodes make the QNN-decoder robust to channel length uncertainty, and it may be easily extended to a multi-antenna system for even greater interference suppression.
- 7 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (6) , 3820-3832
Channel Estimation Considerate Precoder Design for Multi-User Massive MIMO-OFDM Systems: The Concept and Fast Algorithms
The sixth-generation (6G) communication networks target peak data rates exceeding 1Tbps, necessitating base stations (BS) to support up to 100 simultaneous data streams. However, sparse pilot allocation to accommodate such streams poses challenges for users’ channel estimation. This paper presents channel estimation considerate precoding (CECP), where BS precoders prioritize facilitating channel estimation alongside maximizing system throughput. To address the computational complexity of 6G large-scale multi-input multi-output (MIMO) systems, we propose a computationally-efficient space-time block diagonal channel shortening (ST-BDCS) precoding scheme. By leveraging the sparse Toeplitz property of orthogonal frequency division multiplexing (OFDM) channels, this time-domain precoding design effectively mitigates multi-user interference in the downlink and shortens the effective channel’s temporal length. Consequently, users can estimate the channels using sparse pilots. To enable fast implementation, we develop a generalized complex-valued Toeplitz matrix QR decomposition algorithm applicable to various space-time signal processing problems. Simulation results demonstrate that the ST-BDCS precoding method approximates the spectral efficiency performance of conventional subcarrier-by-subcarrier precoding schemes. However, it offers the advantages of accurate effective channel estimation for users and significantly reduced computational complexity for the BS.
- 7 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (6) , 3820-3832
Channel Estimation Considerate Precoder Design for Multi-User Massive MIMO-OFDM Systems: The Concept and Fast Algorithms
The sixth-generation (6G) communication networks target peak data rates exceeding 1Tbps, necessitating base stations (BS) to support up to 100 simultaneous data streams. However, sparse pilot allocation to accommodate such streams poses challenges for users’ channel estimation. This paper presents channel estimation considerate precoding (CECP), where BS precoders prioritize facilitating channel estimation alongside maximizing system throughput. To address the computational complexity of 6G large-scale multi-input multi-output (MIMO) systems, we propose a computationally-efficient space-time block diagonal channel shortening (ST-BDCS) precoding scheme. By leveraging the sparse Toeplitz property of orthogonal frequency division multiplexing (OFDM) channels, this time-domain precoding design effectively mitigates multi-user interference in the downlink and shortens the effective channel’s temporal length. Consequently, users can estimate the channels using sparse pilots. To enable fast implementation, we develop a generalized complex-valued Toeplitz matrix QR decomposition algorithm applicable to various space-time signal processing problems. Simulation results demonstrate that the ST-BDCS precoding method approximates the spectral efficiency performance of conventional subcarrier-by-subcarrier precoding schemes. However, it offers the advantages of accurate effective channel estimation for users and significantly reduced computational complexity for the BS.
- 1 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 21 (11) , 123-140
An optimal and fast precoding for RIS-assisted MIMO communications
In addition to conventional antenna-based array, the reconfigurable intelligent surface (RIS) holds promise as an alternative technology for manufacturing massive multi-input multi-output (MIMO) array for beyond 5G communications. This paper designs a fast algorithm to optimize the RIS-based MIMO precoder for maximizing the spectral efficiency, which includes the digital precoder and the RIS reflection phases. We evaluate the optimality of the algorithm by deriving an RIS channel capacity upper bound utilizing majorization theory. Our scheme can work for an RIS in both frequency flat and frequency selective channels, with either continuously or discretely tunable phases. The simulation results show that the proposed algorithm can achieve the capacity upper bound in some scenarios, which empirically proves its optimality. It is also shown that our algorithm is one-to-two orders of magnitude faster than the state-of-the-art methods in the literature.
- 1 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 21 (11) , 123-140
An optimal and fast precoding for RIS-assisted MIMO communications
In addition to conventional antenna-based array, the reconfigurable intelligent surface (RIS) holds promise as an alternative technology for manufacturing massive multi-input multi-output (MIMO) array for beyond 5G communications. This paper designs a fast algorithm to optimize the RIS-based MIMO precoder for maximizing the spectral efficiency, which includes the digital precoder and the RIS reflection phases. We evaluate the optimality of the algorithm by deriving an RIS channel capacity upper bound utilizing majorization theory. Our scheme can work for an RIS in both frequency flat and frequency selective channels, with either continuously or discretely tunable phases. The simulation results show that the proposed algorithm can achieve the capacity upper bound in some scenarios, which empirically proves its optimality. It is also shown that our algorithm is one-to-two orders of magnitude faster than the state-of-the-art methods in the literature.
- Open Access
SIMRP: Self-Interference Mitigation Using RIS and Phase Shifter Network
Strong self-interference due to the co-located transmitter is the bottleneck for implementing an in-band full-duplex (IBFD) system. If not adequately mitigated, the strong interference can saturate the receiver's analog-digital converters (ADCs) and hence void the digital processing. This paper considers utilizing a reconfigurable intelligent surface (RIS), together with a receiving (Rx) phase shifter network (PSN), to mitigate the strong self-interference through jointly optimizing their phases. This method, named self-interference mitigation using RIS and PSN (SIMRP), can suppress self-interference to avoid ADC saturation effectively and therefore improve the sum rate performance of communication systems, as verified by the simulation studies.
Open AccessSIMRP: Self-Interference Mitigation Using RIS and Phase Shifter Network
Strong self-interference due to the co-located transmitter is the bottleneck for implementing an in-band full-duplex (IBFD) system. If not adequately mitigated, the strong interference can saturate the receiver's analog-digital converters (ADCs) and hence void the digital processing. This paper considers utilizing a reconfigurable intelligent surface (RIS), together with a receiving (Rx) phase shifter network (PSN), to mitigate the strong self-interference through jointly optimizing their phases. This method, named self-interference mitigation using RIS and PSN (SIMRP), can suppress self-interference to avoid ADC saturation effectively and therefore improve the sum rate performance of communication systems, as verified by the simulation studies.
- 14 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (2) , 1157-1168
Distributed Downlink Precoding for Cell-Free Massive MIMO: A Quasi-Neural Network Approach
This paper proposes a novel downlink precoding method for a cell-free massive multiple-input multiple-output (CF-mMIMO) network, requiring no channel state information sharing between the access points via fronthaul links. By drawing analogies between a CF-mMIMO network and an artificial neural network, the proposed algorithm borrows the idea of backpropagation to train the precoders and the combiners through over-the-air ping-pong signaling between the access points and user equipments. It utilizes manifolds optimization to meet the per-AP power constraint and is named as distributed quasi-neural network precoding on manifold (DQNPM). The DQNPM algorithm can accommodate a large category of objective functions for fully distributed implementation. Numerical simulations show that our method outperforms the state-of-the-art approaches, and is robust against pilot contamination.
- 14 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (2) , 1157-1168
Distributed Downlink Precoding for Cell-Free Massive MIMO: A Quasi-Neural Network Approach
This paper proposes a novel downlink precoding method for a cell-free massive multiple-input multiple-output (CF-mMIMO) network, requiring no channel state information sharing between the access points via fronthaul links. By drawing analogies between a CF-mMIMO network and an artificial neural network, the proposed algorithm borrows the idea of backpropagation to train the precoders and the combiners through over-the-air ping-pong signaling between the access points and user equipments. It utilizes manifolds optimization to meet the per-AP power constraint and is named as distributed quasi-neural network precoding on manifold (DQNPM). The DQNPM algorithm can accommodate a large category of objective functions for fully distributed implementation. Numerical simulations show that our method outperforms the state-of-the-art approaches, and is robust against pilot contamination.
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 3819-3833
Broad Beam Designs for Broadcast Channels
In a massive multi-input multi-output (MIMO) cellular communication system, the conventional beam-sweeping scheme for common message broadcasting provides high beamforming gain but requires too many time slots due to the narrowness of the beams. To reduce the beam sweeping time while maintaining a sufficient beamforming gain, this paper focuses on designing broad beams with tunable beamwidths. First, by over-sampling a step-chirp analog signal, we construct a novel sequence family termed the generalized step-chirp (GSC) sequence with a simple closed-form expression, in which some parameters can be tuned to flexibly adjust the beamwidth and coarsen the phase resolution. The beamforming matrix of a uniform rectangular array (URA) of single–polarized antennas can be taken as the outer product of two GSC sequences. Second, by exploiting the full degree of freedom of URA of dual-polarized antennas, we further reduce the power variations in the passband by using a numerical algorithm. The algorithm can be drastically accelerated by exploiting the specific structure of the problem. Both schemes can be implemented using an analog phase shifter network (PSN) with finite resolution.
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 3819-3833
Broad Beam Designs for Broadcast Channels
In a massive multi-input multi-output (MIMO) cellular communication system, the conventional beam-sweeping scheme for common message broadcasting provides high beamforming gain but requires too many time slots due to the narrowness of the beams. To reduce the beam sweeping time while maintaining a sufficient beamforming gain, this paper focuses on designing broad beams with tunable beamwidths. First, by over-sampling a step-chirp analog signal, we construct a novel sequence family termed the generalized step-chirp (GSC) sequence with a simple closed-form expression, in which some parameters can be tuned to flexibly adjust the beamwidth and coarsen the phase resolution. The beamforming matrix of a uniform rectangular array (URA) of single–polarized antennas can be taken as the outer product of two GSC sequences. Second, by exploiting the full degree of freedom of URA of dual-polarized antennas, we further reduce the power variations in the passband by using a numerical algorithm. The algorithm can be drastically accelerated by exploiting the specific structure of the problem. Both schemes can be implemented using an analog phase shifter network (PSN) with finite resolution.