具有距离保持映射的排列码多址访问

T. Shongwe, T. Swart, H. C. Ferreira
{"title":"具有距离保持映射的排列码多址访问","authors":"T. Shongwe, T. Swart, H. C. Ferreira","doi":"10.1109/AFRCON.2013.6757789","DOIUrl":null,"url":null,"abstract":"We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used for multiple access communication even under frequency jamming. We give examples of multiple codebooks that are DPMs such that each DPM can be assigned to a user for communication over a multiple access channel. We only consider one type of DPM called Distance Increasing Mappings (DIMs). The multiple access channel of interest is Time Division Multiple Access (TDMA). We show that it is possible to give a construction for DIMs that can be uniquely decoded even in the presence of frequency jamming. The DPMs are permutation codes found by mapping binary sequences to permutation sequences. The permutation codes have codewords of length M with symbols taken from an alphabet whose cardinality is M, where M is any integer. Each symbol may be seen as representing one out of the M frequencies in an M-ary Frequency Shift keying modulation scheme, for example.","PeriodicalId":159306,"journal":{"name":"2013 Africon","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multiple access with distance preserving mappings for permutation codes\",\"authors\":\"T. Shongwe, T. Swart, H. C. Ferreira\",\"doi\":\"10.1109/AFRCON.2013.6757789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used for multiple access communication even under frequency jamming. We give examples of multiple codebooks that are DPMs such that each DPM can be assigned to a user for communication over a multiple access channel. We only consider one type of DPM called Distance Increasing Mappings (DIMs). The multiple access channel of interest is Time Division Multiple Access (TDMA). We show that it is possible to give a construction for DIMs that can be uniquely decoded even in the presence of frequency jamming. The DPMs are permutation codes found by mapping binary sequences to permutation sequences. The permutation codes have codewords of length M with symbols taken from an alphabet whose cardinality is M, where M is any integer. Each symbol may be seen as representing one out of the M frequencies in an M-ary Frequency Shift keying modulation scheme, for example.\",\"PeriodicalId\":159306,\"journal\":{\"name\":\"2013 Africon\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Africon\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AFRCON.2013.6757789\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Africon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AFRCON.2013.6757789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了在频率干扰下可用于多址通信的排列码的距离保持映射(dpm)的结果。我们给出了作为DPM的多个码本的示例,这样每个DPM可以分配给一个用户,以便通过多址通道进行通信。我们只考虑一种称为距离增加映射(DIMs)的DPM。我们感兴趣的多址通道是时分多址(TDMA)。我们表明,即使在存在频率干扰的情况下,也有可能给出可以唯一解码的dim结构。dpm是通过将二进制序列映射到置换序列而找到的置换代码。排列码具有长度为M的码字,其符号取自基数为M的字母表,其中M是任意整数。例如,每个符号可被视为表示M个频移键控调制方案中M个频率中的一个。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multiple access with distance preserving mappings for permutation codes
We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used for multiple access communication even under frequency jamming. We give examples of multiple codebooks that are DPMs such that each DPM can be assigned to a user for communication over a multiple access channel. We only consider one type of DPM called Distance Increasing Mappings (DIMs). The multiple access channel of interest is Time Division Multiple Access (TDMA). We show that it is possible to give a construction for DIMs that can be uniquely decoded even in the presence of frequency jamming. The DPMs are permutation codes found by mapping binary sequences to permutation sequences. The permutation codes have codewords of length M with symbols taken from an alphabet whose cardinality is M, where M is any integer. Each symbol may be seen as representing one out of the M frequencies in an M-ary Frequency Shift keying modulation scheme, for example.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信