{"title":"An iterative multiuser decoder for asynchronous BPSK users","authors":"M. Moher","doi":"10.1109/ISIT.1998.709028","DOIUrl":null,"url":null,"abstract":"A multiuser decoding algorithm is presented for asynchronous BPSK users. The algorithm is derived from iterative techniques for cross-entropy minimization and has similarities with turbo decoding. Simulations show the algorithm asymptotically achieves single user performance. The complexity per bit of the decoder is O(2/sup 3K/+/sup 2/) per bit per iteration where K is the number of users and K is the constraint length of the code.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.709028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
A multiuser decoding algorithm is presented for asynchronous BPSK users. The algorithm is derived from iterative techniques for cross-entropy minimization and has similarities with turbo decoding. Simulations show the algorithm asymptotically achieves single user performance. The complexity per bit of the decoder is O(2/sup 3K/+/sup 2/) per bit per iteration where K is the number of users and K is the constraint length of the code.