2-D FFT algorithm by matrix factorization in a 2-D space

DOI10.1007/BF00985863zbMath0796.65149OpenAlexW2009491710MaRDI QIDQ1316209

V. Pereyra

Publication date: 14 March 1994

Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00985863

zbMATH Keywords

algorithmparallel computationfactorizationFourier matrixhypercube architecturetwo-dimensional fast Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Cites Work

• Fast computation of discrete Fourier transforms using polynomial transforms
• Unnamed Item

This page was built for publication: 2-D FFT algorithm by matrix factorization in a 2-D space