1-Bit Sparse Gridless Super-Resolution Doa Estimation For Coprime Arrays

Anupama Govinda Raj, J. McClellan
{"title":"1-Bit Sparse Gridless Super-Resolution Doa Estimation For Coprime Arrays","authors":"Anupama Govinda Raj, J. McClellan","doi":"10.1109/IEEECONF44664.2019.9048961","DOIUrl":null,"url":null,"abstract":"Direction of Arrival (DOA) estimation using 1-bit analog-to-digital converters (ADCs) offers significant cost, power, and hardware complexity reduction for sensor arrays. We propose a 1-bit sparse super-resolution DOA method for coprime arrays to achieve search-free DOA estimation, under the assumption of uncorrelated sources. The approach extends gridless DOA estimation for coprime arrays based on sparse super-resolution (SR) theory to 1-bit measurements. Using the arcsine law, a scaled version of the full precision covariance matrix can be recovered from the 1-bit data. The vectorized covariance matrix becomes the effective measurements from the coprime virtual array, and then the DOA estimation problem is expressed as an infinite-dimensional atomic norm minimization problem in the continuous angle domain. The corresponding dual problem is converted to a finite semidefinite program with linear matrix inequality constraints, that is solvable in polynomial time. Finally, the search-free DOA estimates are obtained using the unit-circle zeros of a nonnegative polynomial formed from the dual polynomial, followed by an ℓ1 norm minimization. The angular resolution and accuracy of the proposed method is compared to state-of-the-art approaches such as 1-bit and full-precision versions of spatially smoothed MUSIC and a discrete offgrid method, as well as the full-precision gridless SR method.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"120 1","pages":"108-112"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEECONF44664.2019.9048961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Direction of Arrival (DOA) estimation using 1-bit analog-to-digital converters (ADCs) offers significant cost, power, and hardware complexity reduction for sensor arrays. We propose a 1-bit sparse super-resolution DOA method for coprime arrays to achieve search-free DOA estimation, under the assumption of uncorrelated sources. The approach extends gridless DOA estimation for coprime arrays based on sparse super-resolution (SR) theory to 1-bit measurements. Using the arcsine law, a scaled version of the full precision covariance matrix can be recovered from the 1-bit data. The vectorized covariance matrix becomes the effective measurements from the coprime virtual array, and then the DOA estimation problem is expressed as an infinite-dimensional atomic norm minimization problem in the continuous angle domain. The corresponding dual problem is converted to a finite semidefinite program with linear matrix inequality constraints, that is solvable in polynomial time. Finally, the search-free DOA estimates are obtained using the unit-circle zeros of a nonnegative polynomial formed from the dual polynomial, followed by an ℓ1 norm minimization. The angular resolution and accuracy of the proposed method is compared to state-of-the-art approaches such as 1-bit and full-precision versions of spatially smoothed MUSIC and a discrete offgrid method, as well as the full-precision gridless SR method.
一种1位稀疏无网格的超分辨率互素阵列Doa估计
使用1位模数转换器(adc)的到达方向(DOA)估计为传感器阵列提供了显着的成本,功耗和硬件复杂性降低。提出了一种1位稀疏超分辨率的协素数阵列DOA估计方法,在不相关源假设下实现了无搜索DOA估计。该方法将基于稀疏超分辨率(SR)理论的互素阵列无网格DOA估计扩展到1位测量。使用反正弦定律,可以从1位数据中恢复全精度协方差矩阵的缩放版本。将矢量化的协方差矩阵作为对虚阵的有效度量,将DOA估计问题表示为连续角域中的无限维原子范数最小化问题。将相应的对偶问题转化为具有线性矩阵不等式约束的有限半定规划,在多项式时间内可解。最后,利用由对偶多项式形成的非负多项式的单位圆零点得到了无搜索的DOA估计,然后进行了1范数最小化。该方法的角分辨率和精度与最先进的方法进行了比较,如1位和全精度版本的空间平滑MUSIC和离散离网格方法,以及全精度无网格SR方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信