Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2) (Q4734736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4121384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2) |
scientific article; zbMATH DE number 4121384 |
Statements
Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2) (English)
0 references
1988
0 references
multiplicative complexity
0 references
discrete Fourier transform
0 references
discrete cosine transform
0 references
0.8989477753639221
0 references
0.8971333503723145
0 references
0.8773208856582642
0 references
0.8700478672981262
0 references
