{"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":"34 ","pages":"483-487 vol.2"},"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\":\"34 \",\"pages\":\"483-487 vol.2\"},\"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}
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
