Fast reduction a modulo polynomial and fast Vandermonde transform based on fast Fourier transform algorithms

Alexander M. Krot

doi:10.1117/12.327125

17 July 1998 Fast reduction a modulo polynomial and fast Vandermonde transform based on fast Fourier transform algorithms

Alexander M. Krot

Author Affiliations +

Proceedings Volume 3374, Signal Processing, Sensor Fusion, and Target Recognition VII; (1998) https://doi.org/10.1117/12.327125
Event: Aerospace/Defense Sensing and Controls, 1998, Orlando, FL, United States

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(2Nlog₂²N) and real additive complexity O(6Nlog₂²N) is obtained. New FVT algorithm is applied in digital signal, filtering and interpolation problems.

Citation Download Citation

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); https://doi.org/10.1117/12.327125

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available