PHASED ARRAY RADAR SYSTEM FOR TRACKING

Abstract: The present innovation relates to a phased array radar system for tracking. The system comprises the following units: a track initiation unit (6) which initiates new tracks. A to the track initiation unit connected track prediction unit (1) which predicts the expected position and the calculated positional uncertainty of the target at the next measurement as a function of the time and the minimal, maximal and optimal measurement time difference to the next measurement. A to the track prediction unit (1) connected scheduling unit (2) which performs an independent calculation of a sequence of possible time intervals to the next measurement for each one of two conditions, namely that the measurement time difference will be placed between the calculated minimal and maximal time differences and that range-unambiguity will prevail, and then performs an intersection operation on the so-calculated sequences of time intervals with the purpose of calculating the optimal time intervals to the next measurement. A to the scheduling unit (2) connected track selection unit (3), which selects that track which has shortest time interval, Ki, to the next measurement and decreases the time interval to the next measurement for all other tracks with Ki. A to the track selection unit (3) connected transmitter/receiver unit (4) which forms the waveform, directs the beam, is designed to register the echo from the target and calculate, in a known manner, distance, speed, bearing and uncertainty in the distance and speed calculation, which values are transferred to the track prediction unit (1) for the further calculations in this unit.

Description: Phased Array Radar System for Tracking The present invention relates to a phased array radar tracking system. For radar technical terms in the following description a basic textbook is recommended, e.g. S.Kingsley and S.Quegan, Understanding Radar Systems, McGraw Hill, 1992. The proposed radar design is intended for tracking aircraft targets. The radar system has a phased array antenna, which means that it can be controlled and directed electronically. Each detected aircraft target is followed and represented as a track. The track is a state vector with elements for a set of parameters. The main way of working for the radar is to transmit pulses with a certain pulse repetition frequency and carrier frequency, in a certain direction. After being reflected against a radar target (subsequently called "the target") they may be measured by a receiver. The time delay from transmission to reception of a pulse is proportional to the target distance. The distance is, however, ambiguous since the pulse frequency value is so high that several pulses are transmitted before the reflection of the first pulse returns. This ambiguity gives rise to an ambiguity problem in calculation of the distance: Each measured time between transmission and reception of a pulse corresponds to several possible ranges. The two-way distance that a certain radar pulse can go in the time interval between two consecutive pulses is called the range-unambiguity interval. The length of the range-unambiguity interval depends on the value of the pulse repetition frequency (in the following PRF). For a radar of this type the num- ber of selectable PRF values usually amounts to some tens. A sequence of pulses transmitted with a certain PRF is called a pulse train. Between each pair of adjacent " range-unambiguity intervals there is a blind region dependent on the fact that it takes a certain time to transmit the pulse from the antenna. Before each new measurement of a target the position of the target as well as the position uncertainty is predicted. A common computation technique for this predic¬ tion is Kalman filtering. The position uncertainty forms an uncertainty volume (or uncertainty-region), which grows roughly quadratically with the time since the latest measurement. In order to master both the uncertainty about the target position and the radar-target range-unambiguity, it is necessary that the extension of the uncer¬ tainty volume - along the radius between target and radar - is contained completely in one single range-unambiguity interval. Due to the (predicted) target movement in relation to a possibly moving radar this condition is satisfied only during some limited time intervals, namely such time intervals for which the radar-target range and the position uncertainty region for the target lies completely within the limits of one single range-unambiguity interval, depending on the selected PRF value. How this PRF value, these time intervals and the time point for measurement shall be calculated is one of the problems that have to be solved in a scheduling device of a phased array radar. Several other factors must however also be considered in this calculation. One factor is associated with a combination of Doppler frequency shifts and ground echo cancellation. If a movement of a target between two pulses in the pulse train equals in radial direction a number of half wave lengths for the carrier wave, the target seems to stand still. For each PRF a number of (equally large) speed un- ambiguity intervals arises, during which the target speed is unambiguous. Further- more, all echoes from slow targets must be cancelled (ground echo cancellation). The combination of these two effects leads to "blind spots" in the speed spectrum. This phenomenon is called Doppler blindness. A third problem occurs as the radar can measure only one target at each instance. For each track to be scheduled, the measurement time intervals assigned to other tracks are already occupied. A fourth problem is caused by so called "cross-overs": If the position uncertainties of more than one target during some time interval lie in beam sectors that overlap this time interval will be impossible to use for measurement. " The common thing with all these problems is that they are depending on the choice of PRF value and scheduled measurement time interval. The problem complexity may grow as further conditions may have to be added on the radar. The problem complexity is a new one as phased array radars are new. Known approaches to solve the problem handle one track at a time by first assigning to it the next free time period, and then calculating - if possible - the PRF value that fulfils all de¬ mands. In another approach it is examined which tracks need to be measured each time the radar is "free", which of these tracks that it is most necessary to measure and then a PRF value for this track is calculated. The proposed scheduling mechanism solves the stated problem complexity in an optimal and simple way which in addition allows more constraints to be added. This is achieved by giving the innovation the design that is evident from the following independent claim. The other claims concern suitable embodiments of the inven¬ tion. In the following, the innovation will be described with references to the attached figures, where figure 1 shows the principal structure of one embodiment of the innovation, figure 2 shows the principal structure of one embodiment of the scheduling unit 2 in figure 1 , figure 3 shows the geometrical relations for an approaching target, where tj k denotes the start of time interval number k, if i=1, and the end of the same, if i=2, figure 4 shows how the beam for target coincides with the beam for target y ' and figure 5 shows a picture of the range-unambiguity interval at three different PRF values, where bold lines denote blind parts of the range-unambiguity in each interval, (a) denotes a position which is blind free at only one of the three PRF values, and (b) and (c) denote positions which are blind free in two and three of the investigated PRF values respectively. The innovation consists of a device which computes the time points and PRF values for updates of a number of established target tracks, by calculation of a time interval sequence for each one of a number of geometrical and other conditions which may be posed on the measured target in relation to the position and speed of " the radar itself. These time interval sequences are then intersected forming a new time interval sequence within which the optimal measurement time interval can be sought. On a basic level the radar system according to the innovation comprises a track initiation unit 6, a target model calculation unit 1 , a scheduling unit 2, a track selec¬ tion unit 3 and a transmission/receiving unit 4. The track initiation unit 6 initiates new tracks. It is connected to the target model calculation unit 1 which predicts the expected position of the target and the calcu¬ lated position uncertainty at the next measurement as a function of time and furthermore the minimal, maximal and optimal measurement time difference. The track prediction unit 1 is connected to a scheduling unit 2, which makes an independent calculation of a sequence of possible time intervals to the next measurement for two conditions, namely that the measurement time difference has a value between the minimal time difference and the maximal time difference, and that range-unambiguity shall prevail. The unit then makes an intersection operation on the two so calculated interval sequences in order to calculate the optimal time interval to next measurement. The scheduling unit 2 is connected to a track selection unit 3 which selects the track which has the shortest remaining time interval, K j , to the next measurement and de¬ creases the time interval to next measurement for all other tracks with K j . The track selection unit 3 is connected to a send/receive unit 4 which generates waveform, directs the beam, is designed to register the reflex from the target and calculate, in a known way, range, speed, angle and accuracy in the calculations of range and speed, which parameters are transferred to the track prediction unit 1 for use in the further calculations in this unit. In certain cases the scheduling unit 2 is not able to calculate any time to the next measurement for any PRF value. In order to manage these cases it is suitable for the radar system to comprise a resolution unit 5 which is connected to the schedul¬ ing unit and which can calculate resolution frequencies and possible measuring times for resolution. Data necessary for the calculations in the different units and for the results from the different units must be stored in some way. It is suitable to use a special memory unit 7 which is connected to all other units for this purpose. Other solutions for the memory management is however also possible. In the following the different units will be presented in more detail. 6. The initiation unit 6 initiates tracks. This is done by using any track detection method which gives initial values of the parameters needed to perform track prediction in unit 1. 1. The track prediction unit 1 calculates or selects a number of parameters which later will be used by unit 4. Using the values of the latest measurements, the target is assigned a target track hypothesis. This can be a straight flight hypothesis or a o manoeuvre hypothesis. The later might be of different types depending on the turning forces that influences the target. A straight flight hypothesis is characterised by a small growth of positional uncertainty, and a manoeuvre hypothesis is charac¬ terised by a large growth of uncertainty - the bigger hypothetical turning force, the larger growth of uncertainty. This growth of uncertainty is expressed by the factors μ t (t) and μ u (t) in the formulas a** and a 2 below, and is illustrated by the breadth of the trumpet shaped opening in figure 3. The larger uncertainty growth, the larger trumpet opening. For assignment of hypothesis several known statistical methods are known, the most of which are based on the results of the latest measurements and their position and distance in relation to hypothetical straight flight tracks or turning curves. Based on the target track hypothesis it is possible to determine some of factors needed later in order to estimate the expected position of the target at next measurement - for example in terms of polar co-ordinates. Some of these factors are position, speed, turning rate and acceleration of the target at the latest measurement and functions for estimating the corresponding values at the next measurement. One parameter of these functions is the so far unknown value of the time difference between the latest and the next measurement for the current track. Values on position, turning rate and acceleration of the track are written in the corresponding memory cells for the actual track in memory unit 7. For straight flight hypothesis the function for position decision is indicated in the right part of formula a.. The positional uncertainty depends among other things on the time difference between the latest and the next measurement for the current track. The growth in .the positional uncertainty can be achieved in different ways, for example with the right part of the formulas a** and a 2 below, or with Kalman filtering. Necessary parameters - with the exception of the time difference - in functions needed to calculate the positional uncertainty are stored in the corresponding memory cells in the memory unit 7. The measured Doppler shift may - but need not - be used to calculate the radial speed and thereby to verify the radial component of the target speed. The required number of pulses may be calculated in different ways. One way is based on the known technique that combines the requirements on detection, range accuracy, range resolution and Doppler resolution. The maximal time difference between the latest and the next measurement for the current track is calculated while considering the fact that the position uncertainty region of the target is to be completely included in the sector formed by one monopulse. The position uncertainty-region grows according to the right term of the formulas a-i and a , see also figure 3. The searched time point is calculated accord¬ ing to formula a*ι and a 2 . The minimal time difference between the latest and the next measurement for the current track is calculated while considering the workload and illumination strategy. High workload is a reason to wait a certain minimum amount of time between two illuminations of targets of a certain type. As regards illumination strategy rules for restricted radar illumination on targets of certain types are intended. An optimal time difference between the latest and the next measurement for the current track is calculated among other things as a function of minimal and maximal time difference. The optimal measurement time difference may for example be chosen so that a certain percentage of the difference between the minimal and maximal time difference is less than the optimal time difference. 2. The scheduling unit 2 is formed by the following parts which may be connected according to figure 2. 2.1 A calculation unit 2.1, which from a given number of PRF values selects the maximal PRF value. 2.2 A calculation unit 2.2 which, based on this PRF, calculates zero or one time interval between the time difference limits. For facts about the storage of informa¬ tion about time intervals, see the paragraph about the memory unit 7. 2.3 A calculation unit 2.3 which, by using the selected PRF value from unit 2.1 , calculates zero, one or more time intervals during which the range-unambiguity condition is satisfied. This requirement means that the radial extension of uncertainty-region of the position of the target is completely included in one single range-unambiguity interval during the time of the measurement. This may be calculated in the following way, see figure 3. The time point for moving the target to the closest edge of the uncertainty-region is given by formula a-j and the time point for moving the target to the furthest edge of the uncertainty-region is given by formula a 2 , where n = 0, 1, 2, 3... The other vari¬ able names are explained below. For an approaching target (i.e. a target that approaches the radar) the first time point, t in a^ constitutes the upper limit for a time interval and the second time point, t in a 2> constitutes the lower limit for a time interval. For a departing target the situation is reversed. At most one time interval can be formed for each value of n. n *c/(2 *prf) + t pu ι se < r 0 + t * v r - μ,(t) (a ) r 0 + t * v r - μ u (t) < (n + 1) * c/(2 *prf) + t pulse < (a 2 ) where n = an integer greater than or equal to zero, c = the speed of light, prf = pulse repetition frequency, tpui se - length of measurement time interval,' To = range at the latest measurement, t = time interval between the latest and next measurement, v r - the radial speed of the target, positive only if the target-radar range increases, μι(t) = the range between the straight-line flight path and the closest edge of the uncertainty-region, which may be calculated by the Kalman filter but also may be approximated to k| * t 2 , k| > 0. μ u (t) = the range between the straight-line flight path and the furthest edge of the uncertainty-region, which may be calculated by the Kalman filter but also may be approximated to k u * t 2 , k u > 0. 2.4 is a calculation unit which, by using the selected PRF value from unit 2.1 and information about the radial speed of the target, calculates whether Doppler blind¬ ness prevails, see formula (b). If this is the case with the selected PRF value, an empty time interval sequence is produced, i.e. a sequence with zero time intervals. Otherwise a sequence with one time interval is produced, and this has the limits zero and the positive infinity, respectively. The following formula for Doppler blindness indicates the blind free part of each range rate unambiguity interval, m *λ *prf/2 + d mar < v r < (m+1) *λ * prf/2 - d mar (b) where /τ? = integer greater than or equal to zero, λ =■ carrier frequency, prf = pulse repetition frequency, dmar - blind marginal in each end of the Doppler interval, v r = the radial speed of the target, positive only if the target radar distance increases. A target which has a speed within a blind spot will be made invisible for the radar. Since the range rate unambiguity interval depends on the PRF value, a target which was made invisible with one PRF value may become visible with another PRF value. 2.5 A calculation unit 2.5 which, by using the selected PRF value from unit 2.1 , calculates zero, one or more time intervals during which cross-overs do not occur. These time intervals forms a sequence of time intervals. Cross-overs are illustrated in figure 4. Cross-over is a state when the uncertainty region for one target is partly or completely hidden by the uncertainty-region for another target. The geometry for this state is time dependent. Simplified calculations of cross-overs might be used. It might prevail at those time points when two or more targets have the same expected bearing, added with such time intervals on both sides of this time point which depend on the mutual relation between the directions of the targets. If the targets head in nearly the same direction the cross-over takes longer time. 2.6 A calculation unit 2.6 which, by using the selected PRF value from unit 2.1, calculates zero, one or more time intervals which are not already allocated for update measurement of other targets. These time intervals form a sequence of time intervals. Note: Information about time intervals for update measurement of other tar¬ gets may be achieved in track memory cells for "PRF" and "remaining time to measurement", see the paragraph for memory unit 7, or be administered in a special sequence of time intervals for occupied time intervals. 2.7.j Zero, one or more calculation units 2.7.j, where j=1,2,3 m, which each one, by using the selected PRF value from unit 2.1, calculates a sequence of time inter¬ vals during which measurement can not be carried out for some other reason. One such reason is that a certain part of each time unit must be allocated for search. The complementary set (see definition below) for the such allocated time intervals forms a sequence of allowed time intervals for each calculation unit 2.7.j. Search is an activity, which consists of searching for new targets in defined areas. This com¬ prises a method which, prior to scheduling track updates, allocates a specific per¬ centage of each selected future time interval for search. The complementary set to a sequence S of time intervals is a sequence T of time intervals such that exactly those time points which are not included in any time interval in S are included in a time interval in T. 2.8 A calculation unit 2.8 which performs an intersection operation (see definition below) of all those time intervals or sequences of time intervals which have been achieved from the calculation units 2.2-2.7. The result is a sequence of time inter¬ vals. The intersection of two time interval sequences S*ι and S 2 is a time interval sequence T such that exactly those time points which are included both in a time interval in S-i and a time intervals in S 2 are included in a time interval in T. This might be written T=intersection(S*ι,S 2 ). The intersection of several time interval sequences S-i, S 2 S n , n>2, is then T n , which is achieved from a recursive process T n =intersection(T n-1 ,S 2 ) for all n>2 and where T 2 =T is achieved as described in the previous paragraph. 2.9 A calculation unit 2.9 which calculates the time for update measurement by using the sequence achieved in unit 2.8. 2.9.1 First all intervals are cancelled whose length is smaller than the measurement time length, which can be calculated from the following formula T= 2 *f * w/prf (c) where T = length of the measurement interval, f = a positive integer whose value depends on the needed effect as calculated by the radar equation, w - integer which gives the number of pulses, prf = pulse repetition frequency. 2.9.2 If at least one time interval then remains, calculation is made of the beginning of a time interval whose length equals the measurement time length and whose middle point lies as close as possible to the optimal time, which is calculated in unit 1 and is an optimal time difference between minimum and maximum measurement time difference. This value of the beginning of the measurement time interval is stored in the memory space for "remaining time to next measurement" in the memory unit 7. 2.10 A unit 2.10 which, if no time interval according to 2.9 remains and there are more PRF values to try, deletes the last selected PRF value from the set of PRF values to try. If, however, no time interval according to 2.9 remains and no more PRF values remain in the set of PRF values, then resolution is instead performed by calculation unit 5. The calculation units 2.2-2.7 are independent of each other. They may be arranged in parallel as shown in figure 2, or in sequence, in which case intersection is per¬ formed at each step between the input time interval sequence and the time interval sequence during the times of which the condition is true. If these steps are per¬ formed sequentially, the need for unit 2.8 disappears and the time interval se¬ quence from unit 2.7 is transferred directly to the calculation unit 2.9. An alternative to this, which takes longer time to perform is to make an adjustment considering the following soft desirable requirements, namely, * minimisation of the measurement time length, * closeness to the optimal time point and * centering of the Doppler interval whose limits are calculated with formula (b). In order to be able to consider these desirable requirements and find the PRF value which gives the best combination of desirable requirements, they may be weighted. This is done by introducing three weight factors and storing in one memory cell per PRF value - for all PRF values which give at least one possible time interval accord- ing to unit 2.9.1 - the value of the sum of three products. The products are achieved respectively by multiplication of the inversed measurement length and weight factor number 1, multiplication of the distance to the optimal time point and weight factor number 2, and multiplication of the distance to the centre of the Doppler interval and weight factor number 3. After performing these calculations for all PRF values, that PRF value is selected which gives the smallest sum, together with the corresponding measurement time interval. This consideration among soft desirable requirements may be selectable, i.e. object for on/off switching. The assignment of values of weight factors may be static or dynamic. If static assignment is used, then they have constant values. If dynamic assignment is used, then they might be changed by an operator command or controlled by the transmit¬ ter/receiver by letting the weight factor for centering of the Doppler interval increase as the signal-to-noise ratio decreases. A suitable initial value assignment for the weight factors is 10 "1 , 1 and 1 respectively. 3. The track selection unit 3 identifies - through comparing investigation among all memory cells which for different tracks contain information about the remaining time to next measurement - the track i of all tracks which has the smallest remaining time to next measurement Kj , decreases the value for remaining time to next measurement for all other tracks by the same number Kj and transfers the number of the current track, i, to the transmitter/receiver unit 4. The number Kj indicates an absolute (future) time point namely the time point Now + Kj where Now is the absolute time point for the latest measurement of the radar. 4. The transmitter/receiver unit 4 consists of transmitter, receiver and antenna for a " phased array radar system. The transmitter calculates distance and angle according to functions which earlier have been decided by the track prediction unit for the current track. The number of pulses required for measurement is calculated consid- ering the energy required for target illumination. The PRF value which has been calculated and stored in the state vector is used. The phase shift in the different elements of the antenna is calculated so that a coherent pulse train is directed into the desired direction. The unit stays in a delay state, and at the time point Now + Kj the transmission of the pulse train is started. The receiver infers the distance to the target by calculation of the time delay of the received pulses. Further, distance and radial speed are calculated. These data are registered at the state vector of the track. The value of the absolute time point for the latest measurement, Now, is up¬ dated by addition of the value for Kj. If a target echo is not detected, a new attempt to make a measurement is immedi¬ ately done, which means that the values for minimal measurement time difference and optimal time difference are set to zero, and calculation unit 2 is started anew. Such renewed measurement attempts after a missed detection are normally repeated a few times (0-2). If a target echo is still not detected, the track is deleted, which means that it is not studied any further by this or other units. In renewed measurement attempts alternative target track hypothesises may be used. 5. The resolution unit 5 calculates the resolution frequencies and possible time intervals for resolution. Resolution means that the target is illuminated sequentially with a small number (s) of pulse trains with different PRF values. At most m of these (m < s) are allowed to have overlapping intervals for range blindness (that is the blind time interval between two adjacent range-unambiguity intervals) in the uncer- tainty region of the target . The calculation in unit 5 is performed only if unit 2 could not deliver a measurement time interval for a single PRF value. 7. The memory unit 7 consists of a memory having the required memory cells which can be grouped in the following way: 7.1 A number of memory cells 7.1 for storing the values of all selectable PRF values. These values are constant and used by unit 2. 7.2 A memory cell 7.2 for storing the absolute time point Now for the latest measurement of the radar. The content in this cell is used and changed by the transmitter/receiver unit 4.. 7.3 A number of groups of memory cells, 7,3, each group representing a time inter¬ val. Each such group of cells holds information about the start and end of the time interval, and a track number and a pointer to another memory cell group which also represents a time interval - the pointer is a number or an address to the other cell group. A group of this type is a time interval object. A chain of time interval objects linked together represents a time interval sequence. Time interval objects are allo¬ cated and processed by calculation unit 2. Time interval sequences are also created and maintained. 7.4 A group of memory cells 7.4 for storing the state vector for each track. This vector has elements for: - track number i is assigned at track initiation by unit 6. Each track has a unique number. - distance at the latest measurement is calculated by unit 1 ; used by unit 4. - bearing a the latest measurement is calculated by unit 1 ; used by unit 4. - speed at the latest measurement is calculated by unit 1; used by unit 4. - course at the latest measurement is calculated by unit 1 ; used by unit 4. - growth factors kι, k u , for positional uncertainty is calculated by unit 1; used by unit 4. - minimal (measurement) time difference may be constant or depend on the target volume; is calculated by unit 1; used by unit 2. - maximal (measurement) time difference is calculated by unit 1; used by unit 2. - optimal time point is calculated by unit 1 ; used by unit 2. - function for calculation of how a predicted position depends on the time difference between the last and next measurement is calculated by unit 1; used by unit 4. - function for calculation of how predicted positional uncertainty depends on the measurement time difference is calculated by unit 1 ; used by unit 2. - radar target area is calculated by unit 4; used by unit 4. - planned PRF value for the next measurement is calculated by unit 2; used by unit 4. - planned measurement time length for the next measurement is calculated by unit 2; used by units 2 and 3. - remaining time to the next measurement Kj the time difference between the time point for start of next measurement of this track and the time point for the latest measurement which is stored in the memory cell Now; Kj is calculated by unit 2; used and changed by unit 3. - time interval sequence N for possible measurement (see point 7.3); is calculated and used by the units 2 and 3. Note: There is one implementation version with and one without a special time interval sequence for occupied time intervals. If this sequence is present, data for the time intervals for the next measurement for each track will be stored in it. If the special time interval sequence for occupied time intervals is not pre¬ sent, time data for next measurement of each track might instead be stored only in the memory cell for remaining-time-to-next-measurement Kj. 7.5 A group of memory cells 7.5 which stores those data about antenna and effect that are needed in the radar equation. This is used for calculation of the pulse num¬ ber in the transmitter/receiver unit 4. The units 3, 4, 1 and 2 (in this order) constitute a sequence of units which normally process one target track per turn. Exception 1 : If the PRF value can not be calcu¬ lated in unit 2, resolution is performed in unit 5 as well. Exception 2: If no echo from the target is achieved in the transmitter/receiver unit 4, a new scheduling is made by unit 2 without any intermediate processing in unit 1. If no echo is achieved even after repeated measurement attempts, the target track is finished.

