Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology IIIDigital Audio III.3 (Fr Oct 10) Complex Fourier representation (preliminaries to FFT)

Slides:



Advertisements
Similar presentations
DCSP-11 Jianfeng Feng
Advertisements

Prepared by Dr. Taha MAhdy
The Fourier Transform I
1 D. R. Wilton ECE Dept. ECE 6382 Introduction to Linear Vector Spaces Reference: D.G. Dudley, “Mathematical Foundations for Electromagnetic Theory,” IEEE.
Leo Lam © Signals and Systems EE235 Leo Lam.
Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology IIIDigital Audio III.6 (Fr Oct 24) The MP3 algorithm with PAC.
Symmetry and the DTFT If we know a few things about the symmetry properties of the DTFT, it can make life simpler. First, for a real-valued sequence x(n),
Lecture 7: Basis Functions & Fourier Series
Lecture 15 Orthogonal Functions Fourier Series. LGA mean daily temperature time series is there a global warming signal?
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Math Review with Matlab:
MRA basic concepts Jyun-Ming Chen Spring Introduction MRA (multi- resolution analysis) –Construct a hierarchy of approximations to functions in.
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Signal , Weight Vector Spaces and Linear Transformations
Chapter 5 Orthogonality
Computer Graphics Recitation 2. 2 The plan today Learn about rotations in 2D and 3D. Representing rotations by quaternions.
CS 376b Introduction to Computer Vision 03 / 04 / 2008 Instructor: Michael Eckmann.
CS 376b Introduction to Computer Vision 03 / 04 / 2008 Instructor: Michael Eckmann.
Complex Numbers? What’s So Complex?. Complex numbers are vectors represented in the complex plane as the sum of a Real part and an Imaginary part: z =
Deconstructing periodic driving voltages (or any functions) into their sinusoidal components: It's easy to build a periodic functions by choosing coefficients.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Fourier Transforms.
Time and Frequency Representation
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Chapter 15 Fourier Series and Fourier Transform
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Orthogonal Functions and Fourier Series.
Motivation Music as a combination of sounds at different frequencies
FOURIER SERIES §Jean-Baptiste Fourier (France, ) proved that almost any period function can be represented as the sum of sinusoids with integrally.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Orthogonal Functions and Fourier Series.
Vectors CHAPTER 7. Ch7_2 Contents  7.1 Vectors in 2-Space 7.1 Vectors in 2-Space  7.2 Vectors in 3-Space 7.2 Vectors in 3-Space  7.3 Dot Product 7.3.
AN ORTHOGONAL PROJECTION
Leo Lam © Signals and Systems EE235. Leo Lam © Today’s menu Happy May! Chocolates! Fourier Series Vote!
Chapter 4 – Linear Spaces
Fourier series: Eigenfunction Approach
Fourier Analysis of Discrete Time Signals
Orthogonal Functions and Fourier Series
Chapter 10 Real Inner Products and Least-Square
VECTORS (Ch. 12) Vectors in the plane Definition: A vector v in the Cartesian plane is an ordered pair of real numbers:  a,b . We write v =  a,b  and.
Copyright © Cengage Learning. All rights reserved. Vectors in Two and Three Dimensions.
Section 5.1 Length and Dot Product in ℝ n. Let v = ‹v 1­­, v 2, v 3,..., v n › and w = ‹w 1­­, w 2, w 3,..., w n › be vectors in ℝ n. The dot product.
Guerino Mazzola (Fall 2015 © ): Introduction to Music Technology IIIDigital Audio III.2 (M Oct 12) Finite Fourier Theory.
Fourier Series Fourier Transform Discrete Fourier Transform ISAT 300 Instrumentation and Measurement Spring 2000.
Motivation: Wavelets are building blocks that can quickly decorrelate data 2. each signal written as (possibly infinite) sum 1. what type of data? 3. new.
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Math Review Towards Fourier Transform
Guerino Mazzola (Fall 2015 © ): Introduction to Music Technology IIIDigital Audio III.4 (We Oct 28) Fast Fourier Transform (FFT)
Class 24: Question 1 Which of the following set of vectors is not an orthogonal set?
Mathematical Tools of Quantum Mechanics
 Introduction to reciprocal space
