SlideShare a Scribd company logo
3
Most read
9
Most read
A project report submitted in fulfillments of the requirements for the
award of degree of
BACHELOR OF TECHNOLOGY
IN
ELECTRONICS AND COMMUNICATION ENGINEERING
IMPLEMENTATION OF FAST
FOURIERTRANSFORMATION USING LABVIEW
Prepared by
•B .SUMA 13951A0494
• R.BHAVANA 13951A0458
•A.SHAMALA 13951A0409
•B.KARTHIK 13951A0470
Under The Guidance Of
G.ANIL REDDY
Assistant Professor
ECE, IARE
Fast Fourier Transformation
Introduction
 The Fast Fourier Transform is an algorithm optimization of the DFT—
Discrete Fourier Transform.
 The “discrete” part just means that it’s an adaptation of the Fourier
Transform, a continuous process for the analog world, to make it
suitable for the sampled digital world.
 The results of the FFT are the same as with the DFT, the only
difference is that the algorithm is optimized to remove redundant
calculations
DEFINITION
 The fast Fourier transform maps time-domain functions into
frequency-domain representations. FFT is derived from the Fourier
transform equation, which is:

 where x(t) is the time domain signal, X(f) is the FFT, and ft is the
frequency to analyze
 Fast Fourier Transform, or FFT, is any algorithm for computing the N-
point DFT with a computational complexity of O(N log N). It is not a
new transform, but simply an efficient method of calculating the DFT
of x(n).
.
FFT ALGORITHM
IF WE ASSUME THAT N IS EVEN,WE CAN WRITE THE N POINT DFT OF X(N ) AS
N-POINT FFT
TWIDDLE FACTOR EQUATION
3-STAGE FFT-RADIX2 ALGORITHM
HOW IT IS APPLIED
 FFT is derived by cooley-tukey algorithm. It is also called as RADIX-2
algorithm.
 This is a divide and conquer algorithm that recursively breaks down a
DFT of any composite size N = N1N2into many smaller DFTs of
sizes N1 and N2, along with O(N) multiplications by complex roots of
unity traditionally called twiddle factors.
WHY WE ARE USING IN LABVIEW?
 LabVIEW is an integrated development environment designed
specifically for engineers and scientists building measurement and
control systems.
 LabVIEW is a flexible programming environment that can help
successfully build unique application, by taking simple
measurements .
system labview
Front
panel
block
diagram
Input and output
display
LABVIEW BLOCKDIAGRAM
FRONT PANEL FOR GIVING INPUTS AND
DISPLAYING OUTPUTS
APPLICATIONS OF FFT
FFT's importance derives from the fact that in signal
processing and image processing it has made working in
frequency domain equally computationally feasible as
working in temporal or spatial domain.
FFT is a powerful signal analysis tool applicable to a wide
variety of fields including spectral analysis.
Digital filtering.
Medical imaging.
Numerical analysis.
 Instrumentation and communications.
THANK YOU!!!

More Related Content

PPT
Lecture13
PPTX
Fourier Transform
PPT
Pulse amplitude modulation
PPT
Fourier transform
PPTX
Satellite communication analog and digital signals
PPTX
Classification of antenna
PPTX
Frequency division multiplexing (FDM).pptx
Lecture13
Fourier Transform
Pulse amplitude modulation
Fourier transform
Satellite communication analog and digital signals
Classification of antenna
Frequency division multiplexing (FDM).pptx

What's hot (20)

PPTX
Presentation on fourier transformation
PPTX
COGNITIVE RADIO
PDF
Comparison of modulation methods
PPTX
Cw and fm cw radar
PPT
Introduction & Wireless Transmission
PPTX
Optical switching
PDF
Dsp U Lec10 DFT And FFT
PPT
Active Filters
PDF
evolution of mobile networks generations 1G, 2G, 3G, 4G, 5G.pdf
PPT
multiple access in wireless communication
PPTX
In direct method of fm generation armstrong method
PDF
3_Antenna Array [Modlue 4] (1).pdf
PPTX
1st AND 2nd ORDER PHASE TRANSITION
PPTX
CDMA cellular radio network
PPTX
Applications of cross correlation
PDF
Basics of wireless communication
PPTX
Television Receiver
PPTX
Reflector antenna
PPT
communication system ch1
PPTX
TYPES OF SIGNAL.pptx
Presentation on fourier transformation
COGNITIVE RADIO
Comparison of modulation methods
Cw and fm cw radar
Introduction & Wireless Transmission
Optical switching
Dsp U Lec10 DFT And FFT
Active Filters
evolution of mobile networks generations 1G, 2G, 3G, 4G, 5G.pdf
multiple access in wireless communication
In direct method of fm generation armstrong method
3_Antenna Array [Modlue 4] (1).pdf
1st AND 2nd ORDER PHASE TRANSITION
CDMA cellular radio network
Applications of cross correlation
Basics of wireless communication
Television Receiver
Reflector antenna
communication system ch1
TYPES OF SIGNAL.pptx
Ad

