• :[[ECE438|ECE438: "Digital Signal Processing with Applications"]] *[[Discrete-time_Fourier_transform_info|Discrete-time Fourier transform (DTFT)]]
    2 KB (209 words) - 13:07, 9 September 2022
  • *[[ECE438|ECE438: "Digital Signal Processing with Applications]], the main page for this popular senior level ...tal_signal_processing_practice_problems_list|Practice problems on "Digital Signal Processing"]]
    6 KB (877 words) - 07:22, 21 March 2013
  • ##[[Signal Energy and Power_(ECE301Summer2008asan)|Signal Energy and Power]] ...ntinuous-Time and Discrete-Time_(ECE301Summer2008asan)|Continuous-Time and Discrete-Time]]
    7 KB (921 words) - 06:08, 21 October 2011
  • (a) Derive the condition for which the discrete time complex exponetial signal x[n] is periodic.
    2 KB (270 words) - 10:59, 21 November 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 (777 words) - 11:49, 21 November 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 (815 words) - 10:57, 21 November 2008
  • The command is ifft. It takes in a vector representing your signal and produces a vector of the fourier series coefficients. Two examples are The signal is represented by the graph below and is periodic for all time:
    5 KB (834 words) - 17:26, 23 April 2013
  • :[[2015_Spring_ECE_438_Ersoy|ECE438: "Digital SIgnal Processing", Prof. Ersoy]] :[[2014_Fall_ECE_438_Boutin|ECE438: "Digital SIgnal Processing"]]
    13 KB (1,570 words) - 13:53, 7 August 2018
  • [[Category:signal processing]] 2) Digital Signal = a signal that can be represented by a sequence of 0's and 1's.
    3 KB (532 words) - 06:43, 16 September 2013
  • *<math>\omega_m</math>: Maximum frequency in a band-limited signal (<math> = max(\{|w|\ :\ w \neq 0\})</math> ...hen the band-limited signal can be uniquely reconstructed from the sampled signal.
    2 KB (406 words) - 11:08, 12 November 2010
  • [[Category:signal processing]] <li>Signal Characteristics</li>
    3 KB (508 words) - 06:43, 16 September 2013
  • [[Category:signal processing]] <p><strong>Discrete-time:</strong> (a.k.a. Kronecher delta fn.)<br/>
    2 KB (408 words) - 06:43, 16 September 2013
  • ! colspan="2" style="background: #bbb; font-size: 110%;" | Discrete-Time Domain *[[CT Time-averaged Power of a Signal over an infinite interval_ECE301Fall2008mboutin]] {{:CT Power of a Signal_
    8 KB (989 words) - 07:20, 5 February 2009
  • ...Fourier transform of x[n], which is the sampled signal of continuous time signal x(t) <br>
    546 B (93 words) - 20:27, 18 February 2009
  • ...at starts at -1e-4 and goes to 1e-4. The ideal sampler creates a discrete signal with 5 points each 5e-5 apart.
    844 B (152 words) - 18:26, 11 February 2009
  • Note: PM refers to the official course book, Digital Signal Processing, 3rd edition, J.G. Proakis and D.G. Manolakis. ...due.edu/~bouman/ece438/lecture/module_1/1.1_signals/1.1.1_signal_types.pdf Signal Types]
    8 KB (1,226 words) - 11:40, 1 May 2009
  • =Rhea Section for [[ECE438|ECE 438: Digital Signal Processing with Applications]] Professor [[User:mboutin|Boutin]], Fall 2009
    7 KB (1,067 words) - 12:05, 25 June 2010
  • * [[HW1.5 Nicholas Browdues - Signal Power and Energy_ECE301Fall2008mboutin]] * [[HW1.5 Ben Laskowski - Signal Power and Energy_ECE301Fall2008mboutin]]
    24 KB (3,272 words) - 06:58, 1 September 2010
  • A discrete time signal is periodic if there exists T > 0 such that x(t + T) = x(t) A continuous time signal is periodic if there exists some integer N > 0 such that x[n + N] = x[n]
    1 KB (205 words) - 07:20, 14 April 2010
  • A continuous time signal is periodic if there exists a value <math> T </math> such that <math> x(t + A discrete time signal is periodic if there exists a value <math> N </math> such that <math> X[n +
    1 KB (169 words) - 07:22, 14 April 2010

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

Alumni Liaison

Meet a recent graduate heading to Sweden for a Postdoctorate.

Christine Berkesch