科斯塔斯阵列搜索技术,最大限度地回溯和对称利用

J. Russo, K. Erickson, J. K. Beard
{"title":"科斯塔斯阵列搜索技术,最大限度地回溯和对称利用","authors":"J. Russo, K. Erickson, J. K. Beard","doi":"10.1109/CISS.2010.5464772","DOIUrl":null,"url":null,"abstract":"Two innovations in search methodology for Costas arrays are presented here: extensive exploitation of symmetries, and look-ahead row index exclusion tables. Together, they achieve a reduction of more than a factor of four in computational requirements over conventional search methods. We examined the benefits of these innovations on Costas arrays of higher orders, and particularly on a search over order 28.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Costas array search technique that maximizes backtrack and symmetry exploitation\",\"authors\":\"J. Russo, K. Erickson, J. K. Beard\",\"doi\":\"10.1109/CISS.2010.5464772\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two innovations in search methodology for Costas arrays are presented here: extensive exploitation of symmetries, and look-ahead row index exclusion tables. Together, they achieve a reduction of more than a factor of four in computational requirements over conventional search methods. We examined the benefits of these innovations on Costas arrays of higher orders, and particularly on a search over order 28.\",\"PeriodicalId\":118872,\"journal\":{\"name\":\"2010 44th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 44th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2010.5464772\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2010.5464772","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文介绍了Costas数组搜索方法的两个创新:广泛利用对称性和前瞻性行索引排除表。总的来说,它们比传统的搜索方法减少了四分之一以上的计算需求。我们研究了这些创新对Costas高阶数组的好处,特别是对超过28阶的搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Costas array search technique that maximizes backtrack and symmetry exploitation
Two innovations in search methodology for Costas arrays are presented here: extensive exploitation of symmetries, and look-ahead row index exclusion tables. Together, they achieve a reduction of more than a factor of four in computational requirements over conventional search methods. We examined the benefits of these innovations on Costas arrays of higher orders, and particularly on a search over order 28.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信