Improved fast polynomial transform algorithm for cyclic convolutions (Q1902509)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved fast polynomial transform algorithm for cyclic convolutions |
scientific article |
Statements
Improved fast polynomial transform algorithm for cyclic convolutions (English)
0 references
9 September 1996
0 references
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.
0 references
algorithm complexity
0 references
fast polynomial transform
0 references
cyclic convolution
0 references
