5.1 The Discrete Time Fourier Transform

Size: px
Start display at page:

Download "5.1 The Discrete Time Fourier Transform"

Transcription

1 The Discrete Time ourier Transform ourier (or frequency domain) analysis the last Complete the introduction and the development of the methods of ourier analysis Learn frequency-domain methods for discrete-time signals and systems Outline 5. The Discrete Time ourier Transform 5.2 The ourier Transform for Periodic Signals 5. The Discrete Time ourier Transform Development of the ourier Transform Representation Analogous to continuous time case Aperiodic signal Construct periodic signal with over one period Period over any finite time interval ourier series representation of converges to ourier transform representation of General sequence with outside n Properties of the Discrete Time ourier Transform 5.4 The Convolution Property 5.5 The Multiplication Property 5.6 Duality 5.7 requency Response and Linear Constant Coefficient Difference Equations 2 Corresponding periodic signal n 2 n Obviously: for

2 34 35 requency domain: a k e jk(/)n S a k or k<> a k n<> 2 e jk(/)n n e jn k X(e j ) Sample spacing: / Therefore k<> ow: ( ) X(ejk )e jk(/)n e jk(/)n e jk(/)n k<> k Summation integration k, d Summation over intervals of width / integration interval X(e j )e jn periodic with period any interval of length X(e jk )e jk n Discrete-time ourier transform X(e j ) e jn and inverse discrete-time ourier transform X(e j )e jn d X(e j ): referred to as the ourier transform or the spectrum of Short-hand notation X(e j ) X(e j ) {} {X(e j )} ote: ourier series coefficients a k of periodic signal are equally spaced samples of ourier transform X(e j ) of aperiodic signal, where over one period and zero otherwise. Differences to continuous time ourier transform Periodicity of discrete time ourier transform X(e j ) inite interval of integration in inverse ourier transform Slowly varying signals: nonzero spectrum around k, k Z ast varying signals: nonzero spectrum around + k, Z

3 Signal a n u[n], a < ourier transform X(e j ) e jn ae j Discrete-time ourier transform pair a n u[n] a n u[n]e jn ae j Magnitude of spectrum X(e j ) ae j + a2 2acos a : u[n] very slowly varying spectrum concentrated around k, k Z X(e j ) /( a) (ae j ) n n a : ( ) n u[n] very fast varying spectrum concentrated around + k, k Z 2. Unit impulse ourier transform X(e j ) δ[n] /( + a) δ[n] δ[n] X(e j ) /( a) δ[n]e jn {δ[n]} /( + a) n