4.A Fourier Series & Fourier Transform Many slides are from Taiwen Yu.
Review of Complex Numbers. Introduction to Complex Numbers Complex numbers could be represented by the form Where x and y are real numbers Complex numbers.
Chapter 2. READING ASSIGNMENTS This Lecture: Chapter 2, pp Appendix A: Complex Numbers Appendix B: MATLAB or Labview Chapter 1: Introduction.
The Fourier Transform.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Fourier Transforms.
Fourier Analysis Patrice Koehl Department of Biological Sciences National University of Singapore
Differential Equations
Spaces.
III Digital Audio III.2 (M Oct 02) Finite Fourier Theory.
Fourier Series Prof. Brian L. Evans
III Digital Audio III.4 (Mo Oct 16) Fast Fourier Transform (FFT)
III Digital Audio III.9 (Wed Oct 25) Phase vocoder for tempo and pitch changes.
III Digital Audio III.3 (M Oct 09) Complex Fourier representation (preliminaries to FFT)
Lecture 03: Linear Algebra
Sinusoids: continuous time
Math Review CS474/674 – Prof. Bebis.
III Digital Audio III.9 (Wed Oct 24) Phase vocoder for tempo and pitch changes.
Discrete-Time Complex
III Digital Audio III.2 (F Oct 05) Finite Fourier Theory.
14.4 Arc Length and Curvature
Fourier Transforms University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell.
Presentation transcript:

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology IIIDigital Audio III.3 (Fr Oct 10) Complex Fourier representation (preliminaries to FFT)

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology w(t) = A 0 + A 1 sin(2 .ft+Ph 1 ) + A 2 sin(2 .2ft+Ph 2 ) + A 3 sin(2 .3ft+Ph 3 ) +... w(t) = A 0 + a 1 cos(2 .ft) + b 1 sin(2 .ft)+ a 2 cos(2 .2ft) + b 2 sin(2 .2ft)+... A m sin(2 .mft+Ph m ) = a m cos(2 .mft) + b m sin(2 .mft) For complex calculations, the calculus with sinusoidal functions are usless, need more elegant approach! Have made calculations of this type in finite Fourier theory for the Nyquist theorem

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology ¬ = plane of complex numbers Recall the circle representation of sinusoidal functions: cos(x) sin(x) cos(x)isin(x) cos(x) + i. sin(x) Have the famous Euler formula: cos(x)isin(x) = e ix Have the famous Euler formula: cos(x) + i. sin(x) = e ix cos(x+y) + i.sin(x+y) = e i(x+y) = e ix. e iy = [cos(x) + i.sin(x)]. [cos(y) + i.sin(y)] = [cos(x).cos(y) - sin(x).sin(y)] + i[sin(x).cos(y) +cos(x).sin(y)] Have the famous Euler formula: cos(x)isin(x) = e ix Have the famous Euler formula: cos(x) + i. sin(x) = e ix cos(x+y) + i.sin(x+y) = e i(x+y) = e ix. e iy = [cos(x) + i.sin(x)]. [cos(y) + i.sin(y)] = [cos(x).cos(y) - sin(x).sin(y)] + i[sin(x).cos(y) +cos(x).sin(y)] 1 i = √-1

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology Translate Fourier’s formula into the complex number representation: cos(x)isin(x) = e ix cos(x) + i. sin(x) = e ix cos(-x)isin(-x) = e −ix = cos(x)−isin(x) cos(-x) + i. sin(-x) = e −ix = cos(x) − i. sin(x) cos(x)isin(x) = e ix + cos(x)−isin(x) = e −ix cos(x) + i. sin(x) = e ix + cos(x) − i. sin(x) = e −ix = 2cos(x)= e ix +e −ix = 2cos(x) = e ix +e −ix cos(x)isin(x) = e ix cos(x) + i. sin(x) = e ix cos(-x)isin(-x) = e −ix = cos(x)−isin(x) cos(-x) + i. sin(-x) = e −ix = cos(x) − i. sin(x) cos(x)isin(x) = e ix + cos(x)−isin(x) = e −ix cos(x) + i. sin(x) = e ix + cos(x) − i. sin(x) = e −ix = 2cos(x)= e ix +e −ix = 2cos(x) = e ix +e −ix w(t) = = a 0 + a 1 cos(2 .ft) + b 1 sin(2 .ft)+ a 2 cos(2 .2ft) + b 2 sin(2 .2ft)+... = c 0 + c 1 e i2 .ft + c −1 e − i2 .ft + c 2 e i2 .2ft + c − 2 e − i2 .2ft + c 3 e i2 .3ft + c − 3 e − i2 .3ft +... cos(x)= (e ix + e −ix )/2 sin(x)= (e ix − e −ix )/2i w(t) = ∑ n = 0, ±1, ±2, ±3,... c n e i2 .nft a 0 = c 0 n > 0:a n = c n + c −n b n = i(c n − c −n )

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology Translate the finite Fourier’s formula into the complex number representation: w(rΔ) = a 0 + ∑ m = 1,2,3,...n-1 a m cos(2 .mf. rΔ) + b m sin(2 .mf. rΔ) + b n sin(2 .nft. rΔ) We only consider a special case, which is easy to write down, but it shows the general situation! Namely: a sound sample from t = 0 to t = 1, period P = 1 sec, i.e. fundamental frequency f = 1 Hz whence Δ = 1/N = 1/2n and rΔ =r/N, r = 0,1,2,... N-1 We may then write: w r = w(rΔ) = w(r/N) = ∑ m = 0, 1, 2, 3,... N-1 c m e i2 .mr/N Why no negative indices? In fact, we have them, but they are somewhat hidden: e i2 .mr/N. e i2 .m(N-r)/N = e i2 .mr/N +i2 .m(N-r)/N = e 0 = 1, so e i2 .m(N-r)/N = e i2 .-mr/N Why no negative indices? In fact, we have them, but they are somewhat hidden: e i2 .mr/N. e i2 .m(N-r)/N = e i2 .mr/N +i2 .m(N-r)/N = e 0 = 1, so e i2 .m(N-r)/N = e i2 .-mr/N −m = negative Also, c N-m = complex conjugate to c m since the a m, b m are all real numbers. Therefore we have a total of N/2 independent complex coefficients, i.e. N real coefficients as required from the original formula.

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology The representation w r = w(rΔ) = w(r/N) = ∑ m = 0, 1, 2, 3,... N-1 c m e i2 .mr/N identifies the sequence w = (w 0,w 1,w 2,…,w N-1 ) as a vector in the N-dimensional complex space So our samples of fundamental frequency f = 1 are identified with the vectors w ∈ identifies the sequence w = (w 0,w 1,w 2,…,w N-1 ) as a vector in the N-dimensional complex space ¬ N. So our samples of fundamental frequency f = 1 are identified with the vectors w ∈ ¬ N. On this space, we have a scalar product — similar to the highschool formula (u,v) = |u|.|v|.cos(u,v): Have N exponential functions e 0, e 1, e 2,... e N-1 that are represented as vectors in Have N exponential functions e 0, e 1, e 2,... e N-1 that are represented as vectors in ¬ N e m = (e m (r) = e i2 .mr/N ) r = 0,1,2,...N-1 〈 e m, e m 〉 = 1, 〈 e m, e q 〉 = 0 m ≠ q = orthogonality relations mentioned above! e 0, e 1, e 2,... e N-1 The e 0, e 1, e 2,... e N-1 = orthonormal basis like for normal 3 space! (ortho ~ perpendicular, normal ~ length 1) They replace the sinusoidal functions! 90 o emememem elelelel eqeqeqeq u v = complex conjugate

Guerino Mazzola (Fall 2014 © ): Introduction to Music Technology Every sound sample vector w = (w 0,w 1,w 2,…,w N-1 ) in ¬ N can be written as a linear combination w = ∑ m = 0, 1, 2, 3,... N-1 c m e m of the exponential functions, and the (uniquely determined) coefficients c m are calculated via c m = 〈 w, e m 〉 =(1/N). ∑ r = 0, 1, 2, 3,... N-1 w r e -i2 .mr/N Every sound sample vector w = (w 0,w 1,w 2,…,w N-1 ) in ¬ N can be written as a linear combination w = ∑ m = 0, 1, 2, 3,... N-1 c m e m of the exponential functions, and the (uniquely determined) coefficients c m are calculated via c m = 〈 w, e m 〉 =(1/N). ∑ r = 0, 1, 2, 3,... N-1 w r e -i2 .mr/N 90 o emememem elelelel eqeqeqeq