Live briefing
Everything about Fast Algorithms for Multidimensional Signals
Similar to one-dimensional digital signal processing, in case of the multidimensional signal processing there are efficient algorithms. The efficiency of an algorithm can be evaluated by the amount of computational resources it takes to compute output or the quantity of interest. In this article, two of the very efficient algorithms for multidimensional signals are explained. For the sake of simplicity and description it is explained for two-dimensional signals. However, same theory holds good for higher-dimensional signals. The exact computational savings for each algorithm is also mentioned. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Fast Algorithms for Multidimensional SignalsA 5-minute orientation
- Pick up a classic book: Fast algorithms for signal processingThe most-reprinted book on the subject
- Read the landmark paper: Fast sparse reconstruction algorithm for multidimensional signalsCited 12 times
- Go sideways: Cooley–Tukey FFT algorithmA closely related topic
- Go sideways: Multidimensional transformA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Fast algorithms for signal processingRichard E. Blahut · 2010
Wavelets Made EasyYves Nievergelt · 2012
Intelligent Science and Intelligent Data EngineeringJian Yang · 2013
Digital Signal Processing · 2006
Multidimensional filter banks and waveletsSankar Basu, Bernard C. Levy · 1997
Mathematical Statistics Theory and ApplicationsYu. A. Prokhorov, V. V. Sazonov · 2020
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Cooley–Tukey FFT algorithm The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete…
- Multidimensional transform In mathematical analysis and applications, multidimensional transforms are used to analyze the frequency content of signals in a domain of two or more…
- Hexagonal fast Fourier transform The hexagonal fast Fourier transform (HFFT) is a tool in image and signal processing which uses fast Fourier transform (FFT) routines to compute the discrete…
- Chirp Z-transform The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT). While the DFT samples the Z plane at uniformly-spaced points along…
- Overlap–add method In signal processing, the overlap–add method is an efficient way to evaluate the discrete convolution of a very long signal x [ n ] {\displaystyle x[n]}…
- Discrete wavelet transform In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled…
- Discrete sine transform In mathematics, the discrete sine transform (DST) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using a purely real…
- Goertzel algorithm The Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform…