DS-UWB系统的递归多用户检测

Yihai H. Zhang, Wu-Sheng Lu, T. Gulliver
{"title":"DS-UWB系统的递归多用户检测","authors":"Yihai H. Zhang, Wu-Sheng Lu, T. Gulliver","doi":"10.1109/PACRIM.2005.1517344","DOIUrl":null,"url":null,"abstract":"Multiple access UWB communications has recently attracted a great deal of attention. In a multiple access UWB system, multiuser detection is desirable to effectively reduce multiple access interference (MAI). A suboptimal ML detector based on a recursive convex relaxation strategy is proposed for DS-UWB systems in this paper. This algorithm employs a recursive approach to deduce a sequence of reduced-size quadratic problems, in each of which only the most probable information bits are detected. Performance results are presented which show that the proposed detector provides near-optimal performance relative to the ML detector with considerably reduced computational complexity.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Recursive multiuser detection for DS-UWB systems\",\"authors\":\"Yihai H. Zhang, Wu-Sheng Lu, T. Gulliver\",\"doi\":\"10.1109/PACRIM.2005.1517344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple access UWB communications has recently attracted a great deal of attention. In a multiple access UWB system, multiuser detection is desirable to effectively reduce multiple access interference (MAI). A suboptimal ML detector based on a recursive convex relaxation strategy is proposed for DS-UWB systems in this paper. This algorithm employs a recursive approach to deduce a sequence of reduced-size quadratic problems, in each of which only the most probable information bits are detected. Performance results are presented which show that the proposed detector provides near-optimal performance relative to the ML detector with considerably reduced computational complexity.\",\"PeriodicalId\":346880,\"journal\":{\"name\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2005.1517344\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

近年来,多址超宽带通信引起了人们的广泛关注。在多址UWB系统中,多用户检测是有效降低多址干扰的必要手段。提出了一种基于递归凸松弛策略的次优机器学习检测器,用于DS-UWB系统。该算法采用递归的方法来推导一系列缩减大小的二次问题,在每个问题中只检测到最可能的信息位。性能结果表明,相对于机器学习检测器,所提出的检测器提供了近乎最佳的性能,并且大大降低了计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Recursive multiuser detection for DS-UWB systems
Multiple access UWB communications has recently attracted a great deal of attention. In a multiple access UWB system, multiuser detection is desirable to effectively reduce multiple access interference (MAI). A suboptimal ML detector based on a recursive convex relaxation strategy is proposed for DS-UWB systems in this paper. This algorithm employs a recursive approach to deduce a sequence of reduced-size quadratic problems, in each of which only the most probable information bits are detected. Performance results are presented which show that the proposed detector provides near-optimal performance relative to the ML detector with considerably reduced computational complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信