用户名: 密码: 验证码:
最差性能最优的波束形成算法与敏度分析
详细信息    查看官网全文
摘要
随着阵列信号处理的发展,波束形成技术已成为声纳信号处理的一个重要组成部分。目前,寻求高效快速的稳健波束形成算法是许多研究者追求的目标之一。本文提出一个想法,将最差性能最优的波束形成器置于约束最小二乘框架下研究。为避免求解长期方程,进一步提高算法的计算效率,减少计算量,本文给出一个简单的计算近似最优加载量的公式。与现有的一些算法相比,基于约束最小二乘的算法在提高计算效率的同时还保持了优良的稳健波束形成器输出性能。同时,本文把最差性能最优的波束形成器的敏度分析归结为约束最小二乘问题的扰动分析,给出了相应的条件数,从而得到一些对设计稳健波束形成器有指导意义的结论。
With the development of array signal processing, beamforming has been an important part of sonar signal processing. At present, many researchers are trying to study highly efficient algorithms for robust beamforming. This paper putts forward an idea that investigating the worst-caseoptimization beamformer under the frame of least squares(LS) with constraints. To avoid solving secular equation, enhance computational efficiency further and reduce operations, this paper gives a simple approximate formula for computing the optimum loading factor. Compared with some existing algorithms, these derived algorithm based on LS with constraints enhance computational efficiency and keep up excellent output performance of robust beamformer. Meanwhile, this paper reduces the sensitive analysis of the worst-case optimization beamformer to perturbation analysis of least squares(LS) problems with constraints, gives condition number correspondingly, and therefore derives some constructive conclusions for designing robust beamformers.
引文
[1]何挺.阵列稳健波束形成算法研究[D].西安:西安电子科技大学,2014.23-28.HE T.Research on Array robust beamforming algorithms[D].Xian:Xi Dian University,2014.23-28.
    [2]刘聪锋,廖桂生.最差性能最优的稳健波束形成算法[J].西安电子科技大学学报,2010;37(1):1-7.LIU C F,LIAO G S.Robust Beamforming Algorithm for Worst-case Optimization[J].Journal of Xi Dian University,2010;37(1):1-7.
    [3]郭鑫,葛凤翔,任岁玲,郭良浩.一种最差情况下性能最优化的特征分析自适应波束形成方法[J].声学学报,2015;(2):187-197.GUO X,GE F X,REN S L,GUO L H.An adaptive beamforming method for characteristic analysis of the worst-case performance optimization[J].Acta Acustica,2015;(2):187-197.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700