Jammer behavior modeling utilizes two-layer hidden Markov models (HMMs) for identifying an interferer's plurality of modes and accumulating statistics on transitions between the interferer's plurality of modes for use in improved jammer characterization. The two-layer hidden Markov model characterizes jammer behavior by estimating time-varying but repetitive (mode-cycling) jammer behavior, providing estimates of future states for use by a strategy optimizer. Steps include receiving input data from an interferer; determining if models exist for describing the interferer's behavior; determining if a new model is needed; building a first layer HMM for each state of the interferer; building a second layer HMM using an output from the first layer HMM; and outputting the results from the first and second layer HMMs to a strategy optimizer to identify an interferer's plurality of modes and accumulate statistics on transitions between the interferer's plurality of modes for use in jammer mode prediction.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A two-layer hidden Markov model (HMM) method of predicting jammer behavior comprising: receiving input data from an interferer; determining if any models exist for describing an interferer's behavior; determining if a new model is needed; building a first layer HMM for each state of said interferer; building a second layer HMM using an output from said first layer HMM; and outputting results from said first layer HMM and said second layer HMM to a strategy optimizer which identifies an interferer's plurality of modes and accumulates statistics on transitions between said interferer's plurality of modes for use in jammer behavior prediction, wherein said predictions are made by said strategy optimizer to select from a library of mitigation strategies the optimal strategy to be used against a next predicted mode of said jammer. 2. The method of claim 1, wherein said input data comprises: higher order statistics; a binary detection map; a likelihood vector for current observation features; a statefile; and a timestamp. 3. The method of claim 1, wherein said two-layer hidden Markov models are built by an interference recognizer. 4. The method of claim 1, wherein said two-layer hidden Markov models are built by an interference recognizer with one hidden Markov model per emitter. 5. The method of claim 1 wherein upon HMM startup, a model is created for a first mode using a first data window; and subsequent windows are split into frames, each of which is compared to existing models using a two-stage forward HMM. 6. The method of claim 1 wherein jammer modes are not previously known, and a number of required states is estimated by calculating an average silhouette of k-means clustering. 7. The method of claim 1 wherein k-means clustering is performed on data with increasing number of clusters. 8. The method of claim 7, wherein for each k-means result, an average silhouette value is calculated and compared to prior values. 9. The method of claim 1 wherein said models are built in an unsupervised fashion, whereby no prior training is performed and all models are built during run-time. 10. The method of claim 1 comprising looping through each subspace. 11. The method of claim 1, wherein said HMM input data comprises: a vector of binary frequency detections; and time and frequency higher order statistics for each sample interval. 12. The method of claim 1, wherein frequency maps are binary and higher order statistics are quantized and stacked upon detections to create completely binary input vectors. 13. The method of claim 1 wherein a first stage finds an ideal path through each of said HMMs given said input data using a Jaccard coefficient similarity metric of J  ( y , Y ) =  y ⋂ Y   y ⋃ Y  . 14. The method of claim 1, wherein if a threshold for a first stage is not met, a second stage finds an ideal path using a Bernoulli log-like metric of ∑ i = 1 n  Y i  log  ( p i ) + ( 1 - Y i )  log  ( 1 - p i ) . 15. A two-layer hidden Markov model (HMM) system for predicting jammer behavior comprising: inputting data; looping through for each subspace; stacking inputs; determining if a model exists; if said model does not exist, then train new model, if said model does exist, then divide inputs into frames; performing HMM forward algorithm processing for each frame and each jammer mode model; grouping consecutive frames and remove small gaps; looping through labeled data; if label equals 0, then perform expectation maximization algorithm; if is first 0 in window, then train a new model; if is not first 0 in window, then perform said HMM forward algorithm processing for each frame and each jammer mode model; after training said new model, process histogram obsvec inputs and update transition matrices; and outputting predicted jammer states, whereby a most likely next jammer state is predicted using a current HMM state along with HMM transition and transition duration matrices. 16. The system of claim 15, wherein said HMM forward algorithm processing for each frame and each jammer mode model comprises: calculating a HMM forward algorithm Jaccard metric; if said HMM forward algorithm Jaccard metric is greater than thresh1, then a frame state label equals max; if said HMM forward algorithm Jaccard metric is not greater than said thresh1, then calculate a HMM forward algorithm Bernoulli log likelihood metric; if said HMM forward algorithm Bernoulli log likelihood metric is greater than thresh2, then said frame state label equals max; if said HMM forward algorithm Bernoulli log likelihood metric is not greater than thresh2, then said frame state label equals 0. 17. The system of claim 15, wherein said looping through labeled data step comprises: if a loop of label equals 0, and a first 0 in window, then train a new model; if said loop of label is not equal to 0, then update model computing an expectation maximization algorithm; if said loop of label equals 0, and is not said first 0 in window, then perform said HMM forward algorithm processing for each frame and each jammer mode model. 18. The system of claim 15, wherein said train new model comprises: a silhouette of Kmeans to find a number of states; initializing Bernoulli probabilities; and performing an expectation maximization algorithm. 19. The system of claim 15, wherein said histogram obsvec inputs and update transition matrices comprises: calculating obsvec feature statistics; calculating a HMM transition matrix; and calculating a HMM transition durations matrix. 20. A non-transitory computer-readable storage medium including instructions that are configured, when executed by a computing system, to develop a two-layer hidden Markov model (HMM), the method comprising: receiving input data from an interferer; determining if any models exist for describing an interferer's behavior; determining if a new model is needed; building a first layer HMM for each state of said interferer; building a second layer HMM using an output from said first layer to HMM; and outputting results from said first layer HMM and said second layer HMM to a strategy optimizer to identify an interferer's plurality of modes and accumulate statistics on transitions between said interferer's plurality of modes for use in jammer detection.