Claims: Claims: 1. A phased array radar system for target tracking comprising a transmitter/receiver unit (4), c h a r a c t e r i s e d by the fact that it comprises a track initiation unit (6) which initiates new tracks, a to the a track initiation unit connected track prediction unit (1) which predicts the expected position and the calculated position uncertainty of the target as a function of the time and further the minimal, maximal and optimal time difference to the next measurement, a to the track prediction unit (1) connected scheduling unit (2) which performs an inde- pendent calculation of a sequence of possible time intervals to the next measure¬ ment for each one of two conditions, namely that the measurement time difference will be placed between the calculated minimal and maximal time differences and that range-unambiguity will prevail, and then performs an intersection operation between the so calculated sequences of time intervals with the purpose of calculat- ing the optimal time interval to the next measurement, a to the scheduling unit (2) connected track selection unit (3), which selects that track which has the shortest remaining time interval, Kj, to the next measurement and decreases the time inter¬ val to the next measurement for all other tracks with Kj, the to the track selection unit (3) connected transmitter/receiver unit (4) which forms the waveform, directs the beam, is designed to register the echo from the target and calculate, in a known manner, distance, speed, bearing and uncertainty in the distance and speed calcu¬ lations, which values are transferred to the track prediction unit (1) for the further calculations in this unit. 2. Radar system according to claim ^ c h a r a c t e r i s e d by the fact that it also comprises a to the scheduling unit connected resolution unit (5) which, if the " scheduling unit is not able to calculate any pulse repetition frequency, calculates resolution frequencies and possible measurement times for resolution. 3. Radar system according to claim ^ c h a r a c t e r i s e d by the fact that it also comprises a to all other units connected memory unit (7) which stores needed facts for the calculations in the units and the results of the calculations. 4. Radar system according to claim ^ c h a r a c t e r i s e d by the fact that the scheduling unit (2) is designed to calculate the optimal time difference to the next measurement by, firstly (2.1) selecting the maximal possible PRF value among a number of predefined values, secondly (2.2, 2.3) calculating that sequence of time intervals for each condition, which covers exactly those time points during which the conditions are satisfied, thirdly (2.8) performing an intersection operation on the so calculated sequences of time intervals which generates a time interval sequence N (fig 3), fourthly (2.9) calculating that time interval whose length equals the measurement length, is placed entirely within the time interval sequence N and whose central point lies close to the optimal time point, and fifthly storing the start¬ ing time point for this measurement time interval in that cell of memory unit (7) which stores remaining-time-to-measurement, Kj, in the state vector of the track /. 5. Radar system according to claim 4, c h a r a c t e r i s e d by the fact that the scheduling unit (2) is designed to eliminate the latest selected PRF value (2.10), if no time interval for measurement has been achieved at the calculations in the unit, whereafter the process in the scheduling unit is repeated. 6. Radar system according to claim 5, c h a r a c t e r i s e d by the fact that the scheduling unit (2) is designed to give signal to the resolution unit (5) about resolu¬ tion, if no PRF value remains among the predefined PRF values. 7. Radar system according to anyone of the previous claims, c h a r a c t e r i s e d by the fact that the memory unit (7) contains memory cells which store values for all selectable PRF values (7.1), data about the absolute time point, Now, for the latest measurement of the radar (7.2), data about time interval sequences (7.3) and data about the current state of every track (7.4), the latter including a memory address to a time interval sequence for possible measurement time points and memory cells for minimal, maximal and optimal time interval to the next measurement respectively and remaining-time-to-measurement, Kj. 8. Radar system according to claim 4, c h a r a c t e r i s e d by the fact that the scheduling unit (2) is designed to calculate a sequence of time intervals for still another condition and to perform an intersection operation (2.8) on this time interval sequence and the sequences achieved from earlier mentioned conditions, where the new condition relates to Doppler blindness avoidance. 9. Radar system according to claim 4, c h a r a c t e r i s e d by the fact that the scheduling unit (2 is designed to calculate a sequence of time intervals for still another condition and to perform an intersection operation (2.8) on this time interval sequence and the sequences achieved from earlier mentioned conditions, where the new condition relates to cross-over avoidance. 10. Radar system according claim 4, characterised by the fact that the scheduling unit (2) is designed to calculate a sequence of time intervals for still another condition and to perform an intersection operation (2.8) on this time interval sequence and the sequences achieved from earlier mentioned conditions, where the new condition relates to freedom from overlapping. 11. Radar system according claim 4, c h a r a c t e r i s e d by the fact that the scheduling unit (2) is designed to calculate a sequence of time intervals for still another condition and to perform an intersection operation (2.8) on this time interval sequence and the sequences achieved from earlier mentioned conditions, where the new condition relates to search. 12. Radar system according to anyone of the previous claims, characterised by the fact that the scheduling unit (2) is designed in order to, for all those PRF values that give time interval sequences with at least one time interval of sufficient length, firstly, calculate the length of the measurement time interval, minimum dis¬ tance to the optimal time point and distance to the Doppler interval central point, secondly, fuse those values by multiplicating the inverted measurement time length with a first weight factor, the distance to the optimal time point with a second weight factor and the distance to the Doppler interval centre with a third weight factor and summing them up and thirdly, select that PRF value which gives the least of the so calculated sums. 13. Radar system according to claim 12, characterised by the fact that the scheduling unit (2) is designed to use the weight factors 10 '1 , 1 and 1 respectively. 14. Radar system according to anyone of the previous claims, characterised by the fact that the scheduling unit (2) is designed to perform a new series of calcu¬ lations with sharply decreased parameter values for minimal, optimal and maximal time difference, if the transmitter/receiver unit (4) can not register any echo from the target. 15. Radar system according claim 14, characterised by the fact that the track prediction unit (1) is designed to change the track hypothesis between each new measurement.

Inventors: STROEMBERG DAN, STROEMBERG, DAN
Applicants: FOERSVARETS FORSKNINGSANSTALT, STROEMBERG DAN, STROEMBERG, DAN
Application year: 1996
Main classification: G01S13
IPC codes: G01S13