# Patent

## Title
Methods, systems, and media for detecting usage of a radio channel

## Abstract

Methods, systems, and media for detecting usage of a radio channel are provided. In some embodiments, methods for detecting usage of a radio channel are provided, the methods comprising: collecting noise samples on the radio channel from a radio receiver; determining a noise empirical cumulative distribution function using a hardware processor; collecting signal samples on the radio channel from the radio receiver; determining a signal empirical cumulative distribution function using a hardware processor; calculating a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function using a hardware processor; and determining that the radio channel is being used when the largest absolute difference is greater than a threshold using a hardware processor.

## Background
CROSS REFERENCE TO RELATED APPLICATION
This application claims the benefit of U.S. Provisional Patent Application No. 61/422,114, filed Dec. 10, 2010, which is hereby incorporated by reference herein in its entirety.


STATEMENT REGARDING FEDERALLY SPONSORED RESEARCHED OR DEVELOPMENT
This invention was made with government support under Grant No. N00014-08-1-0318 awarded by the United States Navy. The government has certain rights to the invention.


BACKGROUND
To cope with the recent reality of stringent shortage in frequency spectrum due to the proliferation of wireless services, cognitive radio has been considered as an attractive technique to improve spectrum utilization for future wireless systems. In cognitive radio networks, one important function of secondary transceivers is to determine when primary transceivers are utilizing a channel, and to access the channel in such a way that it causes little performance degradation to the primary transceivers. Previous attempts at detecting the usage of a channel by one or more primary transceivers have had limited performance, especially at low signal-to-noise ratios.
SUMMARY
In accordance with some embodiments, methods, systems, and media for detecting usage of a radio channel are provided. In some embodiments, methods for detecting usage of a radio channel are provided, the methods comprising: collecting noise samples on the radio channel from a radio receiver; determining a noise empirical cumulative distribution function using a hardware processor; collecting signal samples on the radio channel from the radio receiver; determining a signal empirical cumulative distribution function using a hardware processor; calculating a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function using a hardware processor; and determining that the radio channel is being used when the largest absolute difference is greater than a threshold using a hardware processor.
In some embodiments, systems for detecting usage of a radio channel are provided, the systems comprising: a radio receiver; and at least one hardware processor that: collects noise samples on the radio channel from the radio receiver; determines a noise empirical cumulative distribution function; collects signal samples on the radio channel from the radio receiver; determines a signal empirical cumulative distribution function; calculates a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function; and determines that the radio channel is being used when the largest absolute difference is greater than a threshold.
In some embodiments, non-transitory computer-readable media containing computer-executable instructions that, when executed by a processor, cause the processor to perform a method for detecting usage of a radio channel are provided, the method comprising: collecting noise samples on the radio channel from a radio receiver; determining a noise empirical cumulative distribution function; collecting signal samples on the radio channel from the radio receiver; determining a signal empirical cumulative distribution function; calculating a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function; and determining that the radio channel is being used when the largest absolute difference is greater than a threshold.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a cognitive radio network in accordance with some embodiments.
FIG. 2 is a flow diagram of an example of a process for detecting usage of a radio channel using a single stage test in accordance with some embodiments.
FIG. 3 is a flow diagram of an example of a process for detecting usage of a radio channel using a multiple stage test in accordance with some embodiments.



