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.
Analysis and comparison of two disambiguity algorithms: The modified CA and CRT
STINCO, PIETRO;GRECO, MARIA;GINI, FULVIO;
2009-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
