On the computation of autocorrelation using polynomial transforms

Polynomial transforms (PT's) are known to be efficient for computing convolutions. In this correspondence, the use of polynomial transforms for computing autocorrelation has been considered. A method has been described for using polynomial transforms instead of the FFT in the Rader's algorithm for autocorrelation, and the number of arithmetic operations compared; it is found that the use of PT's does not result in the expected computational advantage over the FFT method.