Frequency-hop spread-spectrum packet radio with Hermitian codes

2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277) Pub Date : 2001-10-28 DOI:10.1109/MILCOM.2001.986071

T. Macdonald, M. Pursley

{"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":null,"pages":null},"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}

引用次数: 0

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.

查看原文本刊更多论文

带有厄米码的跳频扩频分组无线电

在频率跳(FH)扩频分组无线网络中，厄米码是里德-所罗门码的一个有吸引力的替代方案。对于给定的字母表大小，厄米码的块长度比里德-所罗门码长得多。这一点和其他考虑表明，厄米码在某些应用中可能更优越。给出了利用厄米编码对跳频传输进行分组错误概率评估的分析结果。我们发现在一些情况下，厄密码比里德-所罗门码提供更低的包错误概率。一般来说，随着码率的降低或符号字母大小的增加，厄米码相对于里德-所罗门码的相对性能有所提高。对加性高斯白噪声信道和灾难性部分频带干扰信道的性能进行了评估，并对纯错误译码和纠删译码的包错误率进行了评估。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)

自引率

0.00%

发文量