Efficient algorithms for computing the 2-D hexagonal Fourier transforms

DOI10.1109/TSP.2002.1003067MaRDI QIDQ5353587zbMATH OpenFDO

Authors Artyom M. Grigoryan

Publication date 8 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2002.1003067

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(3)

• Reducing the background anisotropy by using hexagonal Fourier transform in two-dimensional turbulent flows
• Splines and Multiresolution Analysis
• Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice

This page was built for publication: Efficient algorithms for computing the 2-D hexagonal Fourier transforms

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