Journal ArticleDOI
High-speed computation of autocorrelation using rectangular transforms
N. G. Reddy,V. Reddy +1 more
Reads0
Chats0
TLDR
A technique based on the recently developed rectangular transforms is proposed for computing the autocorrelation function of a data sequence, which is computationally more efficient than Rader's algorithm using the fast Fourier transform and the Winograd-Fourier transform algorithm when the number of desired lag values is smaller than 30.Abstract:
A technique based on the recently developed rectangular transforms is proposed for computing the autocorrelation function of a data sequence. The refinements suggested with the technique make it computationally more efficient than Rader's algorithm using the fast Fourier transform and the Winograd-Fourier transform algorithm, when the number of desired lag values is smaller than 30. However, the technique as such can be used for higher values.read more
Citations
More filters
Journal ArticleDOI
Rectangular transforms for digital convolution on the research signal processor
TL;DR: The results are intended to demonstrate the efficiency of the RT convolution algorithms on a microprocessor with a limited instruction set and to show how to construct efficient RT programs for digital convolution.
Journal ArticleDOI
On the computation of autocorrelation using polynomial transforms
Surya Prakash,V. Rao +1 more
TL;DR: It is found that the use of PT's does not result in the expected computational advantage over the FFT method in the Rader's algorithm for autocorrelation.
Proceedings ArticleDOI
Computationally efficient estimation of the mean frequency for real-valued signals
TL;DR: It is demonstrated in a simulation study that estimates of the mean frequency with mean squared error equal to the error in estimates obtained via a FFT derived mean frequency estimate can be obtained by using just a few lags of the normalized autocorrelation function with a computational effort substantially less than that required for estimation via FFT.
References
More filters
Journal ArticleDOI
On computing the discrete Fourier transform
TL;DR: New algorithms for computing the Discrete Fourier Transform of n points are described, which use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
Journal ArticleDOI
New algorithms for digital convolution
R. Agarwal,J. Cooley +1 more
TL;DR: It is shown how the Chinese Remainder Theorem can be used to convert a one-dimensional cyclic convolution to a multi-dimensional convolution which is cyclic in all dimensions and can be more efficient, for some data sequence lengths, than the fast Fourier transform (FFT) algorithm.
Journal ArticleDOI
A linear prediction vocoder simulation based upon the autocorrelation method
J. Markel,A. Gray +1 more
TL;DR: Experimental results are presented which illustrate both the capabilities and limitations of linear prediction vocoders.
Journal ArticleDOI
An improved algorithm for high speed autocorrelation with applications to spectral estimation
TL;DR: The techniques disclosed here should be especially important in real-time estimation of power spectra, in instances where the data sequence is essentially unterminated.