By Topic

Optimal radar pulse scheduling using a neural network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Izquierdo-Fuente ; ETSI Telecomunicacion, Valladolid Univ., Spain ; J. R. Casar-Corredera

In a multifunction radar, the maximum number of targets which can be managed (maintain their tracks) is one of the main performance figures. The interleaving algorithms exploit the dead times between the transmitted and the received pulses to allocate new tracking tasks (transmit and receive pulses) thus increasing the capacity of the system. Generally speaking, the interleaving of N targets is a complex problem (NP-complete type) and sub-optimal solutions are usually employed to satisfy the real-time constraints of the radar system. In this paper we design an optimal interleaving algorithm based on a Hopfield network. We describe the general problem, define the network and select the criteria to design the weights. Finally as an example, we simulate a simple scenario with five targets

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994