Content deleted Content added
Citation bot (talk | contribs) m Alter: title, template type, url, journal. Add: bibcode, issue, year, isbn, doi, chapter-url, chapter, pages, volume. Removed or converted URL. Removed parameters. Formatted dashes. | You can use this bot yourself. Report bugs here. | Headbomb |
Alter: template type. | You can use this tool yourself. Report bugs here. |
||
Line 117:
===Row-Column Decomposition===
The row-column method can be applied when one of the signals in the convolution is separable. The method exploits the properties of separability in order to achieve a method of calculating the convolution of two multidimensional signals that is more computationally efficient than direct computation of each sample (given that one of the signals are separable).<ref>{{cite book|last1=Sihvo|first1=Tero|title=International Symposium on Signals, Circuits and Systems, 2005. ISSCS 2005|volume=1|pages=99–102|last2=Niittylahti|first2=Jarkko|chapter=Row-Column Decomposition Based 2D Transform Optimization on Subword Parallel Processors|date=5 June 2005
<math>y(n_1,n_2)=\sum_{k_1=-\infty}^{\infty} \sum_{k_2=-\infty}^{\infty} h(k_1,k_2)x(n_1-k_1,n_2-k_2)</math>
Line 195:
==Overlap and Add==
Another method to perform multidimensional convolution is the '''overlap and add''' approach. This method helps reduce the computational complexity often associated with multidimensional convolutions due to the vast amounts of data inherent in modern-day digital systems.<ref>{{cite
Consider a two-dimensional convolution using a direct computation:
| |||