000=0 001=1 010=2 011=3 100=4 101=5 110=6 111=7 000=0 100=4 010=2 110=6 001=1 101=5 011=3 111=7
|
|
- Reynold Wilkinson
- 5 years ago
- Views:
Transcription
1 8 CHAPTER : Fourier Series The second idea behind the FFT concerns how to get the correct h k s into the final DFT s of size. If the subscripts to 7 of the h k s are written in binary form, as shown in first row of the following table, and the bits are reversed, as shown in the second row, then we get the correct ordering of the subscripts of the h k s. = = = = = =5 =6 =7 = = = =6 = =5 = =7 On the next page is a subroutine, FFT, written in Visual Basic and based on one given in umerical Recipes by Press, Flannery, Teukolsky and Vetterling that implements the FFT. The input quantities to FFT are: ISign, normally set to, is the sign in the exponential of Eq. (.88). If ISign is set to, the routine calculates the inverse transform (.9) except that it does not multiply by the factor l/. You have to do that yourself. The number of data points,. The array, Data, of length. Upon entry it contains the h k s. The reason its length is rather than is that the h k s can be complex numbers. The part of each number is stored first, then the complex part as shown in Fig..5 (a). If the h k s are then the inary elements are simply set to zero. The only output quantity from FFT is the array Data, which now contains the H n s. These are also usually complex so again the part of each H n is stored first, then the complex part. ote carefully which frequency is stored at which location. The order is shown in Fig..5(b). It is exactly the same order as in Fig.., namely DC first, then positive frequencies from lowest to highest, then negative frequencies from most negative to least negative. time t = index k = t = t = ( ) t = ( ) k = k = k= (a) part stored in frequency f = index n = f = n = f n f n f n f = n= part (b) stored in DC component positive frequencies more positive negative frequencies more negative yquist frequency (most positive and most negative) Figure.5 (a) Upon entry to routine FFT, the array Data holds the hk s. The hk s are generally complex numbers. The part is stored first then the inary part. (b) Upon exit from routine FFT, array Data holds the Hn s. They are also complex. Their order is: DC, then positive frequencies, then negative; the same as in Fig...
2 CHAPTER : Fourier Series 8 Sub FFT(Data() As Double, As Integer, ISign As Integer) Const Pi = Dim I As Integer, IStep As Integer, J As Integer, M As Integer, MMax As Integer Dim As Integer, TempI As Double, TempR As Double, WTemp As Double Dim Theta As Double, WI As Double, WPI As Double, WR As Double, WPR As Double = * J = For I = To Step If J > I Then TempR = Data(J) TempI = Data(J + ) Data(J) = Data(I) Data(J + ) = Data(I + ) Data(I) = TempR Data(I + ) = TempI 'This is the bit-reversal section of the routine. 'Exchange the two complex numbers. M = : If M >= And J > M Then J = J - M M = M / GoTo J = J + M ext I MMax = 'This is the FFT splitting-in-two section of the routine. : If > MMax Then 'This outer loop is executed log() times. IStep = * MMax Theta = * Pi / (ISign * MMax) 'Initialize for the trigonometric recurrence. WPR = - * Sin(.5 * Theta) ^ WPI = Sin(Theta) WR = 'WR and WI are and inary parts of W WI = 'raised to a power. For M = To MMax Step 'Here are the two nested inner loops. For I = M To Step IStep J = I + MMax TempR = WR * Data(J) - WI * Data(J + ) TempI = WR * Data(J + ) + WI * Data(J) Data(J) = Data(I) - TempR Data(J + ) = Data(I + ) - TempI Data(I) = Data(I) + TempR Data(I + ) = Data(I + ) + TempI ext I WTemp = WR 'Trigonometric recurrence for W raised to a new power. WR = WR * WPR - WI * WPI + WR WI = WI * WPR + WTemp * WPI + WI ext M MMax = IStep GoTo End Sub
3 8 CHAPTER : Fourier Series Example.5: (a) Write an Excel macro that uses the FFT subroutine listed on the previous page to approximate the Fourier transform of the function t ht e cos6 t. ote that in Example. we found its exact Fourier transform. This example will illustrate the similarities and differences between the discrete Fourier transform (calculated here) and the continuous Fourier transform (calculated there). (b) Suppose that h(t) is the current flowing in a resistor. Use the FFT to approximate the total energy dissipated in the resistor and the energy at each frequency (i.e. the power spectrum). Solution: Here is a subroutine, Wrapper, written in Visual Basic, that sets up the h k s, then calls FFT, and then prints the H n s to an Excel spreadsheet. There is also a function, Waveform, which is the function to be Fourier transformed. Public Sub Wrapper() Const ISign = Const = '[] The number of sample points. Const DeltaT = / Const Midpt = / 'To achieve even or odd symmetry it is Dim Data() As Double 'useful to put t= at Midpt index point. ReDim Data( To * ) Dim K As Integer, Time As Double, Energy As Double, EngyT As Double, EngyF As Double For K = To - Time = -(K - Midpt) * DeltaT '[] ote t= when k=midpt Data( * K + ) = Waveform(Time) '[] Set up Re{hk}, the waveform. Data( * K + ) = 'Set up Im{hk}, all zeros. Cells(K +, ) = K 'Print the index k in col of worksheet. Cells(K +, ) = Data( * K + ) 'Print hk in col. EngyT = EngyT + Data( * K + ) ^ * DeltaT 'Sum up Energy over all times. ext K Call FFT(Data,, ISign) 'DO THE FFT. For K = To - Cells(K +, ) = Data( * K + ) 'Print Re{Hn} in col. Cells(K +, ) = Data( * K + ) 'Print Im{Hn} in col. ext K EngyF = (Data() ^ + Data() ^ ) * DeltaT / 'Calculate the energy in the DC term. Cells(, 5) = EngyF 'Print DC energy in col 5. Energy = (Data( + ) ^ + Data( + ) ^ ) * DeltaT / Cells( / +, 5) = Energy EngyF = EngyF + Energy 'Calculate energy at yquist freq. 'Print energy at yquist freq. For K = To / - 'Calculate energy at all other frequencies. Energy = (Data( * K + ) ^ + Data( * K + ) ^ _ + Data( * ( - K) + ) ^ + Data( * ( - K) + ) ^ ) *DeltaT / Cells(K +, 5) = Energy 'Print energy at all other frequencies. EngyF = EngyF + Energy 'Sum up energy over all frequencies. ext K End Sub Function Waveform(T) Const Pi = Waveform = Exp(- * T ^ ) * Cos(6 * Pi * T) End Function 'The waveform to be transformed.
4 CHAPTER : Fourier Series 8 Copy FFT, Wrapper and Waveform into an Excel module (see the instructions on page 8 on how to do this). Because Wrapper is declared public it appears in the list of macros that can be run in Excel. Run it. It prints 5 columns of numbers into a spreadsheet: Column lists the index number k (or n). The number of data points is presently set to = (in the line labelled [] in Wrapper), so this column contains the numbers to. Column lists the parts of the h k s. (The inary parts are zero and so not listed.) These values are calculated in line []. Line [] is the connection between time t and the index k (compare with Eq. (.85)). It causes time t = to occur at index point k = 6 and the time interval between samples to be =. ote that if the h k s have even symmetry about the mid-index k = 6 (which is the case presently) then the H n s will be (i.e. the inary part of the Fourier transform will be zero). A scatter plot of column vs. column is shown in Fig..6. (ote that the points are the h k s and the curve is just a visual aid to help see the oscillations.) Compare it with Fig h k Figure.6 The points are a plot of hk, k=,,. The curve is a visual aid to help see the oscillations Column lists the parts of the H n s (the output from FFT). A scatter plot of column vs. column is shown in Fig..7. It is interesting to compare it to Fig..8 which is the exact Fourier transform. 8 Figure.7 The part of Hn, n=,,. Again the curve is just a visual aid. 6 H n Column lists the inary parts of the H n s. They are presently all zero. However if line [] in Wrapper is changed to Data( * K + ) = Waveform(Time /) then the waveform is shifted one index point to the right, the even symmetry is lost, and the inary parts of the H n s become non-zero. This is very similar to what we saw on page 57, namely shifting a triangle waveform horizontally changed its Fourier series from cosines into sines. Here the parts change into inary parts. Column 5 lists the energy spectrum, which is similar to the power spectrum for periodic waveforms. It is explained in more detail below. A plot of column 5 vs. column is shown in Fig Figure.8 The energy spectrum for n=,, energy spectrum.5 8 6
5 8 CHAPTER : Fourier Series Some background on the energy spectrum. Suppose that t ht e cos6 t is a current in amperes flowing through a resistor. The instantaneous power is pt ht () Rand integrating this over all time gives the total energy, E, in joules dissipated in the resistor. t cos6.68. (.95) E h t dt e t dt (This answer was gotten using Simpson s rule) otice that it doesn t make sense to talk about the average power as we did in Chapter 6, Section 7, because here the period is infinite (the function never repeats) and the average power is zero. The discrete analog of (.95) is k k k k E h t dt h h (.96) We can check the accuracy of this approximation by using the SUMSQ function in Excel to sum the squares of the numbers in column, giving.6, and then multiplying by =. To sig. figs. this gives the same value as the Simpson integration did, namely.68. Using Parseval s theorem, (.9), the total energy can also be expressed as a summation over frequencies. Hn n E (.97) There are two important points when applying (.97) to get the energy spectrum (the distribution of energy among the frequencies): Unlike the h k s, the H n s are generally complex numbers and for any complex number, a bj, absolute value means abj a b. Thus, for example, to get E, the energy in the DC component, we have to use these elements of the array Data (see Fig..5(b)): E H Data Data and to get E /, the energy at the yquist frequency, we have to use these elements: E/ H/ Data Data All frequencies other than the DC and the yquist frequency have both positive and negative frequency components that should be counted together. For example the energy in the lowest frequency, f, is E H H Data Data Data Data The other values in column 5 are gotten the same way. otice that the energy spectrum is peaked at n = 8. The corresponding frequency, according to Eq. (.86), is f n 8.
The discrete Fourier transform
3 The discrete Fourier transform Page 1 3.1 Introduction Let f(t) be a function describing a physical process in the time domain. An equivalent representation of the process, F (ν), is possible in the
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationThe Fourier Transform (and more )
The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider
More informationCHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L
CHAPTER 4 FOURIER SERIES 1 S A B A R I N A I S M A I L Outline Introduction of the Fourier series. The properties of the Fourier series. Symmetry consideration Application of the Fourier series to circuit
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More information3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series
Definition 1 Fourier Series A function f is said to be piecewise continuous on [a, b] if there exists finitely many points a = x 1 < x 2
More informationFourier Series and Fourier Transforms
Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3 Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic
More informationMohammad Farshi Department of Computer Science Yazd University. Computer Science Theory. (Master Course) Yazd Univ.
Computer Science Theory (Master Course) and and Mohammad Farshi Department of Computer Science Yazd University 1395-1 1 / 29 Computability theory is based on a specific programming language L. Assumptions
More information12.1 Fourier Transform of Discretely Sampled Data
494 Chapter 12. Fast Fourier Transform now is: The PSD-per-unit-time converges to finite values at all frequencies except those where h(t) has a discrete sine-wave (or cosine-wave) component of finite
More informationChapter 4 Sequences and Series
Chapter 4 Sequences and Series 4.1 Sequence Review Sequence: a set of elements (numbers or letters or a combination of both). The elements of the set all follow the same rule (logical progression). The
More informationFourier Transform for Continuous Functions
Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum
More informationV(t) = Total Power = Calculating the Power Spectral Density (PSD) in IDL. Thomas Ferree, Ph.D. August 23, 1999
Calculating the Power Spectral Density (PSD) in IDL Thomas Ferree, Ph.D. August 23, 1999 This note outlines the calculation of power spectra via the fast Fourier transform (FFT) algorithm. There are several
More informationFundamentals of the DFT (fft) Algorithms
Fundamentals of the DFT (fft) Algorithms D. Sundararajan November 6, 9 Contents 1 The PM DIF DFT Algorithm 1.1 Half-wave symmetry of periodic waveforms.............. 1. The DFT definition and the half-wave
More informationCS 6604: Data Mining Large Networks and Time-series. B. Aditya Prakash Lecture #12: Time Series Mining
CS 6604: Data Mining Large Networks and Time-series B. Aditya Prakash Lecture #12: Time Series Mining Pa
More information(Refer Slide Time: 01:30)
Networks and Systems Prof V.G K.Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 11 Fourier Series (5) Continuing our discussion of Fourier series today, we will
More informationNetworks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10)
Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10) What we have seen in the previous lectures, is first
More informationa n cos 2πnt L n=1 {1/2, cos2π/l, cos 4π/L, cos6π/l,...,sin 2π/L, sin 4π/L, sin 6π/L,...,} (2)
Note Fourier. 30 January 2007 (as 23.II..tex) and 20 October 2009 in this form. Fourier Analysis The Fourier series First some terminology: a function f(t) is periodic if f(t + ) = f(t) for all t for some,
More informationAs we know, the three basic trigonometric functions are as follows: Figure 1
Trigonometry Basic Functions As we know, the three basic trigonometric functions are as follows: sin θ = cos θ = opposite hypotenuse adjacent hypotenuse tan θ = opposite adjacent Where θ represents an
More informationEXP. NO. 3 Power on (resistive inductive & capacitive) load Series connection
OBJECT: To examine the power distribution on (R, L, C) series circuit. APPARATUS 1-signal function generator 2- Oscilloscope, A.V.O meter 3- Resisters & inductor &capacitor THEORY the following form for
More informationThe Rayleigh Pulse Forming Network
The Rayleigh Pulse Forming Network The ideal power supply for many high current applications is one which supplies a square voltage wave over a short, but predetermined, time. Since these applications
More informationHomework #1 Solution
February 7, 4 Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 734 VLSI Array Structures for Digital Signal Processing Homework # Solution Due: February 6, 4 in class.
More informationLab Fourier Analysis Do prelab before lab starts. PHSX 262 Spring 2011 Lecture 5 Page 1. Based with permission on lectures by John Getty
Today /5/ Lecture 5 Fourier Series Time-Frequency Decomposition/Superposition Fourier Components (Ex. Square wave) Filtering Spectrum Analysis Windowing Fast Fourier Transform Sweep Frequency Analyzer
More informationω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the
he ime-frequency Concept []. Review of Fourier Series Consider the following set of time functions {3A sin t, A sin t}. We can represent these functions in different ways by plotting the amplitude versus
More informationThe Discrete Fourier transform
453.70 Linear Systems, S.M. Tan, The University of uckland 9- Chapter 9 The Discrete Fourier transform 9. DeÞnition When computing spectra on a computer it is not possible to carry out the integrals involved
More information12. Introduction and Chapter Objectives
Real Analog - Circuits 1 Chapter 1: Steady-State Sinusoidal Power 1. Introduction and Chapter Objectives In this chapter we will address the issue of power transmission via sinusoidal or AC) signals. This
More informationThe Discrete Fourier Transform
The Discrete Fourier Transform / 23 The Fourier Transform Any discrete time series exponentials: can be built up of a sum of complex = X m e i2πmn/, n = 0,, m=0 = [ + + + + ]. X 0 X e i2πn (/) X 2 e i2πn
More informationFig. 1: Fourier series Examples
FOURIER SERIES AND ITS SOME APPLICATIONS P. Sathyabama Assistant Professor, Department of Mathematics, Bharath collage of Science and Management, Thanjavur, Tamilnadu Abstract: The Fourier series, the
More informationModule 1: Analyzing the Efficiency of Algorithms
Module 1: Analyzing the Efficiency of Algorithms Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu What is an Algorithm?
More informationDiscrete Fourier transform
Discrete Fourier transform Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ January 2, 216 Signal
More informationPrime coordinates on a modulo map, and sine representation. Diego Alonso Cortez Abstract
Prime coordinates on a modulo map, and sine representation Diego Alonso Cortez diego_cortez@mckinsey.com Abstract We compute the primes up to 1 million by starting an arithmetic progression at every positive
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 018 30 Lecture 30 April 7, 018 Fourier Series In this lecture,
More informationSome of the different forms of a signal, obtained by transformations, are shown in the figure. jwt e z. jwt z e
Transform methods Some of the different forms of a signal, obtained by transformations, are shown in the figure. X(s) X(t) L - L F - F jw s s jw X(jw) X*(t) F - F X*(jw) jwt e z jwt z e X(nT) Z - Z X(z)
More informationComputer Problems for Fourier Series and Transforms
Computer Problems for Fourier Series and Transforms 1. Square waves are frequently used in electronics and signal processing. An example is shown below. 1 π < x < 0 1 0 < x < π y(x) = 1 π < x < 2π... and
More informationFOURIER SERIES. Chapter Introduction
Chapter 1 FOURIER SERIES 1.1 Introduction Fourier series introduced by a French physicist Joseph Fourier (1768-1830), is a mathematical tool that converts some specific periodic signals into everlasting
More informationR Function Tutorial in Module 8.2
R Function Tutorial in Module 8.2 Introduction to Computational Science: Modeling and Simulation for the Sciences, 2 nd Edition Angela B. Shiflet and George W. Shiflet Wofford College 2014 by Princeton
More informationNAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt):
CS 170 First Midterm 26 Feb 2010 NAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt): Instructions: This is a closed book, closed calculator,
More informationFigure 12.1: A simple pendulum
Chapter 12 A Simple Pendulum by Brian Patterson In this module you will use DIYModeling to build a simulation of a simple pendulum. The basic ideas can be extended to other types of pendulums, such as
More informationFrequency-domain representation of discrete-time signals
4 Frequency-domain representation of discrete-time signals So far we have been looing at signals as a function of time or an index in time. Just lie continuous-time signals, we can view a time signal as
More informationPHYS 301 HOMEWORK #5
PHY 3 HOMEWORK #5 olutions On this homework assignment, you may use Mathematica to compute integrals, but you must submit your Mathematica output with your assignment.. For f x = -, - < x
More informationInformation and Communications Security: Encryption and Information Hiding
Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 5: Signal Analysis Contents The complex exponential The complex
More informationAlgebra II. Key Resources: Page 3
Algebra II Course This course includes the study of a variety of functions (linear, quadratic higher order polynomials, exponential, absolute value, logarithmic and rational) learning to graph, compare,
More informationUNIT 1. SIGNALS AND SYSTEM
Page no: 1 UNIT 1. SIGNALS AND SYSTEM INTRODUCTION A SIGNAL is defined as any physical quantity that changes with time, distance, speed, position, pressure, temperature or some other quantity. A SIGNAL
More informationDOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS
DOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS Ian Cooper School of Physics, University of Sydney ian.cooper@sydney.edu.au DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS maths_ft_01.m mscript used
More informationAugust 7, 2007 NUMERICAL SOLUTION OF LAPLACE'S EQUATION
August 7, 007 NUMERICAL SOLUTION OF LAPLACE'S EQUATION PURPOSE: This experiment illustrates the numerical solution of Laplace's Equation using a relaxation method. The results of the relaxation method
More informationDesigning Information Devices and Systems I Fall 2017 Official Lecture Notes Note 2
EECS 6A Designing Information Devices and Systems I Fall 07 Official Lecture Notes Note Introduction Previously, we introduced vectors and matrices as a way of writing systems of linear equations more
More information1 Solutions in cylindrical coordinates: Bessel functions
1 Solutions in cylindrical coordinates: Bessel functions 1.1 Bessel functions Bessel functions arise as solutions of potential problems in cylindrical coordinates. Laplace s equation in cylindrical coordinates
More informationFigure 1: Circuit for Simon s Algorithm. The above circuit corresponds to the following sequence of transformations.
CS 94 //09 Fourier Transform, Period Finding and Factoring in BQP Spring 009 Lecture 4 Recap: Simon s Algorithm Recall that in the Simon s problem, we are given a function f : Z n Zn (i.e. from n-bit strings
More informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More information<excelunusual.com> Building a live Excel clock by George Lungu
Building a live Excel clock by George Lungu Here are a few date and time functions in VBA: Now Date Time Timer TimeValue() DateValue() Current date and time. Example: 7/5/00 3:16:38 PM returned by Now
More informationE The Fast Fourier Transform
Fourier Transform Methods in Finance By Umberto Cherubini Giovanni Della Lunga Sabrina Mulinacci Pietro Rossi Copyright 2010 John Wiley & Sons Ltd E The Fast Fourier Transform E.1 DISCRETE FOURIER TRASFORM
More informationDesigning Information Devices and Systems I Fall 2018 Lecture Notes Note 2
EECS 6A Designing Information Devices and Systems I Fall 08 Lecture Notes Note Vectors and Matrices In the previous note, we introduced vectors and matrices as a way of writing systems of linear equations
More information4.3 The Discrete Fourier Transform (DFT) and the Fast Fourier Transform (FFT)
CHAPTER. TIME-FREQUECY AALYSIS: FOURIER TRASFORMS AD WAVELETS.3 The Discrete Fourier Transform (DFT and the Fast Fourier Transform (FFT.3.1 Introduction In this section, we discuss some of the mathematics
More informationAstronomy Using scientific calculators
Astronomy 113 - Using scientific calculators 0. Introduction For some of the exercises in this lab you will need to use a scientific calculator. You can bring your own, use the few calculators available
More informationCommon Core State Standards. Clusters and Instructional Notes Perform arithmetic operations with complex numbers. 5.6
Algebra II Unit 1: Polynomial, Rational, and Radical Relationships This unit develops the structural similarities between the system of polynomials and the system of integers. Students draw on analogies
More informationLaplace's equation: the potential between parallel plates
4/3/01 Electrostatics Laplace Solver 1 Laplace's equation: the potential between parallel plates Laplace's equation describing the electric potential in two dimensions is: ( x, y) 0 At right is the potential
More informationEIT Quick-Review Electrical Prof. Frank Merat
CIRCUITS 4 The power supplied by the 0 volt source is (a) 2 watts (b) 0 watts (c) 2 watts (d) 6 watts (e) 6 watts 4Ω 2Ω 0V i i 2 2Ω 20V Call the clockwise loop currents i and i 2 as shown in the drawing
More informationCommunication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi
Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 3 Brief Review of Signals and Systems My subject for today s discussion
More informationPurpose: This lab is an experiment to verify Malus Law for polarized light in both a two and three polarizer system.
Purpose: This lab is an experiment to verify Malus Law for polarized light in both a two and three polarizer system. The basic description of Malus law is given as I = I 0 (cos 2 θ ) Where I is the transmitted
More information7 PDES, FOURIER SERIES AND TRANSFORMS Last Updated: July 16, 2012
Problem List 7.1 Fourier series expansion of absolute value function 7.2 Fourier series expansion of step function 7.3 Orthogonality of functions 7.4 Fourier transform of sinusoidal pulse 7.5 Introducing
More informationErrata List Numerical Mathematics and Computing, 7th Edition Ward Cheney & David Kincaid Cengage Learning (c) March 2013
Chapter Errata List Numerical Mathematics and Computing, 7th Edition Ward Cheney & David Kincaid Cengage Learning (c) 202 9 March 203 Page 4, Summary, 2nd bullet item, line 4: Change A segment of to The
More informationModule 4 MULTI- RESOLUTION ANALYSIS. Version 2 ECE IIT, Kharagpur
Module 4 MULTI- RESOLUTION ANALYSIS Lesson Theory of Wavelets Instructional Objectives At the end of this lesson, the students should be able to:. Explain the space-frequency localization problem in sinusoidal
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 12 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted for noncommercial,
More informationMA3232 Summary 5. d y1 dy1. MATLAB has a number of built-in functions for solving stiff systems of ODEs. There are ode15s, ode23s, ode23t, ode23tb.
umerical solutions of higher order ODE We can convert a high order ODE into a system of first order ODEs and then apply RK method to solve it. Stiff ODEs Stiffness is a special problem that can arise in
More informationTime Analysis of Sorting and Searching Algorithms
Time Analysis of Sorting and Searching Algorithms CSE21 Winter 2017, Day 5 (B00), Day 3 (A00) January 20, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Big-O : How to determine? Is f(n) big-o of g(n)?
More informationModule 1: Analyzing the Efficiency of Algorithms
Module 1: Analyzing the Efficiency of Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Based
More informationChapter 1- Polynomial Functions
Chapter 1- Polynomial Functions Lesson Package MHF4U Chapter 1 Outline Unit Goal: By the end of this unit, you will be able to identify and describe some key features of polynomial functions, and make
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 2
EECS 6A Designing Information Devices and Systems I Spring 9 Lecture Notes Note Vectors and Matrices In the previous note, we introduced vectors and matrices as a way of writing systems of linear equations
More informationTyler Anderson 1, Murat Tanyel 2
VENTURING INTO THE WALSH DOMAIN WITH A LABVIEW BASED COMMUNICATION SYSTEMS TOOLKIT Tyler Anderson 1, Murat Tanyel 2 1 Geneva College, Beaver Falls, Pennsylvania: Email: tbanders@geneva.edu 2 Geneva College,
More informationLinear Algebra V = T = ( 4 3 ).
Linear Algebra Vectors A column vector is a list of numbers stored vertically The dimension of a column vector is the number of values in the vector W is a -dimensional column vector and V is a 5-dimensional
More informationTutorial 4. Fast Fourier Transforms Phase factors runs around on the unit circle contains Wave forms
Tutorial 4. Fast Fourier Transforms Phase factors There are functions that produce roots-of-one as a function of time (t) or place (x). A good example is a Bloch function φ(x) = exp(i kx) or the phase
More information23.6. The Complex Form. Introduction. Prerequisites. Learning Outcomes
he Complex Form 3.6 Introduction In this Section we show how a Fourier series can be expressed more concisely if we introduce the complex number i where i =. By utilising the Euler relation: e iθ cos θ
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationFourier Analysis Fourier Series C H A P T E R 1 1
C H A P T E R Fourier Analysis 474 This chapter on Fourier analysis covers three broad areas: Fourier series in Secs...4, more general orthonormal series called Sturm iouville epansions in Secs..5 and.6
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 2: Fourier Series S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 1 Fourier Series Revision of Basics
More informationSequences are ordered lists of elements
Sequences are ordered lists of elements Definition: A sequence is a function from the set of integers, either set {0,1,2,3, } or set {1,2,3,4,..}, to a set S. We use the notation a n to denote the image
More informationELECTRONICS E # 1 FUNDAMENTALS 2/2/2011
FE Review 1 ELECTRONICS E # 1 FUNDAMENTALS Electric Charge 2 In an electric circuit it there is a conservation of charge. The net electric charge is constant. There are positive and negative charges. Like
More informationExperiment: Oscillations of a Mass on a Spring
Physics NYC F17 Objective: Theory: Experiment: Oscillations of a Mass on a Spring A: to verify Hooke s law for a spring and measure its elasticity constant. B: to check the relationship between the period
More informationIntroduction to Fourier Analysis Part 2. CS 510 Lecture #7 January 31, 2018
Introduction to Fourier Analysis Part 2 CS 510 Lecture #7 January 31, 2018 OpenCV on CS Dept. Machines 2/4/18 CSU CS 510, Ross Beveridge & Bruce Draper 2 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg
More informationEE123 Digital Signal Processing
Announcements EE Digital Signal Processing otes posted HW due Friday SDR give away Today! Read Ch 9 $$$ give me your names Lecture based on slides by JM Kahn M Lustig, EECS UC Berkeley M Lustig, EECS UC
More informationT S z 1,S z 2,..., S z N = S z N,S z 1,..., S z N 1
Momentum states (translationally invariant systems) A periodic chain (ring), translationally invariant eigenstates with a fixed momentum (crystal momentum ) quantum number k T n =e ik n k = m 2π, m =0,...,
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More information2 Background: Fourier Series Analysis and Synthesis
Signal Processing First Lab 15: Fourier Series Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in the Pre-Lab section before
More informationSection Summary. Sequences. Recurrence Relations. Summations Special Integer Sequences (optional)
Section 2.4 Section Summary Sequences. o Examples: Geometric Progression, Arithmetic Progression Recurrence Relations o Example: Fibonacci Sequence Summations Special Integer Sequences (optional) Sequences
More informationComputational Methods for Astrophysics: Fourier Transforms
Computational Methods for Astrophysics: Fourier Transforms John T. Whelan (filling in for Joshua Faber) April 27, 2011 John T. Whelan April 27, 2011 Fourier Transforms 1/13 Fourier Analysis Outline: Fourier
More informationThe discrete and fast Fourier transforms
The discrete and fast Fourier transforms Marcel Oliver Revised April 7, 1 1 Fourier series We begin by recalling the familiar definition of the Fourier series. For a periodic function u: [, π] C, we define
More information1 Introduction & Objective
Signal Processing First Lab 13: Numerical Evaluation of Fourier Series Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in
More information8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
More informationHomework 9 Solutions
8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 207 Homework 9 Solutions Part One. (6 points) Compute the convolution of the following continuous-time aperiodic signals. (Hint: Use the
More informationd 1 µ 2 Θ = 0. (4.1) consider first the case of m = 0 where there is no azimuthal dependence on the angle φ.
4 Legendre Functions In order to investigate the solutions of Legendre s differential equation d ( µ ) dθ ] ] + l(l + ) m dµ dµ µ Θ = 0. (4.) consider first the case of m = 0 where there is no azimuthal
More informationSinusoidal Steady State Analysis (AC Analysis) Part II
Sinusoidal Steady State Analysis (AC Analysis) Part II Amin Electronics and Electrical Communications Engineering Department (EECE) Cairo University elc.n102.eng@gmail.com http://scholar.cu.edu.eg/refky/
More informationGeneration of bandlimited sync transitions for sine waveforms
Generation of bandlimited sync transitions for sine waveforms Vadim Zavalishin May 4, 9 Abstract A common way to generate bandlimited sync transitions for the classical analog waveforms is the BLEP method.
More informationPHYS 502 Lecture 3: Fourier Series
PHYS 52 Lecture 3: Fourier Series Fourier Series Introduction In mathematics, a Fourier series decomposes periodic functions or periodic signals into the sum of a (possibly infinite) set of simple oscillating
More informationFourier transforms of molecular vibrations
Fourier transforms of molecular vibrations Part I: An Introduction to the Harmonic Oscillator and Fourier Transforms W. Tandy Grubbs, Department of Chemistry, Unit 827, Stetson University, DeLand, FL 32720
More informationEA2.3 - Electronics 2 1
In the previous lecture, I talked about the idea of complex frequency s, where s = σ + jω. Using such concept of complex frequency allows us to analyse signals and systems with better generality. In this
More informationSignal Processing Signal and System Classifications. Chapter 13
Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals
More informationInvestigating Springs (Simple Harmonic Motion)
Investigating Springs (Simple Harmonic Motion) INTRODUCTION The purpose of this lab is to study the well-known force exerted by a spring The force, as given by Hooke s Law, is a function of the amount
More informationAnalysis of Algorithms [Reading: CLRS 2.2, 3] Laura Toma, csci2200, Bowdoin College
Analysis of Algorithms [Reading: CLRS 2.2, 3] Laura Toma, csci2200, Bowdoin College Why analysis? We want to predict how the algorithm will behave (e.g. running time) on arbitrary inputs, and how it will
More informationMATH III CCR MATH STANDARDS
INFERENCES AND CONCLUSIONS FROM DATA M.3HS.1 Use the mean and standard deviation of a data set to fit it to a normal distribution and to estimate population percentages. Recognize that there are data sets
More informationUnit 1. Revisiting Parent Functions and Graphing
Unit 1 Revisiting Parent Functions and Graphing Precalculus Analysis Pacing Guide First Nine Weeks Understand how the algebraic properties of an equation transform the geometric properties of its graph.
More information