• DocumentCode
    876447
  • Title

    Hexagonal fast Fourier transform with rectangular output

  • Author

    Ehrhardt, James C.

  • Author_Institution
    Dept. of Radiol., Kanazawa Med. Univ., Ishikawa, Japan
  • Volume
    41
  • Issue
    3
  • fYear
    1993
  • fDate
    3/1/1993 12:00:00 AM
  • Firstpage
    1469
  • Lastpage
    1472
  • 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;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.205759
  • Filename
    205759
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=876447