Comparison of MUSIC Variants for Sparse Arrays

K. Adhikari, Benjamin Drozdenko
{"title":"Comparison of MUSIC Variants for Sparse Arrays","authors":"K. Adhikari, Benjamin Drozdenko","doi":"10.1109/NAECON46414.2019.9058169","DOIUrl":null,"url":null,"abstract":"Nested and coprime arrays have high degrees of freedom that can be exploited in direction of arrival estimation using various algorithms. Most algorithms use a combination of product processing, min processing, and MUSIC. We show that direct MUSIC with unbiased autocorrelations estimates is superior to other algorithms.","PeriodicalId":193529,"journal":{"name":"2019 IEEE National Aerospace and Electronics Conference (NAECON)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE National Aerospace and Electronics Conference (NAECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAECON46414.2019.9058169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Nested and coprime arrays have high degrees of freedom that can be exploited in direction of arrival estimation using various algorithms. Most algorithms use a combination of product processing, min processing, and MUSIC. We show that direct MUSIC with unbiased autocorrelations estimates is superior to other algorithms.
稀疏数组MUSIC变量的比较
嵌套数组和互素数数组具有高度的自由度,可以使用各种算法在到达方向估计中加以利用。大多数算法使用产品处理、最小处理和MUSIC的组合。我们证明了具有无偏自相关估计的直接MUSIC优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信