Similar to fft using labview (20)

DOCX
Ppt on fft
PPTX
PDF
Design of Scalable FFT architecture for Advanced Wireless Communication Stand...
PDF
Iaetsd computational performances of ofdm using
PDF
FPGA Implementation of High Speed FIR Filters and less power consumption stru...
PDF
IRJET- Low Complexity Pipelined FFT Design for High Throughput and Low Densit...
PDF
PERFORMANCE EVALUATIONS OF GRIORYAN FFT AND COOLEY-TUKEY FFT ONTO XILINX VIRT...
PDF
Performance evaluations of grioryan fft and cooley tukey fft onto xilinx virt...
PDF
Design and Power Measurement of 2 And 8 Point FFT Using Radix-2 Algorithm for...
PDF
Implementation Of Grigoryan FFT For Its Performance Case Study Over Cooley-Tu...
PDF
Performance Analysis of OFDM Transceiver with Folded FFT and LMS Filter
PDF
IRJET - Design and Implementation of FFT using Compressor with XOR Gate Topology
PDF
B1030610
PDF
Discrete Fourier Series | Discrete Fourier Transform | Discrete Time Fourier ...
PDF
Res701 research methodology fft1
PDF
FPGA based Efficient Interpolator design using DALUT Algorithm
PDF
FPGA based Efficient Interpolator design using DALUT Algorithm
PDF
3 f3 3_fast_ fourier_transform
PDF
Dft and its applications
PDF
Analysis of different FIR Filter Design Method in terms of Resource Utilizati...
Ppt on fft
Design of Scalable FFT architecture for Advanced Wireless Communication Stand...
Iaetsd computational performances of ofdm using
FPGA Implementation of High Speed FIR Filters and less power consumption stru...
IRJET- Low Complexity Pipelined FFT Design for High Throughput and Low Densit...
PERFORMANCE EVALUATIONS OF GRIORYAN FFT AND COOLEY-TUKEY FFT ONTO XILINX VIRT...
Performance evaluations of grioryan fft and cooley tukey fft onto xilinx virt...
Design and Power Measurement of 2 And 8 Point FFT Using Radix-2 Algorithm for...
Implementation Of Grigoryan FFT For Its Performance Case Study Over Cooley-Tu...
Performance Analysis of OFDM Transceiver with Folded FFT and LMS Filter
IRJET - Design and Implementation of FFT using Compressor with XOR Gate Topology
B1030610
Discrete Fourier Series | Discrete Fourier Transform | Discrete Time Fourier ...
Res701 research methodology fft1
FPGA based Efficient Interpolator design using DALUT Algorithm
FPGA based Efficient Interpolator design using DALUT Algorithm
3 f3 3_fast_ fourier_transform
Dft and its applications
Analysis of different FIR Filter Design Method in terms of Resource Utilizati...
Ad

Recently uploaded (20)

