Page title matches

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 time
    1 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 b
    652 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.1
    6 KB (689 words) - 07:59, 2 August 2010
  • <br>- In Q3, convolution must be separated into various cases. The analytical expression will vary
    797 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 als
    906 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 mater
    4 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
  • *Then compute the convolution through the equation: <math> f_z(z)= \int \limits_{-\infty}^{\infty} f_B(\t
    2 KB (344 words) - 17:00, 21 October 2008
  • ...plication in this context. The start symbol is typically used for denoting convolution in electrical engineering. </span>
    4 KB (734 words) - 15:54, 25 February 2015
  • ...this symbol <math>*</math> for multiplication, it can be misunderstood for convolution.
    906 B (161 words) - 16:07, 19 September 2008
  • (Note: The star in this case is the multiplication operator, not the convolution operator)
    601 B (103 words) - 18:18, 18 September 2008
  • we can determine the output using convolution integral
    1 KB (215 words) - 14:56, 26 September 2008
  • The response is equal to the convolution of the input signal and the system.
    550 B (110 words) - 17:36, 26 September 2008
  • ...ms that involve sums and changing their bounds. Also, I am not great with convolution on a more complex level.
    314 B (57 words) - 14:14, 7 October 2008
  • ...a hard time grasping it since we never really went over how it affects the convolution and such.
    299 B (53 words) - 10:11, 8 October 2008
  • <math> y[n] = x[n] * h[n] , where * is convolution/,</math>
    725 B (114 words) - 14:31, 10 October 2008
  • * [[Eric Zarowny - Convolution and Change of Variables in Discrete Time_ECE301Fall2008mboutin]]
    3 KB (406 words) - 11:28, 16 September 2013
  • =Convolution and Change of Variables in Discrete-time=
    1 KB (229 words) - 10:41, 30 January 2011
  • A multiplication in the time domain becomes a convolution in the frequency domain This isolates the range, and if the convolution was ideal, this function should only have a value when k=0, which would yie
    3 KB (543 words) - 17:23, 10 November 2008
  • ...\frac{1}{2\pi}2\pi\delta(w-w_{c}) * X(w) = X(w-w_{c})</math> , where * is convolution
    1 KB (270 words) - 12:35, 16 November 2008
  • ...l <math>x(t)</math>, we must find a signal <math>h_2(t)</math> so that the convolution of <math>h_1(t)</math> and <math>h_2(t)</math> represent a low pass filter
    2 KB (411 words) - 17:16, 17 November 2008
  • ==Convolution==
    392 B (70 words) - 13:48, 23 November 2008
  • ==Convolution==
    693 B (127 words) - 06:51, 1 December 2008
  • Convolution
    1 KB (207 words) - 11:42, 3 December 2008
  • | align="right" style="padding-right: 1em;"|Convolution || <math>\,\! x_1(t)*x_2(t)</math> || <math>\,\! X_1(s)X_2(s)</math> || At | align="right" style="padding-right: 1em;"|Convolution || <math>\,\! x_1[n] * x_2[n]</math> || <math>\,\! X_1(z)X_2(z)</math> ||
    21 KB (3,312 words) - 11:58, 5 December 2008
  • | align="right" style="padding-right: 1em;"|Convolution || <math>\,\! x_1[n] * x_2[n]</math> || <math>\,\! X_1(z)X_2(z)</math> ||
    6 KB (938 words) - 06:59, 8 December 2008
  • ...an ability to determine the response of linear systems to any input signal convolution in the time domain. [1,2,4;a,e,k] #Convolution in DT
    7 KB (1,017 words) - 10:05, 11 December 2008
  • | align="right" style="padding-right: 1em;"|Convolution || <math>\,\! x_1[n] * x_2[n]</math> || <math>\,\! X_1(z)X_2(z)</math> ||
    3 KB (421 words) - 06:52, 8 December 2008
  • | align="right" style="padding-right: 1em;"|Convolution || <math>\,\! x_1(t)*x_2(t)</math> || <math>\,\! X_1(s)X_2(s)</math> || At
    2 KB (358 words) - 06:53, 8 December 2008
  • === Convolution ===
    744 B (106 words) - 11:02, 27 March 2008
  • === Formula for Aperiodic Convolution ===
    198 B (32 words) - 10:51, 7 March 2008
  • Signals can be smoothed by applying a Gaussian filter, which is just the convolution of a signal with an appropriately scaled Gaussian function. Due to the cent
    10 KB (1,594 words) - 11:41, 24 March 2008
  • === Formula for Periodic Convolution ===
    504 B (76 words) - 10:51, 7 March 2008
  • [[Properties of Convolution and LTI systems_Old Kiwi]] [[Convolution Simplification_Old Kiwi]]
    2 KB (363 words) - 21:12, 16 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 formula
    815 B (144 words) - 21:19, 16 March 2008
  • Let's take the convolution of the two most general unit-step exponentials in CT.
    3 KB (515 words) - 21:33, 16 March 2008
  • convolution is a mathematical operator which takes two functions f and g and produces a ...can be used to find the output of an LTI system. The output is simply the convolution of the input and the system's impulse response.
    821 B (137 words) - 16:22, 20 March 2008
  • 2D Convolution Algorithm --peter.s.mc.kinnis.1, Tue, 22 Jan 2008 16:44:33 -0500 reply ...ng if this is how we are suposed to impliment, or if I should just write a convolution in the space domain?
    10 KB (1,738 words) - 22:44, 7 April 2008
  • ...ask it. One of its uses is in helping develop and understand the idea of convolution.
    2 KB (305 words) - 11:17, 24 March 2008
  • This is the same as convolution: At each successive time step, the convolution iterates on the results
    10 KB (1,728 words) - 08:55, 17 January 2013
  • ##[[DT LTI systems: The convolution sum_Old Kiwi]] ##[[CT LTI systems: The convolution integral_Old Kiwi]]
    4 KB (531 words) - 11:32, 25 July 2008
  • #<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 time
    1 KB (238 words) - 16:53, 25 June 2008
  • ...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.
    956 B (170 words) - 16:23, 3 July 2008
  • ...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.
    954 B (175 words) - 16:56, 30 June 2008
  • ...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]
    9 KB (1,237 words) - 09:29, 5 October 2009
  • Leakage is caused by the convolution by the DTFT of a window function, which is a sinc. This causes copies of t
    4 KB (695 words) - 06:46, 23 September 2011
  • ...his context. The star symbol in electrical engineering is usually denoting convolution. </span>
    2 KB (408 words) - 17:20, 25 February 2015
  • ...the star symbol to denote multiplication here. It is usually reserved for convolution in electrical engineering.</span>
    3 KB (432 words) - 17:55, 25 February 2015
  • * DT and CT LTI system input/output relationship by convolution
    5 KB (643 words) - 11:55, 6 August 2009
  • 7. Convolution implementation Write a Matlab function that per- forms convolution of two discrete-time input signals. Note that the
    3 KB (451 words) - 00:38, 2 July 2009
  • Matlab Examples - Review of Discrete Convolution using Matlab == http://www.youtube.com/watch?v=bPAKMS6_FWg&eurl=http://fre
    420 B (68 words) - 11:20, 29 June 2009
  • %% Performs convolution on inputted vectors x & y. Then displays the
    752 B (131 words) - 08:56, 1 July 2009
  • ...do not take into account the variations in starting time of the resulting convolution.
    258 B (39 words) - 13:07, 1 July 2009
  • X=[x,zeros(1,n)]; %padding with zeros will allow for convolution to be
    673 B (123 words) - 11:18, 1 July 2009
  • function [ y ] = convolution( h, x ) %CONVOLUTION computes the convolution for two DT LTI signals;
    717 B (116 words) - 11:25, 1 July 2009
  • %CONVOLUTION computes the convolution for two DT LTI signals % Algebraically, convolution is the same operation as multiplying the
    1 KB (166 words) - 11:30, 1 July 2009
  • %This Program computes the convolution of two inputs x(t) and h(t)with the %The program below will compute the convolution, y(t), based on the users
    1 KB (205 words) - 14:56, 1 July 2009
  • %Convolution problem HW 3.7 CONV Convolution and polynomial multiplication.
    1 KB (204 words) - 22:28, 1 July 2009
  • function y=convolution(x,h);
    275 B (59 words) - 22:35, 1 July 2009
  • % Convolution Program <br>
    568 B (114 words) - 00:51, 2 July 2009
  • * [[Convolution and LTI systems]] == Convolution ==
    1 KB (152 words) - 04:06, 23 July 2009
  • == CT Convolution: Definition ==
    184 B (38 words) - 10:44, 30 January 2011
  • == DT Convolution: Definition==
    165 B (34 words) - 10:48, 30 January 2011
  • [[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
  • =Convolution of a rectangular impulse train with itself (continuous-time)=
    971 B (55 words) - 10:46, 30 January 2011
  • =Example of DT convolution=
    732 B (136 words) - 10:49, 30 January 2011
  • * CT Convolution: F(x_1(t)*x_2(t)) = X_1(\omega)X_2(\omega) \!
    1 KB (178 words) - 04:40, 23 July 2009
  • DT Fourier Transform Convolution <math> x[n]*y[n] = X(e^{jw})Y(e^{jw}) \! </math>
    537 B (85 words) - 07:16, 14 November 2011
  • *[http://www.jhu.edu/signals/convolve/index.html The Joy of Convolution!]
    6 KB (785 words) - 06:02, 1 March 2010
  • ...or the rest of your college career and even into the workforce. Understand convolution (applies to ECE301, ECE438, ECE440), bode plots (ECE382), and Laplace trans *Be sure to get the full story on the dirac function, convolution, bode plot approximations, and linearity. Don't rely on memorization. -Mike
    7 KB (1,297 words) - 11:41, 10 December 2011
  • Definition of Convolution:
    1 KB (264 words) - 05:57, 11 June 2013
  • ...= \|K\|_1\|f\|_p = \|f\|_p</math> where the inequality is a result of the convolution theorem. Proof. Using Young's Convolution Theorem with <math>r = \infty</math> we find:
    4 KB (657 words) - 05:53, 11 June 2013
  • Applying the definitions of Fourier transform and convolution, followed by Fubini (since <math>f, g \in L(\mathbb{R})</math>) we have:
    1 KB (206 words) - 05:52, 11 June 2013
  • but since the convolution is define everywhere and <math>f\ast f = 0\Rightarrow f = 0</math> everywhe
    994 B (157 words) - 05:56, 11 June 2013
  • * A knowledge of impulse response functions and convolution for linear systems.
    7 KB (1,153 words) - 14:06, 24 August 2009
  • ** <span style="color:green">Careful here: the symbol <math>~_*</math> is for convolution, not multiplication.</span>--[[User:Mboutin|Mboutin]] 20:18, 1 September 20
    2 KB (375 words) - 04:11, 3 September 2009
  • * The results of the frequency domain multiplication with the filter (CONVOLUTION IN THE TIME DOMAIN) gives us the desired signal without noise.
    7 KB (1,251 words) - 11:54, 21 September 2012
  • Convolution:
    2 KB (252 words) - 06:55, 16 September 2013
  • ...ransform of the comb is also an impulse train in the frequency domain, the convolution of X(f) with P(f) simply makes copies of X(f) at each impulse with the magn
    8 KB (1,452 words) - 06:49, 16 September 2013
  • Properties of convolution allow
    2 KB (436 words) - 19:51, 22 September 2009
  • Convolution: Convolution in Time domain corresponds to multiplication in Frequency domain.
    1 KB (218 words) - 07:34, 25 August 2010
  • | align="right" style="padding-right: 1em;" | convolution property || <math>x[n]*y[n] \!</math> || ||<math> X(\omega)Y(\omega) \!</ma
    2 KB (351 words) - 12:52, 22 October 2010
  • | align="right" style="padding-right: 1em;" | convolution property
    8 KB (1,130 words) - 11:45, 24 August 2016
  • *Also, a close look at the above integral, shows that it is simply a convolution of the mother wavelet and the signal.
    10 KB (1,646 words) - 11:26, 18 March 2013

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)

Alumni Liaison

Followed her dream after having raised her family.

Ruth Enoch, PhD Mathematics