Discrete-time signal processing
Discrete-time signal processing
SIAM Journal on Optimization
Convex Optimization
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
On robust Capon beamforming and diagonal loading
IEEE Transactions on Signal Processing
Antenna array pattern synthesis via convex optimization
IEEE Transactions on Signal Processing
Optimal array pattern synthesis using semidefinite programming
IEEE Transactions on Signal Processing
On the parameterization of positive real sequences and MA parameterestimation
IEEE Transactions on Signal Processing
Transmit beamforming for physical-layer multicasting
IEEE Transactions on Signal Processing - Part I
Robust adaptive beamformers based on worst-case optimization and constraints on magnitude response
IEEE Transactions on Signal Processing
A robust adaptive beamformer based on worst-case semi-definite programming
IEEE Transactions on Signal Processing
Hi-index | 0.09 |
Spectral factorization (SF) has been well developed for a uniformly sampled sequence (USS). Our recent study found important applications of SF for a non-uniformly sampled sequence (NUSS) in array processing, especially considering arbitrary arrays. Since SF for an arbitrarily sampled sequence is intractable, in this paper, we propose a new SF method for an integer-interval sampled sequence (IISS). Its applications in robust adaptive beamforming and array pattern synthesis for a non-uniform linear array (NULA) are studied. Simulation results show the outstanding performance of the proposed method.