基于球面解码的MC-CDMA系统最佳多用户检测

12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598) Pub Date : 2001-09-30 DOI:10.1109/PIMRC.2001.965383

L. Brunel

{"title":"基于球面解码的MC-CDMA系统最佳多用户检测","authors":"L. Brunel","doi":"10.1109/PIMRC.2001.965383","DOIUrl":null,"url":null,"abstract":"The maximum likelihood joint detection of all users in a multi-carrier code division multiple access (MC-CDMA) system has a prohibitive complexity, growing exponentially with the number of users, when it is performed using an exhaustive search. In this paper, a novel ML multiuser detection algorithm is proposed, whose complexity is a polynomial function of the number of users and is independent of the modulation size. The MC-CDMA system is modelled using a sphere packing lattice representation and an efficient lattice decoder, called the sphere decoder, is applied to jointly detect all users. Simulation results are proposed up to 64 users transmitting 16-QAM symbols.","PeriodicalId":318292,"journal":{"name":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Optimum multiuser detection for MC-CDMA systems using sphere decoding\",\"authors\":\"L. Brunel\",\"doi\":\"10.1109/PIMRC.2001.965383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The maximum likelihood joint detection of all users in a multi-carrier code division multiple access (MC-CDMA) system has a prohibitive complexity, growing exponentially with the number of users, when it is performed using an exhaustive search. In this paper, a novel ML multiuser detection algorithm is proposed, whose complexity is a polynomial function of the number of users and is independent of the modulation size. The MC-CDMA system is modelled using a sphere packing lattice representation and an efficient lattice decoder, called the sphere decoder, is applied to jointly detect all users. Simulation results are proposed up to 64 users transmitting 16-QAM symbols.\",\"PeriodicalId\":318292,\"journal\":{\"name\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"volume\":\"153 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2001.965383\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2001.965383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

多载波码分多址(MC-CDMA)系统中所有用户的最大似然联合检测具有令人难以置信的复杂性，当它使用穷举搜索执行时，随着用户数量呈指数增长。本文提出了一种新的ML多用户检测算法，该算法的复杂度是用户数的多项式函数，与调制大小无关。MC-CDMA系统采用球填充点阵表示建模，并采用高效的点阵解码器球解码器对所有用户进行联合检测。仿真结果表明，最多64个用户发送16-QAM码。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimum multiuser detection for MC-CDMA systems using sphere decoding

The maximum likelihood joint detection of all users in a multi-carrier code division multiple access (MC-CDMA) system has a prohibitive complexity, growing exponentially with the number of users, when it is performed using an exhaustive search. In this paper, a novel ML multiuser detection algorithm is proposed, whose complexity is a polynomial function of the number of users and is independent of the modulation size. The MC-CDMA system is modelled using a sphere packing lattice representation and an efficient lattice decoder, called the sphere decoder, is applied to jointly detect all users. Simulation results are proposed up to 64 users transmitting 16-QAM symbols.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)

自引率

0.00%

发文量