Improved fast polynomial transform algorithm for cyclic convolutions
Copyright policy )Improved fast polynomial transform algorithm for cyclic convolutions
The authors present an improved version of the fast polynomial transform which eliminates totally the pre-transform and post-transform computations for the realization of the cyclic convolution. This new formulation has the advantage of regular structure and requires just one type of complex root of unity. The computation time is 20\% reduced.
- Hong Kong Polytechnic University China (People's Republic of)
Signal theory (characterization, reconstruction, filtering, etc.), fast polynomial transform, Analysis of algorithms and problem complexity, algorithm complexity, cyclic convolution, Probabilistic methods, stochastic differential equations, Numerical methods for discrete and fast Fourier transforms
Signal theory (characterization, reconstruction, filtering, etc.), fast polynomial transform, Analysis of algorithms and problem complexity, algorithm complexity, cyclic convolution, Probabilistic methods, stochastic differential equations, Numerical methods for discrete and fast Fourier transforms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!