Wideband Beampattern Synthesis Using Single Digital Beamformer With Integer Time Delay Filters

Existing wideband beampattern synthesis methods usually require multiple beamformers, each corresponding to one frequency bin, which results in excessive resource consumption in engineering practice. To alleviate the resource consumption of wideband array beamforming, we propose a novel time-domain...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on antennas and propagation Ročník 70; číslo 5; s. 3437 - 3449
Hlavní autoři: Lu, Qinghui, Cui, Guolong, Liu, Ruitao, Yu, Xianxiang, Wang, Xiangrong, Kong, Lingjiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Alternating optimization (AO) algorithm
Approximation algorithms
Array signal processing
Beamforming
Broadband
Consumption
convex approximation (CA) algorithm
Integers
interference nulling
Mathematical analysis
nonconvex optimization
Optimization
Polynomials
Synthesis
Time domain analysis
Time lag
Time-frequency analysis
White noise
Wideband
wideband digital beamformer (DBF)
ISSN:0018-926X, 1558-2221
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Existing wideband beampattern synthesis methods usually require multiple beamformers, each corresponding to one frequency bin, which results in excessive resource consumption in engineering practice. To alleviate the resource consumption of wideband array beamforming, we propose a novel time-domain wideband digital beamformer that can control the beam shape over the whole bandwidth for interference mitigation by using only one set of amplitude-phase weights and integer time delay filters. To tackle the resultant optimization problem, two effective algorithms are introduced, and both can solve the problem within polynomial time. One is an alternating optimization algorithm that decomposes the original problem into multiple tractable subproblems iteratively. The other is the convex approximation algorithm that transforms the original problem into a series of second-order cone programming problems iteratively. The two algorithms exhibit their respective advantages in terms of convergence and computational complexity. Extensive numerical examples are presented to evaluate the proposed time-domain wideband beamforming strategy, highlighting that it can form a deep notch in any interested spatial-spectral region to suppress the strong interferences.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2021.3137460