4 Shifted unit impulse 4. Rectangular pulse δ[n n ] ourier transform X(e j ) δ[n n ]e jn e jn {, n, n > δ[n n ] δ[n n ] e jn X(e j ) n ourier transform 2 X(e j ) e jn e j n n e jn e j e j(2 +) e j ej e j( +) e j/2 (e j/2 e j/2 ) sin( + /2) sin(/2) X(e j ) {, n, n > sin(( + /2)) sin(/2) n n n n X(e j )

5 4 4 Convergence of discrete time ourier transform ourier transform also valid for signals with infinite duration if the associated infinite sum converges. Sufficient conditions for convergence is absolutely summable < or has finite energy 2 < o convergence issues associated with inverse discrete-time ourier transform o Gibbs phenomenon 5.2 The ourier Transform for Periodic Signals Periodic discrete-time signals do not meet the Convergence Conditions of Section 5., but also have discrete-time ourier transforms, which can directly be constructed from their ourier series. Consider with ourier transform X(e j ) δ( l) X(e j ): Impulse train l X(e j ) Inverse ourier transform l e j n δ( l)e jn d e j n l δ( l)

6 42 43 Accordingly: periodic signal with period a k e jk(/)n S a k k<> X(e j ) X(e j ) k<> k a k l δ( k/ l) a k δ( k/) ourier transform of a periodic signal train of impulses occurring at multiples of the fundamental frequency / area of impulse at k/ is times the kth ourier series coefficient k : a a a a a. Sine function sin( n) ( e j n e ) j n 2j k : k : ( + ) ( ) a a + a ( + ) ( ) a a + Periodic if m/ ourier transform X(e j ) j δ( l) + j δ( + l) l l X(e j ) j : a a a a a a a + j a

7 Cosine function cos n 2 ej n + 2 e j n Periodic if m/ ourier transform X(e j ) δ( l) + δ( + l) l l X(e j ) 2 X(e j ) 2 n Impulse train sequence δ[n k] ourier series coefficients a k n<> n<> l k e jk(/)n δ[n l]e jk(/)n ourier transform X(e j ) k δ( k/)

8 Properties of the Discrete Time ourier Transform Periodicity Discrete time ourier transform is always periodic in with period X(e j(+) ) X(e j ) Different from continuous time ourier transform! Linearity ourier transform {a + by[n]} a{} + b{y[n]} inverse ourier transform {cx(e j ) + dy (e j )} c {X(e j )} + d {Y (e j )} Time Shifting If then Proof: {x[n n ]} x[n n ] e jn X(e j ) e jn X(e j ) x[n n ]e jn n n x[n ]e j(n +n ) x[n ]e jn e jn X(e j ) requency Shifting If then e j n X(e j ) X(e j( ) ) Proof: {X(e j( ) )} X(e j( ) )e jn d X(e j )e j( + )n d e j n X(e j )e j n d e j n Periodicity property + frequency shifting property special relationship between ideal lowpass and ideal highpass discrete time filters

9 48 49 Time Reversal Lowpass filter with cutoff frequency c requency response H lp (e j ) c H lp (e j ) Highpass filter with cutoff frequency c requency response H hp (e j ) c H lp (e j ) If then Proof: Y (e j ) m n x[ n] m X(e j ) X(e j ) X(e j ) y[n]e jn x[m]e jm m x[ n]e jn x[m]e j( )m + c c requency domain relation H hp (e j ) H lp (e j( ) ) Impulse response inverse ourier transform of frequency response of an LTI system h hp [n] e jn h lp [n] ( ) n h lp [n] Conjugation and Conjugate Symmetry If then x [n] Real : conjugate symmetry X(e j ) X (e j ) X(e j ) X (e j )

10 5 5 Conjugation + time reversal properties irst order differencing Re{Ev{}} + Re{Od{}} + jim{ev{}} + jim{od{}} X(e j )Re{Ev{X(e j )}} + Re{Od{X(e j )}} + jim{ev{x(e j )}} + jim{od{x(e j )}} If then x[n ] X(e j ) ( e j )X(e j ) Consider Observe where With a n, a < z[n] + z[ n] δ[n] z[n] and time reversal property inally z[ n] z[n] a n u[n] ae j ae j X(e j ) ae + j ae j a 2 2acos() + a 2 real and even X(e j ) real and even ollows immediately from linearity and time-shifting properties Accumulation If then n m x[m] X(e j ) e j X(ej ) + X(e j ) Impulse train X(e j ): dc component Zero-mean (X(e j ) ): (see differencing property) X(e j ) e j k δ( k)

11 52 53 Unit step u[n] Known and Accumulation property X(e j ) u[n] δ[n] G(e j ) u[n] n m δ[m] e jg(ej ) + G(e j ) e + j k e + j k δ( k) k δ( k) δ( k) Decimation and Time Expansion Similar property(ies) to time and frequency scaling in continuous time case Consider X(e j ) Decimation: x[an], a I Proof: a X(e j(/a k/a) ) a k x[an] a X(e j(/a k/a) ) a n n/a k a a k e jn/a a n e j(/a k/a)n x[an ]e jn a e jkn/a k }{{}, if n/a Z, else {x[an ]}

12 54 55 Time Expansion (a I) Proof: { x[n/a], if n is a multiple of a x (a) [n], otherwise X (a) (e j ) x (a) [n] r X(e ja ) jn rn/a x (a) [n]e r x[r]e j(a)r X(e ja ) x (a) [ra]e jra and ourier transform {x[2n]} ( sin(5/4) 2 sin(/4) Decimation by 4 and ourier transform x[4n] δ[n] {x[4n]} ) sin(5( )/4) + sin(( )/4) {}. Decimation Rectangular pulse of length 2 5 x[2n] {x[2n]} and ourier transform Decimation by 2 {, n 2, n > 2 X(e j ) sin(5/2) sin(/2) x[2n] {, n, n > x[4n] {x[4n]}

13 Expansion Rectangular pulse of length 2 5 {, n 2, n > 2 and ourier transform X(e j ) sin(5/2) sin(/2) Expansion by 2 {, n, 2, 4 x (2) [n], else and ourier transform X(e j ) sin(5) sin() Expansion by 3 {, n, 3, 6 x (3) [n], else and ourier transform X(e j ) sin(5/2) sin(3/2) x (2) [n] x (3) [n] 3. ourier transform of sequence {, n 2k 2, n 2k +, k < 5 Observe y (2) [n] + 2y (2) [n ] with shifted rectangular sequence {, n < 5 y[n], else {} {x (2) [n]} {x (3) [n]}

14 58 59 Time-shifting and time-expansion properties y (2) [n] e j4sin(5) sin() Linearity and time-shifting properties inally 2y (2) [n ] Differentiation in requency j5 sin(5) 2e sin() X(e j ) e j4 ( + 2e j ) sin(5) sin(). ourier transform of Already known na n u[n], a < z[n] a n u[n] ae j Z(ej ) Using differentiation-in-frequency property nz[n] j dz(ej ) j d ( ) d d ae j we find na n u[n] ae j ( ae j ) 2 If then Proof: dx(e j ) d n X(e j ) j dx(ej ) d ( d ) e jn d jne jn 2. ourier transform of Since (n + )a n u[n], a < na n u[n] + a n u[n] we find from linearity property (n + )a n u[n] ( ae j ) 2

15 6 6 Parseval s Relation If then Proof: 2 X(e j ) 2 X(e j ) 2 d X (e j )e jn d X (e j ) e jn d X(e j ) 2 d In analogy with continuous time case X(e j ) 2 : Energy density spectrum of Given: ourier transform X(e j ) for of sequence Determine /2 3 2 X(e j ) /2 X(e j ) periodic? ourier transform has no impulses is aperiodic. real? Even magnitude and odd phase function, X(e j ) X (e j ) Symmetry is real. even? X(e j ) is not real valued Symmetry is not even. of finite energy? Integral of X(e j ) 2 over is finite Parseval has finite energy.

16 The Convolution Property Consider discrete-time LTI system with impulse response h[n] y[n] h[n] e jn is eigenfunction with eigenvalue H(e j ) {h[n]} (frequency response) e jn H(e j )e jn Guess: Proof: Y (e j ) H(e j )X(e j ) Convolution property y[n] h[n] Important to memorize Convolution in time domain domain Y (e j ) H(e j )X(e j ) multiplication in frequency requency response H(e j ) of discrete-time LTI system is discretetime ourier transform of impulse response h[n]. Impulse response completely characterizes LTI system. requency response completely characterizes LTI system. Y (e j ) { x[k]h[n k]} k k k k x[k] x[k] x[k]h[n k]e jn n x[k]e jk k n H(e j )X(e j ) h[n k]e jn h[n ]e j(n +k) h[n ]e jn Existence of frequency response convergence of discrete-time ourier transform LTI system is BIBO stable h[n] <, Discrete-time ourier transform converges Stable LTI systems have frequency response H(e j ) {h[n]}.

17 Discrete-time LTI system with impulse response requency response H(e j ) h[n] δ[n n ] δ[n n ]e jn e jn Input-output relation in frequency domain Y (e j ) e jn X(e j ) Time shifting property of ourier transform y[n] x[n n ] ote: time shift n in time domain unit magnitude and linear phase characteristic n in frequency domain 2. requency response of an ideal discrete time lowpass filter defined for {, H(e j c ), > c c H(e j ) c Impulse response h[n] Discrete-time ourier pair c H(e j )e jn d e jn d c ( c sinc c n ) H(e j ) {, c, > c H(e j ) periodic with period Observe: Impulse response h[n] is not causal. Impulse response h[n] has infinite duration. ideal lowpass not realizable As in the continuous-time case: Computing response of LTI system via frequency domain h[n] y[n] X(e j ) H(e j ) Y (e j ) Computational bottleneck : inverse ourier transform Solutions: sin( c n) n Look up table of (basic) ourier transform pairs (e.g., Table 5.2 in text book) Partial fraction expansion for ratio of polynomials

18 . Discrete-time LTI system with impulse response and input signal Output y[n]? h[n] α n u[n], α < β n u[n], β < Discrete-time ourier transforms of and h[n] X(e j ) βe j and H(e j ) αe j Discrete-time ourier transform of y[n] Y (e j ) H(e j )X(e j ) ( αe j )( βe j ) 66 (b) α β A ( αv)y (v) v/α B ( βv)y (v) v/β α α β β β α ( ) Y (e j α ) α β αe β j βe j α y[n] α β αn u[n] β α β βn u[n] ( α n+ β n+) u[n] α β We have Y (e j ) ( αe j ) 2 y[n] (n + )α n u[n] 67 Inverse discrete-time ourier transform (a) α β Write Y (e j A ) αe + B j βe j and consider generalized function (ourier pair derived in an example in Section 5.3, alternatively, write Y (e j ) j d ( ) α ej and use d αe j frequency-differentiation and time-shifting properties) Y (v) ( αv)( βv) A αv + B βv

19 Consider LTI system with ideal lowpass filters H lp (e j ) with cutoff frequency /4 (b) Lower path Convolution property ( ) n ( ) n W 4 (e j ) H lp (e j )X(e j ) w [n] H lp (e j ) w 2 [n] w 3 [n] (c) Combining top and lower path Linearity property y[n] Y (e j ) W 3 (e j )+W 4 (e j ) (H lp (e j( ) )+H lp (e j ))X(e j ) H lp (e j ) Relation between and y[n]? w 4 [n] requency response of overall system H(e j ) H lp (e j( ) ) + H lp (e j ) (a) Top path Since ( ) n e jn w [n] e jn from frequency shifting property Convolution property W (e j ) X(e j( ) ) W 2 (e j ) H lp (e j )X(e j( ) ) rom an example in Section 5.3: Ideal lowpass shifted by in frequency is ideal highpass filter Overall system passes both low and high frequencies and stops frequencies between these two passbands ilter with ideal bandstop characteristic, here stopband region /4 < < 3/4 H(e j ) Again frequency shifting property W 3 (e j ) W 2 (e j( ) ) H lp (e j( ) )X(e j( ) ) Periodicity of discrete time ourier transforms with period, W 3 (e j ) H lp (e j( ) )X(e j )

20 The Multiplication Property Analogous to continuous-time case: multiplication property Proof: y[n] x [n]x 2 [n] Y (e j ) X (e jθ )X 2 (e j( Θ) ) dθ Right hand side integral corresponds to periodic convolution can be evaluated over any interval of length. Y (e j ) y[n]e jn x [n]x 2 [n]e jn X (e jθ )e jθn dθ x 2 [n]e jn ( ) X (e jθ ) x 2 [n]e j( Θ)n dθ X (e jθ )X 2 (e j( Θ) ) dθ Spectrum of signal sin(n/2)sin(3n/4) 2 n 2 Write as product of two sinc functions ( n ) 2 sinc 3 ( ) 3n 2 4 sinc 4 rom multiplication property X(e j ) X (e jθ )X 2 (e j( Θ) ) dθ with periodic rectangular spectra defined in as {, /2 X (e j ), > /2 and X 2 (e j ) {, 3/4, > 3/4 Simplification of above periodic convolution by defining aperiodic lowpass ˆX (j) { X (e j ), <, otherwise

21 72 73 aperiodic convolution X(e j ) ˆX (jθ)x 2 (e j( Θ) ) dθ ˆX (jθ)x 2 (e j( Θ) ) dθ ˆX (j) X 2 (e j ) Result of convolution is ourier transform X(e j ) X(e j ) Duality o formal similarity between discrete-time ourier transform and its inverse X(e j ) e jn and X(e j )e jn d o duality property as in continuous-time case However: equations ormal similarity between discrete time ourier series k a k e jk(/)n and a k ormally define two periodic sequences g[n] S f[k] n e jk(/)n Changing roles of k and n in ourier coefficients series equation f[n] we find k g[k]e jk(/)n f[n] S g[ k] k g[ k]e jk(/)n

22 74 75 Duality of properties of discrete time ourier series Time and requency Shift and x[n n ] r e jm(/)n S a k e jk(/)n S a k m Convolution and Multiplication S x[r]y[n r] a k b k and y[n] S l a l b k l Duality often useful in reducing complexity of calculations involved in determining ourier series representations Periodic signal with a period of 9: sin(5n/9), n multiple of 9 9 sin(n/9), n multiple of Recall: ourier series coefficients b k of periodic square wave g[n] of length and a period (Chapter 3, page 84) {, n g[n], n > sin(k( + /2)/), k, ±, ±2,... sin(k/) b k 2 +, k, ±, ±2,... With 9 and 2 Duality 9 b k g[n] sin(5k/9) sin(k/9), k multiple of 9 5, k multiple of 9 9 S b k and b n S a k 9 g[ k] Sequence of ourier series coefficients with a period 9 { /9, k 2 a k, 2 < k 4

23 76 77 urthermore: ormal similarity between discrete time ourier transform X(e j )e jn d, X(e j ) and continuous time ourier series g(t) a k e jkt, a k T k T e jn x(t)e jk t dt ourier transform X(e j ) periodic with period ormally replace argument e j by t: X(t), periodic with period T, /T continuous-time ourier series X(t) e jtn k Observe: If x(t) periodic with period T and then a n g(t) S a k x[ k]e jk t X(e j ) g() Desired: discrete time ourier transform of sequence sin(n/2) ( n ) n 2 sinc 2 Continuous time signal g(t) with period T and ourier coefficients a k x[ k] (Chapter 3, page 74): {, t /2 g(t), /2 < t a k ( n ) 2 sinc a k x[k] 2 Duality ourier transform {, /2 X(e j ) g(), /2 < Verification: We have g(t) S a k sin(k/2) k or or sin(n/2) n /2 /2 ()e jn d X(e j ) g(t)e jkt dt /2 /2 /2 /2 ()e jn d ()e jkt dt

24 Summary of ourier series and transform expressions Continuous time Discrete time Time domain requency domain Time domain requency domain ourier Series ourier x(t) a k a k a k e jk t T x(t)e jk t a k e jk(/)n k T k e jk(/)n k continuous time discrete frequency discrete time discrete frequency periodic in time aperiodic in frequency periodic in time periodic in frequency x(t) X(j) X(e j ) X(j)e jt d x(t)e jt dt X(e j )e jn d e jn k Transform continuous time continuous frequency discrete time continuous frequency aperiodic in time aperiodic in frequency aperiodic in time periodic in frequency ote: continuous aperiodic discrete periodic requency Response and Linear Constant Coefficient Difference Equations Recall: Discrete-time system description by linear constant-coefficient difference equation aky[n k] k M bkx[n k] k requency response H(e j )? Apply e jn as input output y[n] H(e j )e jn Alternatively Convolution property H(e j ) Y (e j )/X(e j ) Apply ourier transform to difference equation + linearity and time-shifting properties { } { } M aky[n k] bkx[n k] k ak {y[n k]} k ake jk Y (e j ) k Consequently k M bk {x[n k]} k M bke jk X(e j ) k H(e j ) Y (ej ) X(e j ) M k bke jk k ake jk 79

25 8 8 Observe H(e j ) obtained from difference equation by inspection H(e j ) is a rational function in e j inverse ourier transform by partial-fraction expansion. Causal discrete-time LTI system characterized by requency response Impulse response y[n] ay[n ], a < H(e j ) ae j h[n] a n u[n] 2. Causal discrete-time LTI system characterized by y[n] 3 4 y[n ] + y[n 2] 2 8 requency response H(e j 2 ) 3 4 e j + 8 e j2 Partial-fraction expansion H(e j 2 ) ( 2 e j )( 4 e j ) e j 4 e j Impulse response h[n] 4 ( ) n u[n] 2 2 ( ) n u[n] 4 3. System of previous example and input ( ) n u[n] 4 Spectrum of output Y (e j ) H(e j )X(e j ) ( ) ( ) e j + 8 e j2 ( ) 4 e j 2 ( 2 e j )( 4 e j ) 2 Partial fraction expansion Y (e j ) B 4 e j + B 2 ( 4 e j ) 2 + B 2 2 e j with B 4, B 2 2, and B 2 8 Inverse ourier transform ( ( ) n y[n] 4 2(n + ) 4 ( ) n ( ) n ) u[n] 2

4 The Continuous Time Fourier Transform

4 The Continuous Time Fourier Transform 96 4 The Continuous Time ourier Transform ourier (or frequency domain) analysis turns out to be a tool of even greater usefulness Extension of ourier series representation to aperiodic signals oundation

More information

The Discrete-time Fourier Transform

The Discrete-time Fourier Transform The Discrete-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals: The

More information

3 Fourier Series Representation of Periodic Signals

3 Fourier Series Representation of Periodic Signals 65 66 3 Fourier Series Representation of Periodic Signals Fourier (or frequency domain) analysis constitutes a tool of great usefulness Accomplishes decomposition of broad classes of signals using complex

More information

Chapter 3 Fourier Representations of Signals and Linear Time-Invariant Systems

Chapter 3 Fourier Representations of Signals and Linear Time-Invariant Systems Chapter 3 Fourier Representations of Signals and Linear Time-Invariant Systems Introduction Complex Sinusoids and Frequency Response of LTI Systems. Fourier Representations for Four Classes of Signals

More information

Digital Signal Processing:

Digital Signal Processing: Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried

More information

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its

More information

Discrete-time Signals and Systems in

Discrete-time Signals and Systems in Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Discrete-Time Fourier Transform

Discrete-Time Fourier Transform C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,

More information

Stability Condition in Terms of the Pole Locations

Stability Condition in Terms of the Pole Locations Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability

More information

Chap 2. Discrete-Time Signals and Systems

Chap 2. Discrete-Time Signals and Systems Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,

More information

Introduction to Digital Signal Processing

Introduction to Digital Signal Processing Introduction to Digital Signal Processing 1.1 What is DSP? DSP is a technique of performing the mathematical operations on the signals in digital domain. As real time signals are analog in nature we need

More information

Fourier Series Representation of

Fourier Series Representation of Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system

More information

Definition of Discrete-Time Fourier Transform (DTFT)

Definition of Discrete-Time Fourier Transform (DTFT) Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with

More information

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients able : Properties of the Continuous-ime Fourier Series x(t = e jkω0t = = x(te jkω0t dt = e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period and fundamental

More information

Continuous-Time Fourier Transform

Continuous-Time Fourier Transform Signals and Systems Continuous-Time Fourier Transform Chang-Su Kim continuous time discrete time periodic (series) CTFS DTFS aperiodic (transform) CTFT DTFT Lowpass Filtering Blurring or Smoothing Original

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant

More information

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114. ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114. The exam for both sections of ECE 301 is conducted in the same room, but the problems are completely different. Your ID will

More information

ECE-314 Fall 2012 Review Questions for Midterm Examination II

ECE-314 Fall 2012 Review Questions for Midterm Examination II ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem

More information

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 ) Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:

More information

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Digital Signal Processing Lecture 3 - Discrete-Time Systems Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of

More information

Topic 3: Fourier Series (FS)

Topic 3: Fourier Series (FS) ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties

More information

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients able : Properties of the Continuous-ime Fourier Series x(t = a k e jkω0t = a k = x(te jkω0t dt = a k e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period

More information

University Question Paper Solution

University Question Paper Solution Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=

More information

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4. EE : Signals, Systems, and Transforms Spring 7. A causal discrete-time LTI system is described by the equation Test y(n) = X x(n k) k= No notes, closed book. Show your work. Simplify your answers.. A discrete-time

More information

Representing a Signal

Representing a Signal The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the

More information

Linear Convolution Using FFT

Linear Convolution Using FFT Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular

More information

The Continuous-time Fourier

The Continuous-time Fourier The Continuous-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals:

More information

6.003 Homework #10 Solutions

6.003 Homework #10 Solutions 6.3 Homework # Solutions Problems. DT Fourier Series Determine the Fourier Series coefficients for each of the following DT signals, which are periodic in N = 8. x [n] / n x [n] n x 3 [n] n x 4 [n] / n

More information

EEL3135: Homework #4

EEL3135: Homework #4 EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]

More information

VU Signal and Image Processing

VU Signal and Image Processing 052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/18s/

More information

Question Paper Code : AEC11T02

Question Paper Code : AEC11T02 Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)

More information

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function Discrete-Time Signals and s Frequency Domain Analysis of LTI s Dr. Deepa Kundur University of Toronto Reference: Sections 5., 5.2-5.5 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE123 Digital Signal Processing Lecture 2B D. T. Fourier Transform M. Lustig, EECS UC Berkeley Something Fun gotenna http://www.gotenna.com/# Text messaging radio Bluetooth phone interface MURS VHF radio

More information

ELEG 305: Digital Signal Processing

ELEG 305: Digital Signal Processing ELEG 305: Digital Signal Processing Lecture 1: Course Overview; Discrete-Time Signals & Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E.

More information

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:

More information

The Discrete-Time Fourier

The Discrete-Time Fourier Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download

More information

Filter structures ELEC-E5410

Filter structures ELEC-E5410 Filter structures ELEC-E5410 Contents FIR filter basics Ideal impulse responses Polyphase decomposition Fractional delay by polyphase structure Nyquist filters Half-band filters Gibbs phenomenon Discrete-time

More information

GATE EE Topic wise Questions SIGNALS & SYSTEMS

GATE EE Topic wise Questions SIGNALS & SYSTEMS www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

Digital Signal Processing Lecture 4

Digital Signal Processing Lecture 4 Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE123 Digital Signal Processing Lecture 2A D.T Systems D. T. Fourier Transform A couple of things Read Ch 2 2.0-2.9 It s OK to use 2nd edition My office hours: posted on-line W 4-5pm Cory 506 ham radio

More information

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input

More information

The different frequency components in a sound signal are processed first by the sensory system in the ear then some specialized cortical areas in the

The different frequency components in a sound signal are processed first by the sensory system in the ear then some specialized cortical areas in the Signals Represented in Terms of Magnitude Phase The physical interpretation of the Fourier transform of a time signal is its decomposition into a linear combination of frequency components with different

More information

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination ECE 30 Division, all 2006 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested

More information

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions: ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE123 Digital Signal Processing Discrete Time Fourier Transform M. Lustig, EECS UC Berkeley A couple of things Read Ch 2 2.0-2.9 It s OK to use 2nd edition Class webcast in bcourses.berkeley.edu or linked

More information

Chapter 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present

More information

Discrete-Time Fourier Transform

Discrete-Time Fourier Transform Discrete-Time Fourier Transform Chapter Intended Learning Outcomes: (i) (ii) (iii) Represent discrete-time signals using discrete-time Fourier transform Understand the properties of discrete-time Fourier

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

8 The Discrete Fourier Transform (DFT)

8 The Discrete Fourier Transform (DFT) 8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration

More information

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal 2. CONVOLUTION Convolution sum. Response of d.t. LTI systems at a certain input signal Any signal multiplied by the unit impulse = the unit impulse weighted by the value of the signal in 0: xn [ ] δ [

More information

ELEN E4810: Digital Signal Processing Topic 2: Time domain

ELEN E4810: Digital Signal Processing Topic 2: Time domain ELEN E4810: Digital Signal Processing Topic 2: Time domain 1. Discrete-time systems 2. Convolution 3. Linear Constant-Coefficient Difference Equations (LCCDEs) 4. Correlation 1 1. Discrete-time systems

More information

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function

More information

Ch 2: Linear Time-Invariant System

Ch 2: Linear Time-Invariant System Ch 2: Linear Time-Invariant System A system is said to be Linear Time-Invariant (LTI) if it possesses the basic system properties of linearity and time-invariance. Consider a system with an output signal

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 6: January 31, 2017 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial

More information

Frequency-Domain C/S of LTI Systems

Frequency-Domain C/S of LTI Systems Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the

More information

Lecture 4: FT Pairs, Random Signals and z-transform

Lecture 4: FT Pairs, Random Signals and z-transform EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 4: T Pairs, Rom Signals z-transform Wed., Oct. 10, 2001 Prof: J. Bilmes

More information

Fourier Representations of Signals & LTI Systems

Fourier Representations of Signals & LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n] 2. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Responses of Digital Filters Chapter Intended Learning Outcomes:

Responses of Digital Filters Chapter Intended Learning Outcomes: Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing

More information

Bridge between continuous time and discrete time signals

Bridge between continuous time and discrete time signals 6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems

More information

THE DISCRETE-TIME FOURIER TRANSFORM

THE DISCRETE-TIME FOURIER TRANSFORM 5 THE DISCRETE-TIME FOURIER TRANSFORM 5.0 INTRODUCTION 358 In Chapter 4, we introduced the continuous-time Fourier transform and developed the many characteristics of that transform which make the methods

More information

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:

More information

Review of Analog Signal Analysis

Review of Analog Signal Analysis Review of Analog Signal Analysis Chapter Intended Learning Outcomes: (i) Review of Fourier series which is used to analyze continuous-time periodic signals (ii) Review of Fourier transform which is used

More information

Fourier series for continuous and discrete time signals

Fourier series for continuous and discrete time signals 8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output

More information

LINEAR-PHASE FIR FILTERS DESIGN

LINEAR-PHASE FIR FILTERS DESIGN LINEAR-PHASE FIR FILTERS DESIGN Prof. Siripong Potisuk inimum-phase Filters A digital filter is a minimum-phase filter if and only if all of its zeros lie inside or on the unit circle; otherwise, it is

More information

III. Time Domain Analysis of systems

III. Time Domain Analysis of systems 1 III. Time Domain Analysis of systems Here, we adapt properties of continuous time systems to discrete time systems Section 2.2-2.5, pp 17-39 System Notation y(n) = T[ x(n) ] A. Types of Systems Memoryless

More information

Discrete-Time Fourier Transform (DTFT)

Discrete-Time Fourier Transform (DTFT) Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]

More information

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review of Frequency Domain Fourier Series: Continuous periodic frequency components Today we will review: Review of Frequency Domain Fourier series why we use it trig form & exponential form how to get coefficients for each form Eigenfunctions what they are how they relate to LTI systems

More information

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous

More information

EE 210. Signals and Systems Solutions of homework 2

EE 210. Signals and Systems Solutions of homework 2 EE 2. Signals and Systems Solutions of homework 2 Spring 2 Exercise Due Date Week of 22 nd Feb. Problems Q Compute and sketch the output y[n] of each discrete-time LTI system below with impulse response

More information

Notes 07 largely plagiarized by %khc

Notes 07 largely plagiarized by %khc Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties

More information

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier

More information

Ch 4: The Continuous-Time Fourier Transform

Ch 4: The Continuous-Time Fourier Transform Ch 4: The Continuous-Time Fourier Transform Fourier Transform of x(t) Inverse Fourier Transform jt X ( j) x ( t ) e dt jt x ( t ) X ( j) e d 2 Ghulam Muhammad, King Saud University Continuous-time aperiodic

More information

Frequency Response and Continuous-time Fourier Series

Frequency Response and Continuous-time Fourier Series Frequency Response and Continuous-time Fourier Series Recall course objectives Main Course Objective: Fundamentals of systems/signals interaction (we d like to understand how systems transform or affect

More information

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) = Z-Transform The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = Z : G(z) = It is Used in Digital Signal Processing n= g(t)e st dt g[n]z n Used to Define Frequency

More information

Digital Signal Processing Module 1 Analysis of Discrete time Linear Time - Invariant Systems

Digital Signal Processing Module 1 Analysis of Discrete time Linear Time - Invariant Systems Digital Signal Processing Module 1 Analysis of Discrete time Linear Time - Invariant Systems Objective: 1. To understand the representation of Discrete time signals 2. To analyze the causality and stability

More information

DSP-I DSP-I DSP-I DSP-I

DSP-I DSP-I DSP-I DSP-I NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79

More information

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω 3 The z-transform ² Two advantages with the z-transform:. The z-transform is a generalization of the Fourier transform for discrete-time signals; which encompasses a broader class of sequences. The z-transform

More information

Transform Analysis of Linear Time-Invariant Systems

Transform Analysis of Linear Time-Invariant Systems Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform

More information

Filter Design Problem

Filter Design Problem Filter Design Problem Design of frequency-selective filters usually starts with a specification of their frequency response function. Practical filters have passband and stopband ripples, while exhibiting

More information

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

! z-transform.  Tie up loose ends.  Regions of convergence properties. ! Inverse z-transform.  Inspection.  Partial fraction Lecture Outline ESE 53: Digital Signal Processing Lec 6: January 3, 207 Inverse z-transform! z-transform " Tie up loose ends " gions of convergence properties! Inverse z-transform " Inspection " Partial

More information

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2

More information

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier

More information

Properties of LTI Systems

Properties of LTI Systems Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same

More information

Digital Signal Processing

Digital Signal Processing Digital Signal Processing The -Transform and Its Application to the Analysis of LTI Systems Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Cech

More information

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002. The Johns Hopkins University Department of Electrical and Computer Engineering 505.460 Introduction to Linear Systems Fall 2002 Final exam Name: You are allowed to use: 1. Table 3.1 (page 206) & Table

More information

z-transform Chapter 6

z-transform Chapter 6 z-transform Chapter 6 Dr. Iyad djafar Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform

More information

Lecture 19: Discrete Fourier Series

Lecture 19: Discrete Fourier Series EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou

More information

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2, Filters Filters So far: Sound signals, connection to Fourier Series, Introduction to Fourier Series and Transforms, Introduction to the FFT Today Filters Filters: Keep part of the signal we are interested

More information

Signals and Systems Spring 2004 Lecture #9

Signals and Systems Spring 2004 Lecture #9 Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier

More information

1. FIR Filter Design

1. FIR Filter Design ELEN E4810: Digital Signal Processing Topic 9: Filter Design: FIR 1. Windowed Impulse Response 2. Window Shapes 3. Design by Iterative Optimization 1 1. FIR Filter Design! FIR filters! no poles (just zeros)!

More information

Solutions to Problems in Chapter 4

Solutions to Problems in Chapter 4 Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave

More information

EC Signals and Systems

EC Signals and Systems UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE123 Digital Signal Processing Lecture 2 Discrete Time Systems Today Last time: Administration Overview Announcement: HW1 will be out today Lab 0 out webcast out Today: Ch. 2 - Discrete-Time Signals and

More information

Then r (t) can be expanded into a linear combination of the complex exponential signals ( e j2π(kf 0)t ) k= as. c k e j2π(kf0)t + c k e j2π(kf 0)t

Then r (t) can be expanded into a linear combination of the complex exponential signals ( e j2π(kf 0)t ) k= as. c k e j2π(kf0)t + c k e j2π(kf 0)t .3 ourier Series Definition.37. Exponential ourier series: Let the real or complex signal r t be a periodic signal with period. Suppose the following Dirichlet conditions are satisfied: a r t is absolutely

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 3 Signals & Systems Prof. ark Fowler Note Set #28 D-T Systems: DT Filters Ideal & Practical /4 Ideal D-T Filters Just as in the CT case we can specify filters. We looked at the ideal filter for the

More information