Best known PSLs for binary sequences from bit length 71 through 100

M. Amin Nasrabadi, M. Bastani
{"title":"Best known PSLs for binary sequences from bit length 71 through 100","authors":"M. Amin Nasrabadi, M. Bastani","doi":"10.1109/ISTEL.2008.4651390","DOIUrl":null,"url":null,"abstract":"This paper develops a new evolutionary algorithm for generating low autocorrelation binary sequences. These sequences are of interest in pulse compression technique. The proposed algorithm is fast enough to yield optimum or near optimum codes. The generated sequences were compared to the best literature and were seen that its results are better than the others. This suggested method could change 11 rows of the previous best known PSLs table, whereas the previous literature could change only one record. These records were combined with the best results reported in the papers to produce a new best minimal-PSL binary sequence table for bit lengths 71 through 100.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2008.4651390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper develops a new evolutionary algorithm for generating low autocorrelation binary sequences. These sequences are of interest in pulse compression technique. The proposed algorithm is fast enough to yield optimum or near optimum codes. The generated sequences were compared to the best literature and were seen that its results are better than the others. This suggested method could change 11 rows of the previous best known PSLs table, whereas the previous literature could change only one record. These records were combined with the best results reported in the papers to produce a new best minimal-PSL binary sequence table for bit lengths 71 through 100.
最著名的psl是位长从71到100的二进制序列
本文提出了一种新的生成低自相关二值序列的进化算法。这些序列是脉冲压缩技术的研究热点。该算法的速度足以产生最优或接近最优的代码。将生成的序列与最佳文献进行比较,发现其结果优于其他文献。这个建议的方法可以更改以前最著名的PSLs表的11行,而以前的文献只能更改一条记录。这些记录与论文中报道的最佳结果相结合,产生了位长为71到100的新的最佳最小psl二进制序列表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信