Create the page "Convolution" on this wiki! See also the search results found.
Page title matches
-
290 B (30 words) - 11:56, 21 November 2008
- [[Category: Convolution]] ...Invariant (LTI) systems have properties that arise from the properties of convolution.1 KB (178 words) - 11:50, 8 December 2008
- [[Category: Convolution]] <b> Convolution of Unit Step Function: </b>1,016 B (163 words) - 11:54, 8 December 2008
- [[Category: Convolution]] =Example of CT convolution=3 KB (549 words) - 10:37, 30 January 2011
-
58 B (11 words) - 12:49, 14 October 2008
-
46 B (12 words) - 17:56, 14 October 2008
- =Convolution and Change of Variables in Discrete-time=1 KB (229 words) - 10:41, 30 January 2011
- === Formula for Aperiodic Convolution ===198 B (32 words) - 10:51, 7 March 2008
- === Formula for Periodic Convolution ===504 B (76 words) - 10:51, 7 March 2008
- ...Invariant (LTI) systems have properties that arise from the properties of convolution. <font size="3"><b>Property 1: Convolution is Commutative</b></font>1 KB (190 words) - 21:15, 16 March 2008
- ==Convolution of Unit Step Function:== To take a convolution, first determine whether the system is CT or DT and use the correct formula815 B (144 words) - 21:19, 16 March 2008
-
82 B (13 words) - 23:22, 17 June 2008
-
0 B (0 words) - 11:13, 1 July 2008
-
138 B (19 words) - 17:55, 16 July 2008
-
113 B (15 words) - 18:30, 22 July 2009
-
145 B (23 words) - 19:36, 22 July 2009
- [[DT Convolution - Mark Scherschel II (mschersc)]] [[CT Convolution - Nick Gentry (nkgentry)]]95 B (13 words) - 18:10, 22 July 2009
- =Definition of DT convolution=106 B (22 words) - 10:51, 30 January 2011
- =Definition of CT convolution=152 B (28 words) - 11:01, 30 January 2011
- ...em_solving|Practice Question]] on Computing the Output of an LTI system by Convolution = Use convolution to compute the system's response to the input2 KB (380 words) - 10:20, 11 November 2011
Page text matches
- ...TI systems: The convolution sum_(ECE301Summer2008asan)|DR LTI systems: The convolution sum]] ...stems: The convolution integral_(ECE301Summer2008asan)|CT LTI systems: The convolution integral]]7 KB (921 words) - 06:08, 21 October 2011
- ...utput y(t). Since the input and impulse response are given, we simply use convolution on x(t) and h(t) to find the system's output.1 KB (227 words) - 10:55, 30 January 2011
- ...utput y(t). Since the input and impulse response are given, we simply use convolution on x(t) and h(t) to find the system's output.1 KB (222 words) - 10:57, 30 January 2011
- #<math>y(t)=x(t)*h(t)=h(t)*x(t)</math> commutative property of convolution for continuous time ...h>x(t)*(h_1(t)*h_2(t))=x(t)*(h_2(t)*h_1(t))</math> commutative property of convolution for continuous time1 KB (249 words) - 10:45, 21 November 2008
- ...Fall 2007 mboutin Properties of Convolution and LTI Systems|Properties of Convolution and LTI Systems]]== {{:ECE 301 Fall 2007 mboutin Properties of Convolution and LTI Systems}}824 B (87 words) - 11:46, 8 December 2008
- [[Category: Convolution]] ...Invariant (LTI) systems have properties that arise from the properties of convolution.1 KB (178 words) - 11:50, 8 December 2008
- [[Category: Convolution]] <b> Convolution of Unit Step Function: </b>1,016 B (163 words) - 11:54, 8 December 2008
- [[Category: Convolution]] =Framework for computing the CT Convolution of two unit step exponentials=2 KB (470 words) - 11:04, 30 January 2011
- [[Category: Convolution]] =Example of CT convolution=3 KB (549 words) - 10:37, 30 January 2011
- ...o ask it. One of its uses is in helping develop and understand the idea of convolution.2 KB (322 words) - 17:27, 23 April 2013
- ==[[ECE 301 Fall 2007 mboutin Convolution|Convolution Example]]== {{:ECE 301 Fall 2007 mboutin Convolution}}850 B (90 words) - 12:27, 12 December 2008
- =Interesting Site to learn about convolution= ...The part that has been most helpful to me is under the first link 'Joy of Convolution.' I haven't even had time to get around the whole site, but there seem to b652 B (110 words) - 11:30, 30 January 2011
- | align="right" style="padding-right: 1em;" | Friday || 02/27/09 || Circular convolution, one random variable || 1.6.5., 3.1.16 KB (689 words) - 07:59, 2 August 2010
- <br>- In Q3, convolution must be separated into various cases. The analytical expression will vary797 B (145 words) - 08:36, 10 February 2009
- - Zero-order hold (also known as zeroth-order interpolation) involves convolution with a causal rect in time. In frequency, this is multiplication of the sp ...etrical about t=0) triangle. The key is to realize that a triangle is the convolution of two rect's - producing a <math>sinc^2</math> in frequency. This can als906 B (143 words) - 12:40, 4 March 2009
- <math>*</math> means convolution.608 B (114 words) - 11:25, 23 April 2009
- ...ncorporate sampling. I'd imagine all of that, plus DFT, FFT, and circular convolution could be covered by the first exam. Next maybe a short review of 302 mater4 KB (709 words) - 13:42, 3 May 2009
- ...rdue.edu/~bouman/ece438/lecture/module_1/1.2_systems/1.2.2_convolution.pdf Convolution, pp. 87-92, 97-110] ...bouman/ece438/lecture/module_1/1.6_dft/1.6.5_periodic_convol.pdf Circular Convolution]8 KB (1,226 words) - 11:40, 1 May 2009
- ...dependent x,y there had seemed to be some confusion when we were doing the convolution steps. some people had trouble seeing why the boundaries for 0,z and then z ...y always solve this (or know what shape to expect at least) with graphical convolution: http://www.jhu.edu/signals/convolve/930 B (156 words) - 13:27, 22 November 2011
- The PDF of the sum of two independent random variables is the convolution of the two PDFs. The lecture notes from 10/10 are helpful.133 B (23 words) - 19:13, 19 October 2008