Fast unified computation of the multi-dimensional discrete sinusoidal transforms

DOI10.1016/S0096-3003(01)00206-5zbMath1027.94507OpenAlexW1986795553MaRDI QIDQ1855852

Yanyan Li

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(01)00206-5

zbMATH Keywords

discrete Fourier transformsfast algorithmmulti-dimensional signal processingdiscrete sinusoidal transform

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Uses Software

• Visual C++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete W transform
• Fast algorithms for the 2-D discrete W transform.
• The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
• On computing the 2-D FFT
• Multidimensional polynomial transform algorithm for multidimensional discrete W transform
• A refined fast 2-D discrete cosine transform algorithm
• A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• In-place butterfly-style FFT of 2-D real sequences
• Properties of the Multidimensional Generalized Discrete Fourier Transform
• Extended lapped transforms: properties, applications, and fast algorithms
• Fast algorithms for the discrete cosine transform
• Generalized discrete Hartley transforms
• Conjugate Gradient Methods for Toeplitz Systems
• Calculation of multidimensional Hartley transforms using one-dimensional Fourier transforms

This page was built for publication: Fast unified computation of the multi-dimensional discrete sinusoidal transforms