Random multiple access in q-ary disjunctive channel

E. Pustovalov, A. Turlikov
{"title":"Random multiple access in q-ary disjunctive channel","authors":"E. Pustovalov, A. Turlikov","doi":"10.1109/RED.2012.6338410","DOIUrl":null,"url":null,"abstract":"Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338410","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
q元析取信道中的随机多址访问
研究了q元析取信道中的随机多址(RMA)。提出了一种新的RMA算法。该算法属于分割算法的范畴。它利用了q元析取信道的特性,减少了重传次数。该算法的吞吐量为0.603,比传统的RMA算法的吞吐量大,而传统的RMA算法不利用所考虑的信道的特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Goertzel-Blahut algorithm is closely related to the fast fourier transform Steganographic method on weighted container Estimating the performance of computer systems through computer capacity Low-density parity-check codes based on the independent subgroups RFID advanced ultra lightweight authentication protocol
×
引用
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