Name
Abstract | ||
|---|---|---|
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-dimensional convolutions and Discrete Fourier Transforms are then derived from polynomial transforms. |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1147/rd.222.0134 | IBM Journal of Research and Development |
Keywords | Field | DocType |
discrete fourier,one-dimensional convolution,discrete fourier transforms,minimum number,discrete two-dimensional convolution,efficient algorithm,ordinary arithmetic,convolution property,discrete fourier transform | Cyclotomic fast Fourier transform,Polynomial,Algebra,Discrete Fourier series,Fast Fourier transform,Discrete Fourier transform (general),Discrete Fourier transform,Discrete sine transform,Mathematics,Sine and cosine transforms | Journal |
Volume | Issue | ISSN |
22 | 2 | 0018-8646 |
Citations | PageRank | References |
16 | 15.03 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. J. Nussbaumer | 1 | 38 | 33.38 |
| Quandalle, P. | 2 | 16 | 15.03 |