Abstract:
A method for sampling includes selecting and sampling at uniform time steps over a collection time that is more than one period. Reordering the collected samples into “one period” and transforming the period from the time domain to the frequency domain.

Description:
BACKGROUND 
       [0001]    Nyquist frequency is defined as minimum required sampling frequency for a given signal frequency to avoid aliasing. It is based on (maximum) signal frequency that could be reliably measured with that minimum sampling frequency. Thus, the sampling frequency has to be larger than this Nyquist frequency. Sometimes half of this value is defined as the Nyquist frequency (to equal the above definition) so then the sampling frequency has to be larger than twice this Nyquist frequency. The Nyquist criterion relies on the sampling occurring at uniform time steps. 
       SUMMARY 
       [0002]    A method for sampling includes selecting and sampling at non-uniform time steps over a collection time that is more than one period. Reordering the collected samples into “one period” and transforming the period from the time domain to the frequency domain. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0003]      FIG. 1  is a process flow diagram according to the invention. 
           [0004]      FIG. 2  illustrates a measurement apparatus using the method described in  FIG. 1 . 
           [0005]      FIG. 3  is a process flow diagram corresponding to step  102  shown in  FIG. 1 . 
       
    
    
     DETAILED DESCRIPTION 
       [0006]    The Nyquist sampling limit arises when samples are taken at uniform intervals. If non-uniform intervals are used, the bandwidth of the frequency domain conversion is set at some higher level by some other limitation of the measurement system. 
         [0007]      FIG. 1  illustrates a process flow diagram according to the invention. In step  102 , for each set of criteria, sampling times are selected that are non-uniform while having a fast transformation into the frequency domain. In step  104 , the sampling occurs. Step  104  may be repeated as often as required. In step  106 , the samples are folded into “one period”. In step  108 , the transformation from the time domain to the frequency domain occurs. 
         [0008]      FIG. 2  illustrates a measurement apparatus. The physical variable of the system/device to be measured may be optionally sensed through a sensor. The sensor is not required if the data converters operate directly on the physical variable of interest, e.g. voltage. One or more data converters, e.g. ADCs, are configured to convert from the sensor output, if present, or to convert directly from the physical variable. Each data converter is configured so that it triggers when pre-programmed times are reached by an associated real-time clock. The digital data obtained by the data converters at those times are forwarded to a processor. The real-time clocks are synchronized with another using a time synchronization means, e.g. IEEE 1588, Network Time Protocol (NTP), or Global Positioning System (GPS). A suitable example is taught by Eidson in U.S. Pat. No. 6,741,952, assigned to Agilent Technologies, Inc. 
       Notational Description 
       [0009]    A matrix P is a permutation matrix containing all 0s except that each row contains one 1 and each column contains exactly one 1. Thus P=P[i, j, k . . . . ] means that the one in row 1 of P is in the i-th column, the one in row 2 of P is in the j-th column, etc. The identity matrix is noted as I=I[1, 2, 3, . . . ]
       B(t,f) is the discrete Fourier basis matrix for frequency vector f and time vector t. It is equal to exp(2Π i ft T ), where i is the square root of −1.   t recover  is the minimum time that the time triggerable sampling means needs between taking consecutive samples.   t discr  is the discretization increment of the time trigger. Thus, the time triggers must be set to occur at times that are a multiple Of t discr . Generally, t recover  is a multiple of t discr .   diag is the function that takes a vector and returns a square matrix with dimension the same as that of the vector and has all zero elements except the elements of the vector form the main diagonal of the matrix.   floor is returns the greatest integer less than or equal to its argument.   ceil returns the least integer greater than or equal to its argument.       
 
         [0016]      FIG. 3  is process flow diagram for step  102 . The inputs are determined as follows. N is the number of frequencies (including both positive and negative frequencies) for which the vector spectrum is desired. For notational convenience, N is even. Let f max  is the maximum frequency that is desired to appear in the spectrum. According to the Nyquist theorem, f max &lt;1/t discr /2 to avoid aliasing. In step  122 , t step  is set as the lower limit of (1/f max /2/t discr ) times t discr . In step  124 , f step  is 1/t step /N. In step  126 , t image  is set to t step N. In step  128 , the vector of frequency lines of spectrum f is set to be (−N/2·f step , (−N/2−1)·f step , . . . , (N/2−2)·f step , (N/2−1)·f step ) T . In step  128 , the vector tvirt is (0, 1, . . . N−1) T ·t step . where vector tvirt is a vector of virtual sampling times equivalent to the sampling times actually used under the periodicity assumption In step  130 , a new vector t of length N is created. In step  132 , first t 1  is set to 0. Then for i=2, 3, . . . , N, t i  is set to tvirt i-1 +ceil((t i-1 +t recover )/t image )·t image . Set P=I. At the conclusion of step  132 , vector t contains the relative times at which to trigger the time-triggered sampling means. 
         [0017]    There exists an infinite number of vectors t that may be used. t can be any vector for which there exists permutation matrix P that satisfies the following equation: 
         [0000]        B (tvirt, f )= PB ( t,f ) 
         [0000]    Examples of other vectors that meet the above requirement include all vectors t+c for any constant c. Applying Fourier analysis means that the signal is assumed to be periodic, hence another set of vectors t, each of which yields acceptable sampling times, includes all vectors P −1 (tvirt+(k 1 /f step , k 2 /f step , . . . k N /f step ) T ) for all choices of permutation matrix P and integers k 1 , k 2 , . . . k N . In particular, P and k 1 , k 2 , . . . k N  may be chosen so as to reduce or minimize the total measurement time max(tvirt+(k 1 /f step , k 2 /f step , . . . k N /f step ) T ) such that any two sampling times must differ by at least t recover  by means for example of a greedy optimization algorithm. 
         [0018]      FIG. 4  is a process flow diagram for step  108 . The inputs are the permutation matrix P, vector tvirt, and vector t. w is a windowing function that maps the range [−1, 1] into the range [0,1]. Suitable windowing functions include the Hann and Hamming functions. The windowing function is used as the measured physical variable may not be periodic with period 1/f step  as a Fourier transform assumes. 
         [0019]    In step  140 , compute the time to begin the measurements as the current real time plus the time T required to transmit the measurement request to the time-triggered sampling. In step  142 , compute the times to perform the measurements, T+t. In step  144 , transmit the request to perform the measurements at times T+t to the time-triggered sampling means. In step  146 , wait until at least time T+t N , next receive measurements (vector x, where x i  is the measurement taken at time T+t i ) into the computing means. In step  148 , apply P and transform into the frequency domain.