7 views

Uploaded by hamza abdo mohamoud

- 18534_ece300 -- Digital Signal Processing
- Fourier Descriptor
- Best Practice Tank Testing
- frequency analysis - fft.pdf
- Signals.and.Systems.with.MATLAB.Computing.and.Simulink.Modeling.4th.Edition
- DSP_CEN352_ch4_DFT
- 36198235-Vibration-Adv-0402.pdf
- Signals and Systems With [MATLAB] Computing and Simulink Modeling - Karris - 5th Edition
- Basic Electrical Engineering_D. P. Kothari and I. J. Nagrath
- Algorithms for Efficient Computation of Convolution
- hws
- Byzantine Music Intervals an Experimental Signal Processing Approach
- 541
- 3rd Year Syllabus
- It6502 Qb-1 Rejinpaul
- Brain-Computer Interface Using Single-Channel Electroencephalography
- Using Generalized Quantum Fourier Transforms in Quantum Phase Estimation Algorithms
- IJCNS_2017081113460335.pdf
- cs179_2017_lec08
- ECE 437(10P)

You are on page 1of 15

Mark Fowler

Note Set #24

D-T Signals: Definition of DFT Numerical FT Analysis Reading Assignment: Sections 4.2 of Kamen and Heck

The arrows here show conceptual flow between ideas. Note the parallel structure between the pink blocks (C-T Freq. Analysis) and the blue blocks (D-T Freq. Analysis). New Signal Models

Ch. 1 Intro

C-T Signal Model Functions on Real Line System Properties LTI Causal Etc D-T Signal Model Functions on Integers

Fourier Series Periodic Signals Fourier Transform (CTFT) Non-Periodic Signals

Frequency Response Based on Fourier Transform

Transfer Function

C-T System Model Differential Equations D-T Signal Model Difference Equations Zero-State Response Zero-Input Response Characteristic Eq.

Ch. 2 Convolution

C-T System Model Convolution Integral D-T Signal Model Convolution Sum

DTFT (for Hand Analysis) DFT & FFT (for Computer Analysis)

Freq. Response for DT Based on DTFT

Transfer Function

Weve seen that the DTFT is a good analytical tool for D-T signals (and systems as well see later when we return to Ch. 5)

Namely X () =

n =

