134 views

Uploaded by guptavikas_1051

Discrete Fourier Transform using DIT FFT algorithm

- Assignment 1
- ec533_-_lec10
- signal_and_system_5th.pdf
- DIgital signal Processing lab manual
- FFT ASSIGNEMENT-119.docx
- 2marks Periodicals
- High Performance Data Mining in Time Series Techniques and Case
- 222
- 47806
- undoc
- Peak-To-Average Power Ratio Reduction in OFDM Using Cyclically Shifted Phase Sequences
- 12FPGA Implementation 0f 32 Point GM24Sept13VIT Copy
- Brain-Computer Interface Using Single-Channel Electroencephalography
- 13 App
- ECE411 - 6 - The Discrete Fourier Transform and the Fast Fourier Transform
- Floating Point Arith
- LAPORAN BMTT RIDA.docx
- Course Objective
- NMSOP_06
- SM-15571-DI-VII

You are on page 1of 18

V. R. Gupta

Department of Electronics and Telecommunication, YCCE, Nagpur

DFT pairs:

kn X [k ] x[n]WN , n 0 N 1

k 0,1..., N 1

kn N

1 x[n] N

X [k ]W

k 0

N 1

n 0,1..., N 1

WN = ej2/N is Twiddle factor or Nth root of Unity. It requires N2 complex multiplications and (N1)N complex additions for computation. Each complex multiplication needs four real multiplications and two real

requires 4N2 real multiplications and N(4N2) real additions.

In 1965, Cooley and Tukey developed very efficient algorithm to implement the DFT. This algorithm is called as Fast Fourier Transform i.e. FFT.

computations.

operations involved in the computations of DFT are greatly reduced

The direct computations of DFT is primarily inefficient as it does not exploit the Symmetry and Periodicity properties of the twiddle factor WN . Symmetry property:

W

Periodicity property:

kN 2 N

kN N

W

W

k N

k N

We always compute N- point DFT. The number N can be factored as

N r1 x r2 x r3

If

x ..............x v

r (a)

r1 = r2 = r3

= ..............= v

r (b)

Then

N = r v (c )

v indicates the no. of stages in the FFT

algorithm

If , r =2 then it is called as radix-2 FFT algorithm. Thus when r=2 equation (c) becomes

N 2v

If you want to compute 8-point DFT then

8 2 v3

algorithm.

Let x(n) represents a N-point sequence; where, N is an integer power of 2 . i.e. N = 2v

Since N is an even integer, we can consider computing X[k] by separating x[n] into two (N/2)-point sequence consisting of the even numbered point in x[n] and the odd-numbered points in x[n].

X [k ]

nk x [ n ] W N n even

nk x [ n ] W N n odd

or, with the substitution of variable n=2r for n even and n=2r+1 for n odd ( N / 2 ) 1 ( N / 2 ) 1

X [k ]

r 0 ( N / 2 ) 1 r 0

2 rk x [ 2 r ] W N

( 2 r 1) k x [ 2 r 1 ] W N r 0 ( N / 2 ) 1 r 0

2 rk k x [ 2 r ]( W ) W N N

2 rk x [ 2 r 1 ]( W N)

Since

2 WN e 2 j ( 2 / N ) e j 2 /( N / 2 ) WN / 2

( N / 2 ) 1 r 0 2 rk k x [ 2 r ]( W ) W N N ( N / 2 ) 1 r 0 2 rk x [ 2 r 1 ]( W N)

X [k ]

k G[k ] WN H [k ], k 0,1,..., N 1

Both G[k] and H[k] can be computed by (N/2)-point DFT, where G[k] is the (N/2)-point DFT of the even numbered points of the original sequence and the second being the (N/2)-point DFT of the odd-numbered point of the original sequence. Although the index ranges over N values, k = 0, 1, , N-1, each of the sums must be computed only for k between 0 and (N/2)-1, since G[k] and H[k] are each periodic in k with period N/2.

Decomposing N-point DFT into two (N/2)-point DFT for the case of N=8

We can further decompose the (N/2)-point DFT into two (N/4)-point DFTs. For example, the upper half of the previous diagram can be decomposed as

Hence, the 8-point DFT can be obtained by the following diagram with four 2-point DFTs.

Finally, each 2-point DFT can be implemented by the following signal-flow graph, where no multiplications are needed.

In each stage of the decimation-in-time FFT algorithm, there are a basic structure called the butterfly computation:

r X m [ p] X m1[ p] WN X m1[q] r X m [q] X m1[ p] WN X m1[q]

1

1

A

1

1 1

A

1

1 1

1 1

X(0) X(1)

W8 1

B

-1

1 1 1

B C

1

C D

1 W80

-1

X(2)

W8 1

W8 2

1

-1

D E

1 W80

-1

X(3) X(4)

x(1)

x(5)

1

1 1 -1

0

E F G

1

-1

1

W8

1

0

F

1

-1 -1 -1

X(5)

x(3)

x(7)

1 W8

0

1 1 -1

W8 W8

G H

X(6) X(7)

1

2

-1

In the above, we have introduced the decimation-in-time algorithm of FFT. Here, we assume that N is the power of 2. For N=2v, it requires v=log2N stages of computation. The number of complex multiplications and additions required was N+N+N = Nv = N log2N. When N is not the power of 2, we can apply the same principle that were applied in the power-of-2 case when N is a composite integer. For example, if N=RQ, it is possible to express an Npoint DFT as either the sum of R Q-point DFTs or as the sum of Q R-point DFTs. In practice, by zero-padding a sequence into an N-point sequence with N=2v, we can choose the nearest power-of-two FFT algorithm for implementing a DFT. The FFT algorithm of power-of-two is also called the CooleyTukey algorithm since it was first proposed by them.

