{"title":"带有厄米码的跳频扩频分组无线电","authors":"T. Macdonald, M. Pursley","doi":"10.1109/MILCOM.2001.986071","DOIUrl":null,"url":null,"abstract":"Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop (FH) spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for FH transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for a catastrophic partial-band interference channel, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Frequency-hop spread-spectrum packet radio with Hermitian codes\",\"authors\":\"T. Macdonald, M. Pursley\",\"doi\":\"10.1109/MILCOM.2001.986071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop (FH) spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for FH transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for a catastrophic partial-band interference channel, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.\",\"PeriodicalId\":136537,\"journal\":{\"name\":\"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.2001.986071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2001.986071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Frequency-hop spread-spectrum packet radio with Hermitian codes
Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop (FH) spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for FH transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for a catastrophic partial-band interference channel, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.