计算效率高的迭代多用户检测和解码

S. Das, E. Erkip, B. Aazhang
{"title":"计算效率高的迭代多用户检测和解码","authors":"S. Das, E. Erkip, B. Aazhang","doi":"10.1109/ACSSC.1998.750939","DOIUrl":null,"url":null,"abstract":"We describe an iterative detection and decoding scheme for the uplink in a convolutionally coded direct sequence code division multiple access (DS-CDMA) system. We consider maximum-a-posteriori (MAP) decoding and reduce the complexity through an iterative interference cancelation scheme combined with a suboptimal channel decoding algorithm. The MAP priors are updated at every iteration step. We investigate the performance of this low complexity scheme and observe that it is close to optimal.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Computationally efficient iterative multiuser detection and decoding\",\"authors\":\"S. Das, E. Erkip, B. Aazhang\",\"doi\":\"10.1109/ACSSC.1998.750939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe an iterative detection and decoding scheme for the uplink in a convolutionally coded direct sequence code division multiple access (DS-CDMA) system. We consider maximum-a-posteriori (MAP) decoding and reduce the complexity through an iterative interference cancelation scheme combined with a suboptimal channel decoding algorithm. The MAP priors are updated at every iteration step. We investigate the performance of this low complexity scheme and observe that it is close to optimal.\",\"PeriodicalId\":393743,\"journal\":{\"name\":\"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.1998.750939\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1998.750939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文描述了一种卷积编码直接序列码分多址(DS-CDMA)系统中上行链路的迭代检测和解码方案。我们考虑最大后验(MAP)译码,并通过结合次优信道译码算法的迭代干扰抵消方案来降低复杂度。MAP优先级在每个迭代步骤中更新。我们研究了这种低复杂度方案的性能,并观察到它接近最优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Computationally efficient iterative multiuser detection and decoding
We describe an iterative detection and decoding scheme for the uplink in a convolutionally coded direct sequence code division multiple access (DS-CDMA) system. We consider maximum-a-posteriori (MAP) decoding and reduce the complexity through an iterative interference cancelation scheme combined with a suboptimal channel decoding algorithm. The MAP priors are updated at every iteration step. We investigate the performance of this low complexity scheme and observe that it is close to optimal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信