Multidimensional signal processing

In signal processing, multidimensional signal processing covers all signal processing done using multidimensional signals and systems.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In signal processing, multidimensional signal processing covers all signal processing done using multidimensional signals and systems. While multidimensional signal processing is a subset of signal processing, it is unique in the sense that it deals specifically with data that can only be adequately detailed using more than one dimension.

In m-D digital signal processing, useful data is sampled in more than one dimension. Examples of this are image processing and multi-sensor radar detection. Both of these examples use multiple sensors to sample signals and form images based on the manipulation of these multiple signals.

Processing in multi-dimension (m-D) requires more complex algorithms, compared to the 1-D case, to handle calculations such as the fast Fourier transform due to more degrees of freedom. In some cases, m-D signals and systems can be simplified into single dimension signal processing methods, if the considered systems are separable.

Typically, multidimensional signal processing is directly associated with digital signal processing because its complexity warrants the use of computer modelling and computation. A multidimensional signal is similar to a single dimensional signal as far as manipulations that can be performed, such as sampling, Fourier analysis, and filtering.

The actual computations of these manipulations grow with the number of dimensions. X(k_1,k_2,\dots,k_m) = \sum_{n_1=-\infty}^\infty \sum_{n_2=-\infty}^\infty \cdots \sum_{n_m=-\infty}^\infty x(n_1,n_2,\dots,n_m) e^{-j 2 \pi k_1 n_1} e^{-j 2 \pi k_2 n_2} \cdots e^{-j 2 \pi k_m n_m} where X stands for the multidimensional discrete Fourier transform, x stands for the sampled time/space domain signal, m stands for the number of dimensions in the system, n are sample indices and k are frequency samples.

Computational complexity is usually the main concern when implementing any Fourier transform. For multidimensional signals, the complexity can be reduced by a number of different methods. The computation may be simplified if there is independence between variables of the multidimensional signal.

In general, fast Fourier transforms (FFTs), reduce the number of computations by a substantial factor. While there are a number of different implementations of this algorithm for m-D signals, two often used variations are the vector-radix FFT and the row-column FFT.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1326078097 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001326078097 · captured 1765059360.0 · version history

Cite this page as: encyclopegia.org, “Multidimensional signal processing”, snapshot enwiki-001326078097. https://encyclopegia.org/a/multidimensional-signal-processing

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.