用于异步BPSK用户的迭代多用户解码器

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI:10.1109/ISIT.1998.709028

M. Moher

{"title":"用于异步BPSK用户的迭代多用户解码器","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":"{\"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}","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

摘要

针对异步BPSK用户，提出了一种多用户解码算法。该算法源自交叉熵最小化的迭代技术，与turbo译码有相似之处。仿真结果表明，该算法逐渐达到单用户性能。解码器每比特的复杂度为每次迭代每比特0 (2/sup 3K/+/sup 2/)，其中K是用户数量，K是代码的约束长度。

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

查看原文本刊更多论文

An iterative multiuser decoder for asynchronous BPSK users

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.

求助全文

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

来源期刊

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

自引率

0.00%

发文量