Non-uniform discrete Fourier transform
Builds on Discrete Fourier transform
Definition
Let and be integers. Let be real numbers, the sample points, and let be real numbers, the frequencies. The non-uniform discrete Fourier transform of a vector is the vector given by It is of type I if for all , with arbitrary . It is of type II if for all , with arbitrary . It is of type III if both families are arbitrary. The numbering of types I and II varies between authors; some, including the cited source, swap the two names.
Remarks
Example: with , and , the sum is , the ordinary discrete Fourier transform; it is both of type I and of type II. Non-example: the sum over all integers is not a non-uniform DFT, because the definition requires finitely many sample points. The map is linear, with the matrix . Unlike the DFT matrix, is in general not a multiple of a unitary matrix, and it can be badly conditioned or singular, for example when two sample points coincide. The adjoint transform, with , is used in place of an inverse. Some authors use multidimensional points with the dot product in the exponent.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Discrete Fourier transform concept
- Non-uniform discrete Fourier transform definition
Further reading
About this page
| Tag | EXZHFNRMV8 |
|---|---|
| URI | m2://EXZHFNRMV8 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65T50, 65T40 |
| Defines | Non-uniform discrete Fourier transform |
| Uses | Discrete Fourier transform |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.