Adaptive sequential refinement: A tractable approach for ambiguity function shaping in cognitive radar

Omar Aldayel, Tiantong Guo, V. Monga, M. Rangaswamy
{"title":"Adaptive sequential refinement: A tractable approach for ambiguity function shaping in cognitive radar","authors":"Omar Aldayel, Tiantong Guo, V. Monga, M. Rangaswamy","doi":"10.1109/ACSSC.2017.8335406","DOIUrl":null,"url":null,"abstract":"Ambiguity function shaping continues to be one of the most challenging open problems in cognitive radar. Analytically, a complex quartic function should be optimized as a function of the radar waveform code. Practical considerations further require that the waveform be constant modulus, which exacerbates the issue and leads to a hard non-convex problem. We develop a new approach called Adaptive Sequential Refinement (ASR) to suppress the clutter returns for a desired range-Doppler, i.e. ambiguity function response. ASR solves the aforementioned optimization problem in a unique iterative manner such that the formulation is updated depending on the iteration index. We establish formally that: 1.) the problem in each step of the iteration has a closed form solution, and 2.) monotonic decrease of the cost function until convergence is guaranteed. Experimental validation shows that ASR produces a radar waveform with higher Signal to Interference Ratio (SIR) and superior ambiguity function shaping than state of the art alternatives even as its computational burden is orders of magnitude lower.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Ambiguity function shaping continues to be one of the most challenging open problems in cognitive radar. Analytically, a complex quartic function should be optimized as a function of the radar waveform code. Practical considerations further require that the waveform be constant modulus, which exacerbates the issue and leads to a hard non-convex problem. We develop a new approach called Adaptive Sequential Refinement (ASR) to suppress the clutter returns for a desired range-Doppler, i.e. ambiguity function response. ASR solves the aforementioned optimization problem in a unique iterative manner such that the formulation is updated depending on the iteration index. We establish formally that: 1.) the problem in each step of the iteration has a closed form solution, and 2.) monotonic decrease of the cost function until convergence is guaranteed. Experimental validation shows that ASR produces a radar waveform with higher Signal to Interference Ratio (SIR) and superior ambiguity function shaping than state of the art alternatives even as its computational burden is orders of magnitude lower.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自适应序列细化:认知雷达中模糊函数形成的一种易于处理的方法
模糊函数的形成一直是认知雷达中最具挑战性的开放性问题之一。解析上,应将复四次函数优化为雷达波形码的函数。实际考虑进一步要求波形是恒定模量,这加剧了问题并导致了一个困难的非凸问题。我们开发了一种新的方法,称为自适应序列细化(ASR)来抑制杂波回波的期望距离-多普勒,即模糊函数响应。ASR以独特的迭代方式解决上述优化问题,使得公式根据迭代索引更新。我们正式证明:1.)迭代每一步的问题都有一个封闭形式的解,2.)代价函数单调递减直到保证收敛。实验验证表明,ASR产生的雷达波形具有更高的信干扰比(SIR)和优越的模糊函数塑造,即使其计算负担低了几个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
milliProxy: A TCP proxy architecture for 5G mmWave cellular systems Joint user scheduling and power optimization in full-duplex cells with successive interference cancellation Deep neural network architectures for modulation classification Towards provably invisible network flow fingerprints Seeded graph matching: Efficient algorithms and theoretical guarantees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1