{"title":"一种利用单个PRF解决距离模糊的算法","authors":"Wei Zhang, L. Kong, Xiaobo Yang, Xiaojing Wang","doi":"10.1109/ICCCAS.2010.5581957","DOIUrl":null,"url":null,"abstract":"A new algorithm of range ambiguity resolution is presented which is substantially different from previously proposed algorithms. The algorithm utilizes a constant pulse repetition frequency (PRF). Firstly, a merit function is designed according to the moving characteristics of the targets. Secondly, range ambiguity resolution is achieved by minimizing the merit function. Numerical simulation results indicate that the proposed algorithm can resolve the range ambiguity efficiently using a single constant PRF.","PeriodicalId":199950,"journal":{"name":"2010 International Conference on Communications, Circuits and Systems (ICCCAS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An algorithm of resolving the range ambiguity using a single PRF\",\"authors\":\"Wei Zhang, L. Kong, Xiaobo Yang, Xiaojing Wang\",\"doi\":\"10.1109/ICCCAS.2010.5581957\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm of range ambiguity resolution is presented which is substantially different from previously proposed algorithms. The algorithm utilizes a constant pulse repetition frequency (PRF). Firstly, a merit function is designed according to the moving characteristics of the targets. Secondly, range ambiguity resolution is achieved by minimizing the merit function. Numerical simulation results indicate that the proposed algorithm can resolve the range ambiguity efficiently using a single constant PRF.\",\"PeriodicalId\":199950,\"journal\":{\"name\":\"2010 International Conference on Communications, Circuits and Systems (ICCCAS)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Communications, Circuits and Systems (ICCCAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCAS.2010.5581957\",\"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 International Conference on Communications, Circuits and Systems (ICCCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCAS.2010.5581957","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algorithm of resolving the range ambiguity using a single PRF
A new algorithm of range ambiguity resolution is presented which is substantially different from previously proposed algorithms. The algorithm utilizes a constant pulse repetition frequency (PRF). Firstly, a merit function is designed according to the moving characteristics of the targets. Secondly, range ambiguity resolution is achieved by minimizing the merit function. Numerical simulation results indicate that the proposed algorithm can resolve the range ambiguity efficiently using a single constant PRF.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
