Computing the Discrete Fourier Transform on a Hexagonal Lattice

DOI10.1007/S10851-007-0013-XMaRDI QIDQ6483399zbMATH OpenFDO

Authors Andrew Vince, Xiqiang Zheng

Publication date 20 September 2007

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10851-007-0013-X

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• A version of the discrete Fourier transform with nodes on parallelepipedal lattices
• Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
• Nonequispaced fast Fourier transform on parallel hexagon
• scientific article; zbMATH DE number 4075184
• Fast Fourier transform for hexagonal aggregates

Cited in

(5)

• A version of the discrete Fourier transform with nodes on parallelepipedal lattices
• Fast Fourier transform for hexagonal aggregates
• Fast Fourier transform on FCC and BCC lattices with outputs on FCC and BCC lattices respectively
• Solving a 6120 -bit DLP on a Desktop Computer
• Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice

This page was built for publication: Computing the Discrete Fourier Transform on a Hexagonal Lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6483399)