Channel estimation for CDMA systems using iterative cancellations

D. Borah
{"title":"Channel estimation for CDMA systems using iterative cancellations","authors":"D. Borah","doi":"10.1109/GLOCOM.2004.1378456","DOIUrl":null,"url":null,"abstract":"A matching pursuit followed by cancellation (MPC) algorithm is investigated for time-varying multipath channel estimation in asynchronous CDMA. The algorithm has significantly low computational complexity and consists of two steps. In the first step, a basic matching pursuit algorithm that identifies the strongest channel taps, and successively cancels them, is used. The second step of the algorithm uses the already estimated channel taps to remove interference from the received vector in order to identify the channel coefficients more accurately. The performance of the algorithm is characterized in terms of mean squared identification error (MSIE). The convergence behavior of MPC is described. A method to terminate the MP step of the algorithm successfully is proposed and is shown to perform well. Our results show that MPC achieves performance close to the Cramer-Rao lower bound (CRLB).","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2004.1378456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A matching pursuit followed by cancellation (MPC) algorithm is investigated for time-varying multipath channel estimation in asynchronous CDMA. The algorithm has significantly low computational complexity and consists of two steps. In the first step, a basic matching pursuit algorithm that identifies the strongest channel taps, and successively cancels them, is used. The second step of the algorithm uses the already estimated channel taps to remove interference from the received vector in order to identify the channel coefficients more accurately. The performance of the algorithm is characterized in terms of mean squared identification error (MSIE). The convergence behavior of MPC is described. A method to terminate the MP step of the algorithm successfully is proposed and is shown to perform well. Our results show that MPC achieves performance close to the Cramer-Rao lower bound (CRLB).
基于迭代对消的CDMA系统信道估计
研究了异步CDMA中时变多径信道估计的匹配跟踪后消去算法。该算法计算复杂度低,分为两步。在第一步中,使用一种基本的匹配追踪算法来识别最强的信道抽头,并依次取消它们。该算法的第二步使用已经估计的信道抽头来去除接收矢量中的干扰,以便更准确地识别信道系数。该算法的性能用均方识别误差(MSIE)来表征。描述了MPC的收敛行为。提出了一种成功终止该算法的MP步长的方法,并取得了良好的效果。我们的研究结果表明,MPC的性能接近Cramer-Rao下界(CRLB)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信