DETAILED DESCRIPTION
In accordance with some embodiments, methods, systems, and media for detecting usage of a radio channel are provided.
In some embodiments, secondary transceivers can use the Kolmogorov-Smirnov (K-S) test to determine when primary transceivers are using a radio channel. In applying this test, these secondary transceivers can compute an empirical cumulative distribution function (CDF) of some decision statistic obtained from the received signal, and compare it with the empirical CDF of noise samples from the channel.
Turning to FIG. 1, an architecture for a cognitive radio system 100 is shown. As illustrated, system 100 may include a plurality of radios 102, 104, and 106. These radios may respectively include transceivers 108, 110, and 112 and antennas 114, 116, and 118. Each transceiver may include both a receiver and a transmitter in some embodiments. As shown, these radios may be multi-input multi-output (MIMO) transceivers where each include multiple antennas (e.g., such as two transmit antennas and four receive antennas (some of which may also be transmit antennas)). In some embodiments, these radios may transmit on any suitable frequencies (e.g., as specified in the IEEE 802.11 standards), may use any suitable modulation (e.g., such as QPSK modulation), etc.
As shown, transceivers 108 and 110 may be primary transceivers and therefore have priority in using a given radio channel on which the radios operate. When these primary transceivers are using a channel, transceiver 112, which is a secondary transceiver, may determine that it should not use the channel (e.g., not transmit on the channel). In this way, transmission from transceiver 112 will not interfere with the transmission of transceivers 108 or 110.
As also shown in FIG. 1, transceiver 112 may include MIMO transceiver circuitry 120 and a hardware processor 122. MIMO transceiver circuitry 120 may be any suitable MIMO transceiver circuitry for converting RF signals received by antennas 118 into IQ data 124 and for converting IQ data 126 into RF signals to be transmitted from antennas 118. For example, in some embodiments, MIMO transceiver circuitry 120 may be implemented using a transceiver from Analog Devices, Inc. of Norwood, Mass., or a transceiver from Maxim Integrated Products, Inc. of Sunnyvale, Calif. Hardware processor 122 may be any suitable hardware processor 122 such as any suitable microprocessor, digital signal processor, a controller, etc.
Although transceiver 112 is only shown in FIG. 1 as including MIMO transceiver 120 and hardware processor 122 for the sake of clarity, any other suitable components and/or circuitry can be included in transceiver 112. For example, transceiver 112 can include memory, communication interfaces, display controllers, input devices, etc.
Radios 102, 104, and 106 can be implemented in any suitable devices in some embodiments. For example, radios 102, 104, and/or 106 can be implemented in mobile computers, mobile telephones, mobile access cards, wireless routers, wireless access points, and/or any other suitable wireless device.
Any suitable approaches can be used by transceiver 112 to determine if a primary transceiver or 104 is using a radio channel. For example, in some embodiments, the presence of one or several primary transceivers transmitting on a given channel can be detected as usage based on signals observed by transceiver 112.
Whether a transceiver is transmitting on a channel can be determined in any suitable manner. For example, in some embodiments, mathematical models of sampled signals from a channel when a transmitter is present and when a transmitter is not present can be formed, and those models used to perform analysis on a channel under test.
More particularly, for example, when there are one or more primary transceivers transmitting on a general multiple-input multiple-output (MIMO) frequency-selective fading channel, a sampled signal y(t) received by a secondary transceiver, defined as y[n]  y(nTs) with 1/Ts being the sampling rate, can be modeled by the following equation (1):

y[n]=Σk=1KΣl=0L−1Hk[n,l]sk[n−1]+v[n].  (1)

In equation (1): K is the number of transceivers transmitting (e.g., K=2); L is the multipath channel delay spread in terms of the number of symbol intervals (e.g., L=6); sk[n] ε is the n-th transmitted symbol vector for the k-th primary transceiver with Nt being the number of transmit antennas on that transceiver (e.g., Nt=2); y[n] ε is the n-th received signal vector by the secondary transceiver with Nr being the number of receive antennas on the secondary transceiver (e.g., Nr=6); Hk[n,l] ε is the time-variant MIMO channel tap matrix of the k-th transceiver; and v[n] ε is the noise vector.

When there are no primary transceivers transmitting over the sensed channel, the sampled signal can be modeled by equation (2) that includes noise only:

y[n]=v[n].  (2)

