{"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":"63 1","pages":"0"},"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\":\"63 1\",\"pages\":\"0\"},\"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}
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.