矢量析取信道上基于交织Reed-Solomon码的多址系统信码构造的最大可达速率研究

2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI:10.1109/BlackSeaCom.2018.8433716

F. Ivanov, P. Rybin

{"title":"矢量析取信道上基于交织Reed-Solomon码的多址系统信码构造的最大可达速率研究","authors":"F. Ivanov, P. Rybin","doi":"10.1109/BlackSeaCom.2018.8433716","DOIUrl":null,"url":null,"abstract":"We consider a signal-code construction for a special class of multiple access system over vector-disjunctive channel. This construction is based on interleaved Reed-Solomon codes with collaborative decoding. The considered methods of encoding and decoding on one hand have acceptable complexity for a wide range parameters and on other one a decoding algorithm is able to correct significantly more collisions than bounded-distance decoder. We estimate a maximum achievable relative sum-rate of this construction for fixed number of active users and total number of frequencies to transmit.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System Over Vector-Disjunctive Channel\",\"authors\":\"F. Ivanov, P. Rybin\",\"doi\":\"10.1109/BlackSeaCom.2018.8433716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a signal-code construction for a special class of multiple access system over vector-disjunctive channel. This construction is based on interleaved Reed-Solomon codes with collaborative decoding. The considered methods of encoding and decoding on one hand have acceptable complexity for a wide range parameters and on other one a decoding algorithm is able to correct significantly more collisions than bounded-distance decoder. We estimate a maximum achievable relative sum-rate of this construction for fixed number of active users and total number of frequencies to transmit.\",\"PeriodicalId\":351647,\"journal\":{\"name\":\"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BlackSeaCom.2018.8433716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2018.8433716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

考虑了矢量析取信道上一类特殊的多址系统的信码结构。这种结构是基于协同解码的交错里德-所罗门码。所考虑的编码和解码方法一方面对大范围参数具有可接受的复杂性，另一方面解码算法比有界距离解码器能够纠正更多的碰撞。对于固定数量的活跃用户和要传输的总频率，我们估计了这种结构的最大可实现的相对和速率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System Over Vector-Disjunctive Channel

We consider a signal-code construction for a special class of multiple access system over vector-disjunctive channel. This construction is based on interleaved Reed-Solomon codes with collaborative decoding. The considered methods of encoding and decoding on one hand have acceptable complexity for a wide range parameters and on other one a decoding algorithm is able to correct significantly more collisions than bounded-distance decoder. We estimate a maximum achievable relative sum-rate of this construction for fixed number of active users and total number of frequencies to transmit.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

自引率

0.00%

发文量