• == Computing the Fourier series coefficients for a Discrete Time signal x[n] ==
    900 B (178 words) - 12:47, 25 September 2008
  • The response to the input signal <math>z^n</math> is <math>H(z)z^n</math>, giving
    680 B (127 words) - 03:59, 15 October 2008
  • In our textbook(Signal and System,second edition,oppenheim), If we look up p328 and p329, they ha
    2 KB (345 words) - 10:01, 23 October 2008
  • ...e signal to discrete-time signal, process the discrete-time signal using a discrete-time system and convert it back to continuous time. ...and X(j<math>\omega\,</math>) be the continuous Fourier transform of that signal. Then,
    1 KB (214 words) - 08:00, 10 November 2008
  • ...the uniformly spaced discrete samples are a complete representation of the signal if this bandwidth is less than half the sampling rate. ...signal and <math>X(W)\,</math> be the continuous Fourier transform of that signal
    2 KB (303 words) - 10:24, 10 November 2008
  • Let <math>x(t)</math> be a signal with <math>X(\omega) = 0</math> when <math>|\omega| > \omega_m</math>. <math>\omega_m</math> Maximum frequencye for a band limited signal
    2 KB (349 words) - 12:09, 10 November 2008
  • ...the uniformly spaced discrete samples are a complete representation of the signal if this bandwidth is less than half the sampling rate. ...signal and <math>X(w)\,</math> be the continuous Fourier transform of that signal (which exists if <math>x(t)\,</math> is square-integrable)
    2 KB (303 words) - 12:15, 10 November 2008
  • ...AB. By use of sampling a continuous signal can be converted to a discrete signal, manipulated via a computer program and then converted back into a continuo
    1 KB (274 words) - 06:49, 16 September 2013
  • ...u have used a good sampling rate, you should be able to reconstruct the CT signal without much fuss.
    829 B (155 words) - 16:53, 10 November 2008
  • ...rm is used on continuous signal while z transform is used for the discrete signal. The z- transform of a general discrete signal x[n] is defined as
    2 KB (316 words) - 15:23, 3 December 2008
  • For a D.T. signal <math>x[n]\,</math>, the z-Transform is defined as Any z-Transform will have a realm of convergence. For example, if your signal is:
    519 B (87 words) - 19:58, 3 December 2008
  • #'''Signal Reconstruction Using Interpolation:''' the fitting of a continuous signal to a set of sample values ##Analog vs. Digital: The Show-down (A to D conversion -> Discrete-Time Processing System -> D to A conversion
    21 KB (3,312 words) - 11:58, 5 December 2008
  • The z-Transform is the more general case of the discrete-time Fourier transform. For the DT Fourier transform <math>z = e^{j\omega }</mat ! Property !! Signal
    6 KB (938 words) - 06:59, 8 December 2008
  • :(c) an ability to determine the response of linear systems to any input signal convolution in the time domain. [1,2,4;a,e,k] :(e) an ability to determine the response of linear systems to any input signal by transformation to the frequency domain, multiplication, and inverse tran
    7 KB (1,017 words) - 10:05, 11 December 2008
  • #'''Signal Reconstruction Using Interpolation:''' the fitting of a continuous signal to a set of sample values ##Analog vs. Digital: The Show-down (A to D conversion -> Discrete-Time Processing System -> D to A conversion
    2 KB (254 words) - 07:05, 8 December 2008
  • ##[[Signal Energy and Power_Old Kiwi]] ##[[ Discrete-time Fourir Transform_Old Kiwi]]
    4 KB (531 words) - 11:32, 25 July 2008
  • (a) Derive the condition for which the discrete time complex exponetial signal x[n] is periodic.
    2 KB (259 words) - 17:17, 30 June 2008
  • (a) The FT of <math>X(j\omega)</math> of a continuous-time signal x(t) is periodic (b) The FT of <math>X(e^{j\omega})</math> of a continuous-time signal x[n] is periodic
    4 KB (739 words) - 20:48, 30 July 2008
  • .../math> of the signal x[n] is also periodic with period N. For the periodic signal x[n], find the values of <math>a_0,a_1,...,a_{N-1}.</math> Express your an 1)b)Evaluate the value of <math>(1/N)*\sum_{n=<N>}|x[n]|^2</math> for the signal x[n] given in part (a).
    4 KB (803 words) - 11:10, 22 July 2008
  • Note: PM refers to the official course book, Digital Signal Processing, 3rd edition, J.G. Proakis and D.G. Manolakis. * Basic Signals and Signal Properties
    9 KB (1,237 words) - 09:29, 5 October 2009
  • [[GPS Signal Processing]] --[[User:Kheldman|Kheldman]] [[HW3_Signal_Reconstruction_Interpolation|Signal Reconstruction for band-limited functions]] -- [[User:pclay|pclay]]
    4 KB (543 words) - 07:02, 25 August 2010
  • ...can be used when only one period of the signal is analyzed. The DFT of a signal will be discrete and have a finite duration. <math>X[k] = Y(k \frac{ 2 \pi}{N})</math> where Y(w) is the DTFT of signal
    4 KB (695 words) - 06:46, 23 September 2011
  • System 1: A discrete signal for the amount of toilet paper and how much is used in a period of time(one What is the signal and the system? : The signal would be a weight sensor on the toilet paper measuring how much is taken aw
    993 B (192 words) - 11:01, 23 June 2009
  • [[Image:Discrete-Time Signal Processing - 2ed - Oppenheim.pdf]]
    63 B (9 words) - 11:55, 18 June 2009
  • forms convolution of two discrete-time input signals. Note that the assume that a finite-length input signal is such that it is zero outside of
    3 KB (451 words) - 00:38, 2 July 2009
  • ...ath>p(t) = \sum_{n=-\infty}^\infty \delta(t-nT)</math>. This creates a new signal, <math>x_p(t)</math>, which consists of a series of equally spaced impulses ...al. The reason it is not, however, is because the index of a discrete time signal needs to be an integer. To changes this, all that needs to be done is a tra
    851 B (157 words) - 17:37, 4 August 2009
  • n = Lx + Lh -1; % Length of the output signal stem(y) % make it like a discrete signal
    287 B (57 words) - 11:03, 1 July 2009
  • [[Category:discrete-time Fourier transform]] *The Discrete-time Fourier transform (DTFT) is <math>{\mathcal X}(\omega) = {\mathcal F} \left
    1 KB (216 words) - 14:49, 1 May 2015
  • ...the DT Fourier transform look like if the discretization represents the CT signal well?". Should we organize another recitation on that topic?--[[User:Mbou
    2 KB (375 words) - 04:11, 3 September 2009
  • [[Category:signal processing]] The z-transform converts a discrete-time signal into a complex frequency domain representation.
    2 KB (252 words) - 06:55, 16 September 2013
  • [[Category:signal processing]] ...frequency spectrum of a signal the faster we sample it. Naturally, if the signal changes much faster than the sampling rate, these changes will not be captu
    8 KB (1,452 words) - 06:49, 16 September 2013
  • '''Q:''' What is a digital signal? '''A:''' A signal that can be represented by a sequence of 0's and 1's.
    1 KB (170 words) - 10:07, 23 September 2009
  • ...tions caused by analog circuitry. One area that this can be applied is in signal reconstruction, where a low pass analog filter is used on the output of a d ...ed to relax requirements on analog low pass filter design while decreasing signal distortion.
    5 KB (840 words) - 19:08, 22 September 2009
  • ...s time signal (consisting of infinite number of points) to a discrete time signal (finite points). This process enables the conversion of analog signals to ...period T). This can be achieved by multiplying the given continuous time signal by a train of dirac delta functions separated by the time period T. This c
    3 KB (527 words) - 11:50, 22 September 2009
  • xc(t)=continuous time signal x[n]=discrete time signal
    1 KB (219 words) - 11:36, 23 September 2009
  • ...culated to express these coefficients as a function of frequency. For the discrete-time case, the analysis equation is expressed as follows: ...signal, x[n]. To demonstrate why this is the case, consider the following discrete-time function:
    8 KB (1,268 words) - 07:16, 23 September 2009
  • [[Category:digital signal processing]] Definition: let x[n] be a DT signal with Period N.
    3 KB (640 words) - 13:17, 2 December 2011
  • ...s attenuating high frequency portions of the image unless they have a high signal energy (aka, they're significant in the reconstruction and representation o
    5 KB (850 words) - 09:00, 23 September 2009
  • Let X[n] be a DT signal with period N
    2 KB (491 words) - 23:03, 22 September 2009
  • ** Application to Actual 1-D signal ...tween samples and the Low Pass Filter removes the extraneous copies of the signal beyond W/D shown in the output below.
    5 KB (847 words) - 11:54, 21 September 2012
  • xc(t)=continuous time signal x[n]=discrete time signal
    1 KB (215 words) - 11:28, 23 September 2009
  • *[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]] (used in [[ECE301]], [[ECE438]]) **[[Table DT Fourier Transforms|Discrete-time Fourier Transform Pairs and Properties]] (used in [[ECE301]], [[ECE438]])
    3 KB (294 words) - 15:44, 12 March 2015
  • keywords: energy, power, signal '''Signal Metrics Definitions and Formulas'''
    2 KB (307 words) - 14:54, 25 February 2015
  • ...ignals_ECE301S11|Compute the norm of a continuous-time complex exponential signal (practice problem)]] from [[ECE301]] ..._signals_ECE301S11|Compute the norm of a discrete-time complex exponential signal (practice problem)]] from [[ECE301]]
    2 KB (293 words) - 05:21, 3 November 2011
  • ...ler's formula to compute the norm of a continuous-time complex exponential signal (practice problem)]] from [[ECE301]] ...Euler's formula to compute the norm of a discrete-time complex exponential signal (practice problem)]] from [[ECE301]]
    2 KB (249 words) - 18:27, 23 February 2015
  • ...ectrical Engineers, the first person that comes to mind when someone says "SIGNAL PROCESSING" is Fourier. *Jean Baptiste Joseph Fourier (1768 - 1830) laid a rock-solid foundation for signal analysis, when he claimed that all (continuously differentiable) signals ca
    10 KB (1,646 words) - 11:26, 18 March 2013
  • ...your concepts of Fourier and Z transforms should be absolutely clear for signal processing (DSP ECE 438).--[[User:Hlalwani|Hersh Lalwani]] 14:55, 11 Decemb ...ce, furiere and z-transform and signals and systems of continuous-time and discrete-time. However, it contains a lot of mathematics skill and some tricky part mathe
    14 KB (2,366 words) - 17:32, 21 April 2013
  • ...you understand the lecture's material. The textbook for ECE 438 - "Digital Signal Processing" by Proakis - is very mediocre but has some examples. It wasn't *Labs are awesome as you get to deal with practical aspect of signal and image processing.You will learn all sort of things to create a digital
    17 KB (3,004 words) - 08:11, 15 December 2011
  • | Let x[n] be a periodic DT signal, with period N.
    4 KB (633 words) - 15:28, 23 April 2013
  • As everybody in the class seems to know quite well, the continuous-time signal <math> x(t) = cos(t) </math> is a periodic function with period <math> 2\pi ...pling <math> x(t) </math> every <math>T</math>, we obtain a discrete-time signal <math>f[n]</math>. However, <math>f[n]</math> is not necessarily periodic:
    4 KB (736 words) - 17:25, 23 April 2013

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

Alumni Liaison

has a message for current ECE438 students.

Sean Hu, ECE PhD 2009