{"title":"Parallel pulse correlation and geolocation","authors":"D.K. Krecker, W. Mitchell","doi":"10.1109/FMPC.1992.234929","DOIUrl":null,"url":null,"abstract":"The identification and location of ground-based radars via orbiting receivers require the correlation of pulses, the determination of time differences of arrival, and geolocation. Data rates in emitter-rich environments would swamp single-CPU processors performing this operation. The authors present an innovative parallel algorithm developed specifically for this application on massively parallel computers. The algorithm is based on the parallel computation and analysis of a matrix containing the differences in the time of arrival of all pulses received in a time window, and on the parallel proof/disproof of hypothesized emitter locations. Output contains the number of emitters and their location and PRI (pulse repetition interval) sequence. The algorithm was tested on a 16 K processor Connection Machine.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234929","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The identification and location of ground-based radars via orbiting receivers require the correlation of pulses, the determination of time differences of arrival, and geolocation. Data rates in emitter-rich environments would swamp single-CPU processors performing this operation. The authors present an innovative parallel algorithm developed specifically for this application on massively parallel computers. The algorithm is based on the parallel computation and analysis of a matrix containing the differences in the time of arrival of all pulses received in a time window, and on the parallel proof/disproof of hypothesized emitter locations. Output contains the number of emitters and their location and PRI (pulse repetition interval) sequence. The algorithm was tested on a 16 K processor Connection Machine.<>