The best formulae for the approximate computation of discrete Fourier transforms (Q1311551): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Vasily N. Malozemov / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Yasuhiro Kobayashi / rank | |||
| Property / author | |||
| Property / author: Vasily N. Malozemov / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Yasuhiro Kobayashi / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:54, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The best formulae for the approximate computation of discrete Fourier transforms |
scientific article |
Statements
The best formulae for the approximate computation of discrete Fourier transforms (English)
0 references
3 March 1994
0 references
Best approximating formulae with bounded \(L_ 2\)-norm of a finite difference of \(r\)th order is given to compute discrete Fourier transforms for complex-valued periodic signals. The mathematical basis of this proposal is on the use of discrete Bernoulli functions.
0 references
best approximation with \(L_ 2\)-norm
0 references
discrete Fourier transform
0 references
periodic signals
0 references
discrete Bernoulli functions
0 references
