交错分多址中一种新的多级交织器模型

Z. Deng, Yunpeng Zhang, Ning Li, Qin Du
{"title":"交错分多址中一种新的多级交织器模型","authors":"Z. Deng, Yunpeng Zhang, Ning Li, Qin Du","doi":"10.1109/ICCT46805.2019.8947079","DOIUrl":null,"url":null,"abstract":"Based on the Interleave Division Multiple Access (IDMA), the existing interleaver consumes a large amount of storage resources, which causes unnecessary overhead of the terminal and the base station. To solve the problem of high latency and low resource utilization in satellite communications, a novel cyclic multi-level Tree interleaver (CM-Tree) theoretical model based on low memory requirement is proposed in this paper. Under the condition that the BER performance does not decrease, only the original 1/N memory requirement is needed (where N is the number of master interleavers) can achieve the low computational complexity of $\\log_{N}K$ (K is the number of user accesses). This paper makes a comparison of CM-Tree interleaver with other major interleavers which has been performed for the same channel environment.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Multi-Level Interleaver Model in Interleave Division Multiple Access\",\"authors\":\"Z. Deng, Yunpeng Zhang, Ning Li, Qin Du\",\"doi\":\"10.1109/ICCT46805.2019.8947079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the Interleave Division Multiple Access (IDMA), the existing interleaver consumes a large amount of storage resources, which causes unnecessary overhead of the terminal and the base station. To solve the problem of high latency and low resource utilization in satellite communications, a novel cyclic multi-level Tree interleaver (CM-Tree) theoretical model based on low memory requirement is proposed in this paper. Under the condition that the BER performance does not decrease, only the original 1/N memory requirement is needed (where N is the number of master interleavers) can achieve the low computational complexity of $\\\\log_{N}K$ (K is the number of user accesses). This paper makes a comparison of CM-Tree interleaver with other major interleavers which has been performed for the same channel environment.\",\"PeriodicalId\":306112,\"journal\":{\"name\":\"2019 IEEE 19th International Conference on Communication Technology (ICCT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 19th International Conference on Communication Technology (ICCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT46805.2019.8947079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT46805.2019.8947079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

现有的交织器基于IDMA (Interleave Division Multiple Access),占用了大量的存储资源,给终端和基站带来了不必要的开销。针对卫星通信中存在的高延迟和资源利用率低的问题,提出了一种基于低内存需求的循环多级树交织器(CM-Tree)理论模型。在不降低BER性能的条件下,只需要原始的1/N内存需求(其中N为主交织器的个数)就可以实现$\log_{N}K$ (K为用户访问次数)的低计算复杂度。本文将CM-Tree交织器与其他主要的交织器在相同信道环境下进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Multi-Level Interleaver Model in Interleave Division Multiple Access
Based on the Interleave Division Multiple Access (IDMA), the existing interleaver consumes a large amount of storage resources, which causes unnecessary overhead of the terminal and the base station. To solve the problem of high latency and low resource utilization in satellite communications, a novel cyclic multi-level Tree interleaver (CM-Tree) theoretical model based on low memory requirement is proposed in this paper. Under the condition that the BER performance does not decrease, only the original 1/N memory requirement is needed (where N is the number of master interleavers) can achieve the low computational complexity of $\log_{N}K$ (K is the number of user accesses). This paper makes a comparison of CM-Tree interleaver with other major interleavers which has been performed for the same channel environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信