Math 2.0

Numerical analysis Definition

Non-uniform discrete Fourier transform

Builds on Discrete Fourier transform

Definition

Let N≥1N \ge 1 and K≥1K \ge 1 be integers. Let p0,…,pN−1p_0, \ldots, p_{N-1} be real numbers, the sample points, and let f0,…,fK−1f_0, \ldots, f_{K-1} be real numbers, the frequencies. The non-uniform discrete Fourier transform of a vector x=(x0,…,xN−1)∈ℂNx = (x_0, \ldots, x_{N-1}) \in \C^N is the vector X∈ℂKX \in \C^K given by Xk=∑n=0N−1xn e−2πi pnfk,k=0,…,K−1.X_k = \sum_{n=0}^{N-1} x_n\, e^{-2\pi i\, p_n f_k}, \qquad k = 0, \ldots, K-1. It is of type I if fk=kf_k = k for all kk, with arbitrary pnp_n. It is of type II if pn=n/Np_n = n/N for all nn, with arbitrary fkf_k. 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 K=NK = N, pn=n/Np_n = n/N and fk=kf_k = k, the sum is ∑nxne−2πink/N\sum_n x_n e^{-2\pi i nk/N}, the ordinary discrete Fourier transform; it is both of type I and of type II. Non-example: the sum ∑n∈ℤxne−2πinf\sum_{n \in \Z} x_n e^{-2\pi i n f} over all integers is not a non-uniform DFT, because the definition requires finitely many sample points. The map x↦Xx \mapsto X is linear, with the K×NK \times N matrix Akn=e−2πipnfkA_{kn} = e^{-2\pi i p_n f_k}. Unlike the DFT matrix, AA 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 e+2πipnfke^{+2\pi i p_n f_k}, is used in place of an inverse. Some authors use multidimensional points pn,fk∈ℝdp_n, f_k \in \R^d with the dot product pn⋅fkp_n \cdot f_k 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Discrete Fourier transform concept
  2. Non-uniform discrete Fourier transform definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Non-uniform_discrete_Fourier_transform
About this page
TagEXZHFNRMV8
URIm2://EXZHFNRMV8
Kinddefinition
WritingW0 stub
MSC65T50, 65T40
DefinesNon-uniform discrete Fourier transform
UsesDiscrete 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.