.png){kind=icon}
.png){kind=icon}
Return
Spectral factorization for integer-interval sampled sequence and its applications in array processing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2008.01.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2008 Elsevier B.V. All rights reserved.
Keywords:
adaptive beamforming
array pattern synthesis
spectral factorization
constraints on magnitude response
non-uniformly sampled sequence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W