Hexagonal fast Fourier transform with rectangular output

Hexagonal sampling is the most efficient sampling pattern for a two-dimensional circularly bandlimited function. A separable fast discrete Fourier transform (DFT) algorithm for hexagonally sampled data that directly computes output points on a rectangular lattice is reported. No interpolation is req...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1993-03, Vol.41 (3), p.1469-1472
Main Author: Ehrhardt, J.C.
Format: Article
Language:English
Subjects:
Applied sciences
Computational complexity
Discrete Fourier transforms
Discrete transforms
Exact sciences and technology
Fast Fourier transforms
Image reconstruction
Image sampling
Information, signal and communications theory
Interpolation
Lattices
Mathematical methods
Radiology
Sampling methods
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hexagonal sampling is the most efficient sampling pattern for a two-dimensional circularly bandlimited function. A separable fast discrete Fourier transform (DFT) algorithm for hexagonally sampled data that directly computes output points on a rectangular lattice is reported. No interpolation is required. The algorithm has computational complexity comparable to that of standard two-dimensional fast Fourier transforms.< >
ISSN:1053-587X
1941-0476
DOI:10.1109/78.205759