Abstract:
A method and system are disclosed to detect a broad class of signals including Advanced Television Systems Committee (ATSC) digital television (DTV) and wireless microphone signals. This signal detection method performs in Gaussian noise, employing Higher Order Statistics (HOS). Signals are processed in time and frequency domains as well as by real and imaginary components. The spectrum sensing employed also supports Denial of Service (DoS) signal classification. The method can include parameters that may be tailored to adjust the probability of detection and false alarm.

Description:
RELATED APPLICATIONS 
       [0001]    This application is a continuation of PCT Application No. PCT/US2008/069893—filed Jul. 11, 2008, which claims the benefit of U.S. Provisional Application No. 60/959,254, filed Jul. 12, 2007. In addition U.S. Provisional Application Ser. No. 60/814,367 filed Jun. 16, 2006, U.S. application Ser. No. 11/820,063 filed Jun. 18, 2007, are herein incorporated in their entirety by reference. 
     
    
     FIELD OF THE INVENTION 
       [0002]    This invention relates to signal processing and more particularly to methods for use in detecting a broad class of signals in Gaussian noise using higher-order statistics. 
       BACKGROUND OF THE INVENTION 
       [0003]    Most of the radio frequency spectrum is unevenly used. For example, cellular bands are overcrowded, but paging frequencies are underutilized. Increasing wireless communication demands are constrained by this inefficient use of the spectrum. This can extend to other than wireless communications. Any multifrequency system could benefit. 
         [0004]    Efforts to increase efficiency have the potential to alleviate these problems. The practical objective is to fill empty bands and relieve crowded ones. Applications of this technology include secondary usage of the digital television (DTV) broadcasting bands for voice, video and data communications and cognitive radio. 
         [0005]    For example, in May 2004, the United States Federal Communications Commission (FCC) announced in a Notice of Proposed Rule Making (NPRM) 04-113[3] exploring the use of unlicensed wireless operation in the television (TV) broadcasting bands. In response to this NPRM (and proceedings leading up to it), the IEEE 802 LAN/MAN Standards committee created the 802.22 working group (WG) on wireless regional area networks (WRAN) with a cognitive radio-based air interface for use by license-exempt devices on a non-interfering basis in VHF and UHF (54-862 MHz) bands. Hence, in case there are no incumbent signals (TV, wireless microphones etc.) using a particular channel or a band of spectrum, then WRAN devices may use these bands or channels for communications. 
         [0006]    Spectrum sensing is a term applied to techniques used for finding unused temporal or spectral ‘holes’ by detecting, identifying and/or classifying the primary user signals. Spectrum sensing helps to achieve the goal of more efficiently using the radio spectrum. 
         [0007]    There are many broad categories of spectrum sensing: transmitter detection using a single sensor, cooperative detection using multiple sensors, space time spectrum sensing using an antenna array, etc. 
         [0008]    A function (hardware, software or firmware) that carries out the operation of spectrum sensing is termed as the Spectrum Sensing Function (S SF). 
         [0009]    Various IEEE Standardization activities dealing with Cognitive Radio and Co-Existence of wireless systems are concerned with spectrum sensing. In particular, the IEEE 802.22/IEEE 802.16h and P1900 Standards Committee (now IEEE SCC 41 Group). 
         [0010]    Known work discusses signal detection in additive white Gaussian noise (AWGN) using higher-order statistics (HOS) as qualifiers, as is disclosed in B. M. Sadler, G. B. Giannakis, and K. S. Lii, “Estimation and Detection in NonGaussian Noise Using Higher Order Statistics,” IEEE Trans. Signal Processing, vol. 42, no. 10, pp. 2729 {2741, October 1994; and G. B. Giannakis and M. Tsatsanis, “A Unifying Maximum-Likelihood View of Cumulant and Polyspectral Measures for Non-Gaussian Signal Classification and Estimation,” IEEE Trans. Inform. Theory, vol. 38, no. 2, pp. 386-406, March 1992. It is also known that the higher-order cumulants for a Gaussian process are zero, as is disclosed in K. S. Shanmugan and A. M. Breipohl, “Random Signals: Detection, Estimation and Data Analysis,” John Wiley &amp; Sons, New York, 1988; J. M. Mendel, “Tutorial on Higher-Order Statistics (Spectra) in Signal Processing and Systems Theory: Theoretical Results and Some Applications,” IEEE Trans. Signal Processing, vol. 79, no. 3, pp. 278-305, March 1991; and C. L. Nikias and J. M. Mendel, “Signal Processing with Higher-Order Spectra,” IEEE J. Select. Areas Commun., pp. 10-37, July 1993, the contents all of which are incorporated herein by reference. 
         [0011]    The drive toward miniaturization and low power consumption in communication systems creates a demand for simpler, more efficient, solutions. Current approaches can be complex and difficult to implement. A need, therefore, exists for methods and systems that can accommodate the constraints of today&#39;s communication systems. 
         [0012]    Furthermore, detection of a broad class of signals heavily buried in noise is a major challenge. For example, IEEE 802.22 standard requires a spectrum sensing function to detect television signals accurately at a signal to noise ratio (SNR) of −21 decibels (dB). In situations such as this, the noise power is roughly 100 times greater than the signal power. Accurate detection of signals in such disadvantaged conditions is a major challenge. This application&#39;s method is capable of detecting signals accurately and efficiently at low SNRs. 
         [0013]    The FCC also mandates the protection of approved Part  74  devices such as the wireless microphones in the VHF and UHF frequency bands. Because wireless microphones operate with lower bandwidth, lower power, and anywhere in a TV channel, they are difficult to detect and protect. To facilitate their detection, a beacon signal will be constantly transmitted from specialized devices that will accompany the wireless microphone base stations. These beacon signals consist of repeated pseudo noise (PN) sequences and have a bandwidth of approximately 78 kHz with the center frequency at approximately the same location as that of the Advanced Television Systems Committee-Digital Television (ATSC-DTV) pilot signal of the channel currently occupied by the wireless microphone. This technique is capable of detecting such beacon signals accurately and efficiently at low SNRs. 
       BRIEF SUMMARY OF THE INVENTION 
       [0014]    Aspects of the invention address the above needs and provide at least the advantages below. Embodiment descriptions address steps of implementation of a Spectrum Sensing Function for signal detection in the presence of additive white Gaussian noise (AWGN) using higher-order statistics (HOS). This method is efficient and simple to implement. It may be used to detect a broad class of signal types such as Advanced Television Systems Committee (ATSC) digital television (DTV) signals, base-band, pass-band, single-carrier, multi-carrier, frequency-hopping, non-frequency-hopping, broadband, narrow-band, broad-pulse, narrow-pulse, among others. Embodiments of the signal detection method perform well at low signal to noise ratio (SNR). Based on system requirements for tolerable probability of detection (PD) and probability of false alarms (PFA), it is possible to tailor the performance of the methods by altering a few parameters. Additionally, embodiments give the time frequency detection ratio (TFDR) which may be used to determine if the detected signal falls in Class Single-Carrier of Class Multi-Carrier. Included are descriptions of applications such as multiple signal identification and finding the basis functions for the received signal. Results with real-time, over the air collected, test waveforms are also given for applications of embodiments. 
         [0015]    Embodiments include a method for implementation of a Spectrum Sensing Function wherein Higher Order Statistics (HOS) are applied to segments of received signals in time and frequency domains comprising the steps of moving to a particular portion of a frequency spectrum; applying a band pass filter; applying a low noise amplifier; collecting waveforms in the portion of a frequency spectrum; downconverting the collected waveforms; applying a low pass filter; converting to focus on a spectrum of interest; sampling to adjust a sampling rate; applying an analog to digital conversion; applying serial to parallel conversion to convert a stream of samples; applying a Fast Fourier Transform (FFT); detecting at least one signal using higher order statistics; classifying a segment as belonging to Class Signal or Class Noise; and identifying at least one signal. 
         [0016]    For embodiments, the frequency spectrum may be a channel. Downconverting may be to base-band or to an intermediate frequency (IF) band. Converting direction may be up or down and sampling may be up or down. Applying serial to parallel conversion may convert the stream of samples to segments or vectors. In embodiments, each segment is processed individually OR all segments are concatenated into one large block and processed collectively. 
         [0017]    In further embodiments, time and frequency domain components are processed separately. Pre-processing may be selected from the group consisting of: filtering, noise whitening, down-conversion, up-conversion, frequency shift, frequency translation, re-sampling, down-sampling, up-sampling, applying a Fast Fourier Transform (FFT), signal conditioning wherein the pre-processing and is applied to the collected waveform before computing higher order statistics (HOS). Real and imaginary components may be processed separately. In other embodiments, Higher Order Statistics (HOS) processing is selected from the group consisting of: singular higher order cumulants, power spectral density, bi-spectrum, tri-spectrum, and a poly-spectrum. Multiple parallel stages are used to perform steps to convert, adjust, second low pass filter, sample, and signal detection to perform Spectrum Sensing in multiple bands simultaneously. 
         [0018]    In yet other embodiments, a method of signal identification comprises the steps of: moving to a particular portion of a frequency spectrum; applying a band pass filter; collecting waveforms present in the spectrum; downconverting the collected waveforms; applying an analog to digital conversion; first filtering down-converted signal through an image rejection first Low Pass (LP) filter, wherein an image of the downconverted signal is suppressed; upconverting the first filtered signal, wherein a characteristic frequency component of said signal would be shifted closer to 0 Hertz frequency; second filtering the upconverted signal; downsampling the second filtered signal; converting samples of the downsampled signal from serial to parallel; collecting the samples; storing the samples in a buffer; applying a Fast Fourier Transform (FFT); determining higher order moments and cumulants of real and imaginary portions of the stored samples; calculating signal probability; and classifying received signal. 
         [0019]    In embodiments, a standardizing source for the received signal is selected from the group consisting of the Advanced Television Systems Committee (ATSC), Digital Television (DTV), National Television Systems Committee (NTSC), and Digital Video Broadcasting (DVB). In others, the received signal comprises a wireless microphone signal. In yet others, the received signal comprises a wireless microphone beaconing signal (e.g. IEEE 802.22.1), or a co-existing beaconing signal. For other embodiments the characteristic frequency component of the signal is the video or audio carrier of a television signal. A demodulating stage Fast Fourier Transform (FFT) may detect a wireless microphone signal. A Fast Fourier Transforms (FFT) stage may be used for data demodulation to implement a spectrum sensing function. Fast Fourier Transforms (FFTs) used for data demodulation and to implement a spectrum sensing function may have equal sizes. Or, Fast Fourier Transforms (FFT) stages used for data demodulation and to implement a spectrum sensing function may have un-equal sizes. 
         [0020]    In embodiments, the collected waveform of the downconverting step is collected at Radio Frequency (RF) stage or at the Intermediate Frequency (IF) stage. In further embodiments, the first low pass filter of the first filtering step has a bandwidth of 8 MHz. The first filtered signal is upconverted by approximately 2.69 MHz. The second low pass filter of the second filtering step has a bandwidth equal to NFFT/((T sensing ) Z). In other embodiments, downsampling the second filtered signal is by a factor of floor (Fs/(Second Filter Bandwidth)). The converting step is carried out using a first-in first-out (FIFO) buffer and a Fast Fourier Transform (FFT) of length NFFT. Other embodiments comprise adjusting a fine threshold parameter (γ); and reclassifying the received signal. 
         [0021]    Still other embodiments comprise choosing a probability step parameter (δ) equal to one-half the inverse of a number of moments and cumulants of order greater than two available for computation of real and imaginary parts of each segment of the received signal. Yet other embodiments comprise choosing all cumulants greater than two for computation of signal detection probabilities. Further embodiments comprise choosing a subset of cumulants for computation of signal detection probabilities. 
         [0022]    For embodiments, the frequency spectrum is a channel and downconverting is to base-band or to an intermediate frequency (IF) band. In embodiments, Advanced Television Systems Committee (ATSC) digital television (DTV) signals are detected near ATSC-DTV pilot tones. Wireless microphone beaconing signals are detected in the vicinity of Advanced Television Systems Committee (ATSC) digital television (DTV) pilot tones. Digital Video Broadcasting (DVB) digital television (DTV) signals are detected in a vicinity of pilot tones. 
         [0023]    In additional embodiments, multiple parallel stages are used to perform steps to convert, adjust, second low pass filter, sample, and signal detection to perform Spectrum Sensing in multiple bands simultaneously. 
         [0024]    Yet another embodiment is a wireless system for Spectrum Sensing and signal identification wherein Higher Order Statistics (HOS) are applied to segments of received signals in time and frequency domains comprising signal detection and identification classification modules configured to perform the steps of moving to a particular portion of a frequency spectrum; applying a band pass filter; collecting waveforms present in the spectrum; downconverting the collected waveforms; applying an analog to digital conversion; first filtering down-converted signal through an image rejection first Low Pass (LP) filter, wherein an image of the downconverted signal is suppressed; upconverting the first filtered signal, wherein a video carrier would be shifted closer to 0 Hertz frequency; second filtering the upconverted signal; downsampling the second filtered signal; converting samples of the downsampled signal from serial to parallel; collecting the samples; storing the samples in a buffer; applying a Fast Fourier Transform (FFT); determining higher order moments and cumulants of real and imaginary portions of the stored samples; calculating signal probability; and classifying the received signal. 
         [0025]    A further embodiment is a computer-readable medium having computer-readable signals stored thereon that define instructions that, as a result of being executed by a computer, instruct the computer to perform a method for signal identification wherein Higher Order Statistics (HOS) are applied to segments of received signals in time and frequency domains comprising the steps of receiving a signal; detecting at least one signal; and identifying at least one signal. 
         [0026]    Another embodiment is a computer-readable medium having computer-readable signals stored thereon that define instructions that, as a result of being executed by a computer, instruct the computer to perform a method for signal identification wherein Higher Order Statistics (HOS) are applied to segments of received signals in time and frequency domains comprising the steps of receiving a signal; detecting at least one signal; and classifying at least one signal. 
         [0027]    Yet another embodiment is a method for classifying a Denial of Service (DoS) signal comprising the steps of determining bit error rate degradation of a received signal; performing signal or noise detection on the received signal using higher order statistics (HOS); detecting time and frequency domain components of the received signal; identifying Gaussianity whereby the DoS signal is classified from results of the detecting step. 
         [0028]    The features and advantages described herein are not all-inclusive and, in particular, many additional features and advantages will be apparent to one of ordinary skill in the art in view of the drawings, specification, and claims. Moreover, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and not to limit the scope of the inventive subject matter. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0029]      FIG. 1  depicts a simplified flow chart of a Spectrum Sensing Function (SSF) used for detecting a broad class of signals. In accordance with one embodiment, the flow chart represents the steps carried out to detect an ATSC DTV and wireless microphone as well as wireless microphone beacon signals. 
           [0030]      FIG. 2  depicts a simplified flow chart of the signal detector which takes sampled waveform as its inputs and makes a decision whether a particular segment of the received waveform contains a useful signal or belongs to noise. The figure depicts the time and frequency aspects of a method for detecting a broad class of signals in accordance with one embodiment. 
           [0031]      FIG. 3  depicts a simplified flow chart of a method for detecting a broad class of signals in accordance with one embodiment. 
           [0032]      FIG. 4  is a block diagram for the signal or noise identification method for the detection of Advanced Television Systems Committee (ATSC) digital television (DTV) Signals in the presence of Gaussian noise in accordance with one embodiment. The proposed block diagram may also be used to detect wireless microphone and wireless microphone beacon signals. 
           [0033]      FIG. 5  depicts a simplified flow chart of a method for classifying Denial of Service (DoS) signals in accordance with one embodiment. 
           [0034]      FIG. 6  shows the result of the detection method at various SNRs and 5 mS sensing window in accordance with one embodiment. 
           [0035]      FIG. 7  shows the result of the detection method at various SNRs and 10 mS sensing window in accordance with one embodiment. 
           [0036]      FIG. 8  shows the result of the detection method at various SNRs and 20 mS sensing window in accordance with one embodiment. 
           [0037]      FIG. 9  shows the result of the detection method at various SNRs and 40 mS sensing window in accordance with one embodiment. 
           [0038]      FIG. 10  shows the result of changing the fine threshold parameter (γ) in accordance with one embodiment. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     I. Higher-Order Statistics as Non-Gaussian Qualifiers 
       [0039]    There are a number of ways in which a useful, information bearing, signal can be detected from additive noise. Some of these methods are: 1) Energy detection, 2) Spectral correlation, 3) Checking for cyclo-stationarity of the received waveform, 4) Use of higher order statistics, etc. As an illustration, we use a higher order statistics based signal detection method here but any of the above techniques may be used. 
         [0040]    It is known that the higher order cumulants for a Gaussian process are zero. Cumulants are defined as the multiplicative coefficients for each term of the Taylor series expansion of the logarithm of the characteristic function. The characteristic function of ψ X (ω) of a random variable X is defined as 
         [0000]      ψ X (ω)= E {exp( jωX )},  (1) 
         [0041]    where j=√{square root over (−1)}. The natural logarithm of the characteristic function is defined as the cumulant generating function 
         [0000]        C   X (ω)=log {ψ X (ω)},  (2) 
         [0042]    or in other words, 
         [0000]      exp { C   X (ω)}=ψ X (ω).  (3) 
         [0043]    Expanding both sides of the equation in a series form results in the following equality. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       exp 
                        
                       
                         { 
                         
                           
                             
                               c 
                               1 
                             
                              
                             
                               ( 
                               jω 
                               ) 
                             
                           
                           + 
                           
                             
                               c 
                               2 
                             
                              
                             
                               
                                 
                                   ( 
                                   jω 
                                   ) 
                                 
                                 2 
                               
                               
                                 2 
                                 ! 
                               
                             
                           
                           + 
                           … 
                           + 
                           
                             
                               c 
                               n 
                             
                              
                             
                               
                                 
                                   ( 
                                   jω 
                                   ) 
                                 
                                 n 
                               
                               
                                 n 
                                 ! 
                               
                             
                           
                         
                         } 
                       
                     
                     = 
                     
                       1 
                       + 
                       
                         jω 
                          
                         
                             
                         
                          
                         
                           E 
                            
                           
                             [ 
                             X 
                             ] 
                           
                         
                       
                       + 
                       
                         
                           
                             
                               ( 
                               jω 
                               ) 
                             
                             2 
                           
                           
                             2 
                             ! 
                           
                         
                          
                         
                           E 
                            
                           
                             [ 
                             
                               X 
                               2 
                             
                             ] 
                           
                         
                       
                       + 
                       … 
                       + 
                       
                         
                           
                             
                               ( 
                               jω 
                               ) 
                             
                             n 
                           
                           
                             n 
                             ! 
                           
                         
                          
                         
                           E 
                            
                           
                             [ 
                             
                               X 
                               n 
                             
                             ] 
                           
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where c 1 , c 2  . . . c n  are the cumulants of the random process and E[X]=m 1 , E[X 2 ]=m 2 , . . . E[X n ]=m n  are the moments of the random process. When both the sides of the equations are expanded and the powers compared, we can obtain the relationship between the moments and the cumulants of the random process. Let c r =r th  order cumulant of x. Then the relationship between cumulants and the moments may be used to compute the higher order cumulants in a simple fashion as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           c 
                           n 
                         
                         = 
                         
                           
                             m 
                             n 
                           
                           - 
                           
                             
                               ∑ 
                               
                                 k 
                                 = 
                                 1 
                               
                               
                                 n 
                                 - 
                                 1 
                               
                             
                              
                             
                                 
                             
                              
                             
                               
                                 ( 
                                 
                                   
                                     
                                       
                                         n 
                                         - 
                                         1 
                                       
                                     
                                   
                                   
                                     
                                       
                                         k 
                                         - 
                                         1 
                                       
                                     
                                   
                                 
                                 ) 
                               
                                
                               
                                 c 
                                 k 
                               
                                
                               
                                 m 
                                 
                                   n 
                                   - 
                                   k 
                                 
                               
                             
                           
                         
                       
                     
                   
                   
                     
                       where 
                     
                   
                   
                     
                       
                         
                           
                             ( 
                             
                               
                                 
                                   
                                     n 
                                     - 
                                     1 
                                   
                                 
                               
                               
                                 
                                   
                                     k 
                                     - 
                                     1 
                                   
                                 
                               
                             
                             ) 
                           
                           = 
                           
                             
                               
                                 ( 
                                 
                                   n 
                                   - 
                                   1 
                                 
                                 ) 
                               
                               ! 
                             
                             
                               
                                 
                                   ( 
                                   
                                     k 
                                     - 
                                     1 
                                   
                                   ) 
                                 
                                 ! 
                               
                               · 
                               
                                 
                                   ( 
                                   
                                     n 
                                     - 
                                     k 
                                   
                                   ) 
                                 
                                 ! 
                               
                             
                           
                         
                         , 
                       
                     
                   
                   
                     
                       and 
                     
                   
                   
                     
                       
                         
                           y 
                           != 
                           
                             Factorial 
                              
                             
                               ( 
                               y 
                               ) 
                             
                           
                         
                         = 
                         
                           
                             y 
                             · 
                             
                               ( 
                               
                                 y 
                                 - 
                                 1 
                               
                               ) 
                             
                             · 
                             
                               ( 
                               
                                 y 
                                 - 
                                 2 
                               
                               ) 
                             
                             · 
                             
                               ( 
                               
                                 y 
                                 - 
                                 3 
                               
                               ) 
                             
                           
                            
                           
                               
                           
                            
                           … 
                            
                           
                               
                           
                            
                           
                             2 
                             · 
                             1 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
         [0044]    The Equation 5., when expanded can be written as follows: 
         [0000]      c 1 =m 1    
         [0000]    
       
      
       c 
       2 
       =m 
       2 
       −m 
       1  
      
     
         [0000]        c   3   =m   3 −3 m   1   m   2 +2 m   1   3    
         [0000]        c   4   =m   4 −4 m   1   m   3 −3 m   2   2 +12 m   1   2   m   2 −6 m   1   4   (6) 
         [0045]    Since we need to extract these statistics of the random process from the collected waveforms, after sampling the waveforms, we divide them into segments of length N and place them in vectors x. We then estimate the higher order moments for each of the segments using the following approximation 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       m 
                       ^ 
                     
                     r 
                   
                   = 
                   
                     
                       1 
                       N 
                     
                      
                     
                       
                         ∑ 
                         
                           n 
                           = 
                           0 
                         
                         
                           N 
                           - 
                           1 
                         
                       
                        
                       
                           
                       
                        
                       
                         
                           ( 
                           
                             
                               x 
                               n 
                             
                             - 
                             
                               x 
                               _ 
                             
                           
                           ) 
                         
                         r 
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0046]    where {circumflex over (m)} r  is the estimate of the m th  order moment of the collected waveform samples, and  X  is the mean value for the N given samples of data defined as 
         [0000]    
       
         
           
             
               
                 
                   
                     x 
                     _ 
                   
                   ≈ 
                   
                     
                       1 
                       N 
                     
                      
                     
                       
                         ∑ 
                         
                           n 
                           = 
                           0 
                         
                         
                           N 
                           - 
                           1 
                         
                       
                        
                       
                           
                       
                        
                       
                         x 
                         n 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0047]    Using the relationship between the moments and the cumulants of the random process (5 or 6), one can then estimate the cumulants for the received signal samples. 
       II. Method Progression 
       [0048]    Since the cumulants are computed from the estimates of the moments for every segment of duration N, the longer the segment, the better are the statistics and the better the estimation. In practice, however, it is not possible to keep N to be extremely large and it is limited by the duty cycle of the signal itself, and the rate at which the signal changes. This means that even if the received waveform belongs to Class Noise, it is possible that the cumulants may be non-zero. Hence, instead of making a hard decision, we define a probability P Signal  that a certain segment belongs to the Class Signal. We also define a threshold which, when exceeded, increases the probability that the received waveform falls into Class Signal, and when the threshold is not exceeded, it decreases the probability that the waveform falls into the Class Signal. Embodiments of the method follow: 
         [0049]    A. Detection of a Broad Class of Signals 
         [0050]    Many types of information-bearing signals show a Gaussian distribution in the time domain whereas in the frequency domain they are non-Gaussian. For example, the amplitude distribution of the multi-carrier signal samples, formed as a result of orthogonal frequency division multiplexing (OFDM) in the time-domain is Gaussian, but the distribution of its complex samples in the frequency domain is not. On the other hand, the amplitude distribution of a direct sequence spread spectrum (DSSS) signal in the time-domain is non-Gaussian. Hence, in order to be able to detect all these signal types, we apply the method in time as well as in the frequency domains. 
         [0051]      FIG. 1  depicts a simplified flow chart  100  of a generalized Spectrum Sensing Function (SSF) used for detecting a broad class of signals. In accordance with one embodiment, the flow chart represents the steps carried out to detect an ATSC DTV and wireless microphone as well as wireless microphone beacon signals. Embodiments begin with the sensing platform  105 , moving to a particular portion of the spectrum or a channel, followed by a band-pass filter  106  and receiving/collecting waveforms signals  110 . The instruction to move and collect waveforms from a particular channel may come from a central or local authority such as a Spectrum Manager (SM). Next, downshift (downconvert)  115  the received waveform  110  of the signals or noise collected at the Radio Frequency (RF) to the Intermediate Frequency (IF) or the base band. Convert the received analog waveforms to digital discrete time waveforms using an Analog to Digital (A/D) converter 120. Pass the down-converted digitized signal through a Low Pass (LP) filter of total Bandwidth (BW 1 ) filter  125  used to limit the spectral content as well as reject any image. Upshift (upconvert) the signal  130  by approximately f V  MHz. Pass the resultant signals through a second Low Pass (LP)  135  of bandwidth (BW 2 =N FFT /((T sensing ) Z)) to reject any further unwanted parts of the spectrum followed by downsampling  140  of the signals by a factor of floor (Fs/BW 2 ). T sensing =Sensing Duration, Z=1, 2, 3, determines the multiples of the sensing duration. For example, T sensing =0.005 and Z=1 implies the total sensing duration of 5 mS. Similarly, T sensing =0.005 and Z=2 implies the total sensing duration of 10 mS. Fs=sampling frequency of the signal before downsampling. and N FFT =Size of the Fast Fourier Transform (FFT) used. Convert the input samples from serial to parallel  145 . This may be carried out by using a FIFO buffer. The resultant downsampled waveform  150  is then passed on to the signal detection stage  155 . The output of the signal detection stage is a probability measure  160  which signifies whether a particular segment of the downsampled waveform contains a valid signal or whether it is just noise. This signal or noise detection probability measure results in signal or noise classification  165  for each segment of downsampled waveform. Based on the detection performance, the parameters for the signal detection stage may be optionally adjusted  170 . The collected segments of the waveform are then further processed to determine the noise floor  180  or the spectral footprint  185  based on whether the segment contains signal or noise  175 . 
         [0052]      FIG. 2  shows the signal detection stage. It depicts a simplified flow chart  200  of time and frequency aspects of a method for detecting a broad class of signals. The received waveform samples  205  are divided into segments of length N, using a serial to parallel (S/P) converter or a FIFO buffer  210  and are sent to two different branches. One detects the presence of the signal in the time domain  215  and the other in the frequency domain  220 . Frequency domain detection is performed by first taking Fourier transform  225  of each of the segments as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       X 
                       k 
                     
                     = 
                     
                       
                         1 
                         
                           N 
                         
                       
                        
                       
                         
                           ∑ 
                           
                             n 
                             = 
                             0 
                           
                           
                             N 
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           
                             x 
                             n 
                           
                            
                           exp 
                            
                           
                             { 
                             
                               
                                 - 
                                 j 
                               
                                
                               
                                 
                                   2 
                                    
                                   
                                       
                                   
                                    
                                   π 
                                    
                                   
                                       
                                   
                                    
                                   nk 
                                 
                                 N 
                               
                             
                             } 
                           
                         
                       
                     
                   
                   , 
                   
                     k 
                     = 
                     0 
                   
                   , 
                   1 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     N 
                     - 
                     1 
                   
                   , 
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0053]    Time and frequency domain samples are further broken down into real ( 230  and  231  respectively) and imaginary ( 240  and  241  respectively) component vectors and each of these segments or vectors are subjected to the detection algorithm ( 245 ,  246 ,  247 ,  248 ). For the sake of simplicity, each of the segments of length N will be denoted by a variable X; where in the time domain X consists of the real or the imaginary components of the downsampled waveform and in the frequency domain, X consists of the real or the imaginary components of the Fourier co-efficients X k s as shown in Equation (9). The outputs from the detection algorithm are the probability measures if a particular real or imaginary, time or frequency segments contain signal or noise. These measures may be combined (250, 251, 252, 255, 260, 265, 270, 275, 280) in various manner as will be described later to produce the net outcomes (130, 132, 150, 152, 155, 160) as to whether a particular segment of the downsampled waveform contains a useful signal or it is simply noise. 
         [0054]      FIG. 3  depicts a simplified flow chart  300  of a method for detecting a broad class of signals. Let R  305  be the number of moments (m r     —     real , m r     —     imaginary ) and cumulants (C r     —     real , C r     —     imaginary ) of the order greater than two available for computation of the real and the imaginary parts of each of the segments (X) of data respectively. 
         [0055]    Choose  310 , a Probability Step Parameter 0&lt;δ&lt;1; For example let δ=0.5/R. 
         [0056]    Let P Signal     —     real =P Signal     —     imaginary =0.5;  315   
         [0057]    Choose some γ&gt;0; γ typical =1  320   
         [0058]    Determine signal probability  325 : 
         [0059]    for r=2 to (R+2); 
         [0000]      if | c   r     —     real   |&lt;γ|m   2     —     real | r/2   ,=&gt;P   Signal     —     real   =P   Signal     —     real −δ 
         [0000]      elseif | c   r     —     real   |≧γ|m   2     —     real | r/2   ,=&gt;P   Signal     —     real   =P   Signal     —     real +δ 
         [0000]      end, 
         [0000]      if | c   r     —     imaginary   |&lt;γ|m   2     —     imaginary | r/2   ,=&gt;P   Signal     —     imaginary   =P   Signal     —     imaginary −δ, 
         [0000]      elseif | c   r     —     imaginary   |≧γ|m   2     —     imaginary|   r/2   ,=&gt;P   Signal     —     imaginary   =P   Signal     —     imaginary +δ 
         [0000]      end, 
         [0000]      end 
         [0060]    (Results may be combined as in  FIGS. 2 ,  250 ,  251 , and  252 ) P signal =aP signal     —     real +bP Signal     —     imaginary where a and b weight parameters. As an example a=b= 0.5 
         [0061]    This produces a Signal Probability  330 . If Signal Probability P Signal ≧0.5, then X belongs to Class Signal  340 ; if P Signal &lt;0.5 then X belongs to Class Noise  335 . 
       III. Applications of the Proposed Signal Detection Method 
       [0062]    A. Detection of ATSC DTV and Wireless Microphone Beaconing Signals 
         [0063]      FIG. 4  is a block diagram  400  for a system for the signal or noise identification method applied to the detection ATSC DTV signals in the presence of Gaussian noise. It follows the flow chart of the method of  FIGS. 1 ,  2  and  3 . Embodiments receive a signal Intermediate Frequency (IF) sampled at Fs Hz, where r n =s n +noise. The signal is downshifted (downconverted)  405  to Baseband exp(−j2πf c t) where f c =the center frequency of the input signal at IF. The down-converted signal is passed through an image rejection first Low Pass (LP) filter  410  of total Bandwidth (BW 1 =8 MHz) for image rejection. The frequency is then upshifted  415  exp(+j2πf v t) where f v =+2.69 MHz, so that any DTV signal video carriers are shifted closer to 0 Hertz. The resultant signals pass through a second Antialiasing Low Pass (LP) Filter  420  of bandwidth BW 2 =N FFT /((T sensing ) Z). N FFT  is the size of the FFT used (2048 in this case) and T sensing  is the Sensing Duration. Z determines the multiples of the sensing duration and may equal, for example, 1, 2, 4. If T sensing =0.005 seconds and Z=1, the total sensing duration is 5 mS. Similarly, T sensing =0.005 and Z=2 implies a total sensing duration of 10 mS. Data for multiple sensing durations are shown in graph  FIGS. 6-9 . This step is followed by downsampling  425  the signals by a factor of floor (Fs/BW 2 ). Fs is the sampling frequency of the original received signal and BW 2  is as previously defined. The input samples are next converted from serial to parallel  430 . Embodiments employ a FIFO buffer and convert samples to the frequency domain using a process such as the Fast Fourier Transform (FFT) as shown in Equation (8) of length N FFT    435 . N FFT  may equal 2048. Collect samples at the output of the FFT  435 . Then perform signal detection in the frequency domain using HOS  440 . This is determined from the higher order moments and cumulants  440  of the real and imaginary portions of the stored samples using Equations (5), (6) and (7) as introduced in  FIGS. 2 and 3 . 
         [0064]    Again, as introduced in  FIGS. 2 and 3 , apply the following steps to calculate signal probability  440 . 
         [0065]    Let R be the number of moments (m r     —     real , m r     —     imaginary ) and cumulants (c r     —     real , c r     —     imaginary ) of the order greater than two available for computation of the real and the imaginary parts of each of the segments (X) of data respectively, 
         [0066]    Choose a Probability Step Parameter 0&lt;δ&lt;1; For example let δ=0.5/R. 
         [0067]    Let P Signal     —     real =P Signal     —     imaginary =0.5; 
         [0068]    Choose some γ&gt;0; γ typical =1 
         [0069]    for r=2 to (R+2); 
         [0000]      if | c   r     —     real   |&lt;γ|m   2     —     real | r/2   ,=&gt;P   Signal     —     real   =P   Signal     —     real −δ 
         [0000]      elseif | c   r     —     real   |≧γ|m   2     —     real | r/2   ,=&gt;P   Signal     —     real   =P   Signal     —     real +δ 
         [0000]      end, 
         [0000]      if | c   r     —     imaginary   |&lt;γ|m   2     —     imaginary | r/2   ,=&gt;P   Signal     —     imaginary   =P   Signal     —     imaginary −δ, 
         [0000]      elseif | c   r     —     imaginary   |≧γ|m   2     —     imaginary | r/2   ,=&gt;P   Signal     —     imaginary   =P   Signal     —     imaginary   +δ   
         [0000]      end, 
         [0000]      end 
         [0070]    P Signal =aP Signal     —     real +bP Signal     —     imaginary  where a and b weight parameters. As an example, a=b=0.5. 
         [0071]    For signal classification  440 , if P Signal ≧0.5, then X belongs to Class Signal, and the ATSC DTV signal is detected. If P Signal &lt;0.5, then X belongs to Class Noise and the ATSC DTV signal is not detected. The parameter γ is used to make fine adjustments of P FA  if needed ( FIG. 1 ,  170 ). As γ increases, P FA  decreases and vice-versa. In most cases, γ is kept close to unity. 
         [0072]    If the value is ≧0.5, the sample is classified as a signal. If the value is &lt;0.5, then the sample is classified as noise. 
         [0073]    These exact steps described above may be used to detect the wireless microphone as well as the wireless microphone beaconing signals. 
         [0074]    B. Denial of Service (DoS) Classification 
         [0075]      FIG. 5  depicts a simplified flow chart  500  of a method for classifying Denial of Service signals. In cases where performance metrics such as the bit error rate at the receiver show drastic degradation, it is possible that the received signal is being blocked  505 . Perform signal or noise detection on the received signal  510  to separate signal from noise using higher order statistical method previously described (Blind Source Separation). If the signal is detected in the time or the frequency domains  515 , then the DoS waveform is non-Gaussian in time and/or frequency domains  525 . If the signal is not detected  520 , then the DoS waveform is Gaussian in the time and frequency domains  530 . 
         [0076]      FIG. 6  is a graph  600  showing results of the detection method at various SNRs with a 5 mS sensing window and a probability of false alarm (P FA ) of 0.0427. It depicts the probability of detection, P detection  between 10 0  and 10 −2  as a function of the signal to noise ratio (SNR) between −6 to −22 dB. Curves represent data for thirteen configurations as below. Configuration WAS 32 48 06012000 OPT short  605 . Configuration WAS 86 48 07122000 REF short  610 . Configuration WAS 51 35 05242000 REF short  615 . Configuration WAS 68 36 05232000 REF short  620 . Configuration WAS 47 48 06132000 OPT short  625 . Configuration WAS 49 39 06142000 OPT short  630 . Configuration WAS 06 34 06092000 REF short  635 . Configuration WAS 49 34 06142000 OPT short  640 . Configuration WAS 311 35 06052000 REF short  645 . Configuration WAS 3 27 06022000 REF short  650 . Configuration WAS 311 48 06052000 REF short  655 . Configuration WAS 311 36 06052000 REF short  660 . Lastly, the average P detection  for the twelve above signals  665 . 
         [0077]      FIG. 7  is a graph  700  showing results of the detection method at various SNRs with a 10 mS sensing window and a probability of false alarm (P FA ) of 0.0427. It depicts the probability of detection, P detection  between 10 0  and 10 −2  as a function of the signal to noise ratio (SNR) between −6 to −22 dB. Curves represent data for thirteen configurations as below. Configuration WAS 32 48 06012000 OPT short  705 . Configuration WAS 86 48 07122000 REF short  710 . Configuration WAS 51 35 05242000 REF short  715 . Configuration WAS 68 36 05232000 REF short  720 . Configuration WAS 47 48 06132000 OPT short  725 . Configuration WAS 49 39 06142000 OPT short  730 . Configuration WAS 06 34 06092000 REF short  735 . Configuration WAS 49 34 06142000 OPT short  740 . Configuration WAS 311 35 06052000 REF short  745 . Configuration WAS 3 27 06022000 REF short  750 . Configuration WAS 311 48 06052000 REF short  755 . Configuration WAS 311 36 06052000 REF short  760 . Lastly, the average P detection  for the twelve above signals  765 . 
         [0078]      FIG. 8  is a graph  800  showing results of the detection method at various SNRs with a 20 mS sensing window and a probability of false alarm (P FA ) of 0.0396. It depicts the probability of detection, P detection  between 10 0  and 10 −2  as a function of the signal to noise ratio (SNR) between −6 to −22 dB. Curves represent data for thirteen configurations as below. Configuration WAS 32 48 06012000 OPT short  805 . Configuration WAS 86 48 07122000 REF short  810 . Configuration WAS 51 35 05242000 REF short  815 . Configuration WAS 68 36 05232000 REF short  820 . Configuration WAS 47 48 06132000 OPT short  825 . Configuration WAS 49 39 06142000 OPT short  830 . Configuration WAS 06 34 06092000 REF short  835 . Configuration WAS 49 34 06142000 OPT short  840 . Configuration WAS 311 35 06052000 REF short  845 . Configuration WAS 3 27 06022000 REF short  850 . Configuration WAS 311 48 06052000 REF short  855 . Configuration WAS 311 36 06052000 REF short  860 . Lastly, the average P detection  for the twelve above signals  865 . 
         [0079]      FIG. 9  is a graph  900  showing results of the detection method at various SNRs with a 40 mS sensing window and a probability of false alarm (P FA ) of 0.0381. It depicts the probability of detection, P detection  between 10 0  and 10 −2  as a function of the signal to noise ratio (SNR) between −8 to −24 dB. Curves represent data for thirteen configurations as below. Configuration WAS 32 48 06012000 OPT short  905 . Configuration WAS 86 48 07122000 REF short  910 . Configuration WAS 51 35 05242000 REF short  915 . Configuration WAS 68 36 05232000 REF short  920 . Configuration WAS 47 48 06132000 OPT short  925 . Configuration WAS 49 39 06142000 OPT short  930 . Configuration WAS 06 34 06092000 REF short  935 . Configuration WAS 49 34 06142000 OPT short  940 . Configuration WAS 311 35 06052000 REF short  945 . Configuration WAS 3 27 06022000 REF short  950 . Configuration WAS 311 48 06052000 REF short  955 . Configuration WAS 311 36 06052000 REF short  960 . Lastly, the average P detection  for the twelve above signals  965 . 
         [0080]      FIG. 10  is a graph  1000  of the result of changing the fine threshold parameter (γ) on Probability of detection P detection    1005  and Probability of false alarm P false alarm    1010  for SNR of −20 dB and a sensing window of 20 mS for twelve DTV signals. Vertical dashed line  1015  represents γ=0.75, SNR=−20 dB, with P detection &gt;0.9, and P false alarm =0.05. 
         [0081]    The foregoing description of the embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of this disclosure. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.