Analysis and comparison of two disambiguity algorithms: The modified CA and CRT

Author

Stinco, P. ; Greco, M. ; Gini, F. ; Farina, A. ; Timmoneri, L.

Author_Institution

Dept. of Ing. dell´´Inf., Univ. of Pisa, Pisa, Italy

fYear

2009

fDate

12-16 Oct. 2009

Firstpage

1

Lastpage

5

Abstract

In high pulse repetition frequency (PRF) radars ambiguities may arise in range measurements. In this paper we describe and compare two algorithms which can be used even when ambiguous returns from several targets are received. The analyzed algorithms are a modified version of the Clustering Algorithm (CA) and a modified version of the Chinese Remainder Theorem (CRT). The performances of both algorithms have been evaluated in terms of probability of false alarm and probability of detection.

Keywords

pattern clustering; probability; radar; Chinese remainder theorem; clustering algorithm; detection probability; disambiguity algorithms; false alarm probability; high pulse repetition frequency radars; Additive noise; Algorithm design and analysis; Cathode ray tubes; Clustering algorithms; Frequency; Performance evaluation; Pulse measurements; Radar detection; Radar measurements; Radar theory; Chinese Remaider Theorem; Clustering Algorithm; Coincidence Algorithm; Disambiguity algorithm; Multiple pulse repetition frequency radar;

fLanguage

English

Publisher

ieee

Conference_Titel

Radar Conference - Surveillance for a Safer World, 2009. RADAR. International

Conference_Location

Bordeaux

Print_ISBN

978-2-912328-55-7

Type

conf

Filename

5438451