Fast DOA estimation algorithm for improving performance of SPT-LCMV beamformer

Jung-Tae Kim, Sung-Hoon Moon, J. Jo, D. Han, Myeong-Je Cho
{"title":"Fast DOA estimation algorithm for improving performance of SPT-LCMV beamformer","authors":"Jung-Tae Kim, Sung-Hoon Moon, J. Jo, D. Han, Myeong-Je Cho","doi":"10.1109/MILCOM.2003.1290426","DOIUrl":null,"url":null,"abstract":"To eliminate coherent interferences, a conventional split polarity transformation-linearly constrained minimum variance (SPT-LCMV) beamformer uses the SPT matrix to remove any correlation between the desired signal and coherent interferences. After removing the correlation, an LCMV beamforming is applied to obtain the desired signal. However, it needs to estimate direction of arrivals (DOAs) for all coherent interferences. Conventional algorithms to estimate the DOAs of coherent interferences are computationally complexity. Moreover, the performance of the SPT-LCMV beamformer degraded severely as the estimated DOA errors increased. Accordingly, high-order constraints are required to compensate the DOA estimation errors. As a result, the SPT-LCMV beamformer needs many array elements in proportion to the number of the constraints applied to generate the SPT matrix. This paper proposes a DOA estimation algorithm to overcome the disadvantages of the SPT-LCMV beamformer. The proposed algorithm has a significantly reduced computational complexity and can also reduce the number of the high-order constraints compared to the conventional DOA estimation algorithms.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Military Communications Conference, 2003. MILCOM 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2003.1290426","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

To eliminate coherent interferences, a conventional split polarity transformation-linearly constrained minimum variance (SPT-LCMV) beamformer uses the SPT matrix to remove any correlation between the desired signal and coherent interferences. After removing the correlation, an LCMV beamforming is applied to obtain the desired signal. However, it needs to estimate direction of arrivals (DOAs) for all coherent interferences. Conventional algorithms to estimate the DOAs of coherent interferences are computationally complexity. Moreover, the performance of the SPT-LCMV beamformer degraded severely as the estimated DOA errors increased. Accordingly, high-order constraints are required to compensate the DOA estimation errors. As a result, the SPT-LCMV beamformer needs many array elements in proportion to the number of the constraints applied to generate the SPT matrix. This paper proposes a DOA estimation algorithm to overcome the disadvantages of the SPT-LCMV beamformer. The proposed algorithm has a significantly reduced computational complexity and can also reduce the number of the high-order constraints compared to the conventional DOA estimation algorithms.
提高SPT-LCMV波束形成器性能的快速DOA估计算法
为了消除相干干扰,传统的分裂极性变换-线性约束最小方差(SPT- lcmv)波束形成器使用SPT矩阵去除所需信号和相干干扰之间的任何相关性。在去除相关后,应用LCMV波束形成获得所需信号。然而,它需要估计所有相干干扰的到达方向(DOAs)。传统的相干干涉doa估计算法计算量大。此外,随着估计DOA误差的增加,SPT-LCMV波束形成器的性能严重下降。因此,需要高阶约束来补偿DOA估计误差。因此,SPT- lcmv波束形成器需要的阵列元素数量与用于生成SPT矩阵的约束数量成比例。针对SPT-LCMV波束形成器的缺点,提出了一种DOA估计算法。与传统的DOA估计算法相比,该算法大大降低了计算复杂度,并且可以减少高阶约束的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信