Fast-converging maximum-likelihood interference cancellation

M. Steiner, K. Gerlach
{"title":"Fast-converging maximum-likelihood interference cancellation","authors":"M. Steiner, K. Gerlach","doi":"10.1109/NRC.1998.677987","DOIUrl":null,"url":null,"abstract":"The use of adaptive linear techniques to solve signal processing problems is needed particularly when the environment external to the radar is not known a priori. Due to the lack of knowledge of the external environment, adaptive techniques require a certain amount of data to cancel the interference external to the radar or communication system. The amount of data required so that the performance of the adaptive processor is close (nominally within 3 dB) to the optimum is called the convergence time of the processor. The minimization of the convergence time is important since in many environments the external interference changes with time. Although there are heuristic techniques such as the loaded sample matrix inversion (LSMI) in the literature that provide fast convergence for particular problems, there is currently not a general solution for arbitrary interference that is derived via classical theory. In this paper, the authors derive a maximum-likelihood (ML) solution for a structured covariance matrix. The only structure assumed is that the thermal noise variance is known. Using this ML estimate, simulations show that the convergence is on the order of twice the number of narrow-band interference sources.","PeriodicalId":432418,"journal":{"name":"Proceedings of the 1998 IEEE Radar Conference, RADARCON'98. Challenges in Radar Systems and Solutions (Cat. No.98CH36197)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1998 IEEE Radar Conference, RADARCON'98. Challenges in Radar Systems and Solutions (Cat. No.98CH36197)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRC.1998.677987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

The use of adaptive linear techniques to solve signal processing problems is needed particularly when the environment external to the radar is not known a priori. Due to the lack of knowledge of the external environment, adaptive techniques require a certain amount of data to cancel the interference external to the radar or communication system. The amount of data required so that the performance of the adaptive processor is close (nominally within 3 dB) to the optimum is called the convergence time of the processor. The minimization of the convergence time is important since in many environments the external interference changes with time. Although there are heuristic techniques such as the loaded sample matrix inversion (LSMI) in the literature that provide fast convergence for particular problems, there is currently not a general solution for arbitrary interference that is derived via classical theory. In this paper, the authors derive a maximum-likelihood (ML) solution for a structured covariance matrix. The only structure assumed is that the thermal noise variance is known. Using this ML estimate, simulations show that the convergence is on the order of twice the number of narrow-band interference sources.
快速收敛的最大似然干扰消除
使用自适应线性技术来解决信号处理问题是必要的,特别是当雷达外部环境未知时。由于对外界环境缺乏了解,自适应技术需要一定的数据量来抵消雷达或通信系统外部的干扰。使自适应处理器的性能接近(名义上在3db以内)最优所需的数据量称为处理器的收敛时间。收敛时间的最小化是很重要的,因为在许多环境中,外部干扰随时间变化。虽然文献中有一些启发式技术,如加载样本矩阵反演(LSMI),可以为特定问题提供快速收敛,但目前还没有通过经典理论推导出任意干涉的一般解。本文给出了一个结构化协方差矩阵的最大似然解。唯一假设的结构是热噪声方差是已知的。利用这种ML估计,仿真结果表明,收敛性是窄带干扰源数量的两倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信