Non-uniform discrete Fourier transform

Template:Short description In applied mathematics, the non-uniform discrete Fourier transform (NUDFT or NDFT) of a signal is a type of Fourier transform, related to a discrete Fourier transform or discrete-time Fourier transform, but in which the input signal is not sampled at equally spaced points or frequencies (or both). It is a generalization of the shifted DFT. It has important applications in signal processing, magnetic resonance imaging, and the numerical solution of partial differential equations.

As a generalized approach for nonuniform sampling, the NUDFT allows one to obtain frequency domain information of a finite length signal at any frequency. One of the reasons to adopt the NUDFT is that many signals have their energy distributed nonuniformly in the frequency domain. Therefore, a nonuniform sampling scheme could be more convenient and useful in many digital signal processing applications. For example, the NUDFT provides a variable spectral resolution controlled by the user.

Definition

The nonuniform discrete Fourier transform (NUDFT) transforms a sequence of $N$ complex numbers $x_0,\dots ,x_{N-1}$ into another sequence of complex numbers $X_0,\dots ,X_{N-1}$ defined by Template:NumBlk where $p_0,\dots ,p_{N-1}\in [0,1]$ are sample points and $f_0,\dots ,f_{N-1}\in [0,N]$ are frequencies. Note that if $p_n=n/N$ and $f_k=k$, then equation (Template:EquationNote) reduces to the discrete Fourier transform.

The NUDFT defines a linear operator. Fast numerical algorithms for evaluating this operator are known as the nonuniform fast Fourier transform (NUFFT).

Terminology and conventions

Two related but distinct conventions are used in the literature to classify nonuniform Fourier transforms:

• In harmonic analysis and signal processing, NUDFTs are commonly described from a series-evaluation viewpoint, in which transform types are distinguished by whether the sample locations or the frequencies are nonuniform.

• In numerical analysis and scientific computing, particularly in the context of NUFFT algorithms and software libraries, transforms are classified by the mapping direction between uniform and nonuniform representations, reflecting linear-operator structure and adjoint relationships.

NUDFT types

• The nonuniform discrete Fourier transform of type I (NUDFT-I) uses uniform sample points $p_n=n/N$ but nonuniform (i.e. non-integer) frequencies $f_k$. This corresponds to evaluating a generalized Fourier series at equispaced points. It is also known as NDFT.. It is sometimes called forward NDFT and corresponds to NUFFT Type II (uniform to nonuniform) in the operator-based convention.
• The nonuniform discrete Fourier transform of type II (NUDFT-II) uses uniform (i.e. integer) frequencies $f_k=k$ but nonuniform sample points $p_n$. This corresponds to evaluating a Fourier series at nonequispaced points. It is also known as adjoint NDFT or NUFFT Type I (nonuniform to uniform).
• The nonuniform discrete Fourier transform of type III (NUDFT-III) uses both nonuniform sample points $p_n$ and nonuniform frequencies $f_k$. This corresponds to evaluating a generalized Fourier series at nonequispaced points. It is also known as NNDFT or NUFFT Type III (nonuniform to nonuniform).

Adjoint relationship

In the operator-based convention in NUFFT, the Type I and Type II transforms are adjoint to each other in the sense of linear operators. Specifically, the NUFFT Type I transform is the Hermitian adjoint of the NUFFT Type II transform with respect to the standard inner products on the corresponding discrete spaces, up to scaling factors.

A similar family of NUDFTs can be defined by substituting $-i$ for $+i$ in equation (Template:EquationNote). Unlike in the uniform case, however, this substitution is unrelated to the inverse Fourier transform. The inversion of the NUDFT is a separate problem, discussed below.

Multidimensional NUDFT

The multidimensional NUDFT converts a $d$-dimensional array of complex numbers $x_{𝐧}$ into another Template:Nowrap array of complex numbers $X_{𝐤}$ defined by $$X_{𝐤}=\sum _{𝐧=\mathrm{𝟎}}^{𝐍-1}{x}_{𝐧}{e}^{-2\pi i{𝐩}_{𝐧}\cdot {𝒇}_{𝐤}}$$ where ${𝐩}_{𝐧}\in [0,1{]}^d$ are sample points, ${𝒇}_{𝐤}\in [0,N_1]\times [0,N_2]\times \cdots \times [0,N_d]$ are frequencies, and $𝐧=(n_1,n_2,\dots ,n_d)$ and $𝐤=(k_1,k_2,\dots ,k_d)$ are Template:Nowrap vectors of indices from 0 to Template:Nowrap The multidimensional NUDFTs of types I, II, and III are defined analogously to the 1D case.

Relationship to Z-transform

The NUDFT-I can be expressed as a Z-transform. The NUDFT-I of a sequence $x[n]$ of length $N$ is $$X(z_k)=X(z){|}_{z=z_k}=\sum _{n=0}^{N-1}x[n]z_k^{-n},k=0,1,\dots ,N-1,$$

where $X(z)$ is the Z-transform of $x[n]$, and $\{z_i{\}}_{i=0}^{N-1}$ are arbitrarily distinct points in the z-plane. Note that the NUDFT reduces to the DFT when the sampling points are located on the unit circle at equally spaced angles.

Expressing the above as a matrix, we get $$𝐗=𝐃𝐱$$

