{"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}
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.