(at least in principle) when we have an equation model for x[n] Q: Well why cant we use a computer to compute the DTFT? A: There are two reasons why we cant!! 1. The DTFT requires an infinite number of terms to be summed over n = , -3, -2, -1, 0, 1, 2, 3, 2. The DTFT must be evaluated at an infinite number of points over the interval (, ] -The first one (infinite # of terms) isnt a problem if x[n] has finite duration -The second one (infinitely many points) is always a problem!! Well maybe we can just compute the DTFT at a finite set of points!!

Lets explore this possibility it will lead us to the Discrete Fourier Transform Suppose we have a finite duration signal: x[n] = 0 for n < 0 and n N Then the DTFT of this finite duration signal is:

X () =

n =

x[n]e

jn

= x[n]e jn

n =0

N 1

X ()

-3 -2 - -/2 /2 2 3

We are only interested in this range Everywhere else it just repeats periodically

Now suppose we take the numerical data x[n] for n = 0, , N-1 and just compute this DTFT at a finite number of values (8 points here)

X ()

-3 -2 - -/2 /2 2 3

Now, even though we are interested in the - to range, we now play a trick to make the later equations easier

We dont compute points at negative values But, instead compute their mirror images at values between and 2 Dont need same as = 0

X ()

-3 -2 - -/2 /2 2 3

So say we want to compute the DTFT at M points, then choose 2 k = k , for k = 0,1, 2, ..., M 1 M Spacing between computed values In otherwords:

0 = 0,

2 , 1 = M

2 , 2 = 2 M

...

2 , M 1 = ( M 1) M

Thus mathematically what we have computed for our finite-duration signal is:

X ( k ) = x[n ]e

n =0

N 1

jn k

= x[n ]e

n =0

N 1

jnk 2 M

for k = 0, 1, 2, K, M 1

There is just one last step needed to define the Discrete Fourier Transform (DFT):

Done for a few mathematical reasons later well learn a trick called zero-padding to get around this!

We must set M = N

So

Given N signal data points x[n] for n = 0, , N-1 Compute N DFT points using:

X [k ] = x[n ]e j 2kn / N

n =0

N 1

k = 0,1, 2, ..., N 1

Plotting the DFT (well say more about this later..) N = 8 case We often plot the DFT vs. the DFT index k (integers)

X [k ] X ()

But we know that these points can be tied back to the true D-T frequency :

0 1

2 3 4 5 6

7 8

- -/2 /2 2 3

1. So far weve defined the DFT a. We based this on the motivation of wanting to compute the DTFT at a finite number of points b. Later well look more closely at the general relationship between the DFT and the DTFT 2. For now we want to understand a few properties of the DFT a. There a more properties if you take a senior-level DSP class youll learn them there.

1. Symmetry of the DFT We arrived at the DFT via the DTFT so it should be no surprise that the DFT inherits some sort of symmetry from the DTFT.

X [ N k ] = X [k ], k = 0,1, 2, ..., N 1

In this example we dont see the effect of the conjugate because we made the DFT real-valued for ease

X [ N k ] = X [k ], k = 0,1, 2, ..., N 1

X ()

0 1

2 3 4 5 6

7 8

Because the upper DFT points are just like the negative index DFT points this DFT symmetry property is exactly the same as the DTFT symmetry around the origin:

X ()

0 1

2 3 4 5 6

7 8

2. Inverse DFT Recall that the DTFT can be inverted given X() you can find the signal x[n] Because we arrived at the DFT via the DTFT it should be no surprise that the DFT inherits an inverse property from the DTFT.

Actually, we needed to force M = N to enable the DFT inverse property to hold!!

So

Given N DFT points X[k] for k = 0, , N-1 Compute N signal data points using:

1 x[n ] = N

X [k ]e j 2kn / N

n =0

N 1

n = 0,1, 2, ..., N 1

X [k ] = x[n ]e j 2kn / N

n =0

N 1

k = 0,1, 2, ..., N 1

DFT

FFT Algorithm (see Sect. 4.4 if you want to know why this works)

FFT = Fast Fourier Transform The FFT is not a new thing to compute (the DFT is a thing we compute) The FFT is just an efficient algorithm for computing the DFT If you code the DFT algorithm in the obvious way it takes: about N2 multiples, and N2 additions. The FFT is a trick to compute the DFT more efficiently it takes: N 2 log2 ( N ) multiples about N log ( N ) additions 2 2 Similar ideas hold for computing the inverse DFT. Note: The most common FFT algorithm requires that the number of samples put into it be a power of two later well talk about how to zero-pad up to a power of two!

The following plot shows the drastic improvement the FFT gives over the DFT:

While this figure tells the story the following matlab example should really illustrate the dramatic improvement that the FFT provides for computing a 4096 point DFT: Download the Notes_25_fft_test.m file and run it in matlab When you run it 1. Youll be prompted to hit Return a. Several seconds after you hit Return youll hear a beep that indicates that the direct DFT computation is complete 2. Then youll be prompted to hit Return again a. Instantaneously as you hit Return youll hear a beep that indicates that the FFT computation of the same DFT is complete!! Without the FFT algorithm we would not be able to do the DSP processing fast enough to enable much of todays technology!!!

DFT Summary What We Know So Far! Given N signal data points we can compute the DFT

And we can do this efficiently using the FFT algorithm

Given N DFT points we can get back the N signal data points

And we can do this efficiently using the IFFT algorithm

We know that there is a symmetry property We know that we can move the upper DFT points down to represent the negative frequencies

this will be essential in practical uses of the DFT Remember we ended up with the upper DFT points only to make the indexing by k easy!!! It is just to make the DFT equation easy to write!! Now We need to explore the connections between Then understand the relation between the

- 18534_ece300 -- Digital Signal ProcessingUploaded byGetlozzAwaba
- Fourier DescriptorUploaded byAmir Asaad
- Best Practice Tank TestingUploaded byJoão Henriques
- frequency analysis - fft.pdfUploaded byvenkatb7
- Signals.and.Systems.with.MATLAB.Computing.and.Simulink.Modeling.4th.EditionUploaded bywisnubaldas
- DSP_CEN352_ch4_DFTUploaded byTewodros
- 36198235-Vibration-Adv-0402.pdfUploaded byChintan Raval
- Signals and Systems With [MATLAB] Computing and Simulink Modeling - Karris - 5th EditionUploaded byJuan Pablo Cadena Aguilar
- Basic Electrical Engineering_D. P. Kothari and I. J. NagrathUploaded bySharib Jalis
- Algorithms for Efficient Computation of ConvolutionUploaded byAnonymous tsTtieMHD
- hwsUploaded byYozef Pazmiño
- Byzantine Music Intervals an Experimental Signal Processing ApproachUploaded byconstantinstoica
- 541Uploaded bykarsuresh
- 3rd Year SyllabusUploaded byRohitSrinivas
- It6502 Qb-1 RejinpaulUploaded byGovtJobPreparation
- Brain-Computer Interface Using Single-Channel ElectroencephalographyUploaded byJeya Kumar
- Using Generalized Quantum Fourier Transforms in Quantum Phase Estimation AlgorithmsUploaded byPandora Spotify
- IJCNS_2017081113460335.pdfUploaded byAnonymous dtUwrshoDp
- cs179_2017_lec08Uploaded byRajul
- ECE 437(10P)Uploaded byKishan Nandakumar
- 1407.3360v1Uploaded byDavid Turner
- TablesUploaded byKarthik V Kalyani
- CAS-handoutUploaded byMohan Kola
- SummaryUploaded byAnagachinmey
- DFTpptxUploaded byrktiwary256034
- FFT.pptxUploaded bySai Pavan Akhil
- LASC LOS COCOSendogenicidad LinfocitosEnglishUploaded byCristina Scaglione
- EC2302-QBUploaded byprashanthsk
- Audio CaptchaUploaded byNeha Agrawal
- 345man-aaUploaded byrecorcho

- EECE 301 Note Set 28a CT Partial FractionsUploaded byrodriguesvasco
- Nodal AnalysisUploaded byhamza abdo mohamoud
- Motivation for Fourier SeriesUploaded byhamza abdo mohamoud
- EECE 301 Discussion 02 MATLAB TutorialUploaded byQasimBajwa
- LogarithmicUploaded byhamza abdo mohamoud
- Light Dimmer CircuitUploaded byhamza abdo mohamoud
- LaplaceTransform…Transfer FunctionUploaded byhamza abdo mohamoud
- LaplaceTransform…and System StabilityUploaded byhamza abdo mohamoud
- LaplaceTransform…and System Response to an InputUploaded byhamza abdo mohamoud
- Laplace Transform TableUploaded byhamza abdo mohamoud
- Laplace Transform ExamplesUploaded byhamza abdo mohamoud
- InvertersUploaded byhamza abdo mohamoud
- Information on Some of the Parts in PSpice LibrariesUploaded byhamza abdo mohamoud
- Inductance NotesUploaded byhamza abdo mohamoud
- Ideal Filters -Frequency-Domain AnalysisUploaded byhamza abdo mohamoud
- Half-Wave RL Circuit With a Free-wheeling DiodeUploaded byhamza abdo mohamoud
- Half-Wave Rectifier Feeding a DC MotorUploaded byhamza abdo mohamoud
- Half-Wave Rectifier DC Motor With Freewheeling DiodeUploaded byhamza abdo mohamoud
- Half-Wave Rectifier as a Battery ChargerUploaded byhamza abdo mohamoud
- Half-Wave Controlled Rectifier DC Motor With FWDUploaded byhamza abdo mohamoud
- Half-Wave Controlled Rectifier DC MotorUploaded byhamza abdo mohamoud
- Half BridgeUploaded byhamza abdo mohamoud
- GeneralizedFourier TransformUploaded byhamza abdo mohamoud
- Full-Wave Rectifier Circuit With an RL LoadUploaded byhamza abdo mohamoud
- Full Wave FilterUploaded byhamza abdo mohamoud
- Full-Wave Controlled Rectifier With Resistive Load2Uploaded byhamza abdo mohamoud
- Full-Wave Controlled Rectifier RL Load (Discontinuous Mode)Uploaded byhamza abdo mohamoud
- Full-Wave Controlled Rectifier RL Load (Continuous Mode)Uploaded byhamza abdo mohamoud
- Ful l -Wave Phase-cont Rol Led Br Idge Recti Fier Wi Th a Constant Load Cur RentUploaded byhamza abdo mohamoud

- AES OSPFUploaded bySiva Kumar
- Arch ModelUploaded byKiran Jameel
- thesis_mns25.pdfUploaded byRadhianie Djan
- ED7201Uploaded byarulmurugu
- Implementation of Various Cryptosystem Using ChaosUploaded byInternational Organization of Scientific Research (IOSR)
- 01_Probability of Simple EventsUploaded byKimberly Combs Morrow
- 10.1.1.452.8943 asdaUploaded byasafajr
- Conversions Among International Temperature ScalesUploaded bytoplomer
- DSP & Digital FiltersUploaded byYalçınAygül
- A Guide to Fault Detection and Diagnosis.docxUploaded byAlejandro Mosaja
- Assignment 1Uploaded bygoku
- Slide09-Assignment and Network Optimization.pdfUploaded byAdonis C. Bibat
- MPSP 2 LINKNETUploaded bymanan desai
- Virtual Instrumentation applicationsUploaded bysanj155
- EGM6341_Sol_HW_05Uploaded byRaminShamshiri
- mws_gen_sle_ppt_gaussian.pptUploaded byHassan Funsho Akande
- Forcasting NHL SuccessUploaded byjweissbock
- Ieee Floating-point Decimal NumberUploaded bySiddharth Singh
- NCM: Neutrosophic c-means clustering algorithmUploaded byMia Amalia
- control Engineering SystemsUploaded byRajesh Pathak
- Homework#4 VirtualMemoryUploaded byyamaride
- SIC Module1Uploaded byvidhya_bineesh
- 4. Algorithm 2 - Unsupervised - ClusteringUploaded byMalik Faisal
- MIT1_204S10_lec16Uploaded bymhkhan1980
- rombergUploaded by96nissan
- DOE Course - Part 12a - RSMUploaded bysorinavramescu
- Hamilton PrinciplesUploaded byShivakumar Patil
- Space Elasticity TheoryUploaded byhansika
- 1_LifeAssuranceContracts(5)Uploaded byRenithaTalari
- I Error AnalysisUploaded byLucas Ho