Everything about Parallel multidimensional digital signal processing
Digital processing technique
Parallel multidimensional digital signal processing (mD-DSP) is defined as the application of parallel programming and multiprocessing to digital signal processing techniques to process digital signals that have more than a single dimension. The use of mD-DSP is fundamental to many application areas such as digital image and video processing, medical imaging, geophysical signal analysis, sonar, radar, lidar, array processing, computer vision, computational photography, and augmented and virtual reality. However, as the number of dimensions of a signal increases the computational complexity to operate on the signal increases rapidly. This relationship between the number of dimensions and the amount of complexity, related to both time and space, as studied in the field of algorithm analysis, is analogues to the concept of the curse of dimensionality. This large complexity generally results in an extremely long execution run-time of a given mD-DSP application rendering its usage to become impractical for many applications; especially for real-time applications. This long run-time is the primary motivation of applying parallel algorithmic techniques to mD-DSP problems. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Parallel multidimensional digital signal processingA 5-minute orientation
- Pick up a classic book: Digital Signal ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applicationsCited 1 times
- Go sideways: Chirp Z-transformA 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
Digital Signal Processing · 2006- 📕Tech15projects.com · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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…
- 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…
- 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…
- 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]}…
- 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…
- Rader's FFT algorithm Rader's algorithm (1968), named for Charles M. Rader of MIT Lincoln Laboratory, is a fast Fourier transform (FFT) algorithm that computes the discrete…
- Sliding DFT In digital signal processing, the sliding discrete Fourier transform (sliding DFT or SDFT) is a recursive algorithm for computing a sequence of discrete…
- Finite impulse response In signal processing, a finite impulse response (FIR) filter is a filter whose impulse response (or response to any finite length input) is of finite duration…