In accordance with some embodiments, if the received signal samples are denoted as Y{y[n], n=1, . . . , M}, the determination of whether a primary transceiver is transmitting can be performed by testing for the truth of two hypotheses. For example, in such a determination, a hypothesis  can state that no primary transceiver is transmitting and thus that Y follows the model of equation (2), and a hypothesis  can state that one or more primary transceivers are transmitting and thus that Y follows the model of equation (1).
In accordance with some embodiments, there can be several special cases of the general signal model in equation (1) that are of interest, as follows: (1) slow-fading, frequency-flat MIMO channels where L=1 and Hk[n,0]≡Hk, ∀n; (2) slow-fading frequency-selective MIMO channels where Hk[n,l]≡Hk[l], ∀n; and (3) MEMO-OFDM channels where L=1, Hk[n, 0] are obtained by the discrete Fourier transform (DFT) of the time-domain channel coefficients, and n is the subcarrier index.
The Kolmogorov-Smirnov (K-S) test is a non-parametric test of goodness of fit for a continuous cumulative distribution of data samples. It accordance with some embodiments, it can be used to approve a null hypothesis that two data populations are drawn from the same distribution to a certain required level of significance. On the other hand, failing to approve the null hypothesis can be used to show that the two data populations are from different distributions.
In accordance with some embodiments a two-sample K-S test can be used to approve or fail to approve the null hypothesis. This test can be referred to as a one dimensional (1D) test. In the two-sample K-S test, a sequence of independent and identically distributed real-valued data samples z1, z2, . . . , zN with the underlying cumulative distribution function (CDF) F1(z) can be observed when one or more primary transceivers may or may not be transmitting. For example, these data samples can be observed in IQ data 124 by hardware processor 122. Another independent and identically distributed sequence of noise samples ξ1, ξ2, . . . , ξN0 with the underlying CDF F0(ξ) can also be observed when all transceivers are known to not be transmitting. For example, these data samples can also be observed in IQ data 124 by hardware processor 122. The null hypothesis to be tested is:

H0:F1=F0.  (3)

In some embodiments, in performing the K-S test, hardware processor 122 can form the empirical CDF {circumflex over (F)}1 from M (e.g., 50) observed signal samples z1, z2, . . . , zM using the following equation (4):




  
    
      
        
          
            
              
                F
                ^
              
              1
            
            ⁡
            
              (
              z
              )
            
          
          ⁢
          
            =
            △
          
          ⁢
          
            
              1
              M
            
            ⁢
            
              
                ∑
                
                  n
                  =
                  1
                
                M
              
              ⁢
              
                                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      z
                      n
                    
                    ≤
                    z
                  
                  )
                
              
            
          
        
        ,
      
    
    
      
        (
        4
        )
      
    
  




where  (•) is the indicator function, which equals one if the input is true (e.g., the amplitude, the quadrature, or any other suitable characteristic of the samples zn is less than or equal to a certain threshold z) and equals zero otherwise.

Hardware processor 122 can also form the empirical CDF {circumflex over (F)}0 from M0 (e.g., 100) observed noise samples ξ1, ξ2, . . . , ξN0 using the following equation (5):




  
    
      
        
          
            
              F
              ^
            
            0
          
          ⁡
          
            (
            ξ
            )
          
        
        ⁢
        
          =
          △
        
        ⁢
        
          
            1
            
              M
              0
            
          
          ⁢
          
            
              ∑
              
                n
                =
                1
              
              
                M
                0
              
            
            ⁢
            
                            ⁢
              
                
              
              ⁢
              
                
                  (
                  
                    
                      ξ
                      n
                    
                    ≤
                    ξ
                  
                  )
                
                .
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




In some embodiments, the largest absolute difference between the two CDFs can be used as a goodness-of-fit statistic as shown in equation (6):




  
    
      
        D
        ⁢
        
          =
          △
        
        ⁢
        
          
            
               
              
                z
                ∈
                R
              
              sup
            
            ⁢
            
              
              
                
                  
                    F
                    1
                  
                  ⁡
                  
                    (
                    w
                    )
                  
                
                -
                
                  
                    F
                    0
                  
                  ⁡
                  
                    (
                    w
                    )
                  
                
              
              
            
          
          .
        
      
    
    
      
        (
        6
        )
      
    
  




In some embodiments, this difference can be calculated by hardware processor 122 using equation (7):





  
    
      
        
          
            D
            ^
          
          ⁢
          
            =
            △
          
          ⁢
          
            
              max
              i
            
            ⁢
            
              
              
                
                  
                    
                      F
                      ^
                    
                    1
                  
                  ⁡
                  
                    (
                    
                      w
                      i
                    
                    )
                  
                
                -
                
                  
                    
                      F
                      ^
                    
                    0
                  
                  ⁡
                  
                    (
                    
                      w
                      i
                    
                    )
                  
                
              
              
            
          
        
        ,
      
    
    
      
        (
        7
        )
      
    
  




for some uniformly sampled points {wi}.

In some embodiments, the hardware processor 122 can calculate the significance level {circumflex over (α)} of the observed value {circumflex over (D)} using equation (8):




  
    
      
        
          
            α
            ^
          
          ⁢
          
            =
            △
          
          ⁢
          
            
              P
              ⁡
              
                (
                
                  D
                  >
                  
                    D
                    ^
                  
                
                )
              
            
            =
            
              Q
              (
              
                
                  [
                  
                    
                      
                        M
                        ~
                      
                    
                    +
                    0.12
                    +
                    
                      0.11
                      
                        
                          M
                          ~
                        
                      
                    
                  
                  ]
                
                ⁢
                
                  D
                  ^
                
              
              )
            
          
        
        ,
        
          

        
        ⁢
        with
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          
            Q
            ⁡
            
              (
              x
              )
            
          
          ⁢
          
            =
            △
          
          ⁢
          
            2
            ⁢
            
              
                ∑
                
                  m
                  =
                  1
                
                ∞
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    (
                    
                      -
                      1
                    
                    )
                  
                  
                    m
                    -
                    1
                  
                
                ⁢
                
                  e
                  
                    
                      -
                      2
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      m
                      2
                    
                    ⁢
                    
                      x
                      2
                    
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        9
        )
      
    
  




where {tilde over (M)} is the equivalent sample size, given by:





  
    
      
        
          M
          ~
        
        =
        
          
            
              MM
              0
            
            
              M
              +
              
                M
                0
              
            
          
          .
        
      
    
    
      
        (
        10
        )
      
    
  




Note that Q(•) is a Monotonically Decreasing Function with Q(0)=1 and Q(∞)=0.

In some embodiments, the hardware processor 122 can reject the hypothesis H0 at a significance level α if {circumflex over (α)}=P(D>{circumflex over (D)})<α. The significance level α is an input of the K-S test to specify the false alarm probability under the null hypothesis, i.e.,

αP(D≧τ|H0),  (11)

where τ is a threshold value, that can be obtained given a level of significance α by solving equation (8) and (11) for τ.

Note that the relationship of critical value τ and the significance level α can depend on equivalent sample size {tilde over (M)}.
Hence given α, H0 is accepted, i.e., F1=F0, if {circumflex over (D)}≦τ; and otherwise H0 is rejected, i.e., F1≠F0.
Because the signals in equation (1) are complex-valued, the corresponding distributions are two-dimensional (2D). Accordingly, in accordance with some embodiments, a two-dimensional K-S test can additionally or alternatively be used to approve or fail to approve the null hypothesis.
Consider a sequence of 2D real-valued data samples (u1, v1), . . . , (uN, vN). In the 2D K-S test, the CDFs for all four quadrants (I, II, III, and IV) of the 2D plane can be examined by the hardware processor as follows:

FI(u,v)P(U<u,V<v);

FII(u,v)P(U>u,V<v; 

FIII(u,v)P(U>u,V>v); and

FIV(u,v)P(U<u,V>v).  (12)

In some embodiments, the hardware processor can calculate the four empirical CDFs for the four quadrants using all possible combinations of the 2D data samples. For example, the first quadrant empirical CDF can be calculated using equations (13):




  
    
      
        
          
            
              
                
                  F
                  ^
                
                1
                I
              
              ⁡
              
                (
                
                  u
                  ,
                  v
                
                )
              
            
            =
            
              
                1
                
                  M
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                    ∈
                    
                      
                        {
                        
                          1
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ,
                          M
                        
                        }
                      
                      ×
                      
                        {
                        
                          1
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ,
                          M
                        
                        }
                      
                    
                  
                  
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        u
                        i
                      
                      <
                      u
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        v
                        j
                      
                      <
                      v
                    
                    )
                  
                
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  F
                  ^
                
                1
                II
              
              ⁡
              
                (
                
                  u
                  ,
                  v
                
                )
              
            
            =
            
              
                1
                
                  M
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                    ∈
                    
                      
                        {
                        
                          1
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ,
                          M
                        
                        }
                      
                      ×
                      
                        {
                        
                          1
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ⁢
                          
                            
                          
                          ,
                          M
                        
                        }
                      
                    
                  
                  
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        u
                        i
                      
                      >
                      u
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                                    ⁢
                  
                    (
                    
                      
                        v
                        j
                      
                      <
                      v
                    
                    )
                  
                
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  F
                  ^
                
                1
                III
              
              ⁡
              
                (
                
                  u
                  ,
                  v
                
                )
              
            
            =
            
              
                1
                
                  M
                  2
                
              
              ⁢
              
                
                  ∑
                  
                    
                      (
                      
                        i
                        ,
                        j
                      
                      )
                    
                    ∈
                    
                      
                        {
                        
                          1
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ,
                          M
                        
                        }
                      
                      ×
                      
                        {
                        
                          1
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ,
                          M
                        
                        }
                      
                    
                  
                  
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        u
                        i
                      
                      >
                      u
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        v
                        j
                      
                      >
                      v
                    
                    )
                  
                
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        and
        ⁢
        
          

        
        ⁢
        
          
            
              
                F
                ^
              
              1
              IV
            
            ⁡
            
              (
              
                u
                ,
                v
              
              )
            
          
          =
          
            
              1
              
                M
                2
              
            
            ⁢
            
              
                ∑
                
                  
                    (
                    
                      i
                      ,
                      j
                    
                    )
                  
                  ∈
                  
                    
                      {
                      
                        1
                        ,
                        
                          
                        
                        ⁢
                        ...
                        ,
                        M
                      
                      }
                    
                    ×
                    
                      {
                      
                        1
                        ,
                        
                          
                        
                        ⁢
                        ...
                        ,
                        M
                      
                      }
                    
                  
                
                
                  
                
              
              ⁢
              
                                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      u
                      i
                    
                    <
                    u
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                                ⁢
                
                  
                
                ⁢
                
                  
                    (
                    
                      
                        v
                        j
                      
                      >
                      v
                    
                    )
                  
                  .
                
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




In some embodiments, the hardware processor can use the 2D samples directly, rather than using all possible combinations, for forming the empirical CDFs as follows using equations (14):




  
    
      
        
          
            
              
                
                  F
                  ^
                
                1
                I
              
              ⁡
              
                (
                
                  u
                  ,
                  v
                
                )
              
            
            =
            
              
                1
                M
              
              ⁢
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  M
                
                ⁢
                
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        u
                        i
                      
                      <
                      u
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        v
                        j
                      
                      <
                      v
                    
                    )
                  
                
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  F
                  ^
                
                1
                II
              
              ⁡
              
                (
                
                  u
                  ,
                  v
                
                )
              
            
            =
            
              
                1
                M
              
              ⁢
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  M
                
                ⁢
                
                  
                
                ⁢
                
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        u
                        i
                      
                      >
                      u
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        v
                        j
                      
                      <
                      v
                    
                    )
                  
                
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  F
                  ^
                
                1
                III
              
              ⁡
              
                (
                
                  u
                  ,
                  v
                
                )
              
            
            =
            
              
                1
                M
              
              ⁢
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  M
                
                ⁢
                
                  
                
                ⁢
                
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        u
                        i
                      
                      >
                      u
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                                    ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        v
                        j
                      
                      >
                      v
                    
                    )
                  
                
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        and
        ⁢
        
          

        
        ⁢
        
          
            
              
                F
                ^
              
              1
              IV
            
            ⁡
            
              (
              
                u
                ,
                v
              
              )
            
          
          =
          
            
              1
              M
            
            ⁢
            
              
                ∑
                
                  n
                  =
                  1
                
                M
              
              ⁢
              
                
              
              ⁢
              
                                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      u
                      i
                    
                    <
                    u
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                                ⁢
                
                  
                    (
                    
                      
                        v
                        j
                      
                      >
                      v
                    
                    )
                  
                  .
                
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




In some embodiments, the largest absolute difference between the empirical CDFs among all four quadrants under H0 and H1 can be calculated as follows:

{circumflex over (D)}=maxqε{I,II,III,IV}max1≦n≦N|{circumflex over (F)}1q(un,vn)−{circumflex over (F)}0q(un,vn)|  (15)

As in the 1D test, for a given significance level α or a threshold value τ, using {circumflex over (D)} in equation (15), the hardware processor can then test to approve or disapprove the hypothesis H0.

Turning to FIG. 2, an example process 200 for determining whether a primary transceiver is using a radio channel that can be implemented by hardware processor 122 in accordance with some embodiments is shown.
As described above, this process uses empirical cumulative distribution function (CDF) calculations based on decision statistics {zn}. Any suitable decision statistics can be used to calculate the CDFs. For example, in some embodiments, because the received signals in (1) and (2) are complex-valued, the decision statistics {zn} can be formed based on any of various combinations a signal characteristic (e.g., signal amplitude, signal quadrature, etc.) and a K-S detector dimensionality (e.g., one dimension (1D), two dimensions (2D), etc.). For example, in some embodiments, the decision statistics can be formed based on a magnitude-based, 1D K-S detector from M received signal vectors {y[n], n=1, . . . , M}, so that M·Nr decision statistics can be obtained as:

z2(n−1)Nτ+j=|yj[n]|,j=1, . . . ,Nr;n=1, . . . ,M  (16)

As another example, in some embodiments, the decision statistics can be formed based on a quadrature-based, 1D K-S detector from M received signal vectors {y[n], n=1, . . . , M}, so that 2·M·Nr decision statistics can be obtained as:

z2[(n−1)Nτ+j]={yj[n]},z2[(n−1)Nτ+j]+1=I{yj[n]}),j=1, . . . ,Nr;n=1, . . . ,M.  (17)

As yet another example, in some embodiments, the decision statistics can be formed based on a quadrature-based, 2D K-S detector from M received signal vectors {y[n], n=1, . . . , M}, so that M·Nr decision statistic pairs can be obtained as:

z(n−1)Nr+j=({yj[n]},I{yj[n]}),j=1, . . . ,Nr;n=1, . . . ,M.  (18)

As illustrated, after process 200 begins at 202, hardware processor 122 can obtain noise statistics by collecting M0 noise-only sample vectors {v[n], n=1, . . . , M0} and form the corresponding decision statistics (e.g., amplitude or quadrature statistics) {ξn} at 204. These noise-only samples can be collected in any suitable manner and any suitable number of samples can be collected. For example, these samples may be collected from IQ data 124 at a time when it is known that no primary transceiver is using the radio channel.
Then, at 206, the hardware processor can then compute the empirical 1D or 2D noise empirical CDF {circumflex over (F)}0, as described above.
Next, hardware processor 122 can collect M received signal sample vectors {y[n], n=1, . . . , M} and form the corresponding decision statistics (e.g., amplitude or quadrature statistics) {zn} at 208. These signal samples can be collected in any suitable manner and any suitable number of samples can be collected. For example, these samples may be collected from IQ data 124 at a time when a primary transceiver may or may not be using the radio channel.
The hardware processor can then compute the empirical 1D or 2D cdf {circumflex over (F)}1, as described above, at 210.
At 212, hardware processor 122 can next compute the maximum difference {circumflex over (D)} in equation (7), and the threshold τ based on the given false alarm rate α using equation (8) and equation (11), as described above. If {circumflex over (D)}>τ, then the hardware processor can determine at 214 that a primary transceiver is using the radio channel and prevent secondary transceiver 112 from transmitting on the channel at 216. Otherwise, the hardware processor 122 can determine at 214 that no primary transceiver is using the radio channel and cause the secondary transceiver to transmit on the channel at 218. After 216 or 218, process 200 can terminate at 220.
It should be understood that some of the above steps of the flow diagram of FIG. 2 can be executed or performed in an order or sequence other than the order and sequence shown and described in the figure. Also, some of the above steps of the flow diagram of FIG. 2 may be executed or performed well in advance of other steps, or may be executed or performed substantially simultaneously or in parallel to reduce latency and processing times.
In accordance with some embodiments, instead of using a fixed number of samples for each decision, a decision can be made based on a number of samples that varies based on conditions. For example, in some embodiments, with each new detected sample, the empirical CDF {circumflex over (F)}1 can be updated and the K-S statistic reevaluated. More particularly, for example, a sequential K-S test can be formed by concatenating P K-S tests, starting with q samples and adding q samples at each subsequent stage up to P stages, where P is the truncation point of the test.
FIG. 3 illustrates an example process 300 for determining whether a primary transceiver is using a radio channel that can be implemented by hardware processor 122 in accordance with some embodiments.
As shown, after process 300 begins at 302, hardware processor 122 can obtain noise statistics by collecting M0 noise-only sample vectors {v[n], n=1, . . . , M0} and form the corresponding decision statistics (e.g., amplitude or quadrature statistics) {ξn} at 304. These noise-only samples can be collected in any suitable manner and any suitable number of samples can be collected. For example, these samples may be collected from IQ data 124 at a time when it is known that no primary transceiver is using the radio channel.
Then, at 306, the hardware processor can then compute the empirical 1D or 2D noise empirical CDF {circumflex over (F)}0, as described above.
Next, hardware processor 122 can collect M=q received signal sample vectors {y[n], n=1, . . . , M} and form the corresponding decision statistics (e.g., amplitude or quadrature statistics) {zn} at 308. These signal samples can be collected in any suitable manner and any suitable number of samples can be collected. For example, these samples may be collected from IQ data 124 at a time when a primary transceiver may or may not be using the radio channel.
The hardware processor can then compute the signal empirical 1D or 2D CDF {circumflex over (F)}1, as described above, at 310.
At 312, hardware processor 122 can next compute the maximum difference {circumflex over (D)} in equation (7) and the threshold τ using equation (8) and equation (11). However, unlike what is described above wherein τ is calculated based on the false alarm rate α of the overall single stage test, here τ is calculated based on the false alarm probability β of each stage of the P stage test (by substituting α with β in equations (8) and (11)) in order to meet the overall false alarm rate α, where β can be calculated using equation (19):

β=1−P√{square root over (1−α)}  (19)

based on the overall false alarm rate a being represented by the following equation:

α=β+(1−β)β+(1−β)2β+ . . . +(1−β)P−1β=1−(1−β)P.  (20)

If {circumflex over (D)}>τ, then the hardware processor can determine at 314 that a primary transceiver is using the radio channel and prevent secondary transceiver 112 from transmitting on the channel at 316. Otherwise, hardware processor 122 can branch from 314 to 318 to determine whether to truncate the test. The test may be truncated for any suitable reason. For example, in some embodiments, the test may be truncated after a certain number if loops, comparisons of the largest absolute difference to the threshold, etc. If so, the processor can determine that no primary transceiver is using the radio channel and cause the secondary transceiver to transmit on the channel at 320. After 316 or 320, process 300 can terminate at 322.
It should be understood that some of the above steps of the flow diagram of FIG. 3 can be executed or performed in an order or sequence other than the order and sequence shown and described in the figure. Also, some of the above steps of the flow diagram of FIG. 3 may be executed or performed well in advance of other steps, or may be executed or performed substantially simultaneously or in parallel to reduce latency and processing times.
In some embodiments, any suitable computer readable media can be used for storing, instructions for performing the processes described herein, can be used as a content distribution that stores content and a payload, etc. For example, in some embodiments, computer readable media can be transitory or non-transitory. For example, non-transitory computer readable media can include media such as magnetic media (such as hard disks, floppy disks, etc.), optical media (such as compact discs, digital video discs, Blu-ray discs, etc.), semiconductor media (such as flash memory, electrically programmable read only memory (EPROM), electrically erasable programmable read only memory (EEPROM), etc.), any suitable media that is not fleeting or devoid of any semblance of permanence during transmission, and/or any suitable tangible media. As another example, transitory computer readable media can include signals on networks, in wires, conductors, optical fibers, circuits, any suitable media that is fleeting and devoid of any semblance of permanence during transmission, and/or any suitable intangible media.
Although the invention has been described and illustrated in the foregoing illustrative embodiments, it is understood that the present disclosure has been made only by way of example, and that numerous changes in the details of implementation of the invention can be made without departing from the spirit and scope of the invention, which is only limited by the claims which follow. Features of the disclosed embodiments can be combined and rearranged in various ways.

