跳频多址中有界相互干扰的跳频模式

T. Seay
{"title":"跳频多址中有界相互干扰的跳频模式","authors":"T. Seay","doi":"10.1109/MILCOM.1982.4805942","DOIUrl":null,"url":null,"abstract":"Theoretical bounds are given for the number and length of hopping patterns with a guaranteed maximum number of pairwise hits. Constructions for hopping pattern sets which achieve the single hit bounds are given, as well as hopping patterns which guarantee the maximum number of pairwise hits in the presence of time or frequency asynchrony, or both. It is shown that variable rate coding permits \"averaging\" of the worst case interference compared to fixed rate coding, when the data messages are of varying duration.","PeriodicalId":179832,"journal":{"name":"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Hopping Patterns for Bounded Mutual Interference in Frequency Hopping Multiple Access\",\"authors\":\"T. Seay\",\"doi\":\"10.1109/MILCOM.1982.4805942\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Theoretical bounds are given for the number and length of hopping patterns with a guaranteed maximum number of pairwise hits. Constructions for hopping pattern sets which achieve the single hit bounds are given, as well as hopping patterns which guarantee the maximum number of pairwise hits in the presence of time or frequency asynchrony, or both. It is shown that variable rate coding permits \\\"averaging\\\" of the worst case interference compared to fixed rate coding, when the data messages are of varying duration.\",\"PeriodicalId\":179832,\"journal\":{\"name\":\"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1982.4805942\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1982.4805942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

给出了保证最大成对命中次数的跳跃模式的数目和长度的理论界限。给出了实现单命中边界的跳跃模式集的构造,以及在存在时间或频率异步或两者同时存在的情况下保证成对命中数量最大的跳跃模式。结果表明,当数据报文的持续时间不同时,与固定速率编码相比,可变速率编码允许对最坏情况下的干扰进行“平均”。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hopping Patterns for Bounded Mutual Interference in Frequency Hopping Multiple Access
Theoretical bounds are given for the number and length of hopping patterns with a guaranteed maximum number of pairwise hits. Constructions for hopping pattern sets which achieve the single hit bounds are given, as well as hopping patterns which guarantee the maximum number of pairwise hits in the presence of time or frequency asynchrony, or both. It is shown that variable rate coding permits "averaging" of the worst case interference compared to fixed rate coding, when the data messages are of varying duration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信