Title :
Hexagonal fast Fourier transform with rectangular output
Author :
Ehrhardt, James C.
Author_Institution :
Dept. of Radiol., Kanazawa Med. Univ., Ishikawa, Japan
fDate :
3/1/1993 12:00:00 AM
Abstract :
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
Keywords :
fast Fourier transforms; computational complexity; discrete Fourier transform; hexagonal FFT; hexagonal sampling; hexagonally sampled data; rectangular lattice; rectangular output; separable DFT algorithm; two-dimensional circularly bandlimited function; Computational complexity; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Image reconstruction; Image sampling; Interpolation; Lattices; Radiology; Sampling methods;
Journal_Title :
Signal Processing, IEEE Transactions on
