{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

EE3TP4_22_DTFT_Motivation_v2_Lecture 29

# EE3TP4_22_DTFT_Motivation_v2_Lecture 29 - Ch 4 Fourier...

This preview shows pages 1–4. Sign up to view the full content.

Ch. 4: Fourier Analysis of D-T Signals In this chapter we do for D-T signals what we did for C-T signals in Ch. 3: Define a D-T FT (DTFT) for D-T signals and see that it works pretty much like the FT for C-T signals (CTFT) But … we also do something we can’t do for CTFT-based ideas: Develop a computer-processing version of the DTFT… called the Discrete Fourier Transform (DFT) that will allow you to use the computer to numerically compute a “view” of the DTFT Order of Coverage: Section 4.1 : DTFT & It’s Properties Sections 4.2 and 4.3 : The DFT & DFT-Based Signal Analysis Section 4.5 provides some applications of DFT analysis … we’ll cover some other applications in class These overheads were originally developed by Mark Fowler at Binghamton University, State University of New York.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4.1 Discrete-Time FT (DTFT) (Very Important!)
Recall Our Analysis of Sampling Impulse Gen CT LPF DAC x ( t ) x [ n ] = x ( nT ) “Hold” Sample at t = nT ADC f X ( f ) B –B f F s 2F s –F s 2 F s x t x

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}