The recursive constant modulus algorithm; a new approach for real-time array processing

R. Pickholtz, K. Elbarbary
{"title":"The recursive constant modulus algorithm; a new approach for real-time array processing","authors":"R. Pickholtz, K. Elbarbary","doi":"10.1109/ACSSC.1993.342594","DOIUrl":null,"url":null,"abstract":"The constant modulus algorithm (CMA) has proved its ability to compensate the severe effect of the multipath interference and co-channel signals on the constant modulus signals. The application limitation of the CMA is mainly due to its slow rate of convergence. The paper presents a new algorithm which keeps the desired properties of the original CMA while it reduces the time required for convergence on the expense of some added mathematical complexity. The algorithm shows stable operations in both cases of compensating the effect of the multipath interference by an adaptive correction filter and separation of cochannel signals by an adaptive array followed by a signal canceler. The proposed algorithm is an order of magnitude faster than the original CMA on the average.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1993.342594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

The constant modulus algorithm (CMA) has proved its ability to compensate the severe effect of the multipath interference and co-channel signals on the constant modulus signals. The application limitation of the CMA is mainly due to its slow rate of convergence. The paper presents a new algorithm which keeps the desired properties of the original CMA while it reduces the time required for convergence on the expense of some added mathematical complexity. The algorithm shows stable operations in both cases of compensating the effect of the multipath interference by an adaptive correction filter and separation of cochannel signals by an adaptive array followed by a signal canceler. The proposed algorithm is an order of magnitude faster than the original CMA on the average.<>
递归常模算法;一种实时阵列处理的新方法
恒模算法(CMA)已被证明能够补偿多径干扰和同信道信号对恒模信号的严重影响。CMA的应用局限性主要在于其收敛速度慢。本文提出了一种新的算法,该算法在保持原CMA的预期性能的同时,以增加数学复杂度为代价,减少了收敛所需的时间。该算法通过自适应校正滤波器补偿多径干扰的影响,通过自适应阵列和信号消去器分离共信道信号,均表现出稳定的运行效果。该算法的平均速度比原始的CMA算法快一个数量级
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信