17 July 1998 Fast reduction a modulo polynomial and fast Vandermonde transform based on fast Fourier transform algorithms
Author Affiliations +
Abstract
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alexander M. Krot, "Fast reduction a modulo polynomial and fast Vandermonde transform based on fast Fourier transform algorithms", Proc. SPIE 3374, Signal Processing, Sensor Fusion, and Target Recognition VII, (17 July 1998); doi: 10.1117/12.327125; https://doi.org/10.1117/12.327125
PROCEEDINGS
10 PAGES


SHARE
Back to Top