Computing the Discrete Fourier Transform on a Hexagonal Lattice

Authors:
Andrew Vince;Xiqiang Zheng
Affiliations:
Department of Mathematics, University of Florida, Gainesville, USA 32611-8105;Department of Mathematics, University of Florida, Gainesville, USA 32611-8105
Venue:
Journal of Mathematical Imaging and Vision
Year:
2007

Citing 5
Cited 1

An isomorphism between the p-adic integers and a ring associated with a tiling of N-space by permutohedra

Discrete Applied Mathematics
Fast Fourier Transform for Hexagonal Aggregates

Journal of Mathematical Imaging and Vision
Multidimensional Digital Signal Processing

Multidimensional Digital Signal Processing
Hexagonal Image Processing: A Practical Approach (Advances in Pattern Recognition)

Hexagonal Image Processing: A Practical Approach (Advances in Pattern Recognition)
Efficient algorithms for computing the 2-D hexagonal Fouriertransforms

IEEE Transactions on Signal Processing

Structured FFT and TFT: symmetric and lattice polynomials

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computation of the Discrete Fourier Transform for a general lattice in 驴 d can be reduced to the computation of the standard 1-dimensional Discrete Fourier Transform. We provide a mathematically rigorous but simple treatment of this procedure and apply it to the DFT on the hexagonal lattice.