Blind multiuser detection based on the fast relative newton algorithm

Z. Albataineh, F. Salem
{"title":"Blind multiuser detection based on the fast relative newton algorithm","authors":"Z. Albataineh, F. Salem","doi":"10.1109/WTS.2014.6835034","DOIUrl":null,"url":null,"abstract":"We introduce a multiuser detection algorithm for Direct Sequence Code Division Multiple Access (DS-CDMA) systems that implements a fast relative newton algorithm in a quasi-maximum likelihood (quasi-ML) estimation framework. The symbol signals are estimated based on this quasi-ML criteria at reduced Bit-Error-Rate (BER) and reduced computational load. Specifically, we construct multiuser detectors based on this new algorithm as well as the leading RobustICA and FastICA algorithms. Then, we demonstrate the significant improvements in Bit error rate (BER) and computational speed achieved by this new algorithm in comparative simulation studies.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Wireless Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WTS.2014.6835034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We introduce a multiuser detection algorithm for Direct Sequence Code Division Multiple Access (DS-CDMA) systems that implements a fast relative newton algorithm in a quasi-maximum likelihood (quasi-ML) estimation framework. The symbol signals are estimated based on this quasi-ML criteria at reduced Bit-Error-Rate (BER) and reduced computational load. Specifically, we construct multiuser detectors based on this new algorithm as well as the leading RobustICA and FastICA algorithms. Then, we demonstrate the significant improvements in Bit error rate (BER) and computational speed achieved by this new algorithm in comparative simulation studies.
基于快速相对牛顿算法的盲多用户检测
介绍了一种直接序列码分多址(DS-CDMA)系统的多用户检测算法,该算法在拟极大似然估计框架中实现了快速相对牛顿算法。在降低误码率和减少计算负荷的情况下,基于该准机器学习准则对符号信号进行估计。具体来说,我们基于这种新算法以及领先的鲁布斯蒂卡和法斯蒂卡算法构建了多用户检测器。然后,我们通过对比仿真研究证明了该算法在误码率(BER)和计算速度方面的显著改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信