Study on fast quasi-synchronous sampling algorithm

The quasi-synchronous sampling algorithm is an effective method for improving measurement precision when perfect synchronization is impossible. As a computer-intensive method, however, it is limited in many measurement occasions, especially when strict real-time measurement is required. By means of mathematical induction and discrete Z transformation, the recursive operation of the quasi-synchronous sampling in time domain is proved to be a multiple linear-convolution process in this paper, and a fast quasi-synchronous sampling algorithm based on linear convolution and fast Fourier transform is proposed accordingly. It is experimentally validated that the fast algorithm has a higher executing speed than the recursive algorithm.