Fast Fourier Transform: the most important numerical algorithm of our lifetime
|
|
- Denis McCarthy
- 5 years ago
- Views:
Transcription
1 VU Signal and Image Processing Fast Fourier Transform: the most important numerical algorithm of our lifetime 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/17s/ Raphael 1 Sahann
2 Overview More 2D Fourier Transform Intuition Fast Fourier Transform motivation how it works trivia Fourier Transform in Biology? 2
3 Frequency Spectrum 3
4 Frequency Spectrum 4
5 Frequency Spectrum angle: 16.7 degrees 5
6 Overview More 2D Fourier Transform Intuition Fast Fourier Transform motivation how it works trivia Fourier Transform in Biology? 6
7 Usage FFT is used in almost every electronic device Telecommunication is only possible because of FFT All media applications A huge number of scientific applications Physics: partial differential equations Meteorology: weather simulations 7
8 Discrete Fourier Transform - DFT DFT takes one period of DTFS Analysis Synthesis Warning: periodicity is not eliminated. Evaluating outside the intervals will not give zero. 26 Hrvoje Bogunovic, Raphael Sahann 8
9 DFT vs FFT DFT: more general: 9
10 DFT vs FFT general form of the DFT: with entries: 10
11 DFT vs FFT Consider 1s of audio signal, sampled at 44.1 khz Matrix F has dimensions NxN, which is * = billion floating point operations order of O(n 2 ) FFT can do the same calculation in O(n log(n)) * = /4 million floating point operations 11
12 DFT vs FFT is identical to evens odds 12
13 DFT vs FFT F4 is close to F2 * 13
14 DFT vs FFT in general: 14
15 DFT vs FFT in general: 15
16 DFT vs FFT For this example FFT is 200 times faster than regular DFT 16
17 Fast Fourier Transform The speedup for powers of 2 using the FFT is so significant that the fastest way for signals that do not fit into a power of 2 is to pad them with zeroes until their size is at the next power of 2 17
18 Fast Fourier Transform The first version dates back to 1805 when J.C.F. Gauss used a similar algorithm to interpolate the orbits of Pallas and Juno from sample observations Cooley and Tukey are attributed with publishing the general FFT in 1965 The idea was originally used by Tukey (Princeton) to analyse sensor data from sensors placed along the borders of the USSR to detect nuclear tests 18
19 Fast Fourier Transform Soon after it was discovered that the algorithm had a wide range of applications and Cooley (IBM) implemented it Since Tukey did not work at IBM the patentability of the algorithm was doubted and it went into public domain 19
20 Fast Fourier Transform FFT was included in the Top 10 algorithms of the 20th century by IEEE journal Computing in Science and Engineering Gilbert Strang called it the most important numerical algorithm of our lifetime 20
21 Overview More 2D Fourier Transform Intuition Fast Fourier Transform motivation how it works trivia Fourier Transform in Biology? 21
22 An Historic Fourier Transform Taken by Rosalind Franklin, this image sparked Watson and Crick s insight into the double helix. Reprinted by permission from Macmillan Publishers Ltd: Nature. Source: Franklin, R., and R. G. Gosling. "Molecular Configuration in Sodium Thymonucleate." Nature 171 (1953): (c) Prof. Dennis Freeman, MIT,
23 An Historic Fourier Transform This is an x-ray crystallographic image of DNA, and it shows the Fourier transform of the structure of DNA. Reprinted by permission from Macmillan Publishers Ltd: Nature. Source: Franklin, R., and R. G. Gosling. "Molecular Configuration in Sodium Thymonucleate." Nature 171 (1953): (c) Prof. Dennis Freeman, MIT,
24 An Historic Fourier Transform High-frequency bands indicate repeating structure of base pairs. b 1/b Reprinted by permission from Macmillan Publishers Ltd: Nature. Source: Franklin, R., and R. G. Gosling. "Molecular Configuration in Sodium Thymonucleate." Nature 171 (1953): (c) Prof. Dennis Freeman, MIT,
25 An Historic Fourier Transform Low-frequency bands indicate a lower frequency repeating structure. h 1/h Reprinted by permission from Macmillan Publishers Ltd: Nature. Source: Franklin, R., and R. G. Gosling. "Molecular Configuration in Sodium Thymonucleate." Nature 171 (1953): (c) Prof. Dennis Freeman, MIT,
26 An Historic Fourier Transform Tilt of low-frequency bands indicates tilt of low-frequency repeating structure: the double helix! Reprinted by permission from Macmillan Publishers Ltd: Nature. Source: Franklin, R., and R. G. Gosling. "Molecular Configuration in Sodium Thymonucleate." Nature 171 (1953): (c) Prof. Dennis Freeman, MIT,
27 Simulation Easy to calculate relation between structure and Fourier transform. 42 Prof. Dennis Freeman, MIT,
VU Signal and Image Processing. Image Restoration. Torsten Möller + Hrvoje Bogunović + Raphael Sahann
052600 VU Signal and Image Processing Image Restoration 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/17s/
More information6. Fast Fourier Transform
x[] X[] x[] x[] x[6] X[] X[] X[3] x[] x[5] x[3] x[7] 3 X[] X[5] X[6] X[7] A Historical Perspective The Cooley and Tukey Fast Fourier Transform (FFT) algorithm is a turning point to the computation of DFT
More informationELEC 427 Final Project Area-Efficient FFT on FPGA
ELEC 427 Final Project Area-Efficient FFT on FPGA Hamed Rahmani-Mohammad Sadegh Riazi- Seyyed Mohammad Kazempour Introduction The aim of this project was to design a 16 point Discrete Time Fourier Transform
More informationHigh Performance Pipelined Design for FFT Processor based on FPGA
High Performance Pipelined Design for FFT Processor based on FPGA A.A. Raut 1, S. M. Kate 2 1 Sinhgad Institute of Technology, Lonavala, Pune University, India 2 Sinhgad Institute of Technology, Lonavala,
More informationINTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM
Course Outline Course Outline INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM Introduction Fast Fourier Transforms have revolutionized digital signal processing What is the FFT? A collection of tricks
More informationAssignment 3: Edge Detection
Assignment 3: Edge Detection - EE Affiliate I. INTRODUCTION This assignment looks at different techniques of detecting edges in an image. Edge detection is a fundamental tool in computer vision to analyse
More informationFFTC: Fastest Fourier Transform on the IBM Cell Broadband Engine. David A. Bader, Virat Agarwal
FFTC: Fastest Fourier Transform on the IBM Cell Broadband Engine David A. Bader, Virat Agarwal Cell System Features Heterogeneous multi-core system architecture Power Processor Element for control tasks
More informationInvestigation of Intel MIC for implementation of Fast Fourier Transform
Investigation of Intel MIC for implementation of Fast Fourier Transform Soren Goyal Department of Physics IIT Kanpur e-mail address: soren@iitk.ac.in The objective of the project was to run the code for
More information3.2 Cache Oblivious Algorithms
3.2 Cache Oblivious Algorithms Cache-Oblivious Algorithms by Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. In the 40th Annual Symposium on Foundations of Computer Science,
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More informationFourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)
Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) 1D: Common Transform Pairs Summary source FT Properties: Convolution See book DIP 4.2.5:
More informationENT 315 Medical Signal Processing CHAPTER 3 FAST FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 3 FAST FOURIER TRANSFORM Dr. Lim Chee Chin Outline Definition and Introduction FFT Properties of FFT Algorithm of FFT Decimate in Time (DIT) FFT Steps for radix
More informationFFT and Spectrum Analyzer
Objective: FFT and Spectrum Analyzer Understand the frequency domain and some of it's uses Understand the Discrete Fourier Transform Preparation: (i) PC and data acquisition system (ii)fft software Background:
More informationScience Panel Discussion presentation: "A Data Sharing Story"
University of Massachusetts Medical School escholarship@umms University of Massachusetts and New England Area Librarian e-science Symposium 2012 e-science Symposium Apr 4th, 10:45 AM - 11:15 AM Science
More informationFourier transform of images
Fourier transform of images Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 2014 2015 Extension to bidimensional domain The concepts
More informationFPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 2
FPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 2 Anurag Dwivedi Recap Verilog- Hardware Description Language Modules Combinational circuits assign statement Control statements Sequential
More informationModule 9 : Numerical Relaying II : DSP Perspective
Module 9 : Numerical Relaying II : DSP Perspective Lecture 36 : Fast Fourier Transform Objectives In this lecture, We will introduce Fast Fourier Transform (FFT). We will show equivalence between FFT and
More informationVedic Mathematics Based Floating Point Multiplier Implementation for 24 Bit FFT Computation
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p-ISSN: 2278-8735 PP 44-51 www.iosrjournals.org Vedic Mathematics Based Floating Point Multiplier Implementation
More informationParallel FFT Program Optimizations on Heterogeneous Computers
Parallel FFT Program Optimizations on Heterogeneous Computers Shuo Chen, Xiaoming Li Department of Electrical and Computer Engineering University of Delaware, Newark, DE 19716 Outline Part I: A Hybrid
More informationTOPICS PIPELINE IMPLEMENTATIONS OF THE FAST FOURIER TRANSFORM (FFT) DISCRETE FOURIER TRANSFORM (DFT) INVERSE DFT (IDFT) Consulted work:
1 PIPELINE IMPLEMENTATIONS OF THE FAST FOURIER TRANSFORM (FFT) Consulted work: Chiueh, T.D. and P.Y. Tsai, OFDM Baseband Receiver Design for Wireless Communications, John Wiley and Sons Asia, (2007). Second
More informationEE123 Digital Signal Processing
EE23 Digital Signal Processing Lecture 8 FFT II Lab based on slides by JM Kahn M Lustig, EECS UC Berkeley Announcements Last time: Started FFT Today Lab Finish FFT Read Ch 002 Midterm : Feb 22nd M Lustig,
More informationGPU Multiple Sequence Alignment Fourier-Space Cross-Correlation Alignment
GPU Multiple Sequence Alignment Fourier-Space Cross-Correlation Alignment Final Project Writeup EN.600.639 Prof. Ben Langmead Matthias Alexander Lee May 3, 2013 Abstract The aim of this project is to explore
More informationFatima Michael College of Engineering & Technology
DEPARTMENT OF ECE V SEMESTER ECE QUESTION BANK EC6502 PRINCIPLES OF DIGITAL SIGNAL PROCESSING UNIT I DISCRETE FOURIER TRANSFORM PART A 1. Obtain the circular convolution of the following sequences x(n)
More informationResearch Article International Journal of Emerging Research in Management &Technology ISSN: (Volume-6, Issue-8) Abstract:
International Journal of Emerging Research in Management &Technology Research Article August 27 Design and Implementation of Fast Fourier Transform (FFT) using VHDL Code Akarshika Singhal, Anjana Goen,
More information4.1, 4.2 Performance, with Sorting
1 4.1, 4.2 Performance, with Sorting Running Time As soon as an Analytic Engine exists, it will necessarily guide the future course of the science. Whenever any result is sought by its aid, the question
More informationFused Floating Point Arithmetic Unit for Radix 2 FFT Implementation
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 6, Issue 2, Ver. I (Mar. -Apr. 2016), PP 58-65 e-issn: 2319 4200, p-issn No. : 2319 4197 www.iosrjournals.org Fused Floating Point Arithmetic
More informationLecture 39. CSE 331 Dec 6, 2017
Lecture 39 CSE 331 Dec 6, 2017 Grading back on track Re-grading request deadlines Now relax 4 Randomized algorithms What is different? Algorithms can toss coins and make decisions A Representative Problem
More informationMULTIPLIERLESS HIGH PERFORMANCE FFT COMPUTATION
MULTIPLIERLESS HIGH PERFORMANCE FFT COMPUTATION Maheshwari.U 1, Josephine Sugan Priya. 2, 1 PG Student, Dept Of Communication Systems Engg, Idhaya Engg. College For Women, 2 Asst Prof, Dept Of Communication
More informationScheduling FFT Computation on SMP and Multicore Systems Ayaz Ali, Lennart Johnsson & Jaspal Subhlok
Scheduling FFT Computation on SMP and Multicore Systems Ayaz Ali, Lennart Johnsson & Jaspal Subhlok Texas Learning and Computation Center Department of Computer Science University of Houston Outline Motivation
More informationAn Adaptive Framework for Scientific Software Libraries. Ayaz Ali Lennart Johnsson Dept of Computer Science University of Houston
An Adaptive Framework for Scientific Software Libraries Ayaz Ali Lennart Johnsson Dept of Computer Science University of Houston Diversity of execution environments Growing complexity of modern microprocessors.
More informationThe Fast Fourier Transform Algorithm and Its Application in Digital Image Processing
The Fast Fourier Transform Algorithm and Its Application in Digital Image Processing S.Arunachalam(Associate Professor) Department of Mathematics, Rizvi College of Arts, Science & Commerce, Bandra (West),
More informationIntroduction to Sampled Signals and Fourier Transforms
Introduction to Sampled Signals and Fourier Transforms Physics116C, 4/28/06 D. Pellett References: Essick, Advanced LabVIEW Labs Press et al., Numerical Recipes, Ch. 12 Brigham, The Fast Fourier Transform
More informationParallel Fourier Transform A Practical Guide
Parallel Fourier Transform A Practical Guide Dhrubaditya Mitra Indian Institute of Science, Bangalore, 560012 Parallel Fourier Transform p.1/29 Outline Motivation Serial FFT Serial FFT : Basic Algorithm
More informationG N Ramachandran s Contributions to Medical Imaging
G N Ramachandran s Contributions to Medical Imaging Substance From Shadows Anil Kumar and Ashok Ajoy G N Ramachandran made several remarkable contributions to biophysics and structural biology over the
More informationAn evaluation of the Performance and Scalability of a Yellowstone Test-System in 5 Benchmarks
An evaluation of the Performance and Scalability of a Yellowstone Test-System in 5 Benchmarks WRF Model NASA Parallel Benchmark Intel MPI Bench My own personal benchmark HPC Challenge Benchmark Abstract
More informationRadiance Photography. Todor Georgiev Adobe Systems. Andrew Lumsdaine Indiana University
Radiance Photography Todor Georgiev Adobe Systems Andrew Lumsdaine Indiana University Course Goals Overview of radiance (aka lightfield) photography Mathematical treatment of theory and computation Hands
More informationDigital Signal Processing Lecture Notes 22 November 2010
Digital Signal Processing Lecture otes 22 ovember 2 Topics: Discrete Cosine Transform FFT Linear and Circular Convolution Rate Conversion Includes review of Fourier transforms, properties of Fourier transforms,
More informationDigital Image Processing. Image Enhancement in the Frequency Domain
Digital Image Processing Image Enhancement in the Frequency Domain Topics Frequency Domain Enhancements Fourier Transform Convolution High Pass Filtering in Frequency Domain Low Pass Filtering in Frequency
More informationWhy can you be sure that the second number in the ordered pairs for this data is always greater than or equal to the first?
Algebra II A Guided Notes Name 2-1 Guided Notes Period Relations and Functions Learning Matrix Goal #1: I can identify x & y intercepts in a graph or a set of ordered pairs. Learning Matrix Goal #2: I
More informationAudio-coding standards
Audio-coding standards The goal is to provide CD-quality audio over telecommunications networks. Almost all CD audio coders are based on the so-called psychoacoustic model of the human auditory system.
More informationModified Welch Power Spectral Density Computation with Fast Fourier Transform
Modified Welch Power Spectral Density Computation with Fast Fourier Transform Sreelekha S 1, Sabi S 2 1 Department of Electronics and Communication, Sree Budha College of Engineering, Kerala, India 2 Professor,
More informationEnergy Optimizations for FPGA-based 2-D FFT Architecture
Energy Optimizations for FPGA-based 2-D FFT Architecture Ren Chen and Viktor K. Prasanna Ming Hsieh Department of Electrical Engineering University of Southern California Ganges.usc.edu/wiki/TAPAS Outline
More informationAUDIO. Henning Schulzrinne Dept. of Computer Science Columbia University Spring 2015
AUDIO Henning Schulzrinne Dept. of Computer Science Columbia University Spring 2015 Key objectives How do humans generate and process sound? How does digital sound work? How fast do I have to sample audio?
More informationCommunication Technologies for Smart Objects
Ubiquitous Computing Seminar FS2014 29.04.2014 Communication Technologies for Smart Objects Speaker Supervisor Dominik Kovacs Matthias Kovatsch An Internet of Things In the next century, planet earth will
More informationAbstract. Literature Survey. Introduction. A.Radix-2/8 FFT algorithm for length qx2 m DFTs
Implementation of Split Radix algorithm for length 6 m DFT using VLSI J.Nancy, PG Scholar,PSNA College of Engineering and Technology; S.Bharath,Assistant Professor,PSNA College of Engineering and Technology;J.Wilson,Assistant
More informationDigital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
More informationSimple and Practical Algorithm for the Sparse Fourier Transform
Simple and Practical Algorithm for the Sparse Fourier Transform Haitham Hassanieh Piotr Indyk Dina Katabi Eric Price MIT 2012-01-19 Hassanieh, Indyk, Katabi, and Price (MIT) Simple and Practical Algorithm
More informationYves Nievergelt. Wavelets Made Easy. Springer Science+Business Media, LLC
Wavelets Made Easy Yves Nievergelt Wavelets Made Easy Springer Science+Business Media, LLC Yves Nievergelt Department of Mathematics Eastem Washington University Cheney, WA 99004-2431 USA Library of Congress
More information4.1 Performance Analysis
4.1 Performance Analysis Running Time As soon as an Analytic Engine exists, it will necessarily guide the future course of the science. Whenever any result is sought by its aid, the question will arise
More informationVHDL IMPLEMENTATION OF A FLEXIBLE AND SYNTHESIZABLE FFT PROCESSOR
VHDL IMPLEMENTATION OF A FLEXIBLE AND SYNTHESIZABLE FFT PROCESSOR 1 Gatla Srinivas, 2 P.Masthanaiah, 3 P.Veeranath, 4 R.Durga Gopal, 1,2[ M.Tech], 3 Associate Professor, J.B.R E.C, 4 Associate Professor,
More informationFilterbanks and transforms
Filterbanks and transforms Sources: Zölzer, Digital audio signal processing, Wiley & Sons. Saramäki, Multirate signal processing, TUT course. Filterbanks! Introduction! Critical sampling, half-band filter!
More informationSampling functions and sparse reconstruction methods
Sampling functions and sparse reconstruction methods Mostafa Naghizadeh and Mauricio Sacchi Signal Analysis and Imaging Group Department of Physics, University of Alberta EAGE 2008 Rome, Italy Outlines:
More informationFiber Fourier optics
Final version printed as of 4/7/00 Accepted for publication in Optics Letters Fiber Fourier optics A. E. Siegman Ginzton Laboratory, Stanford University, Stanford, California 94305 Received The Fourier
More informationA Texture Feature Extraction Technique Using 2D-DFT and Hamming Distance
A Texture Feature Extraction Technique Using 2D-DFT and Hamming Distance Author Tao, Yu, Muthukkumarasamy, Vallipuram, Verma, Brijesh, Blumenstein, Michael Published 2003 Conference Title Fifth International
More informationMath 225 Scientific Computing II Outline of Lectures
Math 225 Scientific Computing II Outline of Lectures Spring Semester 2003 I. Interpolating polynomials Lagrange formulation of interpolating polynomial Uniqueness of interpolating polynomial of degree
More informationCase study of Wireless Technologies in Industrial Applications
International Journal of Scientific and Research Publications, Volume 7, Issue 1, January 2017 257 Case study of Wireless Technologies in Industrial Applications Rahul Hanumanth Rao Computer Information
More informationA SIMD Vectorizing Compiler for Digital Signal Processing Algorithms Λ
A SIMD Vectorizing Compiler for Digital Signal Processing Algorithms Λ Franz Franchetti Applied and Numerical Mathematics Technical University of Vienna, Austria franz.franchetti@tuwien.ac.at Markus Püschel
More informationFormal Loop Merging for Signal Transforms
Formal Loop Merging for Signal Transforms Franz Franchetti Yevgen S. Voronenko Markus Püschel Department of Electrical & Computer Engineering Carnegie Mellon University This work was supported by NSF through
More informationMODERN FORTRAN MODERN FORTRAN MODERN FORTRAN PDF FORTRAN - WIKIPEDIA PRODUCTS PAGE THE FORTRAN COMPANY 1 / 5
PDF FORTRAN - WIKIPEDIA PRODUCTS PAGE THE FORTRAN COMPANY 1 / 5 2 / 5 3 / 5 modern fortran pdf Naming. The names of earlier versions of the language through FORTRAN 77 were conventionally spelled in all-capitals
More informationFAULT DETECTION AND ISOLATION USING SPECTRAL ANALYSIS. Eugen Iancu
FAULT DETECTION AND ISOLATION USING SPECTRAL ANALYSIS Eugen Iancu Automation and Mechatronics Department University of Craiova Eugen.Iancu@automation.ucv.ro Abstract: In this work, spectral signal analyses
More informationANALYSIS OF FREQUENCY RECOGNITION ALGORITHMS AND IMPLEMENTATION IN REAL TIME MASTER OF SCIENCE
ANALYSIS OF FREQUENCY RECOGNITION ALGORITHMS AND IMPLEMENTATION IN REAL TIME A Dissertation Submitted In Partial Fulfilment Of The Requirements For The Degree Of MASTER OF SCIENCE In NETWORK CENTRED COMPUTING,
More informationProject Kickoff CS/EE 217. GPU Architecture and Parallel Programming
CS/EE 217 GPU Architecture and Parallel Programming Project Kickoff David Kirk/NVIDIA and Wen-mei W. Hwu, 2007-2012 University of Illinois, Urbana-Champaign! 1 Two flavors Application Implement/optimize
More information18th World Conference on Nondestructive Testing, April 2012, Durban, South Africa
18th World Conference on Nondestructive Testing, 16-0 April 01, Durban, South Africa Acoustic Resonance Testing Using Transform Decomposition and Support Vector Machines for efficient and accurate Detection
More informationDigital Signal Processing with Field Programmable Gate Arrays
Uwe Meyer-Baese Digital Signal Processing with Field Programmable Gate Arrays Third Edition With 359 Figures and 98 Tables Book with CD-ROM ei Springer Contents Preface Preface to Second Edition Preface
More informationFPGA Based Design and Simulation of 32- Point FFT Through Radix-2 DIT Algorith
FPGA Based Design and Simulation of 32- Point FFT Through Radix-2 DIT Algorith Sudhanshu Mohan Khare M.Tech (perusing), Dept. of ECE Laxmi Naraian College of Technology, Bhopal, India M. Zahid Alam Associate
More informationGEMINI GEneric Multimedia INdexIng
GEMINI GEneric Multimedia INdexIng GEneric Multimedia INdexIng distance measure Sub-pattern Match quick and dirty test Lower bounding lemma 1-D Time Sequences Color histograms Color auto-correlogram Shapes
More informationHow to Write Fast Code , spring st Lecture, Jan. 14 th
How to Write Fast Code 18-645, spring 2008 1 st Lecture, Jan. 14 th Instructor: Markus Püschel TAs: Srinivas Chellappa (Vas) and Frédéric de Mesmay (Fred) Today Motivation and idea behind this course Technicalities
More informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Review of Motion Modelling and Estimation Introduction to Motion Modelling & Estimation Forward Motion Backward Motion Block Motion Estimation Motion
More informationPit Pattern Classification of Zoom-Endoscopic Colon Images using D
Pit Pattern Classification of Zoom-Endoscopic Colon Images using DCT and FFT Leonhard Brunauer Hannes Payer Robert Resch Department of Computer Science University of Salzburg February 1, 2007 Outline 1
More informationStudy and implementation of computational methods for Differential Equations in heterogeneous systems. Asimina Vouronikoy - Eleni Zisiou
Study and implementation of computational methods for Differential Equations in heterogeneous systems Asimina Vouronikoy - Eleni Zisiou Outline Introduction Review of related work Cyclic Reduction Algorithm
More informationHigh-Performance Scientific Computing
High-Performance Scientific Computing Instructor: Randy LeVeque TA: Grady Lemoine Applied Mathematics 483/583, Spring 2011 http://www.amath.washington.edu/~rjl/am583 World s fastest computers http://top500.org
More informationCoordinate Mapping Between an Acoustic and Visual Sensor Network in the Shape Domain for a Joint Self-Calibrating Speaker Tracking
Coordinate Mapping Between an Acoustic and Visual Sensor Network in the Shape Domain for a Joint Self-Calibrating Speaker Tracking Florian Jacob and Reinhold Haeb-Umbach Department of Communications Engineering
More informationEvaluating MMX Technology Using DSP and Multimedia Applications
Evaluating MMX Technology Using DSP and Multimedia Applications Ravi Bhargava * Lizy K. John * Brian L. Evans Ramesh Radhakrishnan * November 22, 1999 The University of Texas at Austin Department of Electrical
More information4. Image Retrieval using Transformed Image Content
4. Image Retrieval using Transformed Image Content The desire of better and faster retrieval techniques has always fuelled to the research in content based image retrieval (CBIR). A class of unitary matrices
More informationKanto Audio Player Design
Kanto Audio Player Design David Benedetto djb2167, Kavita Jain Cocks kj2264, Amrita Mazumdar am3210 Zhehao Mao zm2169, Darien Nurse don2102, Jonathan Yu jy2432 Project Overview: Our project will be an
More informationDigital Processing of Synthetic Aperture Radar Data
Digital Processing of Synthetic Aperture Radar Data Algorithms and Implementation Ian G. Cumming Frank H. Wong ARTECH HOUSE BOSTON LONDON artechhouse.com Contents Foreword Preface Acknowledgments xix xxiii
More informationDIGITAL VS. ANALOG SIGNAL PROCESSING Digital signal processing (DSP) characterized by: OUTLINE APPLICATIONS OF DIGITAL SIGNAL PROCESSING
1 DSP applications DSP platforms The synthesis problem Models of computation OUTLINE 2 DIGITAL VS. ANALOG SIGNAL PROCESSING Digital signal processing (DSP) characterized by: Time-discrete representation
More informationBuilding More Efficient Time Parallel Solvers with Applications to Multiscale Modeling and Gyrokinetics
Building More Efficient Time Parallel Solvers with Applications to Multiscale Modeling and Gyrokinetics January 2015 Carl D Lederman AFTC/PA clearance No. 15008, 16 January 2014 1 The Differential Equation
More informationImage Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi
Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi 1. Introduction The choice of a particular transform in a given application depends on the amount of
More informationKNOWLEDGE DISCOVERY AND DATA MINING
KNOWLEDGE DISCOVERY AND DATA MINING Prof. Fabio A. Schreiber Dipartimento di Elettronica e Informazione Politecnico di Milano INFORMATION MANAGEMENT TECHNOLOGIES DATA WAREHOUSE DECISION SUPPORT SYSTEMS
More informationCS490D: Introduction to Data Mining Prof. Chris Clifton
CS490D: Introduction to Data Mining Prof. Chris Clifton April 5, 2004 Mining of Time Series Data Time-series database Mining Time-Series and Sequence Data Consists of sequences of values or events changing
More informationAudio-coding standards
Audio-coding standards The goal is to provide CD-quality audio over telecommunications networks. Almost all CD audio coders are based on the so-called psychoacoustic model of the human auditory system.
More informationChapter 1. Digital Data Representation and Communication. Part 2
Chapter 1. Digital Data Representation and Communication Part 2 Compression Digital media files are usually very large, and they need to be made smaller compressed Without compression Won t have storage
More informationPhoto-realistic Renderings for Machines Seong-heum Kim
Photo-realistic Renderings for Machines 20105034 Seong-heum Kim CS580 Student Presentations 2016.04.28 Photo-realistic Renderings for Machines Scene radiances Model descriptions (Light, Shape, Material,
More informationThe Fastest Fourier Transform in the West
: The Fastest Fourier Transform in the West Steven G. ohnson, MIT Applied Mathematics Matteo Frigo, Cilk Arts Inc. In the beginning (c. 1805): Carl Friedrich Gauss declination angle ( ) 30 25 20 15 10
More informationCOMPUTERIZED OFFICE MANAGEMENT
COMPUTERIZED OFFICE MANAGEMENT Module 1 (COMPUTER FUNDAMENTALS) COMPUTER FUNDAMENTALS : INTRODUCTION : The term computer is derived from the Latin word compute which means to calculate. Computer is a fast
More informationEnergy Efficient Adaptive Beamforming on Sensor Networks
Energy Efficient Adaptive Beamforming on Sensor Networks Viktor K. Prasanna Bhargava Gundala, Mitali Singh Dept. of EE-Systems University of Southern California email: prasanna@usc.edu http://ceng.usc.edu/~prasanna
More informationA Kernel-independent Adaptive Fast Multipole Method
A Kernel-independent Adaptive Fast Multipole Method Lexing Ying Caltech Joint work with George Biros and Denis Zorin Problem Statement Given G an elliptic PDE kernel, e.g. {x i } points in {φ i } charges
More informationCS 112 Introduction to Programming
Running Time CS 112 Introduction to Programming As soon as an Analytic Engine exists, it will necessarily guide the future course of the science. Whenever any result is sought by its aid, the question
More informationFourier Transformation Methods in the Field of Gamma Spectrometry
International Journal of Pure and Applied Physics ISSN 0973-1776 Volume 3 Number 1 (2007) pp. 132 141 Research India Publications http://www.ripublication.com/ijpap.htm Fourier Transformation Methods in
More informationFFT. There are many ways to decompose an FFT [Rabiner and Gold] The simplest ones are radix-2 Computation made up of radix-2 butterflies X = A + BW
FFT There are many ways to decompose an FFT [Rabiner and Gold] The simplest ones are radix-2 Computation made up of radix-2 butterflies A X = A + BW B Y = A BW B. Baas 442 FFT Dataflow Diagram Dataflow
More informationRunning Time. Analytic Engine. Charles Babbage (1864) how many times do you have to turn the crank?
4.1 Performance Introduction to Programming in Java: An Interdisciplinary Approach Robert Sedgewick and Kevin Wayne Copyright 2008 March 30, 2009 7:37 tt Running Time As soon as an Analytic Engine exists,
More informationComputer Generation of IP Cores
A I n Computer Generation of IP Cores Peter Milder (ECE, Carnegie Mellon) James Hoe (ECE, Carnegie Mellon) Markus Püschel (CS, ETH Zürich) addfxp #(16, 1) add15282(.a(a69),.b(a70),.clk(clk),.q(t45)); addfxp
More informationParallel Implementations of Gaussian Elimination
s of Western Michigan University vasilije.perovic@wmich.edu January 27, 2012 CS 6260: in Parallel Linear systems of equations General form of a linear system of equations is given by a 11 x 1 + + a 1n
More informationHigh School Science Acid and Base Concentrations (ph and poh) Lesson Objective: Subobjective 1: Subobjective 2: Subobjective 3: Subobjective 4:
High School Science Acid and Base Concentrations (ph and poh) Lesson Objective: The student will determine acid and base concentrations. Subobjective 1: The student will use the ph scale to characterize
More informationBig Data - Some Words BIG DATA 8/31/2017. Introduction
BIG DATA Introduction Big Data - Some Words Connectivity Social Medias Share information Interactivity People Business Data Data mining Text mining Business Intelligence 1 What is Big Data Big Data means
More informationComputing the Discrete Fourier Transform on FPGA Based Systolic Arrays
Computing the Discrete Fourier Transform on FPGA Based Systolic Arrays Chris Dick School of Electronic Engineering La Trobe University Melbourne 3083, Australia Abstract Reconfigurable logic arrays allow
More informationX-ray tomography. X-ray tomography. Applications in Science. X-Rays. Notes. Notes. Notes. Notes
X-ray tomography Important application of the Fast Fourier transform: X-ray tomography. Also referred to as CAT scan (Computerized Axial Tomography) X-ray tomography This has revolutionized medical diagnosis.
More informationTexture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation
Texture Outline Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation 1 Image Representation The standard basis for images is the set
More informationBecause of the good performance of vocoder and the potential
FINAL REVIEW ABOUT APPLIED FFT APPROACH IN PHASE VOCODER TO ACHIEVE TIME/PITCH SCALING Digital Audio Systems, DESC9115, 2018 Graduate Program in Audio and Acoustics Sydney School of Architecture, Design
More information