Non-uniform discrete Fourier transform

From HandWiki

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,[1] magnetic resonance imaging,[2] and the numerical solution of partial differential equations.[3] 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 transforms a sequence of [math]\displaystyle{ N }[/math] complex numbers [math]\displaystyle{ x_0, \ldots, x_{N-1} }[/math] into another sequence of complex numbers [math]\displaystyle{ X_0, \ldots, X_{N-1} }[/math] defined by

[math]\displaystyle{ X_k = \sum_{n=0}^{N-1} x_n e^{-2\pi i p_n f_k}, \quad 0 \leq k \leq N-1, }[/math]

 

 

 

 

(1)

where [math]\displaystyle{ p_0, \ldots, p_{N-1} \in [0,1] }[/math] are sample points and [math]\displaystyle{ f_0, \ldots, f_{N-1} \in [0,N] }[/math] are frequencies. Note that if [math]\displaystyle{ p_n = n/N }[/math] and [math]\displaystyle{ f_k = k }[/math], then equation (1) reduces to the discrete Fourier transform. There are three types of NUDFTs.[4]

  • The nonuniform discrete Fourier transform of type I (NUDFT-I) uses uniform sample points [math]\displaystyle{ p_n = n/N }[/math] but nonuniform (i.e. non-integer) frequencies [math]\displaystyle{ f_k }[/math]. This corresponds to evaluating a generalized Fourier series at equispaced points. It is also known as NDFT.[5]
  • The nonuniform discrete Fourier transform of type II (NUDFT-II) uses uniform (i.e. integer) frequencies [math]\displaystyle{ f_k = k }[/math] but nonuniform sample points [math]\displaystyle{ p_n }[/math]. This corresponds to evaluating a Fourier series at nonequispaced points. It is also known as adjoint NDFT.
  • The nonuniform discrete Fourier transform of type III (NUDFT-III) uses both nonuniform sample points [math]\displaystyle{ p_n }[/math] and nonuniform frequencies [math]\displaystyle{ f_k }[/math]. This corresponds to evaluating a generalized Fourier series at nonequispaced points. It is also known as NNDFT.

A similar set of NUDFTs can be defined by substituting [math]\displaystyle{ -i }[/math] for [math]\displaystyle{ +i }[/math] in equation (1). 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 [math]\displaystyle{ d }[/math]-dimensional array of complex numbers [math]\displaystyle{ x_{\mathbf{n}} }[/math] into another [math]\displaystyle{ d }[/math]-dimensional array of complex numbers [math]\displaystyle{ X_{\mathbf{k}} }[/math] defined by

[math]\displaystyle{ X_{\mathbf{k}} = \sum_{\mathbf{n}=\mathbf{0}}^{\mathbf{N}-1} x_{\mathbf{n}} e^{-2\pi i \mathbf{p}_{\mathbf{n}} \cdot \boldsymbol{f}_{\mathbf{k}}} }[/math]

where [math]\displaystyle{ \mathbf{p}_{\mathbf{n}} \in [0,1]^d }[/math] are sample points, [math]\displaystyle{ \boldsymbol{f}_{\mathbf{k}} \in [0,N_1] \times [0,N_2] \times \cdots \times [0,N_d] }[/math] are frequencies, and [math]\displaystyle{ \mathbf{n} = (n_1,n_2,\ldots,n_d) }[/math] and [math]\displaystyle{ \mathbf{k} = (k_1,k_2,\ldots,k_d) }[/math] are [math]\displaystyle{ d }[/math]-dimensional vectors of indices from 0 to [math]\displaystyle{ \mathbf{N}-1 = (N_1-1,N_2-1,\ldots,N_d-1) }[/math]. The multidimensional NUDFTs of types I, II, and III are defined analogously to the 1D case.[4]

Relationship to Z-transform

The NUDFT-I can be expressed as a Z-transform.[6] The NUDFT-I of a sequence [math]\displaystyle{ x[n] }[/math] of length [math]\displaystyle{ N }[/math] is

[math]\displaystyle{ X(z_k)=X(z)|_{z=z_k}=\sum_{n=0}^{N-1}x[n]z_k^{-n},\quad k=0, 1, ..., N-1, }[/math]

where [math]\displaystyle{ X(z) }[/math] is the Z-transform of [math]\displaystyle{ x[n] }[/math], and [math]\displaystyle{ \{z_i\}_{i=0, 1, ..., N-1} }[/math] 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

[math]\displaystyle{ \mathbf{X}=\mathbf{D}\mathbf{x} }[/math]

where

