{"title":"异步超宽带系统的低复杂度迭代MUD算法","authors":"Xiaoli Wang, Lei Huang, C. Ko","doi":"10.1109/ICCS.2004.1359330","DOIUrl":null,"url":null,"abstract":"In this paper, a low-complexity iterative multiuser detection (MUD) algorithm specifically designed for asynchronous multiple access ultra-wideband (UWB) systems is proposed. The maximum a posteriori criterion is applied in the detection process by subtracting the multiple access interference precisely, and the computational complexity is reduced in an iterative manner. Considering the asynchronous scenario, a truncated detection window is introduced and studied. The simulation results demonstrate that the proposed iterative MUD algorithm can achieve a satisfactory bit-error-rate performance while maintain a considerably low complexity","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low-complexity iterative MUD algorithm for asynchronous UWB systems\",\"authors\":\"Xiaoli Wang, Lei Huang, C. Ko\",\"doi\":\"10.1109/ICCS.2004.1359330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a low-complexity iterative multiuser detection (MUD) algorithm specifically designed for asynchronous multiple access ultra-wideband (UWB) systems is proposed. The maximum a posteriori criterion is applied in the detection process by subtracting the multiple access interference precisely, and the computational complexity is reduced in an iterative manner. Considering the asynchronous scenario, a truncated detection window is introduced and studied. The simulation results demonstrate that the proposed iterative MUD algorithm can achieve a satisfactory bit-error-rate performance while maintain a considerably low complexity\",\"PeriodicalId\":333629,\"journal\":{\"name\":\"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.2004.1359330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.2004.1359330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low-complexity iterative MUD algorithm for asynchronous UWB systems
In this paper, a low-complexity iterative multiuser detection (MUD) algorithm specifically designed for asynchronous multiple access ultra-wideband (UWB) systems is proposed. The maximum a posteriori criterion is applied in the detection process by subtracting the multiple access interference precisely, and the computational complexity is reduced in an iterative manner. Considering the asynchronous scenario, a truncated detection window is introduced and studied. The simulation results demonstrate that the proposed iterative MUD algorithm can achieve a satisfactory bit-error-rate performance while maintain a considerably low complexity
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
