{"title":"用遗传算法搜索压缩到几个子脉冲的二进制码","authors":"H. Takase, S. Hoshino, M. Shinriki","doi":"10.1109/IRS.2016.7497274","DOIUrl":null,"url":null,"abstract":"Binary codes, which are compressed to a signal with a width of several subpulses and small sidelobes, are searched using a genetic algorithm because they cannot be found by exhaustive search. We found new codes with longer code length and that the peak-sidelobe to peak-mainlobe ratios are smaller than such conventional codes as Barker codes and optimum binary codes. We also indicate the characteristics of the codes.","PeriodicalId":346680,"journal":{"name":"2016 17th International Radar Symposium (IRS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Search of binary codes compressed to several subpulses using genetic algorithm\",\"authors\":\"H. Takase, S. Hoshino, M. Shinriki\",\"doi\":\"10.1109/IRS.2016.7497274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary codes, which are compressed to a signal with a width of several subpulses and small sidelobes, are searched using a genetic algorithm because they cannot be found by exhaustive search. We found new codes with longer code length and that the peak-sidelobe to peak-mainlobe ratios are smaller than such conventional codes as Barker codes and optimum binary codes. We also indicate the characteristics of the codes.\",\"PeriodicalId\":346680,\"journal\":{\"name\":\"2016 17th International Radar Symposium (IRS)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 17th International Radar Symposium (IRS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRS.2016.7497274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 17th International Radar Symposium (IRS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRS.2016.7497274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Search of binary codes compressed to several subpulses using genetic algorithm
Binary codes, which are compressed to a signal with a width of several subpulses and small sidelobes, are searched using a genetic algorithm because they cannot be found by exhaustive search. We found new codes with longer code length and that the peak-sidelobe to peak-mainlobe ratios are smaller than such conventional codes as Barker codes and optimum binary codes. We also indicate the characteristics of the codes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
