On computing the 2-D FFT

DOI10.1109/78.757237zbMath0972.65125OpenAlexW1994003281MaRDI QIDQ2723624

Dragutin Šević

Publication date: 8 July 2001

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

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

zbMATH Keywords

algorithmdiscrete cosine transform2-D FFTsplit-radix FFTlapped transformstwo-dimensional fast Fourier transforminverse scaling

Mathematics Subject Classification ID

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

Related Items (1)

Fast unified computation of the multi-dimensional discrete sinusoidal transforms

This page was built for publication: On computing the 2-D FFT