Efficient algorithms for computing the 2-D hexagonal Fourier transforms

DOI10.1109/TSP.2002.1003067zbMath1369.65186MaRDI QIDQ5353587

Artyom M. Grigoryan

Publication date: 8 September 2017

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

Mathematics Subject Classification ID

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

Related Items (3)

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

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