DOCSLIB.ORG

The Fourier Transform: Examples, Properties, Common Pairs the Fourier Transform: Examples, Properties, Common Pairs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Fourier Transform: Examples, Properties, Common Pairs the Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Magnitude and Phase Remember: complex numbers can be thought of as (real,imaginary) The Fourier Transform: or (magnitude,phase). Examples, Properties, Common Pairs 2 2 1/2 CS 450: Introduction to Digital Signal and Image Processing Magnitude: F = (F) + (F) | | < 1 (F)= = Phase: φ (F) = tan− (F) < Bryan Morse Real part How much of a cosine of that frequency you need BYU Computer Science Imaginary part How much of a sine of that frequency you need Magnitude Amplitude of combined cosine and sine Phase Relative proportions of sine and cosine The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Example: Fourier Transform of a Cosine Example: Fourier Transform of a Cosine ( ) = ( π ) f t cos 2 st Spatial Domain Frequency Domain ∞ i2πut F(u) = f (t) e− dt 1 1 Z−∞ cos(2πst) 2 δ(u s) + 2 δ(u + s) ∞ i2πut − = cos(2πst) e− dt 1 Z−∞ 1 ∞ = cos(2πst)[cos( 2πut) + i sin( 2πut)] dt 0.8 − − 0.5 Z−∞ 0.6 ∞ ∞ = cos(2πst) cos( 2πut) dt + i cos(2πst) sin( 2πut) dt 0.2 0.4 0.6 0.8 1 − − 0.4 Z−∞ Z−∞ -0.5 ∞ ∞ 0.2 = cos(2πst) cos(2πut) dt i cos(2πst) sin(2πut) dt − Z−∞ Z−∞ -1 -10 -5 5 10 0 except when u = s 0 for all u ± 1 1 = δ(u s) + δ(u + s) 2 − 2 The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Odd and Even Functions Sinusoids Even Odd Spatial Domain Frequency Domain f ( t) = f (t) f ( t) = f (t) − − − f (t) F(u) Symmetric Anti-symmetric Cosines Sines 1 cos(2πst) 2 [δ(u + s) + δ(u s)] Transform is real∗ Transform is imaginary∗ − sin(2πst) 1 i [δ(u + s) δ(u s)] 2 − − ∗ for real-valued signals The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Constant Functions Delta Functions Spatial Domain Frequency Domain Spatial Domain Frequency Domain f (t) F(u) f (t) F(u) 1 δ(u) δ(t) 1 a a δ(u) The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Square Pulse Square Pulse Spatial Domain Frequency Domain f (t) F(u) 1 if a/2 t a/2 ( π ) − ≤ ≤ sinc(aπu) = sin a u 0 otherwise aπu The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Triangle Comb Spatial Domain Frequency Domain Spatial Domain Frequency Domain f (t) F(u) f (t) F(u) 1 t if a t a − | | − ≤ ≤ sinc2(aπu) δ(t mod k) δ(u mod 1/k) 0 otherwise The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Gaussian Differentiation Spatial Domain Frequency Domain Spatial Domain Frequency Domain f (t) F(u) f (t) F(u) πt2 πu2 d e− e− dt 2πiu The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Some Common Fourier Transform Pairs More Common Fourier Transform Pairs Spatial Domain Frequency Domain Spatial Domain Frequency Domain f (t) F(u) f (t) F(u) Cosine cos(2πst) Deltas 1 [δ(u + s) + δ(u s)] 1 if a/2 t a/2 2 − Square − ≤ ≤ Sinc sinc(aπu) Sine sin(2πst) Deltas 1 i [δ(u + s) δ(u s)] 0 otherwise 2 − − Unit 1 Delta δ(u) 1 t if a t a 2 Triangle − | | − ≤ ≤ Sinc2 sinc (aπu) Constant a Delta aδ(u) 0 otherwise πt2 πu2 Delta δ(t) Unit 1 Gaussian e− Gaussian e− d Comb δ(t mod k) Comb δ(u mod 1/k) Differentiation dt Ramp 2πiu The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Properties: Notation Properties: Linearity Let denote the Fourier Transform: Adding two functions together adds their Fourier Transforms together: F F = (f ) (f + g) = (f ) + (g) F F F F 1 Multiplying a function by a scalar constant multiplies its Fourier Let − denote the Inverse Fourier Transform: F Transform by the same constant: 1 f = − (F) F (af ) = a (f ) F F The Fourier Transform: Examples, Properties, Common Pairs The Fourier Transform: Examples, Properties, Common Pairs Properties: Translation Change of Scale: Square Pulse Revisited Translating a function leaves the magnitude unchanged and adds a constant to the phase. If f = f (t a) 2 1 − F = (f ) 1 F 1 F = (f ) 2 F 2 then F = F | 2| | 1| φ (F ) = φ (F ) 2πua 2 1 − Intuition: magnitude tells you “how much”, phase tells you “where”. The Fourier Transform: Examples, Properties, Common Pairs Rayleigh’s Theorem Total “energy” (sum of squares) is the same in either domain: ∞ ∞ f (t) 2 dt = F(u) 2 du | | | | Z−∞ Z−∞.
Load more