[math]\displaystyle{ \mathbf{X}=\begin{bmatrix} X(z_0)\\ X(z_1)\\ \vdots\\ X(z_{N-1}) \end{bmatrix},\quad \mathbf{x}=\begin{bmatrix} x[0]\\ x[1]\\ \vdots\\ x[N-1] \end{bmatrix},\text{ and}\quad \mathbf{D}=\begin{bmatrix} 1 & z_0^{-1} & z_0^{-2} & \cdots & z_0^{-(N-1)}\\ 1 & z_1^{-1} & z_1^{-2} & \cdots & z_1^{-(N-1)}\\ \vdots & \vdots & \vdots & \ddots & \vdots\\ 1 & z_{N-1}^{-1} & z_{N-1}^{-2} & \cdots & z_{N-1}^{-(N-1)} \end{bmatrix}. }[/math]

Direct inversion of the NUDFT-I

As we can see, the NUDFT-I is characterized by [math]\displaystyle{ \mathbf{D} }[/math] and hence the [math]\displaystyle{ N }[/math] [math]\displaystyle{ {z_k} }[/math] points. If we further factorize [math]\displaystyle{ \det(\mathbf{D}) }[/math], we can see that [math]\displaystyle{ \mathbf{D} }[/math] is nonsingular provided the [math]\displaystyle{ N }[/math] [math]\displaystyle{ {z_k} }[/math] points are distinct. If [math]\displaystyle{ \mathbf{D} }[/math] is nonsingular, we can get a unique inverse NUDFT-I as follows:

[math]\displaystyle{ \mathbf{x}=\mathbf{D^{-1}}\mathbf{X} }[/math].

Given [math]\displaystyle{ \mathbf{X}\text{ and }\mathbf{D} }[/math], we can use Gaussian elimination to solve for [math]\displaystyle{ \mathbf{x} }[/math]. However, the complexity of this method is [math]\displaystyle{ O(N^3) }[/math]. To solve this problem more efficiently, we first determine [math]\displaystyle{ X(z) }[/math] directly by polynomial interpolation:

[math]\displaystyle{ \hat X [k]=X(z_k),\quad k=0, 1, ..., N-1 }[/math].

Then [math]\displaystyle{ x[n] }[/math] are the coefficients of the above interpolating polynomial.

Expressing [math]\displaystyle{ X(z) }[/math] as the Lagrange polynomial of order [math]\displaystyle{ N-1 }[/math], we get

[math]\displaystyle{ X(z)=\sum_{k=0}^{N-1}\frac{L_k(z)}{L_k(z_k)}\hat X [k], }[/math]

where [math]\displaystyle{ \{L_i(z)\}_{i=0, 1, ..., N-1} }[/math] are the fundamental polynomials:

[math]\displaystyle{ L_k(z)=\prod_{i\ne k}(1-z_iz^{-1}),\quad k=0, 1, ..., N-1 }[/math].

Expressing [math]\displaystyle{ X(z) }[/math] by the Newton interpolation method, we get

[math]\displaystyle{ X(z)=c_0 + c_1(1-z_0z^{-1}) + c_2(1-z_0z^{-1})(1-z_1z^{-1}) + \cdots + c_{N-1}\prod_{k=0}^{N-2}(1-z_kz^{-1}), }[/math]

where [math]\displaystyle{ c_j }[/math] is the divided difference of the [math]\displaystyle{ j }[/math]th order of [math]\displaystyle{ \hat X [0], \hat X [1], ..., \hat X [j] }[/math] with respect to [math]\displaystyle{ z_0, z_1, ..., z_j }[/math]:

[math]\displaystyle{ c_0 = \hat X [0], }[/math]
[math]\displaystyle{ c_1 = \frac{\hat X [1]-c_0}{1-z_0z_1^{-1}}, }[/math]
[math]\displaystyle{ c_2 = \frac{\hat X [2]-c_0-c_1(1-z_0z^{-1})}{(1-z_0z_2^{-1})(1-z_1z_2^{-1})}, }[/math]
[math]\displaystyle{ \vdots }[/math]

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 [math]\displaystyle{ \{c_j\} }[/math]:

[math]\displaystyle{ \mathbf{L}\mathbf{c}=\mathbf{X} }[/math]

where

[math]\displaystyle{ \mathbf{X}=\begin{bmatrix} \hat X [0]\\ \hat X [1]\\ \vdots\\ \hat X [N-1] \end{bmatrix},\quad \mathbf{c}=\begin{bmatrix} c_0\\ c_1\\ \vdots\\ c_{N-1} \end{bmatrix},\text{ and}\quad \mathbf{L}=\begin{bmatrix} 1 & 0 & 0 & 0 & \cdots & 0\\ 1 & (1-z_0z_1^{-1}) & 0 & 0 & \cdots & 0\\ 1 & (1-z_0z_2^{-1}) & (1-z_0z_2^{-1})(1-z_1z_2^{-1}) & 0 & \cdots & 0\\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots\\ 1 & (1-z_0z_{N-1}^{-1}) & (1-z_0z_{N-1}^{-1})(1-z_1z_{N-1}^{-1}) & \cdots & \prod_{k=0}^{N-2}(1-z_kz_{N-1}^{-1}) \end{bmatrix}. }[/math]

