分组组合码分多址随机多址系统分析

R. Prakash, V. Veeravalli
{"title":"分组组合码分多址随机多址系统分析","authors":"R. Prakash, V. Veeravalli","doi":"10.1109/ACSSC.2000.910758","DOIUrl":null,"url":null,"abstract":"A reverse link random access system is considered where CDMA with random spreading is used for reset separation. The receiver consists of either a matched filter (MF) or a minimum mean squared error (MMSE) detector followed by autonomous forward error correction (FEC) decoders for each user. The random access strategy combines slotted ALOHA with incremental redundancy (IR). Such a system is defined as a code division random multiple access (CDRMA) system. Two types of IR, namely code combining and maximal ratio combining (MRC) are considered. Bounds on the throughput of a CDRMA system are obtained for different detectors and IR schemes, when the number of users K and the spreading factor N, are both large (K,N/spl rarr//spl infin/, K/N=/spl alpha/). These bounds are derived using known results on the information theoretic capacity for a user within a slot. The bound on the throughput of a CDRMA system is shown to be equal to the bound on the throughput of an equivalent fixed access (conventional) CDMA system.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"25 1","pages":"1225-1229 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Analysis of code division random multiple access systems with packet combining\",\"authors\":\"R. Prakash, V. Veeravalli\",\"doi\":\"10.1109/ACSSC.2000.910758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A reverse link random access system is considered where CDMA with random spreading is used for reset separation. The receiver consists of either a matched filter (MF) or a minimum mean squared error (MMSE) detector followed by autonomous forward error correction (FEC) decoders for each user. The random access strategy combines slotted ALOHA with incremental redundancy (IR). Such a system is defined as a code division random multiple access (CDRMA) system. Two types of IR, namely code combining and maximal ratio combining (MRC) are considered. Bounds on the throughput of a CDRMA system are obtained for different detectors and IR schemes, when the number of users K and the spreading factor N, are both large (K,N/spl rarr//spl infin/, K/N=/spl alpha/). These bounds are derived using known results on the information theoretic capacity for a user within a slot. The bound on the throughput of a CDRMA system is shown to be equal to the bound on the throughput of an equivalent fixed access (conventional) CDMA system.\",\"PeriodicalId\":10581,\"journal\":{\"name\":\"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)\",\"volume\":\"25 1\",\"pages\":\"1225-1229 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2000.910758\",\"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 the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2000.910758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

考虑了一种反向链路随机接入系统,该系统采用随机扩展的CDMA进行复位分离。接收机由匹配滤波器(MF)或最小均方误差(MMSE)检测器组成,然后为每个用户提供自主前向纠错(FEC)解码器。随机访问策略结合了开槽ALOHA和增量冗余(IR)。这种系统被定义为码分随机多址(CDRMA)系统。考虑了码合并和最大比合并(MRC)两种IR。当用户数K和扩频因子N都很大(K,N/spl rarr//spl infin/, K/N=/spl alpha/)时,得到了不同检测器和红外方案下CDRMA系统吞吐量的边界。这些边界是利用已知的槽内用户的信息论容量的结果推导出来的。CDRMA系统的吞吐量上限等于等效固定接入(传统)CDMA系统的吞吐量上限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Analysis of code division random multiple access systems with packet combining
A reverse link random access system is considered where CDMA with random spreading is used for reset separation. The receiver consists of either a matched filter (MF) or a minimum mean squared error (MMSE) detector followed by autonomous forward error correction (FEC) decoders for each user. The random access strategy combines slotted ALOHA with incremental redundancy (IR). Such a system is defined as a code division random multiple access (CDRMA) system. Two types of IR, namely code combining and maximal ratio combining (MRC) are considered. Bounds on the throughput of a CDRMA system are obtained for different detectors and IR schemes, when the number of users K and the spreading factor N, are both large (K,N/spl rarr//spl infin/, K/N=/spl alpha/). These bounds are derived using known results on the information theoretic capacity for a user within a slot. The bound on the throughput of a CDRMA system is shown to be equal to the bound on the throughput of an equivalent fixed access (conventional) CDMA system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Generalized lapped biorthogonal transforms using lifting steps Linear unitary precoders for maximum diversity gains with multiple transmit and receive antennas An N2logN back-projection algorithm for SAR image formation A fast constant modulus algorithm for blind equalization A signal separation algorithm for fetal heart-rate estimation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1