Recommended publications
  • Glossary Physics (I-Introduction)
    1 Glossary Physics (I-introduction) - Efficiency: The percent of the work put into a machine that is converted into useful work output; = work done / energy used [-]. = eta In machines: The work output of any machine cannot exceed the work input (<=100%); in an ideal machine, where no energy is transformed into heat: work(input) = work(output), =100%. Energy: The property of a system that enables it to do work. Conservation o. E.: Energy cannot be created or destroyed; it may be transformed from one form into another, but the total amount of energy never changes. Equilibrium: The state of an object when not acted upon by a net force or net torque; an object in equilibrium may be at rest or moving at uniform velocity - not accelerating. Mechanical E.: The state of an object or system of objects for which any impressed forces cancels to zero and no acceleration occurs. Dynamic E.: Object is moving without experiencing acceleration. Static E.: Object is at rest.F Force: The influence that can cause an object to be accelerated or retarded; is always in the direction of the net force, hence a vector quantity; the four elementary forces are: Electromagnetic F.: Is an attraction or repulsion G, gravit. const.6.672E-11[Nm2/kg2] between electric charges: d, distance [m] 2 2 2 2 F = 1/(40) (q1q2/d ) [(CC/m )(Nm /C )] = [N] m,M, mass [kg] Gravitational F.: Is a mutual attraction between all masses: q, charge [As] [C] 2 2 2 2 F = GmM/d [Nm /kg kg 1/m ] = [N] 0, dielectric constant Strong F.: (nuclear force) Acts within the nuclei of atoms: 8.854E-12 [C2/Nm2] [F/m] 2 2 2 2 2 F = 1/(40) (e /d ) [(CC/m )(Nm /C )] = [N] , 3.14 [-] Weak F.: Manifests itself in special reactions among elementary e, 1.60210 E-19 [As] [C] particles, such as the reaction that occur in radioactive decay.
    [Show full text]
  • FOURIER TRANSFORM Very Broadly Speaking, the Fourier Transform Is a Systematic Way to Decompose “Generic” Functions Into
    FOURIER TRANSFORM TERENCE TAO Very broadly speaking, the Fourier transform is a systematic way to decompose “generic” functions into a superposition of “symmetric” functions. These symmetric functions are usually quite explicit (such as a trigonometric function sin(nx) or cos(nx)), and are often associated with physical concepts such as frequency or energy. What “symmetric” means here will be left vague, but it will usually be associated with some sort of group G, which is usually (though not always) abelian. Indeed, the Fourier transform is a fundamental tool in the study of groups (and more precisely in the representation theory of groups, which roughly speaking describes how a group can define a notion of symmetry). The Fourier transform is also related to topics in linear algebra, such as the representation of a vector as linear combinations of an orthonormal basis, or as linear combinations of eigenvectors of a matrix (or a linear operator). To give a very simple prototype of the Fourier transform, consider a real-valued function f : R → R. Recall that such a function f(x) is even if f(−x) = f(x) for all x ∈ R, and is odd if f(−x) = −f(x) for all x ∈ R. A typical function f, such as f(x) = x3 + 3x2 + 3x + 1, will be neither even nor odd. However, one can always write f as the superposition f = fe + fo of an even function fe and an odd function fo by the formulae f(x) + f(−x) f(x) − f(−x) f (x) := ; f (x) := . e 2 o 2 3 2 2 3 For instance, if f(x) = x + 3x + 3x + 1, then fe(x) = 3x + 1 and fo(x) = x + 3x.
    [Show full text]
  • An Introduction to Fourier Analysis Fourier Series, Partial Differential Equations and Fourier Transforms
    An Introduction to Fourier Analysis Fourier Series, Partial Differential Equations and Fourier Transforms Notes prepared for MA3139 Arthur L. Schoenstadt Department of Applied Mathematics Naval Postgraduate School Code MA/Zh Monterey, California 93943 August 18, 2005 c 1992 - Professor Arthur L. Schoenstadt 1 Contents 1 Infinite Sequences, Infinite Series and Improper Integrals 1 1.1Introduction.................................... 1 1.2FunctionsandSequences............................. 2 1.3Limits....................................... 5 1.4TheOrderNotation................................ 8 1.5 Infinite Series . ................................ 11 1.6ConvergenceTests................................ 13 1.7ErrorEstimates.................................. 15 1.8SequencesofFunctions.............................. 18 2 Fourier Series 25 2.1Introduction.................................... 25 2.2DerivationoftheFourierSeriesCoefficients.................. 26 2.3OddandEvenFunctions............................. 35 2.4ConvergencePropertiesofFourierSeries.................... 40 2.5InterpretationoftheFourierCoefficients.................... 48 2.6TheComplexFormoftheFourierSeries.................... 53 2.7FourierSeriesandOrdinaryDifferentialEquations............... 56 2.8FourierSeriesandDigitalDataTransmission.................. 60 3 The One-Dimensional Wave Equation 70 3.1Introduction.................................... 70 3.2TheOne-DimensionalWaveEquation...................... 70 3.3 Boundary Conditions ............................... 76 3.4InitialConditions................................
    [Show full text]
  • Frequency Response = K − Ml
    Frequency Response 1. Introduction We will examine the response of a second order linear constant coefficient system to a sinusoidal input. We will pay special attention to the way the output changes as the frequency of the input changes. This is what we mean by the frequency response of the system. In particular, we will look at the amplitude response and the phase response; that is, the amplitude and phase lag of the system’s output considered as functions of the input frequency. In O.4 the Exponential Input Theorem was used to find a particular solution in the case of exponential or sinusoidal input. Here we will work out in detail the formulas for a second order system. We will then interpret these formulas as the frequency response of a mechanical system. In particular, we will look at damped-spring-mass systems. We will study carefully two cases: first, when the mass is driven by pushing on the spring and second, when the mass is driven by pushing on the dashpot. Both these systems have the same form p(D)x = q(t), but their amplitude responses are very different. This is because, as we will see, it can make physical sense to designate something other than q(t) as the input. For example, in the system mx0 + bx0 + kx = by0 we will consider y to be the input. (Of course, y is related to the expression on the right- hand-side of the equation, but it is not exactly the same.) 2. Sinusoidally Driven Systems: Second Order Constant Coefficient DE’s We start with the second order linear constant coefficient (CC) DE, which as we’ve seen can be interpreted as modeling a damped forced harmonic oscillator.
    [Show full text]
  • Fourier Transforms & the Convolution Theorem
    Convolution, Correlation, & Fourier Transforms James R. Graham 11/25/2009 Introduction • A large class of signal processing techniques fall under the category of Fourier transform methods – These methods fall into two broad categories • Efficient method for accomplishing common data manipulations • Problems related to the Fourier transform or the power spectrum Time & Frequency Domains • A physical process can be described in two ways – In the time domain, by h as a function of time t, that is h(t), -∞ < t < ∞ – In the frequency domain, by H that gives its amplitude and phase as a function of frequency f, that is H(f), with -∞ < f < ∞ • In general h and H are complex numbers • It is useful to think of h(t) and H(f) as two different representations of the same function – One goes back and forth between these two representations by Fourier transforms Fourier Transforms ∞ H( f )= ∫ h(t)e−2πift dt −∞ ∞ h(t)= ∫ H ( f )e2πift df −∞ • If t is measured in seconds, then f is in cycles per second or Hz • Other units – E.g, if h=h(x) and x is in meters, then H is a function of spatial frequency measured in cycles per meter Fourier Transforms • The Fourier transform is a linear operator – The transform of the sum of two functions is the sum of the transforms h12 = h1 + h2 ∞ H ( f ) h e−2πift dt 12 = ∫ 12 −∞ ∞ ∞ ∞ h h e−2πift dt h e−2πift dt h e−2πift dt = ∫ ( 1 + 2 ) = ∫ 1 + ∫ 2 −∞ −∞ −∞ = H1 + H 2 Fourier Transforms • h(t) may have some special properties – Real, imaginary – Even: h(t) = h(-t) – Odd: h(t) = -h(-t) • In the frequency domain these
    [Show full text]
  • STATISTICAL FOURIER ANALYSIS: CLARIFICATIONS and INTERPRETATIONS by DSG Pollock
    STATISTICAL FOURIER ANALYSIS: CLARIFICATIONS AND INTERPRETATIONS by D.S.G. Pollock (University of Leicester) Email: stephen [email protected] This paper expounds some of the results of Fourier theory that are es- sential to the statistical analysis of time series. It employs the algebra of circulant matrices to expose the structure of the discrete Fourier transform and to elucidate the filtering operations that may be applied to finite data sequences. An ideal filter with a gain of unity throughout the pass band and a gain of zero throughout the stop band is commonly regarded as incapable of being realised in finite samples. It is shown here that, to the contrary, such a filter can be realised both in the time domain and in the frequency domain. The algebra of circulant matrices is also helpful in revealing the nature of statistical processes that are band limited in the frequency domain. In order to apply the conventional techniques of autoregressive moving-average modelling, the data generated by such processes must be subjected to anti- aliasing filtering and sub sampling. These techniques are also described. It is argued that band-limited processes are more prevalent in statis- tical and econometric time series than is commonly recognised. 1 D.S.G. POLLOCK: Statistical Fourier Analysis 1. Introduction Statistical Fourier analysis is an important part of modern time-series analysis, yet it frequently poses an impediment that prevents a full understanding of temporal stochastic processes and of the manipulations to which their data are amenable. This paper provides a survey of the theory that is not overburdened by inessential complications, and it addresses some enduring misapprehensions.
    [Show full text]
  • Fourier Transform, Convolution Theorem, and Linear Dynamical Systems April 28, 2016
    Mathematical Tools for Neuroscience (NEU 314) Princeton University, Spring 2016 Jonathan Pillow Lecture 23: Fourier Transform, Convolution Theorem, and Linear Dynamical Systems April 28, 2016. Discrete Fourier Transform (DFT) We will focus on the discrete Fourier transform, which applies to discretely sampled signals (i.e., vectors). Linear algebra provides a simple way to think about the Fourier transform: it is simply a change of basis, specifically a mapping from the time domain to a representation in terms of a weighted combination of sinusoids of different frequencies. The discrete Fourier transform is therefore equiv- alent to multiplying by an orthogonal (or \unitary", which is the same concept when the entries are complex-valued) matrix1. For a vector of length N, the matrix that performs the DFT (i.e., that maps it to a basis of sinusoids) is an N × N matrix. The k'th row of this matrix is given by exp(−2πikt), for k 2 [0; :::; N − 1] (where we assume indexing starts at 0 instead of 1), and t is a row vector t=0:N-1;. Recall that exp(iθ) = cos(θ) + i sin(θ), so this gives us a compact way to represent the signal with a linear superposition of sines and cosines. The first row of the DFT matrix is all ones (since exp(0) = 1), and so the first element of the DFT corresponds to the sum of the elements of the signal. It is often known as the \DC component". The next row is a complex sinusoid that completes one cycle over the length of the signal, and each subsequent row has a frequency that is an integer multiple of this \fundamental" frequency.
    [Show full text]
  • Multidisciplinary Design Project Engineering Dictionary Version 0.0.2
    Multidisciplinary Design Project Engineering Dictionary Version 0.0.2 February 15, 2006 . DRAFT Cambridge-MIT Institute Multidisciplinary Design Project This Dictionary/Glossary of Engineering terms has been compiled to compliment the work developed as part of the Multi-disciplinary Design Project (MDP), which is a programme to develop teaching material and kits to aid the running of mechtronics projects in Universities and Schools. The project is being carried out with support from the Cambridge-MIT Institute undergraduate teaching programe. For more information about the project please visit the MDP website at http://www-mdp.eng.cam.ac.uk or contact Dr. Peter Long Prof. Alex Slocum Cambridge University Engineering Department Massachusetts Institute of Technology Trumpington Street, 77 Massachusetts Ave. Cambridge. Cambridge MA 02139-4307 CB2 1PZ. USA e-mail: [email protected] e-mail: [email protected] tel: +44 (0) 1223 332779 tel: +1 617 253 0012 For information about the CMI initiative please see Cambridge-MIT Institute website :- http://www.cambridge-mit.org CMI CMI, University of Cambridge Massachusetts Institute of Technology 10 Miller’s Yard, 77 Massachusetts Ave. Mill Lane, Cambridge MA 02139-4307 Cambridge. CB2 1RQ. USA tel: +44 (0) 1223 327207 tel. +1 617 253 7732 fax: +44 (0) 1223 765891 fax. +1 617 258 8539 . DRAFT 2 CMI-MDP Programme 1 Introduction This dictionary/glossary has not been developed as a definative work but as a useful reference book for engi- neering students to search when looking for the meaning of a word/phrase. It has been compiled from a number of existing glossaries together with a number of local additions.
    [Show full text]
  • To Learn the Basic Properties of Traveling Waves. Slide 20-2 Chapter 20 Preview
    Chapter 20 Traveling Waves Chapter Goal: To learn the basic properties of traveling waves. Slide 20-2 Chapter 20 Preview Slide 20-3 Chapter 20 Preview Slide 20-5 • result from periodic disturbance • same period (frequency) as source 1 f • Longitudinal or Transverse Waves • Characterized by – amplitude (how far do the “bits” move from their equilibrium positions? Amplitude of MEDIUM) – period or frequency (how long does it take for each “bit” to go through one cycle?) – wavelength (over what distance does the cycle repeat in a freeze frame?) – wave speed (how fast is the energy transferred?) vf v Wavelength and Frequency are Inversely related: f The shorter the wavelength, the higher the frequency. The longer the wavelength, the lower the frequency. 3Hz 5Hz Spherical Waves Wave speed: Depends on Properties of the Medium: Temperature, Density, Elasticity, Tension, Relative Motion vf Transverse Wave • A traveling wave or pulse that causes the elements of the disturbed medium to move perpendicular to the direction of propagation is called a transverse wave Longitudinal Wave A traveling wave or pulse that causes the elements of the disturbed medium to move parallel to the direction of propagation is called a longitudinal wave: Pulse Tuning Fork Guitar String Types of Waves Sound String Wave PULSE: • traveling disturbance • transfers energy and momentum • no bulk motion of the medium • comes in two flavors • LONGitudinal • TRANSverse Traveling Pulse • For a pulse traveling to the right – y (x, t) = f (x – vt) • For a pulse traveling to
    [Show full text]
  • A Hilbert Space Theory of Generalized Graph Signal Processing
    1 A Hilbert Space Theory of Generalized Graph Signal Processing Feng Ji and Wee Peng Tay, Senior Member, IEEE Abstract Graph signal processing (GSP) has become an important tool in many areas such as image pro- cessing, networking learning and analysis of social network data. In this paper, we propose a broader framework that not only encompasses traditional GSP as a special case, but also includes a hybrid framework of graph and classical signal processing over a continuous domain. Our framework relies extensively on concepts and tools from functional analysis to generalize traditional GSP to graph signals in a separable Hilbert space with infinite dimensions. We develop a concept analogous to Fourier transform for generalized GSP and the theory of filtering and sampling such signals. Index Terms Graph signal proceesing, Hilbert space, generalized graph signals, F-transform, filtering, sampling I. INTRODUCTION Since its emergence, the theory and applications of graph signal processing (GSP) have rapidly developed (see for example, [1]–[10]). Traditional GSP theory is essentially based on a change of orthonormal basis in a finite dimensional vector space. Suppose G = (V; E) is a weighted, arXiv:1904.11655v2 [eess.SP] 16 Sep 2019 undirected graph with V the vertex set of size n and E the set of edges. Recall that a graph signal f assigns a complex number to each vertex, and hence f can be regarded as an element of n C , where C is the set of complex numbers. The heart of the theory is a shift operator AG that is usually defined using a property of the graph.
    [Show full text]
  • 20. the Fourier Transform in Optics, II Parseval’S Theorem
    20. The Fourier Transform in optics, II Parseval’s Theorem The Shift theorem Convolutions and the Convolution Theorem Autocorrelations and the Autocorrelation Theorem The Shah Function in optics The Fourier Transform of a train of pulses The spectrum of a light wave The spectrum of a light wave is defined as: 2 SFEt {()} where F{E(t)} denotes E(), the Fourier transform of E(t). The Fourier transform of E(t) contains the same information as the original function E(t). The Fourier transform is just a different way of representing a signal (in the frequency domain rather than in the time domain). But the spectrum contains less information, because we take the magnitude of E(), therefore losing the phase information. Parseval’s Theorem Parseval’s Theorem* says that the 221 energy in a function is the same, whether f ()tdt F ( ) d 2 you integrate over time or frequency: Proof: f ()tdt2 f ()t f *()tdt 11 F( exp(j td ) F *( exp(j td ) dt 22 11 FF() *(') exp([j '])tdtd ' d 22 11 FF( ) * ( ') [2 ')] dd ' 22 112 FF() *() d F () d * also known as 22Rayleigh’s Identity. The Fourier Transform of a sum of two f(t) F() functions t g(t) G() Faft() bgt () aF ft() bFgt () t The FT of a sum is the F() + sum of the FT’s. f(t)+g(t) G() Also, constants factor out. t This property reflects the fact that the Fourier transform is a linear operation. Shift Theorem The Fourier transform of a shifted function, f ():ta Ffta ( ) exp( jaF ) ( ) Proof : This theorem is F ft a ft( a )exp( jtdt ) important in optics, because we often encounter functions Change variables : uta that are shifting (continuously) along fu( )exp( j [ u a ]) du the time axis – they are called waves! exp(ja ) fu ( )exp( judu ) exp(jaF ) ( ) QED An example of the Shift Theorem in optics Suppose that we’re measuring the spectrum of a light wave, E(t), but a small fraction of the irradiance of this light, say , takes a different path that also leads to the spectrometer.
    [Show full text]
  • The Fourier Transform
    The Fourier Transform CS/CME/BIOPHYS/BMI 279 Fall 2015 Ron Dror The Fourier transform is a mathematical method that expresses a function as the sum of sinusoidal functions (sine waves). Fourier transforms are widely used in many fields of sciences and engineering, including image processing, quantum mechanics, crystallography, geoscience, etc. Here we will use, as examples, functions with finite, discrete domains (i.e., functions defined at a finite number of regularly spaced points), as typically encountered in computational problems. However the concept of Fourier transform can be readily applied to functions with infinite or continuous domains. (We won’t differentiate between “Fourier series” and “Fourier transform.”) A graphical example ! ! Suppose we have a function � � defined in the range − < � < on 2� + 1 discrete points such that ! ! ! � = �. By a Fourier transform we aim to express it as: ! !!!! � �! = �! + �! cos 2��!� + �! + �! cos 2��!� + �! + ⋯ (1) We first demonstrate graphically how a function may be described by its Fourier components. Fig. 1 shows a function defined on 101 discrete data points integer � = −50, −49, … , 49, 50. In fig. 2, the first Fig. 1. The function to be Fourier transformed few Fourier components are plotted separately (left) and added together (right) to form an approximation to the original function. Finally, fig. 3 demonstrates that by including the components up to � = 50, a faithful representation of the original function can be obtained. � ��, �� & �� Single components Summing over components up to m 0 �! = 0.6 �! = 0 �! = 0 1 �! = 1.9 �! = 0.01 �! = 2.2 2 �! = 0.27 �! = 0.02 �! = −1.3 3 �! = 0.39 �! = 0.03 �! = 0.4 Fig.2.
    [Show full text]