The principles of medium PRF (pulse-repetition-frequency) radar and the specific requirements of a radar system place restrictions on the choice of these PRFs. The author documents typical constraints placed on a pulse-Doppler search-mode PRF set. He sets forth an efficient approach for selecting a near-optimum set.

2002年12月10日 · This paper presents a new and novel method of selecting multiple pulse repetition frequency (PRF) sets for use in medium PRF pulsed-Doppler radars. Evolutionary algorithms are used to minimise the blind areas in the range/Doppler space.

In multiple pulse repetition frequencies (PRFs) radars, the PRF set is used to resolve the ambiguities in both range and Doppler frequency. In this paper, a novel PRF selection scheme is proposed. The optimization is driven by the requirement to maximize the decodable velocity space for low PRF applications.

The selection of PRFs in a medium PRF set is therefore based on the following: 1) A spread of values which enable the resolution of range and velocity ambiguities, 2) the minimisation of blind zones, 3) removal of totally blind velocities, 4) ensuring that the duty cycle yields the desired average transmitted power,

The selection of an optimal PRF set is constrained by radar system characteristics, application requirements, ghost minimization, and sampling rates. The paper presents an efficient combinatorial approach to calculate PRF set quality, addressing these constraints and discussing their implications to enhance radar performance.

The PRF set selection is complex, restricted by the particular radar system and its intended use. After briefly discussing constraints, some results concerning ghost minimisation, and the linearity of clear region probabilities, an efficient method is presented for calculating PRF set quality.

1994年12月1日 · Modern fighter aircraft use a host of different techniques to search for and detect airborne targets. One such technique involves the use of pulse Doppler and a collection of 'medium' pulse repetition frequencies (PRFs). Such a collection of medium PRFs ...

We explore in detail our protocol's application to semi-honest secure private set intersection (PSI). The fastest state-of-the-art PSI protocol (Pinkas et al., Usenix 2015) is based on e cient OT extension. We observe that our OPRF can be used to remove their PSI protocol's dependence on the bit-length of the parties' items.

2011年5月1日 · Simulated annealing algorithm, which effectively finds globally optimal solutions of a given cost function, is exploited to obtain an optimal PRF set. In this process, we devise a good...

In this paper, we present a concretely efficient protocol for private set intersection (PSI) in the multi-party setting using oblivious pseudorandom function (OPRF). In fact, we generalize the approach used in the work of Chase and Miao [CRYPTO ...