Fast reduction a modulo polynomial and fast Vandermonde transform based on fast Fourier transform algorithms
Alexander M. Krot · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1998
This paper shows on how the real algorithms for the reduction a modulo arbitrary polynomial and fast Vandermonde transform (FVT) are realized on computer using fast Fourier transform (FFT). This real-valued FVT algorithm on the developed fast reduction polynomial algorithm is based. The realization of FVT algorithm on computer with real multiplicative complexity O(2Nlog22N) and real additive complexity O(6Nlog22N) is obtained. New FVT algorithm is applied in digital signal, filtering and interpolation problems.