Title of Invention: Hidden markov modeling for radar electronic warfare Abstract: The present invention relates to a method for identifying modern radar systems. A finite state automaton comprising a finite set of states and a set of transitions from state to state that occur in dependence upon an input signal is provided for modeling the radar system. The finite state automaton produces a sequence of output symbols from an output alphabet in dependence upon the state transitions such that the sequence of output symbols corresponds to a received electromagnetic signal emitted from the radar system. The finite state automaton is then transformed into a hidden Markov model such that a sequence of observation symbols produced from an observation alphabet by the hidden Markov model is equal to the sequence of output symbols. The method provides powerful tools for solving electronic warfare problems such the classification problem, the decoding problem, the prediction problem and the training problem. Describing the radar system as a finite state automaton and transforming it into a hidden Markov model provides flexibility and preserves a maximum of information provided by the observed signals. The new method is compatible with conventional receiver front-ends and allows integration into a wide range of legacy ES, EA and ELINT systems. The only hardware requirement is a fast processor with sufficient memory. Summary of Invention: &lsqb;0001&rsqb; This patent application is based upon U.S. Provisional Patent Application Serial No. 60/317,180, filed on Sept. 06, 2001. FIELD OF THE INVENTION &lsqb;0002&rsqb; This invention relates to electronic warfare and in particular to a method for recognizing observed electromagnetic signals emitted from modern radar systems, which are not stable and do not correspond to emitter modes. BACKGROUND OF THE INVENTION &lsqb;0003&rsqb; Electronic warfare (EW) is based upon the recognition of observed electromagnetic signals, in particular, radar signals. The EW is an essential component of modem warfare by providing information about, for example, the movement of enemy planes or the launch of a rocket. Such Electronic Support (ES) functions allow, for example, surveillance of enemy forces and warning of an imminent attack. Another aspect of the EW is the Electronic Attack (EA) function such as jamming an enemy radar system in order to substantially reduce the attack capability of an enemy force. A third aspect of the EW is the Electronic Intelligence (ELINT) function that is concerned with the interception and analysis of unknown radar signals for the population of databases in order to support the ES and EA functions. The ELINT function is important for ES and EA tactical systems, since these systems encounter in the field radar signals emitted from unknown radar systems, or yet unknown signals emitted from known radar systems. &lsqb;0004&rsqb; In current EW systems, radar signals are recognized using histograms of observed pulses in a parametric space—for example, frequency, pulse width, angle of arrival—and temporal periodicities in the pulse train. &lsqb;0005&rsqb; Andersen et al. describe in U.S. Pat. No. 5,583,505 issued Dec. 10, 1996 a radar pulse detection and classification system that receives times-of-arrival of pulses from simultaneous emitters, deinterleaves them into bands of pulse repetition intervals, and determines the pulse periodicities using autocorrelation. &lsqb;0006&rsqb; Caschera describes in U.S. Pat. No. 5,063,385 issued Nov. 5, 1991 a memory system for histogramming the pulse descriptor word output of a radar warning receiver for quickly determining the number and types of emitters of the observed radar signals. &lsqb;0007&rsqb; In U.S. Pat. No. 4,918,455 issued Apr. 17, 1990, Maier teaches deinterleaving of sequential signal pulses from unknown sources by clustering similar pulses into groups, and the use of those groups to form hypothetical pulse train models. &lsqb;0008&rsqb; Dunne et al. describe in US Statutory Invention Registration H513 published Aug. 2, 1998 a tracking apparatus using multi-processor modules for predicting in real time the parametric behavior of radar signals to be jammed. &lsqb;0009&rsqb; A major drawback of histogramming on parameters available on individual pulses is that the temporal relationship of the pulses is lost in the histogram. Furthermore, the periodic temporal analysis is limited by the assumption that the radar system is a cyclo-stationary source of pulses. This holds true only for simple radar systems over short periods of time. &lsqb;0010&rsqb; Therefore, all these prior art EW systems—using histogramming and periodic temporal analysis—are based upon the assumption that the observed electromagnetic signals are stable and correspond to emitter modes. Emitter modes date back to the early days of radar when an operator changed the signal by manually switching to another electrical circuit. Therefore, the prior art EW systems are ill-suited for recognizing modern “dynamic” radar systems. For example, in response to various events modern radar systems change their emitted signal, which is automatically adjusted using a processor to maximize radar performance. The signals are no longer stable and do no longer correspond to emitter modes. Events causing a change of the emitted signal are, for example, selection of a different range display by an operator, detection of a target by the radar system and subsequently changing from a search to a tracking signal, switching between a number of periodic signal patterns to reduce blind ranges and speeds, and, launching of a missile triggering the transmission of a guidance signal from the radar system. &lsqb;0011&rsqb; It is, therefore, an object of the invention to overcome the drawbacks of the prior art by providing a method capable of recognizing observed electromagnetic signals, which are not stable and do not correspond to emitter modes. &lsqb;0012&rsqb; It is further an object of the invention to provide flexibility in the modeling of the radar system based upon the sensed signals and to preserve a maximum of information provided by the sensed signals. SUMMARY OF THE INVENTION &lsqb;0013&rsqb; The new method according to the invention provides the capability for recognizing modern radar systems. Describing the radar system as a finite state automaton and transforming it into a hidden Markov model provides flexibility and preserves a maximum of information provided by the observed signals. The new method is compatible with conventional receiver front-ends and allows integration into a wide range of legacy ES, EA and ELINT systems. The only hardware requirement is a fast processor with sufficient memory. &lsqb;0014&rsqb; In accordance with the present invention there is provided a method for identifying a source of electromagnetic signals comprising the steps of: &lsqb;0015&rsqb; receiving an electromagnetic signal emitted from the source; &lsqb;0016&rsqb; providing a finite state automaton for modeling the source, the finite state automaton comprising a finite set of states and a set of transitions from state to state that occur in dependence upon an input signal, the finite state automaton for producing a sequence of output symbols from an output alphabet in dependence upon the state transitions, such that the sequence of output symbols corresponds to the received electromagnetic signal emitted from the source; &lsqb;0017&rsqb; hidden Markov modeling of the finite state automaton and determining parameters of the hidden Markov model such that a sequence of observation symbols produced from an observation alphabet by the hidden Markov model is equal to the sequence of output symbols; and, &lsqb;0018&rsqb; identifying the source in dependence upon the determined parameters of the hidden Markov model. &lsqb;0019&rsqb; In accordance with an aspect of the present invention there is provided a method for classifying source models in dependence upon an electromagnetic signal emitted from a source of electromagnetic signals comprising the steps of: &lsqb;0020&rsqb; receiving the electromagnetic signal emitted from the source; &lsqb;0021&rsqb; providing a plurality of L source models &lgr; such that the L source models &lgr; have L different observation alphabets comprising symbols being integer multiples of L different time periods, the source models &lgr; being hidden Markov modeled finite state automatons; &lsqb;0022&rsqb; transforming the received electromagnetic signal into L sequences of observation symbols O using the L different observation alphabets; and, &lsqb;0023&rsqb; determining for each combination of a source model &lgr; of the L source models with a sequence of observation symbols O(l) of the L sequences of observation symbols an observation probability P&boxur;&lgr;(l)&verbar;O(l)&boxul;, 1&lE;l&lE;L of the source model &lgr; for producing the sequence of observation symbols O(l). &lsqb;0024&rsqb; In accordance with the aspect of the present invention there is further provided a method for decoding an electromagnetic signal emitted from a source of electromagnetic signals comprising the steps of: &lsqb;0025&rsqb; receiving the electromagnetic signal emitted from the source; &lsqb;0026&rsqb; determining a sequence of observation symbols O in dependence upon the received electromagnetic signal; &lsqb;0027&rsqb; providing a source model &lgr;, the source model &lgr; being a hidden Markov modeled finite state automaton; &lsqb;0028&rsqb; determining a plurality of sequences of state transitions Q of the hidden Markov modeled finite state automaton; and, &lsqb;0029&rsqb; determining for each of the sequences of state transitions Q a probability of occurrence P&lsqb;Q&verbar;O, &lgr;&rsqb; with respect to the sequence of observation symbols O. &lsqb;0030&rsqb; In accordance with the aspect of the present invention there is yet further provided a method for predicting a second portion of an electromagnetic signal based upon a first portion of the electromagnetic signal emitted from a source of electromagnetic signals comprising the steps of: &lsqb;0031&rsqb; receiving the first portion of the electromagnetic signal; &lsqb;0032&rsqb; determining a partial sequence of observation symbols Ot in dependence upon the observed first portion of the signal; &lsqb;0033&rsqb; providing a source model, the source model being a hidden Markov modeled finite state automaton; &lsqb;0034&rsqb; determining for each observation symbol of an observation alphabet of the source model a probability for being the next symbol at time t&plus;1 in the sequence of observation symbols O based on a state transition probability distribution at time t of the source model and an observation symbol probability distribution of the source model at time t; and, &lsqb;0035&rsqb; determining a most probable observation symbol. &lsqb;0036&rsqb; In accordance with the aspect of the present invention there is yet further provided a method for training a source model of a source emitting electromagnetic signals comprising the steps of: &lsqb;0037&rsqb; receiving an electromagnetic signal emitted from the source; &lsqb;0038&rsqb; determining a sequence of observation symbols in dependence upon the received signal emitted from the source; &lsqb;0039&rsqb; providing the source model, the source model being a hidden Markov modeled finite state automaton; and, &lsqb;0040&rsqb; estimating a new source model based upon the probability &xgr;t(i, j) of the source model being in state i at time t and in state j at time t&plus;1 for the sequence of observation symbols and the probability &ggr;t (i) of the source model being in state i at time t for the sequence of observation symbols. Detailed Description: DETAILED DESCRIPTION OF THE INVENTION &lsqb;0052&rsqb; A modern radar system is capable to change its pulse repetition interval (PRI) from one stable value to another. Given sufficient observations it is possible to determine the sequences of PRI changes that can occur and cannot occur, and the time intervals separating the different PRIs. This information is very useful for recognizing a radar system among others that use the same stable PRI values but in a different order or with different intermediate intervals. For example, a radar system emits a stable PRI followed by a sequence of pulses spaced by varying time intervals, the sequence of intervals being periodic, exhibiting partial freedom, or being entirely pseudo-random. &lsqb;0053&rsqb; In addition to changing the pulse-to-pulse interval many modem radar systems emit different pulses. Recognizing the choice of pulse combined with the choice of interval by the radar system provides further information for recognizing a radar system. For example, two radar systems have a same set of pulses and intervals, but are still distinguishable if the order they emit and space their pulses differs. &lsqb;0054&rsqb; In order to provide the capability for recognizing modem radar systems a new method according to the invention is disclosed. The new method describes each radar system as a finite state automaton. This provides flexibility for modeling the radar system, and preserves a maximum of information provided by the observed signals. &lsqb;0055&rsqb; In the following, the method according to the invention will be explained in connection with the recognizing of modem radar systems in EW applications, but is not limited thereto. A person of skill in the art will find numerous applications of this method for recognizing electromagnetic signals emitted from sources other than radar systems. &lsqb;0056&rsqb; A finite state automaton is defined as follows: “A finite state automaton consists of a finite set of states and a set of transitions from state to state that occur on input symbols chosen from an alphabet. For each input symbol, there is exactly one transition out of each state (possibly back to the state itself).” The definition and a detailed description of finite state automata are found, for example, in Hopcroft, J. E. and Ullman, J. D. “Introduction to Automata Theory, Languages and Computation” Massachusetts, Addison-Wesley, (1979). &lsqb;0057&rsqb; The input symbols and state transitions of the radar system are likely unobservable by the EW system. What is observed by the EW system is the output of the finite state automaton. The output is chosen from an alphabet containing, for example, pulses and time intervals. The output is either associated with the state—called a Moore machine—or with the transition—called a Mealy machine. The Moore machine and the Mealy machine are equivalent, i.e. for any Moore machine there exists an equivalent Mealy machine as shown, for example, in Hopcroft, J. E. and Ullman, J. D. &lsqb;0058&rsqb; Referring to FIG. 1 the state diagram of a Moore machine is shown. A state diagram is a directed graph with the vertices of the graph corresponding to the states of the finite state automaton. If there is a transition from state i to state j on input x, then there is an arc labeled from state i to state j in the state diagram. The finite state automaton described by the state diagram in FIG. 1 has three states indicated by circles 1, 2, and 3, accepts a binary input from an input alphabet &lcub;0, 1&rcub;, and produces a ternary output from an output alphabet &lcub;a, b, c&rcub;. The outputs are shown above the states. If the automaton is in state 1 and reads an input it necessarily enters state 2 because the corresponding arc is labeled with both input symbols 0 and 1. Two arcs are leaving state 2, one labeled 0 going to state 1, and one labeled 1 going to state 3. The next state, therefore, depends on the input symbol read by the automaton. It is state 1 if the automaton reads an input symbol 0 or it is state 3 if the automaton reads an input symbol 1. If the automaton is in state 3 and reads an input symbol it goes to state 1. For example, starting in state 1 and reading an input sequence of consecutive 0s, the automaton produces the output sequence ababab . . . . Starting in the same state and reading an input sequence of consecutive 1s, it produces abcabcabc . . . . &lsqb;0059&rsqb; The finite state automaton representation of a radar system allows analysis of its dynamic behavior for three reasons. &lsqb;0060&rsqb; First, the dynamic behavior of the radar system is readily apparent upon examination of the state transitions. Every time the finite state automaton is in a state from which transition is possible to two or more states, the next state is selected based on the input symbol. Therefore, the finite state automaton representation of the radar system takes into account that the radar system is driven by events resulting in input symbols that are randomly chosen, controlled by a tracking process, controlled by an operator, etc. If the finite state automaton contains no state from which transition is possible to two or more states the corresponding radar system is not dynamic, i.e. it produces a periodic signal. &lsqb;0061&rsqb; Second, the finite state automaton representation provides flexibility for modeling a radar system by allowing the output alphabet to contain pulses, intervals, pulses combined with intervals, bursts of consecutive pulses, portions of continuous wave (CW) signals, etc. Furthermore, the pulses, intervals, etc. represented by the output symbols need not to have a same duration. &lsqb;0062&rsqb; Third, representing a radar system as a finite state automaton allows analysis using hidden Markov models (HMM). &lsqb;0063&rsqb; HMMs have been used very successfully for speech recognition. A detailed description of the HMMs is given, for example, in Rabiner, Lawrence and Juang, Biing-Hwang “Fundamentals of Speech Recognition”, New Jersey: Prentice Hall (1993), and Jelinek, Frederick “Statistical Methods for Speech Recognition (Language, Speech, and Communication)”, Cambridge, Mass.: MIT Press. (1999). &lsqb;0064&rsqb; Jelinek and Frederick describe in “Continuous Speech Recognition by Statistical Methods”, Proc. IEEE, 64(4), 532-556, (1976) statistical methods of automatic recognition of continuous speech concerning the modeling of a speaker and of an acoustic processor, extraction of the models' statistical parameters, hypothesis search procedures, and likelihood computations of linguistic decoding. &lsqb;0065&rsqb; Levinson et al. disclose in U.S. Pat. RE No. 33,597 reissued in May 28, 1991, in a speech recognizer storing of a set of signals each representative of a prescribed acoustic feature and storing of a template for each spoken reference word which comprises signals representative of a first state, a last state and a preselected number of intermediate states of a constrained HMM. &lsqb;0066&rsqb; Doddington et al. teach in U.S. Pat. No. 4,977,598 issued in Dec. II, 1990 an efficient pruning method which reduces computer processing unit loading during speech recognition by means of a HMM. &lsqb;0067&rsqb; Bahl et al. describe in U.S. Pat. No. 4,827,521 issued in May 2, 1989 training of Markov models in a speech recognition environment, wherein word decoding accuracy is maximized by maximizing the difference between the probability of the correct script of uttered words given the label outputs and the probability of any other script. &lsqb;0068&rsqb; An HMM is characterized by the following definitions, which will be used throughout the disclosure of the invention: &lsqb;0069&rsqb; 1. N being the number of states in the model. The states are hidden, i.e. they are not observable. The individual states are labeled as &lcub;1, 2, . . . , N&rcub;, and the state of the model at time t is qt. &lsqb;0070&rsqb; 2. M being the number of distinct observation symbols per state, i.e. the discrete alphabet size. The observation symbols correspond to the physical output of the system being modeled. The individual symbols are denoted as V&equals;&lcub;v1, v2, . . . , VM&rcub;. &lsqb;0071&rsqb; 3. A&equals;&lcub;aj&rcub; being a state transition probability distribution where aij&equals;P&lsqb;qt&plus;1&equals;j&verbar;qt&equals;i&rsqb;, 1&lE;i,j&lE;N. (1) &lsqb;0072&rsqb; In the special case where each state reaches every other state of the model in a single step, we have aij>0 for all (i, j) pairs. In other cases we have aij&equals;0 for one or more (i, j) pairs. &lsqb;0073&rsqb; 4. B&equals;&lcub;bj(k)&rcub; being an observation symbol probability distribution, in which bj(k)&equals;P&lsqb;ot&equals;vk&verbar;qt&equals;j&rsqb;, 1&lE;k&lE;M. (2) &lsqb;0074&rsqb; The observation symbol probability distribution defines the symbol distribution in state j,j&equals;1, 2, . . . , N, and ot denotes the observation symbol at time t. &lsqb;0075&rsqb; 5. &pgr;&equals;&lcub;&pgr;i&rcub; being an initial state distribution where &pgr;i&equals;P&lsqb;q1&equals;i&rsqb;, 1&lE;i&lE;N. &lsqb;0076&rsqb; Given appropriate values of N, M, A, B, and &pgr; the HMM generates an observation sequence O&equals;(o1o2 . . . OT) with each observation ot being one of the symbols from V, and with T being the number of observations in the sequence. For brevity, the compact notation &pgr;&equals;(A, B, &pgr;) will be used in the following to denote a complete parameter set of the HMM. &lsqb;0077&rsqb; Based upon the above described characterization it is possible to model the states and outputs of a finite state automaton as states and observation symbols in the HMM. The main difference is that transitions are driven by input symbols in the finite state automata while they occur statistically in HMMs. Therefore, every transition out of every state—possibly back to the state itself—in the finite state automaton is modeled as a non-zero transition probability in the probability distribution A of the HMM. The lack of a transition in the finite state automaton is modeled as a zero transition probability in the probability distribution A. The difference between the finite state automaton and the HMM accommodates the fact that the input symbols and state transitions are unobservable in EW applications. &lsqb;0078&rsqb; Numerous HMMs are able to produce observation sequences explaining the output sequences of a given finite state automaton. In the following three possible HMMs explaining the output sequences of the Moore machine shown in FIG. 1 will be described. &lsqb;0079&rsqb; Referring to FIG. 2 a possible HMM which is able to produce observation sequences explaining the output sequences of the finite state automaton of FIG. 1 is shown. The HMM of FIG. 2 has N&equals;3 states. Each state corresponds to one of M&equals;3 observation symbols, v1&equals;a, v2&equals;b, and v3&equals;c, respectively. The observation alphabet of this model is identical to the output alphabet of the finite state automaton. A possible state transition probability A is given by 1 A = { a ij } = [ 0 1 0 0.5 0 0.5 1 0 0 ] &lsqb;0080&rsqb; where transition from state 1 is always to state 2, transition from state 3 is always to state 1, and transitions from state 2 to states 1 and 3 have been chosen to be equiprobable. &lsqb;0081&rsqb; Referring to FIG. 3 another possible HMM which is able to produce observation sequences explaining the output sequences of the finite state automaton of FIG. 1 is shown. The HMM of FIG. 3 has N&equals;2 states. Each state corresponds to one of M&equals;2 observation symbols, v1&equals;ab, and v2&equals;abc, respectively. In this model the observation alphabet is different from the output alphabet of the finite state automaton. A possible state transition probability distribution A is given by 2 A = { a ij } = [ 0.5 0.5 0.5 0.5 ] &lsqb;0082&rsqb; where all transition have been chosen to be equiprobable. &lsqb;0083&rsqb; Before introducing the third HMM modeling for discrete time and uniform symbol duration will be explained in the following. &lsqb;0084&rsqb; In practice, most radar systems contain a clock, which is used to produce pulse to pulse intervals as integer multiples of the clock period. Generally, it is possible in EW systems to estimate the radar clock period, or a multiple thereof. In the following this estimated period is denoted r. For simplicity r is assumed to be exact in following description, but as is evident to a person of skill in the art the invention is not limited thereto. Having estimated the radar period it is possible to transform the observation signal into a sequence of observation symbols—O&equals;(o1o2 . . . oT), wherein the duration of each symbol ot is equal to an integer multiple of the clock period&tgr;. This implies proper synchronization and an observation alphabet V where the symbol durations are all multiples of &tgr;. &lsqb;0085&rsqb; For modeling radar systems that do not use a clock, either r is chosen to be very small, or a continuous-time HMM is used. &lsqb;0086&rsqb; To illustrate the discrete-time modeling the discrete-time output alphabet, shown in Table 1, is chosen for the finite state automaton of FIG. 1. 1 TABLE 1 Symbol Duration Description a 1 &tgr; a pulse b 2 &tgr; Symbol a followed by an empty interval of one clock period c 3 &tgr; Symbol a followed by an empty interval of two clock periods &lsqb;0087&rsqb; Denoting by 1 an interval containing a pulse, and by 0 an empty interval the output alphabet is rewritten as a &equals;1, b&equals;10, and c&equals;100. &lsqb;0088&rsqb; Referring now to FIG. 4 the states and possible transitions of a third HMM of the finite state automaton of FIG. 1 is shown, which accounts for output sequences produced by a discrete-time finite state automaton. This model is essentially the HMM of FIG. 2 modified to accept observation symbols of uniform duration s. Defining M&equals;2 observation symbols, v1&equals;1 and v2&equals;0, and then dividing each original state into one or more new states based on the duration of the associated original symbol N&equals;6 new states are obtained with the state transition probability distribution 3 A = { a ij } = [ 0 1 0 0 0 0 0 0 1 0 0 0 0.5 0 0 0.5 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 ] . &lsqb;0089&rsqb; Given the states and transitions of a uniform discrete-time HMM, it is possible to construct a graph called the “Trellis diagram” as follows. First, T copies of the N states are replicated. The N states of the tth copy correspond to the HMM at time t. A line with an arrow connects a state Ai of the tth copy with a state Aj of the (t&plus;1)th copy if the corresponding transition probability aij is positive. For example, FIG. 5 shows the Trellis diagram for the HMM of FIG. 4. The Trellis diagram leads to fast solution methods for many problems of interest. &lsqb;0090&rsqb; In the models shown above a single observation symbol has been associated to each state of the HMM. In the following we now consider the possibility of errors to occur during the observation a signal emitted from the radar system. It is possible to consider such errors in the HMM by means of the observation symbol probability distribution B, which will be explained in the following using the third model, but is not limited thereto. &lsqb;0091&rsqb; For example, a pulse is observed when the radar output was an empty interval. Using radar nomenclature we call this event a false alarm and denote the false alarm probability as PF. Conversely, it is possible that nothing is observed when the radar output was a pulse. This event is called a miss and the miss probability is denoted PM. Formally, we have PF&equals;P&lsqb;ot&equals;1&verbar;output 0 at t&rsqb; (3) PM&equals;P&lsqb;ot&equals;0&verbar;output 1 at t&rsqb;. (4) &lsqb;0092&rsqb; The corresponding observation symbol distribution B&equals;&lcub;bj(k)&rcub;, bj(k)&equals;P&lsqb;ot&equals;vk&verbar;qt&equals;j&rsqb;, j&equals;1, 2, . . . , 6, for the uniform discrete-time HMM of FIG. 4 is shown in Table 2. 2 TABLE 2 j k vk BJ(k) 1 1 1 1 − PM 1 2 0 PM 2 1 1 1 − PM 2 2 0 PM 3 1 1 PF 3 2 0 1 − PF 4 1 1 1 − PM 4 2 0 PM 5 1 1 PF 5 2 0 1 − PF 6 1 1 PF 6 2 0 1 − PF &lsqb;0093&rsqb; For brevity and HMM corresponding to a radar system is called the radar model. We assume that the EW system contains L competing radar models. The individual radar models are denoted as &lgr;(1), &lgr;(2), . . . , &lgr;(L). The models have different time periods, which are denoted as &tgr;(1), &tgr;(2), . . . , &tgr;(L). Hence, for a given observation signal, there are several observation sequences, which are denoted as O(1), O(2), . . . , O(L), respective to the different time periods. &lsqb;0094&rsqb; Referring to FIG. 6, a method for modeling a radar system according to the invention is shown. In a first step, the radar system is described as a finite state automaton comprising a finite set of states and a set of transitions from state to state that occur in dependence upon an input signal. The finite state automaton produces a sequence of output symbols from an output alphabet in dependence upon the state transitions such that the sequence of output symbols corresponds to an observed electromagnetic signal emitted from the radar system. In a second step the finite state automaton is transformed into a HMM such that a sequence of observation symbols produced from an observation alphabet by the HMM is equal to the sequence of output symbols. Optionally, given the states and transitions of a uniform discrete-time HMM, a Trellis diagram is constructed. &lsqb;0095&rsqb; For simplicity, discussion of the various concepts of the invention has been limited to the observation of discrete symbols chosen from an alphabet. However, it is important to note that it is possible to generalize all the disclosed concepts to continuously distributed multivariate observations. This is achieved by replacing the observation symbol probability distribution with a joint probability density function for which a HMM training procedure has been formulated. Compliant joint density functions include elliptically symmetric density functions like multivariate Gaussians and multivariate mixtures like Gaussian sums. In EW, generalization to multivariate observations allows use of parameters like pulse width and frequency. &lsqb;0096&rsqb; In modern electronic warfare four basic problems are encountered. &lsqb;0097&rsqb; The first problem is the classification problem: given an observed signal and L competing radar models &lgr;(1), &lgr;(2), . . . , &lgr;(L), how is the model chosen which best matches the observed signal&quest; &lsqb;0098&rsqb; The second problem is the decoding problem: given the observation sequence O and the radar model &lgr;, how is a state sequence {circumflex over (Q)}&equals;({circumflex over (q)}1{circumflex over (q)}2 . . . {circumflex over (q)}T) chosen which explains best the observations&quest; &lsqb;0099&rsqb; The third problem is the prediction problem: given the partial observation sequence (o1o2 . . . ot) and the radar model A, how is the next observation symbol ôt&plus;1&equals;vk predicted and the associated probability P&lsqb;ot&plus;1&equals;vk&verbar;o1o2 . . . ot, &lgr;&rsqb; computed&quest; &lsqb;0100&rsqb; The fourth problem is the training problem: given only the observation sequence O, how is the radar model A adjusted—or trained—so that it best describes the generation of the observed signals produced by the radar system&quest; &lsqb;0101&rsqb; The classification problem is critical for ES and EA. Current approaches use histograms of the pulses in a parametric space and temporal periodicities in the pulse train, extract parameters and match them to competing entries in a library. When the extracted parameters fall into an overlap area of two or more entries of the library, the emitter is not uniquely identified, resulting in an ambiguity. EW systems are designed to communicate multiple candidate identifications to the operator. For example, a friendly emitter leads to multiple candidate identifications that include a threat. This triggers an unnecessary alert, jeopardizing safety and increasing the risk of fracticide. Since the method for modeling a radar system according to the invention preserves more information about the radar system than current approaches, it has the potential to substantially enhance the classification of radar systems. &lsqb;0102&rsqb; Since the L competing radar models have different time periods the observation signal is transformed into L sequences of observation symbols, O(1), O(2), . . . , O(L), where the duration of each symbol ot(l) of the lth sequence is equal to an integer multiple of the lth time period &tgr;(l), 1&lE;&lE;L. &lsqb;0103&rsqb; Formally, the classification problem now becomes: given O(1), O(2), . . . , O(L) and &lgr;(1), &lgr;(2), . . . , &lgr;(L), how is the most probable of the L radar models chosen&quest; &lsqb;0104&rsqb; From Bayesian decision theory, one of the most useful decisions is to maximize the a posteriori probability. The maximum a posteriori (MAP) decision is to choose 4 l MAP = arg &it; &it; max 1 &leq; l &leq; L &it; P &af; [ λ ( l ) &VerticalSeparator; O ( l ) ] . ( 5 ) &lsqb;0105&rsqb; Using Bayes rule, we have 5 P &af; [ λ &VerticalSeparator; O ] = P &af; [ O &VerticalSeparator; λ ] &it; P &af; [ λ ] P &af; [ O ] . ( 6 ) &lsqb;0106&rsqb; Since P&lsqb;O&rsqb; is not a function of &lgr;, the MAP decision is also defined as 6 l MAP = arg &it; &it; max 1 &leq; l &leq; L &it; P &af; [ O ( l ) &VerticalSeparator; λ ( l ) ] &it; P &af; [ λ ( l ) ] . ( 7 ) &lsqb;0107&rsqb; However, the MAP decision requires prior knowledge of the probabilities P&boxur;&lgr;(l)&boxul;, 1&lE;l&lE;L, which is not always available. &lsqb;0108&rsqb; When the probabilities P&boxur;&lgr;(l)&boxul;, 1&lE;l&lE;L, are not known a priori, it is assumed that the competing radar models are equiprobable. Then the maximum likelihood (ML) decision is used which is defined as follows 7 l ML = arg &it; &it; max 1 &leq; l &leq; L &it; P &af; [ O ( l ) &VerticalSeparator; λ ( l ) ] . ( 8 ) &lsqb;0109&rsqb; Whether the MAP or ML decision is used for each of the L competing radar models the probability of the sequence for a given model is computed. This problem is called the evaluation problem: given an observation sequence O&equals;(o1o2 . . . oT) and a radar model &lgr;, how is P&lsqb;O&verbar;&lgr;&rsqb;—the probability of the sequence for a given radar model—computed&quest; &lsqb;0110&rsqb; One possibility is a direct approach to solving the evaluation problem. However, since computing the probability of O given a state sequence Q requires the order of T calculations, and since there are NT possible state sequences, a direct computation of P&lsqb;O&verbar;&lgr;&rsqb; requires in the order of TNT calculations. Because of the large number of calculations and its non-polynomial complexity, the direct approach is practical only for small HMMs. &lsqb;0111&rsqb; A method for solving the evaluation problem for large HMMs is the forward-backward procedure which is described in detail, for example, in Baum, L. E. and Egon, J. A. “An Inequality with Applications to Statistical Estimation for Probabilistic Functions of a Markov Process and to a Model for Ecology”, Bull. Amer. Meteorol. Soc., 73, 360-363, (1967), and Baum, L. E. and Sell, G. R. “Growth Functions for Transformations on Manifolds”, Pac. J. Math., 27(2), 211-227, (1968). The solution of the evaluation problem using the forward-backward procedure requires in the order of N2T calculations. &lsqb;0112&rsqb; Consider the forward variable &agr;t(i)&equals;P&lsqb;o1o2 . . . ot, qt&equals;i&verbar;&lgr;&rsqb;, (9) &lsqb;0113&rsqb; i.e. the probability of the model being in state i at time t and observing the partial sequence (o1o2 . . . ot), for a given model &lgr;. The forward variable at time t&equals;1 is the joint probability of state i and observation o1, &agr;1(i)&equals;&lgr;ibi(o1), 1&lE;i&lE;N. (10) &lsqb;0114&rsqb; At time t&equals;2 the forward variable is 8 α 2 &af; ( i ) = [ &Sum; i = 1 N &it; [ π i &it; b i &af; ( o 1 ) ] &it; a ij ] &it; b j &af; ( o 2 ) = [ &Sum; i = 1 N &it; α 1 &af; ( i ) &it; a ij ] &it; b j &af; ( o 2 ) , 1 &leq; i &leq; N . &lsqb;0115&rsqb; Proceeding inductively, we obtain for 1&lE;t&lE;T−1, 9 α t + 1 &af; ( i ) = [ &Sum; i = 1 N &it; α i &af; ( i ) &it; a ij ] &it; b j &af; ( o t + 1 ) , 1 &leq; i &leq; N . ( 11 ) &lsqb;0116&rsqb; Finally, the sum of the terminal forward variables provides the solution to the evaluation problem, i.e. 10 P &af; [ O &VerticalSeparator; λ ] &it; &Sum; i = 1 N &it; α T &af; ( i ) . ( 12 ) &lsqb;0117&rsqb; The forward-backward procedure owes its efficiency to the Trellis representation of uniform discrete-time HMMs. &lsqb;0118&rsqb; Once the evaluation problem has been solved it is possible to compute for each of the L models in the classification problem the probability of the sequence for each given model and to decide between the models using the MAP or the ML criterion. &lsqb;0119&rsqb; A special situation occurs when the ES or EA system encounters in the field either an unknown radar system, or an unknown signal produced by a known radar system. When such a situation occurs it is not desired that the ES or EA system chooses a model of its library for the unknown signal, but provides an indication that an unknown signal has been observed. This results in a decision with a reject option. Formally, the decision problem has then (L&plus;1) values: 1, 2, . . . , L, and “reject”. &lsqb;0120&rsqb; Referring to FIG. 7 a simplified flow diagram of a method for classifying radar models according to the invention is shown. &lsqb;0121&rsqb; The decoding problem is: given the observation sequence O and the radar model &lgr;, how is a state sequence {circumflex over (Q)}&equals;({circumflex over (q)}1{circumflex over (q)}2 . . . {circumflex over (q)}T) chosen which explains best the observations&quest; &lsqb;0122&rsqb; Particularly useful for ES and EA applications is not so much the complete state sequence {circumflex over (Q)}. as the recognition of specific state transitions providing situational information. For example, when a missile is launched, the associated radar system often changes its signal to guide the missile. In order for the radar signal to change, some state transition has to occur in the finite state automaton of the radar. By observing the state transition that corresponds to a missile launch, the ES or EA system is able to recognize the event and to warn that a missile is airborne. In another example, when a radar senses a new target it often changes its signal to estimate the position and velocity of the target. Again in order for the radar signal to change, some state transition has to occur in the finite state automaton of the radar. By observing this state transition the ES or EA system is able to warn that a target is being acquired. &lsqb;0123&rsqb; Assuming that the radar system has already been classified, the motivation behind the decoding problem is to recognize changes in the radar signal and, ultimately, to infer what events are happening. If the HMM contains the state transitions that correspond to critical events it substantially enhances situational awareness. &lsqb;0124&rsqb; The solution to the decoding problem depends on the choice of an optimality criterion to determine which sequence is the best. The optimality criterion is to maximize P&lsqb;Q&verbar;O, &lgr;&rsqb;. This criterion accounts for the probability of occurrence of sequences of states. Therefore, it yields a sequence for which all state transitions have positive probability, i.e. a valid sequence. &lsqb;0125&rsqb; For solving the decoding problem the dynamic programming method—also known as the Viterbi method—is used. Detailed information about this method is provided, for example, in Bellman, Richard “Dynamic Programming”, New Jersey, Princeton University Press, (1957), and in Bertsekas, Dimitri “Dynamic Programming and Optimal Control” 2 ed. Belmont, Mass.: Athena Scientific, (2000). Optionally, less optimal methods such as the stack method are also applicable for solving the decoding problem. In particular, if exhaustive exploration of the Trellis diagram is prohibitive. &lsqb;0126&rsqb; FIG. 8 illustrates a simplified flow diagram of a method for decoding an observed signal emitted from a radar system according to the invention. &lsqb;0127&rsqb; The prediction problem is: given the partial observation sequence (o1o2 . . . ot) and the radar model &lgr;, how is the next observation symbol ôt&plus;1&equals;vk predicted and the associated probability P&lsqb;ot&plus;1&equals;vk&verbar;o1o2 . . . ot, &lgr;&rsqb;computed&quest; &lsqb;0128&rsqb; This problem is of particular interest for EA systems using deceptive electronic countermeasures techniques. For example, the range gate pull-off technique involves the transmission of false echo pulses just before the arrival of the actual radar pulses to create a false target. To simulate an inbound target the jammer anticipates the reception of the radar pulse and transmits a false echo pulse before the radar pulse. For this technique to work it is crucial that the time of arrival of the radar pulse is predicted reliably and accurately. &lsqb;0129&rsqb; This problem is closely related to the evaluation problem and similarly solved. Using the forward variable the probability that the next symbol is vk is 11 P &af; [ o t + 1 = v k &VerticalSeparator; o 1 &it; o 2 &it; … &it; &it; o t , λ ] = P &af; [ o t + 1 = v k , o 1 &it; o 2 &it; … &it; &it; o t &VerticalSeparator; λ ] P &af; [ o 1 &it; o 2 &it; … &it; &it; o t &VerticalSeparator; λ ] ( 13 ) = &Sum; j = 1 N &it; [ &Sum; i = 1 N &it; α t &af; ( i ) &it; a ij ] &it; b j &af; ( k ) &Sum; i = 1 N &it; α t &af; ( i ) . ( 14 ) &lsqb;0130&rsqb; Therefore, the most probable symbol vk to occur at time t&plus;1 is 12 o &Cap; t + 1 = arg &it; &it; max 1 &leq; k &leq; M &af; [ &Sum; j = 1 N &it; [ &Sum; i = 1 N &it; α t &af; ( i ) &it; a ij ] &it; b j &af; ( k ) ] . ( 15 ) &lsqb;0131&rsqb; Similarly the HMM is used to predict the most probable symbol to occur at time t&plus;2, t&plus;3, etc. Furthermore, it is possible to use the HMM in a similar fashion to estimate the time a given symbol is most likely to be observed next. &lsqb;0132&rsqb; A simplified flow diagram of a method according to the invention for predicting a next observation symbol given a partial observation sequence is shown in FIG. 9. &lsqb;0133&rsqb; The training problem is: given only the observation sequence O, how is the radar model &lgr; adjusted—or trained—so that it best describes the generation of the observed signals produced by the radar system&quest; &lsqb;0134&rsqb; Prior to solving the classification, decoding and prediction problems radar models are needed. Training an HMM is viewed as a reverse engineering problem: knowing what the radar produces, what is the finite state automaton in the radar model&quest; The training problem is of particular interest for ELINT, a branch of the EW concerned with the interception and analysis of radar signals for the population of databases. &lsqb;0135&rsqb; Ideally, the training problem is defined as finding the maximum a posteriori radar model 13 λ MAP = arg &it; &it; max λ &it; P &af; [ λ &VerticalSeparator; O ] . ( 16 ) &lsqb;0136&rsqb; However, the solution to this equation is most likely not unique. In practice we have only partial knowledge of the probabilities P&lsqb;&lgr;&rsqb; for all possible &lgr;s and the search space comprising all possible &lgr;s is very large. &lsqb;0137&rsqb; Not knowing the number N of states different values of N are used and then for each given N the corresponding MAP model is searched, and finally the best of the models found is chosen. &lsqb;0138&rsqb; To illustrate the difficulty of the problem we return to the Moore machine of FIG. 1. Considering that it has produced an output abcabcabab, or rewritten using the discrete-time alphabet 101001101001101110. Assuming M&equals;2, v1&equals;1, v2&equals;0, and that no observation error has occurred, then the observation sequence O is the same as the Moore machine's output. &lsqb;0139&rsqb; In the following, two very simple HMMs will be examined and compared. For the smallest possible number of states, N&equals;1, we arrive at a model defined by A&equals;&lsqb;1&rsqb;, 14 b 1 &it; ( 1 ) = 5 9 , b 1 &it; ( 2 ) = 4 9 , &lsqb;0140&rsqb; and &pgr;1&equals;1. The probability of this radar model &lgr;(1) producing the sequence O is 15 P &af; [ O &VerticalSeparator; λ ( 1 ) ] = ( 5 9 ) 10 &it; ( 4 9 ) 8 &TildeTilde; 4.3 × 10 - 6 . &lsqb;0141&rsqb; For the number of states being equal to the number of observation symbols of the observation sequence O, N&equals;18, we arrive at the model defined by A being equal to the N×N diagonal matrix, bt(1)&equals;1 and bt(2)&equals;0 for t such that ot&equals;1, and bt(1)&equals;0 and bt(2)&equals;1 for t such that ot&equals;0, &pgr;1&equals;1, and &pgr;i&equals;0 for 2&lE;i&lE;18. The probability of this radar model &lgr;(2) producing the sequence O is 16 P &it; &LeftFloor; O &VerticalSeparator; λ ( 2 ) &RightFloor; = ( 1 ) 18 = 1. &lsqb;0142&rsqb; Which of the two models &lgr;(1) or &lgr;(2) should be chosen&quest; The latter is more likely to have produced the sequence O, but has a number of states equal to the number of observation symbols of the observation sequence O. However, is the latter model plausible&quest; Answering such a question requires prior knowledge, for example, from radar engineering. Consequently, the success of automatic HMM training depends as much on the use of prior knowledge in the form of P&lsqb;&lgr;&rsqb;, as on the maximization of the probability of the sequence being observed from the model P&lsqb;O&verbar;&lgr;&rsqb;. &lsqb;0143&rsqb; Given a lack of prior statistics the maximum likelihood model 17 λ ML = arg &it; &it; max λ &it; P &af; [ O &VerticalSeparator; λ ] ( 17 ) &lsqb;0144&rsqb; is considered, which is considerably simpler than the MAP problem. Still, there is no known way for analytically solving the ML problem. &lsqb;0145&rsqb; Assuming knowledge of the number of states N the ML problem is iteratively solved using the Baum-Welch method, which is, for example discussed in Baum, L. E. “An Inequality and Associated Maximization Technique in Statistical Estimation for Probabilistic Functions of Markov Processes”, Inequalities, 3, 1-8, (1972). The solution of the ML problem leads to local maxima of the probability of the sequence being observed from the model, P&lsqb;O&verbar;&lgr;&rsqb;. In most problems of interest, the optimization surface is complex and has many local maxima and, therefore, the solution found, &lgr;BW, is not necessarily the optimum. &lsqb;0146&rsqb; Before describing the iterative solution, we first define the backward variable as &bgr;t(i)&equals;P&lsqb;ot&plus;1ot&plus;2 . . . oT&verbar;qt&equals;i,&lgr;&rsqb; (18) &lsqb;0147&rsqb; i.e. the probability of observing the partial sequence (ot&plus;1ot&plus;2 . . . oT) for a given state i at time t and a given model &lgr;. The backward variable at time T is arbitrarily defined as &bgr;T(i)&equals;1, 1&lE;i&lE;N. (19) &lsqb;0148&rsqb; Proceeding inductively, we obtain for 1&lE;t&lE;T−1, 18 β t &af; ( i ) = &Sum; j = 1 N &it; a ij &it; b j &af; ( o t + 1 ) &it; β t + 1 &af; ( j ) , 1 &leq; i &leq; N . ( 20 ) &lsqb;0149&rsqb; We define the probability of being in state i and at time t and state j at time t&plus;1, given the observation sequence and the model, as &xgr;t(i,j)&equals;P&lsqb;qt&equals;i,qt&plus;1&equals;j&verbar;O,&lgr;&rsqb;. (21) &lsqb;0150&rsqb; Using the definitions of the forward and backward variables &xgr;t(i, j) is written in the form 19 ξ t &af; ( i , j ) = α t &af; ( i ) &it; a ij &it; b j &af; ( o t + 1 ) &it; β t + 1 &af; ( j ) P &af; [ O &VerticalSeparator; λ ] = α t &af; ( i ) &it; a ij &it; b j &af; ( o t + 1 ) &it; β t + 1 &af; ( j ) &Sum; i = 1 N &it; &Sum; j = 1 N &it; α t &af; ( i ) &it; a ij &it; b j &af; ( o t + 1 ) &it; β t + 1 &af; ( j ) . ( 22 ) &lsqb;0151&rsqb; Next we define the variable &ggr;t(i)&equals;P&lsqb;qt&equals;i&verbar;O,&lgr;&rsqb; (23) &lsqb;0152&rsqb; as the probability of being in state i at time t, given the observation sequence and the model. Using the definitions of the variables &agr;, (i), &bgr;t(i), and &xgr;t(i, j), &ggr;t(i) is rewritten in the form 20 γ t &af; ( i ) = &it; α t &af; ( i ) &it; β t &af; ( i ) P &af; [ O &VerticalSeparator; λ ] &it; α t &af; ( i ) &it; β t &af; ( i ) &Sum; i = 1 N &it; α t &af; ( i ) &it; β t &af; ( i ) &it; &Sum; j = 1 N &it; ξ t &af; ( i , j ) . ( 24 ) &lsqb;0153&rsqb; If we sum &ggr;t(i) over time, we get the expected number of transitions from state i. Similarly, if we sum &xgr;t(i, j) over time, we get the expected number of transitions from state i to state j. &lsqb;0154&rsqb; Based on the above variables and formulas, the following equations are used to iteratively estimate &pgr;, A, and B: {overscore (&pgr;)}i&equals;&ggr;t(i) (25) &lsqb;0155&rsqb; 21 a _ ij = &Sum; i = 1 T - 1 &it; ξ t &af; ( i , j ) &Sum; i = 1 T - 1 &it; γ t &af; ( i ) ( 26 ) b _ j &af; ( k ) = &Sum; i * &it; γ t &af; ( j ) &Sum; i = 1 T &it; γ t &af; ( j ) , ( 27 ) &lsqb;0156&rsqb; wherein t* is such that ot&equals;vk. &lsqb;0157&rsqb; Denoting the current model as &lgr;&equals;(A, B, &pgr;) equations (25)-(27) are then used to estimate a new model {overscore (&lgr;)}&equals;({overscore (A)}, {overscore (B)}, {overscore (&pgr;)}). It has been proven that if {overscore (&lgr;)}≠&lgr;, then the probability of O being observed from the model has increased, i.e. P&boxur;O&verbar;{overscore (&lgr;)}&boxul;>P&lsqb;O&verbar;&lgr;&rsqb;. In a following iteration step the current model is set equal to the new model and equations (25)-(27) are then used again to re-estimate the model. If {overscore (&lgr;)}&equals;&lgr; a limit has been reached and the model {overscore (&lgr;)}&equals;&lgr;BW corresponds to a local maximum of P&lsqb;O&verbar;&lgr;&rsqb;. &lsqb;0158&rsqb; Again the optimization surface is very complex and has many local maxima. Therefore, the model &lgr;BW found by the iterative solution depends to a large extent on the initial condition, i.e. the radar model &lgr;
{'app_number': '10233658', 'application_number': None, 'doc_number': '20030085831', 'publication_number': None, 'source_file': './application/2003/pa030508.xml', 'source_data': 'USPTO-Application'}