Adaptive  H  ∞ ‐array beamforming | Zendy

Chen YuanHwang | Zendy; Chang AnnChen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Adaptive H ∞ ‐array beamforming

Author(s) -

Chen YuanHwang,

Chang AnnChen

Publication year - 2000

Publication title -

microwave and optical technology letters

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.304

H-Index - 76

eISSN - 1098-2760

pISSN - 0895-2477

DOI - 10.1002/(sici)1098-2760(20000205)24:3<202::aid-mop17>3.0.co;2-j

Subject(s) - adaptive beamformer , beamforming , computer science , partition (number theory) , algorithm , convergence (economics) , electronic engineering , microwave , noise (video) , control theory (sociology) , engineering , mathematics , telecommunications , artificial intelligence , control (management) , combinatorics , economics , image (mathematics) , economic growth

This letter deals with adaptive H ∞ ‐array beamforming based on a generalized sidelobe canceler with and without a subweight partition scheme. It is shown that the adaptive H ∞ ‐beamformer with a subweight approach demonstrates the advantages of faster convergence speed, insensitivity to dynamic estimate error, and more suitable arbitrary noise signals compared to the conventional H ∞ adaptive algorithm and RLS‐based beamformer. Several computer simulation examples are provided to illustrate the effectiveness of the proposed technique. © 2000 John Wiley & Sons, Inc. Microwave Opt Technol Lett 24: 202–206, 2000.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research