## Claims

1. A method for detecting usage of a radio channel comprising:
(a) collecting noise samples on the radio channel from a radio receiver;
(b) determining a noise empirical cumulative distribution function using a hardware processor;
(c) collecting signal samples on the radio channel from the radio receiver;
(d) determining a signal empirical cumulative distribution function using a hardware processor;
(e) calculating a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function using a hardware processor; and
(f) determining that the radio channel is being used when the largest absolute difference is greater than a threshold using a hardware processor.

2. The method of claim 1, wherein the radio receiver is part of a transceiver.

3. The method of claim 1, wherein the radio channel is a MIMO channel.

4. The method of claim 1, further comprising forming decision statistics for the noise samples and the signal samples based on amplitude characteristics.

5. The method of claim 1, further comprising forming decision statistics for the noise samples and the signal samples based on quadrature characteristics.

6. The method of claim 1, further comprising repeating (c), (d), (e), and (f) when the largest absolute difference is not greater than a threshold using a hardware processor.

7. The method of claim 6, further comprising determining whether a given number of comparisons of a largest absolute difference value to the threshold has been performed before repeating (c), (d), (e), and (f).

8. A system for detecting usage of a radio channel comprising:
a radio receiver; and
at least one hardware processor that:
(a) collects noise samples on the radio channel from the radio receiver;
(b) determines a noise empirical cumulative distribution function;
(c) collects signal samples on the radio channel from the radio receiver;
(d) determines a signal empirical cumulative distribution function;
(e) calculates a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function; and
(f) determines that the radio channel is being used when the largest absolute difference is greater than a threshold.

9. The system of claim 8, wherein the radio receiver is part of a transceiver.

10. The system of claim 8, wherein the radio channel is a MIMO channel.

11. The system of claim 8, wherein the at least one hardware processor also forms decision statistics for the noise samples and the signal samples based on amplitude characteristics.

12. The system of claim 8, wherein the at least one hardware processor also forms decision statistics for the noise samples and the signal samples based on quadrature characteristics.

13. The system of claim 8, wherein the at least one hardware processor also repeats (c), (d), (e), and (f) when the largest absolute difference is not greater than a threshold.

14. The system of claim 13, wherein the at least one hardware processor also determines whether a given number of comparisons of a largest absolute difference value to the threshold has been performed before repeating (c), (d), (e), and (f).

15. A non-transitory computer-readable medium containing computer-executable instructions that, when executed by a processor, cause the processor to perform a method for detecting usage of a radio channel, the method comprising:
(a) collecting noise samples on the radio channel from a radio receiver;
(b) determining a noise empirical cumulative distribution function;
(c) collecting signal samples on the radio channel from the radio receiver;
(d) determining a signal empirical cumulative distribution function;
(e) calculating a largest absolute difference between the noise empirical cumulative distribution function and the signal empirical cumulative distribution function; and
(f) determining that the radio channel is being used when the largest absolute difference is greater than a threshold.

16. The non-transitory computer-readable medium of claim 15, wherein the radio receiver is part of a transceiver.

17. The non-transitory computer-readable medium of claim 15, wherein the radio channel is a MIMO channel.

18. The non-transitory computer-readable medium of claim 15, wherein the method further comprises forming decision statistics for the noise samples and the signal samples based on amplitude characteristics.

19. The non-transitory computer-readable medium of claim 15, wherein the method further comprises forming decision statistics for the noise samples and the signal samples based on quadrature characteristics.

20. The non-transitory computer-readable medium of claim 15, wherein the method further comprises repeating (c), (d), (e), and (f) when the largest absolute difference is not greater than a threshold.

21. The non-transitory computer-readable medium of claim 20, wherein the method further comprises determining whether a given number of comparisons of a largest absolute difference value to the threshold has been performed before repeating (c), (d), (e), and (f).