Share Email Print
cover

Proceedings Paper

Fast reduction a modulo polynomial and fast Vandermonde transform based on fast Fourier transform algorithms
Author(s): Alexander M. Krot
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 17 July 1998
PDF: 10 pages
Proc. SPIE 3374, Signal Processing, Sensor Fusion, and Target Recognition VII, (17 July 1998); doi: 10.1117/12.327125
Show Author Affiliations
Alexander M. Krot, Institute of Engineering Cybernetics (Belarus)


Published in SPIE Proceedings Vol. 3374:
Signal Processing, Sensor Fusion, and Target Recognition VII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top