{"title":"固定分组长度的单跳无槽CDMA网络的吞吐量","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":"{\"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}","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}
Throughput of single-hop unslotted CDMA networks with fixed packet lengths
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.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
