{"title":"Performance analysis of grouped chip-level iterated multiuser detection for overloaded CDMA systems","authors":"F. P. Wathan, R. Hoshyar, R. Tafazolli","doi":"10.1109/SPAWC.2008.4641584","DOIUrl":null,"url":null,"abstract":"We present the performance evaluation of a grouped chip-level iterated (CLi) multiuser detection (MUD) technique that is based on Gaussian forcing technique for overloaded synchronous code-division multiple access systems. We confirm that the new grouped CLi MUD can approach the performance of the more complex CLi MUD with brute-force search. Also, we show that the new Grouped CLi MUD can provide a greater flexibility in trading off the performance and complexity. Furthermore, by incorporating a dynamic user grouping, the performance of the new CLi MUD technique can be further improved. We show via computer simulation, at the system with 200% condition, the loss of approximately 0.3 dB compared to its brute-force counterpart is observed while reducing the complexity to more than half.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present the performance evaluation of a grouped chip-level iterated (CLi) multiuser detection (MUD) technique that is based on Gaussian forcing technique for overloaded synchronous code-division multiple access systems. We confirm that the new grouped CLi MUD can approach the performance of the more complex CLi MUD with brute-force search. Also, we show that the new Grouped CLi MUD can provide a greater flexibility in trading off the performance and complexity. Furthermore, by incorporating a dynamic user grouping, the performance of the new CLi MUD technique can be further improved. We show via computer simulation, at the system with 200% condition, the loss of approximately 0.3 dB compared to its brute-force counterpart is observed while reducing the complexity to more than half.