where $$𝐗=\left[\begin{array}{c}X(z_0)\\ X(z_1)\\ ⋮\\ X(z_{N-1})\end{array}\right],𝐱=\left[\begin{array}{c}x[0]\\ x[1]\\ ⋮\\ x[N-1]\end{array}\right],$$ and $$𝐃=\left[\begin{array}{ccccc}1& z_0^{-1}& z_0^{-2}& \cdots & z_0^{-(N-1)}\\ 1& z_1^{-1}& z_1^{-2}& \cdots & z_1^{-(N-1)}\\ ⋮& ⋮& ⋮& \ddots & ⋮\\ 1& z_{N-1}^{-1}& z_{N-1}^{-2}& \cdots & z_{N-1}^{-(N-1)}\end{array}\right].$$

Direct inversion of the NUDFT-I

As we can see, the NUDFT-I is characterized by $𝐃$ and hence the $N$ $z_k$ points. If we further factorize $det(𝐃)$, we can see that $𝐃$ is nonsingular provided the $N$ $z_k$ points are distinct. If $𝐃$ is nonsingular, we can get a unique inverse NUDFT-I as follows: $$𝐱={𝐃}^{\mathbf{-}\mathrm{𝟏}}𝐗.$$

Given $𝐗\text{ and }𝐃$, we can use Gaussian elimination to solve for $𝐱$. However, the complexity of this method is $O(N^3)$. To solve this problem more efficiently, we first determine $X(z)$ directly by polynomial interpolation: $$\hat{X}[k]=X(z_k),k=0,1,\dots ,N-1.$$

Then $x[n]$ are the coefficients of the above interpolating polynomial.

Expressing $X(z)$ as the Lagrange polynomial of order $N-1$, we get $$X(z)=\sum _{k=0}^{N-1}\frac{L_k(z)}{L_k(z_k)}\hat{X}[k],$$

where ${\{L_i(z)\}}_{i=0}^{N-1}$ are the fundamental polynomials:

$$L_k(z)=\prod _{i\ne k}(1-z_i{z}^{-1}),k=0,1,\dots ,N-1.$$

Expressing $X(z)$ by the Newton interpolation method, we get $$X(z)=c_0+c_1(1-z_0{z}^{-1})+c_2(1-z_0{z}^{-1})(1-z_1{z}^{-1})+\cdots +c_{N-1}\prod _{k=0}^{N-2}(1-z_k{z}^{-1}),$$

where $c_j$ is the divided difference of the $j$-th order of $\hat{X}[0],\hat{X}[1],\dots ,\hat{X}[j]$ with respect to Template:Nowrap $$\begin{array}{cccc}{c}_0& =\hat{X}[0],& c_1& =\frac{\hat{X}[1]-c_0}{1-z_0{z}_1^{-1}},\\ c_2& =\frac{\hat{X}[2]-c_0-c_1(1-z_0{z}^{-1})}{(1-z_0{z}_2^{-1})(1-z_1{z}_2^{-1})},& & \cdots \end{array}$$

The disadvantage of the Lagrange representation is that any additional point included will increase the order of the interpolating polynomial, leading to the need to recompute all the fundamental polynomials. However, any additional point included in the Newton representation only requires the addition of one more term.

We can use a lower triangular system to solve Template:Nowrap $$𝐋𝐜=𝐗$$ where $$𝐗=\left[\begin{array}{c}\hat{X}[0]\\ \hat{X}[1]\\ ⋮\\ \hat{X}[N-1]\end{array}\right],𝐜=\left[\begin{array}{c}{c}_0\\ c_1\\ ⋮\\ c_{N-1}\end{array}\right],$$ and $$𝐋=\left[\begin{array}{ccccc}1& 0& 0& \cdots & 0\\ 1& (1-z_0{z}_1^{-1})& 0& \cdots & 0\\ 1& (1-z_0{z}_2^{-1})& (1-z_0{z}_2^{-1})(1-z_1{z}_2^{-1})& \cdots & 0\\ ⋮& ⋮& ⋮& \ddots & ⋮\\ 1& (1-z_0{z}_{N-1}^{-1})& (1-z_0{z}_{N-1}^{-1})(1-z_1{z}_{N-1}^{-1})& \cdots & \prod _{k=0}^{N-2}(1-z_k{z}_{N-1}^{-1})\end{array}\right].$$

By the above equation, $\{c_j\}$ can be computed within $O(N^2)$ operations. In this way Newton interpolation is more efficient than Lagrange interpolation unless the latter is modified by $$L_{k+1}(z)=\frac{1-z_{k+1}{z}^{-1}}{1-z_k{z}^{-1}}{L}_k(z),k=0,1,\dots ,N-1.$$

Nonuniform fast Fourier transform

While a naive application of Template:EqNote results in an $O(N^2)$ algorithm for computing the NUDFT, $O(N\log N)$ algorithms based on the fast Fourier transform (FFT) do exist. Such algorithms are referred to as NUFFTs or NFFTs and have been developed based on oversampling and interpolation, min-max interpolation, and low-rank approximation. In general, NUFFTs leverage the FFT by converting the nonuniform problem into a uniform problem (or a sequence of uniform problems) to which the FFT can be applied. Software libraries for performing NUFFTs are available in 1D, 2D, and 3D.

Applications

The applications of the NUDFT include: Template:Div col

• Digital signal processing
• Magnetic resonance imaging
• Numerical partial differential equations
• Semi-Lagrangian schemes
• Spectral methods
• Spectral analysis
• Digital filter design
• Antenna array design
• Detection and decoding of dual-tone multi-frequency (DTMF) signals

See also

• Discrete Fourier transform
• Fast Fourier transform
• Least-squares spectral analysis
• Lomb–Scargle periodogram
• Spectral estimation
• Unevenly spaced time series

External links

• Non-Uniform Fourier Transform: A Tutorial.
• NFFT 3.0 – Tutorial
• NUFFT software library