Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2) (Q4734736)
From MaRDI portal
scientific article; zbMATH DE number 4121384
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