By the above equation, [math]\displaystyle{ \{c_j\} }[/math] can be computed within [math]\displaystyle{ O(N^2) }[/math] operations. In this way Newton interpolation is more efficient than Lagrange Interpolation unless the latter is modified by

[math]\displaystyle{ L_{k+1}(z) = \frac{(1-z_{k+1}z^{-1})}{(1-z_kz^{-1})}L_k(z),\quad k=0, 1, ..., N-1 }[/math].

Nonuniform fast Fourier transform

While a naive application of equation (1) results in an [math]\displaystyle{ O(N^2) }[/math] algorithm for computing the NUDFT, [math]\displaystyle{ O(N \log N) }[/math] 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,[7][8][9][10] min-max interpolation,[2] and low-rank approximation.[11] 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.[4] Software libraries for performing NUFFTs are available in 1D, 2D, and 3D.[12][13][14][15]

Applications

The applications of the NUDFT include:

See also

References

  1. ↑ Bagchi, Sonali; Mitra, Sanjit K. (1999). The Nonuniform Discrete Fourier Transform and Its Applications in Signal Processing. Boston, MA: Springer US. ISBN 978-1-4615-4925-3. 
  2. ↑ 2.0 2.1 Fessler, J.A.; Sutton, B.P. (February 2003). "Nonuniform fast fourier transforms using min-max interpolation". IEEE Transactions on Signal Processing 51 (2): 560–574. doi:10.1109/TSP.2002.807005. Bibcode: 2003ITSP...51..560F. 
  3. ↑ Lee, June-Yub; Greengard, Leslie (June 2005). "The type 3 nonuniform FFT and its applications". Journal of Computational Physics 206 (1): 1–5. doi:10.1016/j.jcp.2004.12.004. Bibcode: 2005JCoPh.206....1L. 
  4. ↑ 4.0 4.1 4.2 Greengard, Leslie; Lee, June-Yub (January 2004). "Accelerating the Nonuniform Fast Fourier Transform". SIAM Review 46 (3): 443–454. doi:10.1137/S003614450343200X. Bibcode: 2004SIAMR..46..443G. 
  5. ↑ Plonka, Gerlind; Potts, Daniel; Steidl, Gabriele; Tasche, Manfred (2019). Numerical Fourier Analysis. Birkhäuser. doi:10.1007/978-3-030-04306-3. ISBN 978-3-030-04306-3. 
  6. ↑ Marvasti, Farokh (2001). Nonuniform Sampling: Theory and Practice. New York: Springer. pp. 325–360. ISBN 978-1-4615-1229-5. 
  7. ↑ Dutt, Alok (May 1993). Fast Fourier Transforms for Nonequispaced Data (PDF) (PhD). Yale University.
  8. ↑ Dutt, Alok; Rokhlin, Vladimir (November 1993). "Fast Fourier Transforms for Nonequispaced Data". SIAM Journal on Scientific Computing 14 (6): 1368–1393. doi:10.1137/0914081. 
  9. ↑ Potts, Daniel; Steidl, Gabriele (January 2003). "Fast Summation at Nonequispaced Knots by NFFT". SIAM Journal on Scientific Computing 24 (6): 2013–2037. doi:10.1137/S1064827502400984. 
  10. ↑ Boyd, John P (December 1992). "A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid". Journal of Computational Physics 103 (2): 243–257. doi:10.1016/0021-9991(92)90399-J. Bibcode: 1992JCoPh.103..243B. https://deepblue.lib.umich.edu/bitstream/2027.42/29694/1/0000026.pdf. 
  11. ↑ Ruiz-Antolín, Diego; Townsend, Alex (20 February 2018). "A Nonuniform Fast Fourier Transform Based on Low Rank Approximation". SIAM Journal on Scientific Computing 40 (1): A529–A547. doi:10.1137/17M1134822. https://repositorio.unican.es/xmlui/bitstream/handle/10902/13767/ANonuniform.pdf. 
  12. ↑ "NUFFT page". https://cims.nyu.edu/cmcl/nufft/nufft.html. 
  13. ↑ "NFFT" (in en). http://www.nfft.org/. 
  14. ↑ "MikaelSlevinsky/FastTransforms.jl" (in en). 2019-02-13. https://github.com/MikaelSlevinsky/FastTransforms.jl. 
  15. ↑ "chebfun/chebfun" (in en). 2019-02-07. https://github.com/chebfun/chebfun. 

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Non-uniform_discrete_Fourier_transform&oldid=3386848"