Chris NUFFT Slides

The Non-Uniform
Fast Fourier Transform

Group Meeting
Friday, October 3rd, 2008
Overview
Intuitive Descriptions
Formulation of Equations for NUDFT
NUFFT Development
Inverse Techniques
Generalizations
Basic Examples
Applications to Research
NUDFT Description
NUDFT: essentially the DFT without
limitations to equally spaced frequency
nodes
Useful for applications in which samples
must be taken at irregular intervals in
frequency, time, or both (NNDFT)
Allows for more selectively concentrated
frequency (or time) information
Fast implementation:
NUFFT:NUDFT::FFT:DFT
Interpretation as Interpolation
Can be thought of as two sequential
processes
FFT taken to get frequency information at
uniformly-spaced nodes
Results used to interpolate to desired nodes
Approximation
Interpolation only produces approximation
of values at desired nodes
Quality of approximation dependent on
node spacing, nature of function
Deriving the NUDFT: Setup

Set of d-dimensional frequencies
Index set specifying sample locations:
Space of all d-variate one-period functions
expressed as:
Deriving the NUDFT: Expression

A 1-periodic function can be written as a
basis expansion:
In matrix notation:
Dimensionality (M: # of Fourier

coefficients):
Deriving the NUDFT: The Adjoint

Adjoint something like an inverse
transform
Expressed as:
Adjoint behavior
When frequency nodes equally spaced,
NUDFT collapses to DFT, and A A=MIM
Without equal spacing, equality does not hold
Transform cannot be undone just by applying
the adjoint
Developing the NUFFT: Introduction

Computationally fast
Does not require full computation of A
Uses approximations in both frequency and
time/space not a perfect representation of
the transform
Makes use of standard FFT techniques and

window operations
Developing the NUFFT: 1-D

In 1-D, want frequency information for
certain frequencies
Goal: find a linear combination of 1periodic shifted window functions to
approximate the NUDFT
General equation to satisfy:
Developing the NUFFT: Window Fcns.

Essentially used as method of frequency
interpolation
Start with a standard window function ',
extend to 1-periodic version
Periodic version expressed as Fourier
Series:
Developing the NUFFT: 1st Approx.

Then the approximation function can be
expressed in a Fourier Series representation:
Approximation: compactness in time domain

Assume window function has decaying Fourier
coeff.
Choose wks to match NUDFT coefficients:
Developing the NUFFT: 1st Approx.

Approximation yields an expression for the
weights in the original s1 expansion:
This is a standard DFT, since k and q are both

integers and are distributed uniformly
Can be evaluated with standard FFT
algorithms (notably FFTW)
Results in truncation in the time/space

domain
Developing the NUFFT: 2nd Approx.

Want to truncate window function
Give compact support in frequency domain
Achieved by multiplying against function
with compact support ()
Approximate s1 by:
Define a new multi-index set:
Developing the NUFFT: 2nd Approx.

Define a function by:
Then we can write s1 as:
Results in frequency truncation
Developing the NUFFT: Generalization

Same approach applied
Vector, matrix notation used
s1 expressed as:
NUFFT: Algorithm
Inputs: M, N, frequency locations, and
sample values
Algorithm:
Outputs: Fourier coefficients at given

frequency locations
Adjoint NUFFT: Algorithm

Inputs: M, N, frequency locations, and
Fourier coefficients
Algorithm:
Outputs: Sample values over uniform grid
Inverse Techniques
No simple inverses exist
Over-determined case:
More frequency locations than time/space points
Problem can be formulated as weighted leastsquares problem:
Under-determined case:
Fewer frequency locations than time/space
points
Problem can be formulated as damped
minimization problem:
Inverse Techniques
Both systems can be solved using
Conjugate Gradients
Under-determined case requires some
form of regularization
Included in the damped minimization
approach
Smooth time/space functions preferred;
sample values decay at edges
Generalizations of NUFFT
NNFFT NU in both time/space and
frequency version of Fast Fourier Transform
NUFCT/NUFST NU version of Fast
Cosine/Sine Transform
NUSFFT NU version of Sparse Fast Fourier
Transform
NUFPT NU version of Fast Polynomial
Transform
NUSFT NU version of Spherical Fourier
Transform
Basic Example: 1-D Reconstruction

MATLAB Example with irregularly spaced
data
Conjugate Gradients used in
reconstruction
Applications to Research
Unevenly spaced frequency data arises in
MRI
Given Fourier coefficient values at
frequencies lying on 3-dimensional spirals
Under-determined case
Want to reconstruct a 3-dimensional image
from Fourier coefficients

Chris NUFFT Slides

Uploaded by

Copyright:

Available Formats

Chris NUFFT Slides

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chris NUFFT Slides

Uploaded by

Copyright:

Available Formats

The Non-Uniform

Fast Fourier Transform

Deriving the NUDFT: Setup

Deriving the NUDFT: Expression

Dimensionality (M: # of Fourier

Deriving the NUDFT: The Adjoint

Developing the NUFFT: Introduction

Makes use of standard FFT techniques and

Developing the NUFFT: 1-D

Developing the NUFFT: Window Fcns.

Developing the NUFFT: 1st Approx.

Approximation: compactness in time domain

Developing the NUFFT: 1st Approx.

This is a standard DFT, since k and q are both

Results in truncation in the time/space

Developing the NUFFT: 2nd Approx.

Developing the NUFFT: 2nd Approx.

Results in frequency truncation

Developing the NUFFT: Generalization

Outputs: Fourier coefficients at given

Adjoint NUFFT: Algorithm

Outputs: Sample values over uniform grid

Basic Example: 1-D Reconstruction

You might also like