- Assignment 1Uploaded byRenga Pradeep
- ec533_-_lec10Uploaded byDalia Abou El Maaty
- signal_and_system_5th.pdfUploaded bymaheshbabu527
- DIgital signal Processing lab manualUploaded byRaj Kumar Chowdary
- FFT ASSIGNEMENT-119.docxUploaded byRahul Khatri
- 2marks PeriodicalsUploaded byarunecetheboss
- High Performance Data Mining in Time Series Techniques and CaseUploaded byomitsura
- 222Uploaded byAndrew TheKanenas
- 47806Uploaded byDusko
- undocUploaded byAnonymous y9Qwj4PFCv
- Peak-To-Average Power Ratio Reduction in OFDM Using Cyclically Shifted Phase SequencesUploaded byElakkiyaSelvaraj
- 12FPGA Implementation 0f 32 Point GM24Sept13VIT CopyUploaded bykartik
- Brain-Computer Interface Using Single-Channel ElectroencephalographyUploaded byJeya Kumar
- 13 AppUploaded byimteyazashraf
- ECE411 - 6 - The Discrete Fourier Transform and the Fast Fourier TransformUploaded byMartine Jimenez
- Floating Point ArithUploaded byVishnupriya Akinapelli
- LAPORAN BMTT RIDA.docxUploaded byRidawati Turnip
- Course ObjectiveUploaded bydurraizali
- NMSOP_06Uploaded byFelix Rubenta
- SM-15571-DI-VIIUploaded bypavan kumar kvs
- 10EC44_Notes (1)Uploaded bylathavenky
- MatemathicsUploaded byGheorgheMario
- A Digital Guitar TunerUploaded byijcsis
- 406 Mark SchemeUploaded byPatrick Mugo
- 3 Prep 2Uploaded bysunnynnus
- break up of continuous liquid jets effect of nozzle geometryUploaded byFederico Roversi
- 574 Ftp Comp DHTUploaded byghalzai
- mock Exam 1Uploaded byXiaoou
- curriculum_itUploaded byMaverick Santos
- Beam Steering in Smart Antennas by Using Low Complex Adaptive AlgorithmsUploaded byesatjournals

- MFCEUploaded byguptavikas_1051
- Scope for Biomedical EngineersUploaded byguptavikas_1051
- Integrated Electronics- Analog and Digital Circuits and Systems_J. Millman and C. C. HalkiasUploaded byguptavikas_1051
- PPT Template for UG & PGUploaded byguptavikas_1051
- Electromagnetic_Field_Theory_Fundamentals.pdfUploaded byguptavikas_1051
- [James H. McClellan, Ronald W. Schafer, Mark a. Yo(BookZZ.org)Uploaded byguptavikas_1051
- ENT555-2 _New S & S 2016-17Uploaded byguptavikas_1051
- unit2Uploaded byguptavikas_1051
- Image CompressionUploaded byguptavikas_1051
- UNIT_3_PIPUploaded byguptavikas_1051
- Digital Signal ProcessingUploaded byVikas Gupta
- DSP IntroductionUploaded byVikas Gupta
- SFR OF 8051Uploaded byguptavikas_1051
- Karnan and LogeswariUploaded byguptavikas_1051
- Unit 3Uploaded byguptavikas_1051
- PresentationUploaded byguptavikas_1051
- DIP-UNIT-1Uploaded byguptavikas_1051
- Introduction 2 DSPUploaded byguptavikas_1051

- Rapor 2Uploaded byTürkay Taylak
- CO211-ErrorDetectionandCorrectionUploaded byThilini Nadeesha
- Nn DesignUploaded byNam
- Statistical Digital Signal Processing and ModelingUploaded byAmit Patel
- NumMethPDEsUploaded byDerli Dias
- Assignment Set KolkataUploaded byDebanjan Mukhopadhyay
- mariza_jurnalUploaded byMariza Wijayanti
- 3_Linear Regression Multiple VariablesUploaded byhung13579
- Object Detection Using Convolutional Neural Networks Vehicle DetectionUploaded byvictor
- Design Low Pass FIR Digital Filter for Cut off Frequency Calculation Using Artificial Neural NetworkUploaded byIRJET Journal
- Information Theory & Coding (ECE) by Nitin MittalUploaded byAmanjeet Panghal
- Lecture Notes on DSP - JNTUUploaded byRaja Pramod
- Dynamic Programming _ Set 4 (Longest Common Subsequence) - GeeksforGeeks.pdfUploaded byTanisha Jindal
- 6. Frequency-Domain Analysis of Discrete-Time Signals and SystemsUploaded bySwatiSharma
- Book 1Uploaded byAnass El Harruchi
- lec14Uploaded byMuhammad Asghar Khan
- Randomized AlgorithmsUploaded byRaji Pillai
- [IJCST-V4I4P11]:Rajni David Bagul, Prof. Dr. B. D. PhulpagarUploaded byEighthSenseGroup
- Polynomials - Aaron Pixton - MOP 2010Uploaded byParsasam
- COMP 4421 - Image ProcessingUploaded byLinh Ta
- Performance Comparison of LMS and RLS in Adaptive Equalization for Different Channel ConditionsUploaded byijrdt
- Digital Control Theory ProjectUploaded bySayed Abdullah
- MINLPUploaded byFebriza Imansuri
- 00822378Uploaded byapi-26783388
- Re a Effects GuideUploaded byAlex Csűri
- Digital Image Processing_S. Jayaraman, S. Esakkirajan and T. VeerakumarUploaded bykrish
- 07a80203 Optimization TechniquesUploaded bySharanya Thirichinapalli
- Didital Voice recognition system.Uploaded byTerrence
- SoptUploaded bySajid Zubair
- 160512-161903-Computer Aided Design.pdfUploaded byNajip Talibin