PDF
Classroom Observation Tools for Teachers
PDF
OBE - B.A.(HON'S) IN INTERIOR ARCHITECTURE -Ar.MOHIUDDIN.pdf
PDF
Computing-Curriculum for Schools in Ghana
PDF
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
PPTX
Final Presentation General Medicine 03-08-2024.pptx
PDF
grade 11-chemistry_fetena_net_5883.pdf teacher guide for all student
PDF
A GUIDE TO GENETICS FOR UNDERGRADUATE MEDICAL STUDENTS
PDF
Supply Chain Operations Speaking Notes -ICLT Program
PPTX
Final Presentation General Medicine 03-08-2024.pptx
PPTX
Introduction-to-Literarature-and-Literary-Studies-week-Prelim-coverage.pptx
PDF
STATICS OF THE RIGID BODIES Hibbelers.pdf
PPTX
Presentation on HIE in infants and its manifestations
PPTX
Microbial diseases, their pathogenesis and prophylaxis
PPTX
202450812 BayCHI UCSC-SV 20250812 v17.pptx
PDF
Saundersa Comprehensive Review for the NCLEX-RN Examination.pdf
PDF
VCE English Exam - Section C Student Revision Booklet
PPTX
Cell Structure & Organelles in detailed.
PPTX
school management -TNTEU- B.Ed., Semester II Unit 1.pptx
PDF
Abdominal Access Techniques with Prof. Dr. R K Mishra
PDF
Complications of Minimal Access Surgery at WLH
Classroom Observation Tools for Teachers
OBE - B.A.(HON'S) IN INTERIOR ARCHITECTURE -Ar.MOHIUDDIN.pdf
Computing-Curriculum for Schools in Ghana
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
Final Presentation General Medicine 03-08-2024.pptx
grade 11-chemistry_fetena_net_5883.pdf teacher guide for all student
A GUIDE TO GENETICS FOR UNDERGRADUATE MEDICAL STUDENTS
Supply Chain Operations Speaking Notes -ICLT Program
Final Presentation General Medicine 03-08-2024.pptx
Introduction-to-Literarature-and-Literary-Studies-week-Prelim-coverage.pptx
STATICS OF THE RIGID BODIES Hibbelers.pdf
Presentation on HIE in infants and its manifestations
Microbial diseases, their pathogenesis and prophylaxis
202450812 BayCHI UCSC-SV 20250812 v17.pptx
Saundersa Comprehensive Review for the NCLEX-RN Examination.pdf
VCE English Exam - Section C Student Revision Booklet
Cell Structure & Organelles in detailed.
school management -TNTEU- B.Ed., Semester II Unit 1.pptx
Abdominal Access Techniques with Prof. Dr. R K Mishra
Complications of Minimal Access Surgery at WLH

fft using labview

  • 1. A project report submitted in fulfillments of the requirements for the award of degree of BACHELOR OF TECHNOLOGY IN ELECTRONICS AND COMMUNICATION ENGINEERING IMPLEMENTATION OF FAST FOURIERTRANSFORMATION USING LABVIEW Prepared by •B .SUMA 13951A0494 • R.BHAVANA 13951A0458 •A.SHAMALA 13951A0409 •B.KARTHIK 13951A0470 Under The Guidance Of G.ANIL REDDY Assistant Professor ECE, IARE
  • 2. Fast Fourier Transformation Introduction  The Fast Fourier Transform is an algorithm optimization of the DFT— Discrete Fourier Transform.  The “discrete” part just means that it’s an adaptation of the Fourier Transform, a continuous process for the analog world, to make it suitable for the sampled digital world.  The results of the FFT are the same as with the DFT, the only difference is that the algorithm is optimized to remove redundant calculations
  • 3. DEFINITION  The fast Fourier transform maps time-domain functions into frequency-domain representations. FFT is derived from the Fourier transform equation, which is:   where x(t) is the time domain signal, X(f) is the FFT, and ft is the frequency to analyze  Fast Fourier Transform, or FFT, is any algorithm for computing the N- point DFT with a computational complexity of O(N log N). It is not a new transform, but simply an efficient method of calculating the DFT of x(n). .
  • 4. FFT ALGORITHM IF WE ASSUME THAT N IS EVEN,WE CAN WRITE THE N POINT DFT OF X(N ) AS
  • 7. HOW IT IS APPLIED  FFT is derived by cooley-tukey algorithm. It is also called as RADIX-2 algorithm.  This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size N = N1N2into many smaller DFTs of sizes N1 and N2, along with O(N) multiplications by complex roots of unity traditionally called twiddle factors. WHY WE ARE USING IN LABVIEW?  LabVIEW is an integrated development environment designed specifically for engineers and scientists building measurement and control systems.  LabVIEW is a flexible programming environment that can help successfully build unique application, by taking simple measurements .
  • 10. FRONT PANEL FOR GIVING INPUTS AND DISPLAYING OUTPUTS
  • 11. APPLICATIONS OF FFT FFT's importance derives from the fact that in signal processing and image processing it has made working in frequency domain equally computationally feasible as working in temporal or spatial domain. FFT is a powerful signal analysis tool applicable to a wide variety of fields including spectral analysis. Digital filtering. Medical imaging. Numerical analysis.  Instrumentation and communications.