一种有效生成任意长度的大好的周期二值序列集的新算法

军事通信技术 Pub Date : 1988-10-23 DOI:10.1109/MILCOM.1988.13435

M. Haspel

{"title":"一种有效生成任意长度的大好的周期二值序列集的新算法","authors":"M. Haspel","doi":"10.1109/MILCOM.1988.13435","DOIUrl":null,"url":null,"abstract":"The author addresses the problem of generating large sets of balanced preferred periodic binary sequences (-1, 1) of arbitrary length N with good correlation properties. The PRHL (phase randomization/hard limiting) algorithm for the generation of such sequences is described and compared to the coin-tossing approach. The PRHL algorithm is shown to yield considerable gain in efficiency in generation of sequences with the required properties. In addition, the sequences found have special average energy properties.<<ETX>>","PeriodicalId":66166,"journal":{"name":"军事通信技术","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1988-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel algorithm for efficient generation of large sets of good periodic binary sequences of arbitrary length\",\"authors\":\"M. Haspel\",\"doi\":\"10.1109/MILCOM.1988.13435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author addresses the problem of generating large sets of balanced preferred periodic binary sequences (-1, 1) of arbitrary length N with good correlation properties. The PRHL (phase randomization/hard limiting) algorithm for the generation of such sequences is described and compared to the coin-tossing approach. The PRHL algorithm is shown to yield considerable gain in efficiency in generation of sequences with the required properties. In addition, the sequences found have special average energy properties.<<ETX>>\",\"PeriodicalId\":66166,\"journal\":{\"name\":\"军事通信技术\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"军事通信技术\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1988.13435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"军事通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/MILCOM.1988.13435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了具有良好相关性质的任意长度N的平衡优选周期二值序列(- 1,1)的大集合的生成问题。描述了用于生成此类序列的PRHL(相位随机化/硬限制)算法，并将其与抛硬币方法进行了比较。PRHL算法在生成具有所需属性的序列时显示出相当大的效率。此外，发现的序列具有特殊的平均能量性质。

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

查看原文本刊更多论文

A novel algorithm for efficient generation of large sets of good periodic binary sequences of arbitrary length

The author addresses the problem of generating large sets of balanced preferred periodic binary sequences (-1, 1) of arbitrary length N with good correlation properties. The PRHL (phase randomization/hard limiting) algorithm for the generation of such sequences is described and compared to the coin-tossing approach. The PRHL algorithm is shown to yield considerable gain in efficiency in generation of sequences with the required properties. In addition, the sequences found have special average energy properties.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

军事通信技术

自引率

0.00%

发文量

2434