Throughput of single-hop unslotted CDMA networks with fixed packet lengths

M. Yin, Vu Li
{"title":"Throughput of single-hop unslotted CDMA networks with fixed packet lengths","authors":"M. Yin, Vu Li","doi":"10.1109/MILCOM.1988.13469","DOIUrl":null,"url":null,"abstract":"The authors present a recursive method to compute the joint distribution of bit errors for single-hop unslotted code-division multiple-access (CDMA) networks with deterministic packet lengths. The computational complexity of this method grows polynomially with M, the number of bits per packet, if the bit error probability equals 1 when the number of interferers exceeds a threshold. The complexity is O(M/sup 3/) for the L-channel model, which assumes that the probability of bit error is zero below the threshold L and 1 above the threshold. The throughput of the system can be improved by using a channel sensing protocol.<<ETX>>","PeriodicalId":66166,"journal":{"name":"军事通信技术","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1988-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"军事通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/MILCOM.1988.13469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The authors present a recursive method to compute the joint distribution of bit errors for single-hop unslotted code-division multiple-access (CDMA) networks with deterministic packet lengths. The computational complexity of this method grows polynomially with M, the number of bits per packet, if the bit error probability equals 1 when the number of interferers exceeds a threshold. The complexity is O(M/sup 3/) for the L-channel model, which assumes that the probability of bit error is zero below the threshold L and 1 above the threshold. The throughput of the system can be improved by using a channel sensing protocol.<>
固定分组长度的单跳无槽CDMA网络的吞吐量
提出了一种计算具有确定分组长度的单跳无槽码分多址(CDMA)网络误码联合分布的递归方法。当干扰数超过某个阈值时,如果误码概率等于1,则该方法的计算复杂度随着M(每个数据包的比特数)呈多项式增长。L通道模型的复杂度为0 (M/sup 3/),该模型假设误码概率在阈值L以下为0,在阈值L以上为1。采用信道感知协议可以提高系统的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
2434
×
引用
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学术官方微信