1A. Dirac Delta Function the Following Comes from Chapter 1 of My Other Document on Delta Function

Total Page:16

File Type:pdf, Size:1020Kb

1A. Dirac Delta Function the Following Comes from Chapter 1 of My Other Document on Delta Function (updated 2016-Nov-4,7:40pm) MEDE2500 (2016-2017) Tutorial 3 MEDE2500 Tutorial 3 2016-Nov-7 Content 1. The Dirac Delta Function, singularity functions, even and odd functions 2. The sampling process and aliasing 3. A simple filtering system 1a. Dirac Delta Function The following comes from chapter 1 of my other document on Delta function. (Other parts of the pdf is related to integration on delta function, which is not the main concern here http://www.eee.hku.hk/~msang/DiracDeltaFunction_Ang.pdf) For simplicity, we can say that the Unit Delta Function has the form 1 푖푓 푡 = 0 훿(푡) = { 0 푒푙푠푒 The following shows some delta functions with different shift The other name of Delta function is impulse function, Dirac pulse function. 1 MEDE2500 (2016-2017) Tutorial 3 Impulse is very useful. It can be used to generate other function. The unit step function (Heaviside Unit Step function) 푡 푢(푡) = ∫ 훿(푠)푑푠 −∞ For simplicity, we can say that the Unit Step Function has the form 1 푖푓 푡 ≥ 0 푢(푡) = { 0 푒푙푠푒 The following shows some step functions The ramp function 푡 푟(푡) = ∫ 푢(푠)푑푠 −∞ For simplicity, we can say that the ramp function has the form 푡 푖푓 푡 ≥ 0 푟(푡) = { 0 푒푙푠푒 Relationship between impulse, step and ramp 푑 푑2 푑 훿 = 푢 = 푟 , 푢 = 푟 = ∫ 훿푑푠 , 푟 = ∫ 푢푑푠 = ∫ ∫ 훿푑푠2 푑푡 푑푡2 푑푡 (훿, 푢, 푟) together are called singular functions Singular function are useful for expressing other function. 2 MEDE2500 (2016-2017) Tutorial 3 EXAMPLE 1. Write down the expression of the following signal. Answer Note. 푥(푡) = 2(푢(푡) − 푢(푡 − 2)) + (푢(푡 − 2) − 푢(푡 − 4)) + 2(푢(푡 − 4) − 푢(푡 − 6)) + 2(푢(푡 − 6) − 푢(푡 − 8))(1 − 푟(푡 − 6)) After simplification 푥(푡) = 2푢(푡) − 푢(푡 − 2) + 푢(푡 − 4) − 2푢(푡 − 8) − 2(푢(푡 − 6) − 푢(푡 − 8))푟(푡 − 6) 3 MEDE2500 (2016-2017) Tutorial 3 EXAMPLE 2. Write down the expression of the following signal. Answer: 2 [푢(푡) − 푢(푡 − 1.5)] [1 − 푟(푡)] 1.5 2 +[푢(푡 − 1.5) − 푢(푡 − 3)] 푟(푡 − 1.5) 1.5 −2훿(푡 − 4) EXAMPLE 3. Write down the expression of the following signal. (Called impulse train or Daric comb). ∞ Answer: 푠(푡) = ∑푛=−∞ 훿(푡 − 푛푇) 1b. Even and Odd function A function is even if it is symmetric along the y-axis. A function is even if it is anti-symmetrical along the y-axis. 푓 is even ↔ 푓(푥) = 푓(−푥) 푓 is odd ↔ 푓(푥) = −푓(−푥) Example of even and odd function 4 MEDE2500 (2016-2017) Tutorial 3 Even and odd function decomposition theorem. Any function can be written as a sum of even and odd functions. 푓(푥) = 푓푒(푥) + 푓표(푥) where 1 푓푒(푥) = (푓(푥) + 푓(−푥)) 2 1 푓 (푥) = (푓(푥) − 푓(−푥)) 표 2 Decomposition of function as even and odd function. EXAMPLE 4. Decompose the function below into even and odd function. Answer: EXAMPLE 5. Decompose the function below into even and odd function. Answer: 5 MEDE2500 (2016-2017) Tutorial 3 Why care about even and odd function: speed up calculation. 1 EXAMPLE 6. Find the spectrum of 푥(푡) = [푢(푡 − 1) − 푢(푡 + 1)]. (The 푥 in example 4). 2 푒 The standard way: ∞ 푋(휔) = ∫ 푥(푡)푒−푗휔푡푑푡 −∞ 1 1 = ∫ 푒−푗휔푡푑푡 2 −1 −1 = 푒−푗휔푡|1 2푗휔 −1 −1 = (푒−푗휔 − 푒푗휔) 2푗휔 1 = sin 휔 휔 = sinc 휔 The “fast” way: ∞ 푋(휔) = ∫ 푥(푡)푒−푗휔푡푑푡 −∞ Expand the 푒−푗휔푡 using Euler formula ∞ 푋(휔) = ∫ 푥(푡)[cos 휔푡 − 푗 sin 휔푡]푑푡 −∞ ∞ ∞ 푋(휔) = ∫ 푥(푡) cos 휔푡 푑푡 − 푗 ∫ 푥(푡) sin 휔푡 푑푡 −∞ −∞ Note that (i) 푥(푡) is even and sin 휔푡 is odd, (ii) 푒푣푒푛 × 표푑푑 = 표푑푑. (iii) the integration of odd function is zero. Thus we can ignore the second term. ∞ 푋(휔) = ∫ 푥(푡) cos 휔푡 푑푡 −∞ 1 1 = ∫ cos 휔푡 푑푡 2 −1 1 = sin 휔푡 |1 2휔 −1 1 = sin 휔 휔 = sinc 휔 6 MEDE2500 (2016-2017) Tutorial 3 EXAMPLE 7. Find the spectrum of 푥0(푡) in example 4. 푡 푥 (푡) = [푢(푡 − 1) − 푢(푡 + 1)] 표 2 “Normal way” “Fast way” ∞ ∞ 푋(휔) = ∫ 푥(푡)푒−푗휔푡푑푡 푋(휔) = ∫ 푥(푡)푒−푗휔푡푑푡 −∞ −∞ 1 Expand the exp term 1 = ∫ 푡푒−푗휔푡푑푡 ∞ 2 −1 = ∫ 푥(푡)[cos 휔푡 − 푗 sin 휔푡]푑푡 −∞ Can ignore the first term since it is zero. 1 −푗 푋(휔) = ∫ 푡 sin 휔푡 푑푡 2 −1 Perform integration by parts 1 푗 = ∫ 푡푑푐표푠휔푡 2휔 −1 푗 2 = [2 cos 휔 − sin 휔] 2휔 휔 sin 휔 − 휔 cos 휔 = −푗 휔2 Message from this example: both are clumsy. But making use of even-odd function may help reduce some of the step!!! 7 MEDE2500 (2016-2017) Tutorial 3 2a. Sampling Sampling turns a continuous time signal x(t) into discrete time signal x[n]. There are many sampling schemes but usually uniform sampling will be used: the sampling interval is fix (constant T). Discrete signal is obtained by multiplying a sampling signal s(t) with the original function. s(t) is an impulse train ∞ 푠(푡) = ∑ 훿(푡 − 푛푇) 푛=−∞ Therefore, the multiplication between 푥(푡) and 푠(푡) creates a signal 푥(푛푇) 푥푐(푡) = 푥(푛푇) = 푥(푡)푠(푡) ∞ = 푥(푡) ∑ 훿(푡 − 푛푇) 푛=−∞ ∞ = ∑ 푥(푛푇)훿(푡 − 푛푇) 푛=−∞ Now, consider the spectrum. Recall that Fourier Series of 푣(푡) if 푣(푡)is periodic Spectrum of a signal 푣(푡) = { Fourier Transform of 푣(푡) if 푣(푡)is aperiodic Let’s assume the spectrum of x(t) is 푋(휔). (or 푋(푗휔) as shown below.) The spectrum is band-limited. That means the frequency content (complex spectrum) of the signal x(t) is within a frequency range [−휔푀 + 휔푀] (subscript M means max). In “drawing” a spectrum, actually any kind of shape is possible. But usually triangle will be used. A triangle spectrum means “strong low frequency, weak high frequency”. 8 MEDE2500 (2016-2017) Tutorial 3 Now assumes we have the spectrum 푆(휔) of s(t). To find the spectrum 푋푐(휔) of 푥푐(푡), there is a theorem: Convolution theorem on spectrum. The relationship between 푋(휔), 푆(휔) and 푋푐(휔) is 푋푐(휔) = 푋(휔) ∗ 푆(휔) where * is convolution. Some technical details 1. The complete theorem (i). Two signal multiplied together in the time domain is equivalent to the two signal convoluted together in the frequency domain. (ii). Two signal convoluted in the time domain is equivalent to the two signal multiplied together in the frequency domain. i.e. 푥(푡) ∗ 푠(푡) ↔ 푋(휔)푆(휔) 푥(푡)푠(푡) ↔ 푋(휔) ∗ 푆(휔) 2. Normalization constant Sometime there will be a normalization constant before the expression. For example 1 1 푥(푡)푠(푡) ↔ 푋(휔) ∗ 푆(휔) 표푟 푥(푡) ∗ 푠(푡) ↔ 푋(휔)푆(휔) 2휋 √2휋 These are just different notations used in different books. The spectrum - the Fourier Series of 풔(풕). Since 푠(푡) is periodic. So we compute the Fourier series. Fourier series of 푠(푡) is ∞ 푗푚휔푡 푠(푡) = ∑ 푐푚푒 푚=−∞ where 푇/2 1 푐 = ∫ 푠(푡)푒푗푚휔푡푑푡 푚 푇 −푇/2 Plug in the equation of s(t) into the integration 푇/2 ∞ 1 푐 = ∫ ∑ 훿(푡 − 푛푇) 푒푗푚휔푡푑푡 푚 푇 −푇/2 푛=−∞ 푇 푇 Since integral range is [− + ] and 훿(푡 − 푛푇) = 0 for 푡 ≠ 푛푇, so all the terms except 훿(푡) 2 2 in the summation vanish. 푇/2 1 푐 = ∫ 훿(푡)푒푗푚휔푡푑푡 푚 푇 −푇/2 9 MEDE2500 (2016-2017) Tutorial 3 Mathematics trick: since 훿(푡) = 0 for 푡 ≠ 0, we can extend the integration range ∞ 1 푐 = ∫ 훿(푡)푒푗푚휔푡푑푡 푚 푇 −∞ Now we can use the “screening property” of Delta function (page 1 property 2) 1 푐 = 푒푗푚휔0 푛 푇 1 = 푇 Thus the Fourier series of 푠(푡) is ∞ 1 푠(푡) = ∑ 푒푗푚휔푡 푇 푚=−∞ Now, recall that spectrum of a periodic signal are the coefficient of the Fourier series (tutorial 2). So the spectrum is As the spectrum is also an impulse train, so it can be expressed mathematically as ∞ ∞ 1 푛 2휋 푆(푓) = ∑ 훿 (푓 − ) 표푟 푆(휔) = ∑ 훿(휔 − 푛휔) 푇 푇 푇 푛=−∞ 푛=−∞ Note. If s(t) is not infinite pulse train but finite pulse train. Then it is NOT periodic function and the process above changed from Fourier series to Fourier Transform. What we have now: (i) All the expressions of 푥(푡), 푠(푡) , 푥푐(푡), 푋(휔) and 푆(휔) (ii) The relationships between them. (The convolution theorem on spectrum). From (ii), what we need to do is to convolute 푋(휔) and 푆(휔) to get the spectrum of the sampled signal. 10 MEDE2500 (2016-2017) Tutorial 3 Convolution with impulse train illustration How to “think” about convolution “When f is only one impulse. Then convolution is just translation” “Amplitude is just magnification” 11 MEDE2500 (2016-2017) Tutorial 3 “Multiple impulses? Just add them together!” “Don’t forget the shape of g matters!” EXAMPLE 8. 푓 = [1 2 3 4], 푔 = [1 − 1 1 ]. Find 푓 ∗ 푔. Answer Consider 푓 ∗ 푔 Result: 푓 ∗ 푔 = 푓 ∗ 푔[1] + 푓 ∗ 푔[2] + 푓 ∗ 푔[3] = [1, 1,2,3, −1,4] Consider 푔 ∗ 푓 Also give you [1, 1,2,3, −1,4], since 푓 ∗ 푔 = 푔 ∗ 푓 12 MEDE2500 (2016-2017) Tutorial 3 Hence, the overall picture of the sampling process is shown below (I) and (II) produce (III) through multiplication.
Recommended publications
  • Convolution! (CDT-14) Luciano Da Fontoura Costa
    Convolution! (CDT-14) Luciano da Fontoura Costa To cite this version: Luciano da Fontoura Costa. Convolution! (CDT-14). 2019. hal-02334910 HAL Id: hal-02334910 https://hal.archives-ouvertes.fr/hal-02334910 Preprint submitted on 27 Oct 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Convolution! (CDT-14) Luciano da Fontoura Costa luciano@ifsc.usp.br S~aoCarlos Institute of Physics { DFCM/USP October 22, 2019 Abstract The convolution between two functions, yielding a third function, is a particularly important concept in several areas including physics, engineering, statistics, and mathematics, to name but a few. Yet, it is not often so easy to be conceptually understood, as a consequence of its seemingly intricate definition. In this text, we develop a conceptual framework aimed at hopefully providing a more complete and integrated conceptual understanding of this important operation. In particular, we adopt an alternative graphical interpretation in the time domain, allowing the shift implied in the convolution to proceed over free variable instead of the additive inverse of this variable. In addition, we discuss two possible conceptual interpretations of the convolution of two functions as: (i) the `blending' of these functions, and (ii) as a quantification of `matching' between those functions.
    [Show full text]
  • Eliminating Aliasing Caused by Discontinuities Using Integrals of the Sinc Function
    Sound production – Sound synthesis: Paper ISMR2016-48 Eliminating aliasing caused by discontinuities using integrals of the sinc function Fabián Esqueda(a), Stefan Bilbao(b), Vesa Välimäki(c) (a)Aalto University, Dept. of Signal Processing and Acoustics, Espoo, Finland, fabian.esqueda@aalto.fi (b)Acoustics and Audio Group, University of Edinburgh, United Kingdom, s.bilbao@ed.ac.uk (c)Aalto University, Dept. of Signal Processing and Acoustics, Espoo, Finland, vesa.valimaki@aalto.fi Abstract A study on the limits of bandlimited correction functions used to eliminate aliasing in audio signals with discontinuities is presented. Trivial sampling of signals with discontinuities in their waveform or their derivatives causes high levels of aliasing distortion due to the infinite bandwidth of these discontinuities. Geometrical oscillator waveforms used in subtractive synthesis are a common example of audio signals with these characteristics. However, discontinuities may also be in- troduced in arbitrary signals during operations such as signal clipping and rectification. Several existing techniques aim to increase the perceived quality of oscillators by attenuating aliasing suf- ficiently to be inaudible. One family of these techniques consists on using the bandlimited step (BLEP) and ramp (BLAMP) functions to quasi-bandlimit discontinuities. Recent work on antialias- ing clipped audio signals has demonstrated the suitability of the BLAMP method in this context. This work evaluates the performance of the BLEP, BLAMP, and integrated BLAMP functions by testing whether they can be used to fully bandlimit aliased signals. Of particular interest are cases where discontinuities appear past the first derivative of a signal, like in hard clipping. These cases require more than one correction function to be applied at every discontinuity.
    [Show full text]
  • 7: Inner Products, Fourier Series, Convolution
    7: FOURIER SERIES STEVEN HEILMAN Contents 1. Review 1 2. Introduction 1 3. Periodic Functions 2 4. Inner Products on Periodic Functions 3 5. Trigonometric Polynomials 5 6. Periodic Convolutions 7 7. Fourier Inversion and Plancherel Theorems 10 8. Appendix: Notation 13 1. Review Exercise 1.1. Let (X; h·; ·i) be a (real or complex) inner product space. Define k·k : X ! [0; 1) by kxk := phx; xi. Then (X; k·k) is a normed linear space. Consequently, if we define d: X × X ! [0; 1) by d(x; y) := ph(x − y); (x − y)i, then (X; d) is a metric space. Exercise 1.2 (Cauchy-Schwarz Inequality). Let (X; h·; ·i) be a complex inner product space. Let x; y 2 X. Then jhx; yij ≤ hx; xi1=2hy; yi1=2: Exercise 1.3. Let (X; h·; ·i) be a complex inner product space. Let x; y 2 X. As usual, let kxk := phx; xi. Prove Pythagoras's theorem: if hx; yi = 0, then kx + yk2 = kxk2 + kyk2. 1 Theorem 1.4 (Weierstrass M-test). Let (X; d) be a metric space and let (fj)j=1 be a sequence of bounded real-valued continuous functions on X such that the series (of real num- P1 P1 bers) j=1 kfjk1 is absolutely convergent. Then the series j=1 fj converges uniformly to some continuous function f : X ! R. 2. Introduction A general problem in analysis is to approximate a general function by a series that is relatively easy to describe. With the Weierstrass Approximation theorem, we saw that it is possible to achieve this goal by approximating compactly supported continuous functions by polynomials.
    [Show full text]
  • Fourier Series
    Academic Press Encyclopedia of Physical Science and Technology Fourier Series James S. Walker Department of Mathematics University of Wisconsin–Eau Claire Eau Claire, WI 54702–4004 Phone: 715–836–3301 Fax: 715–836–2924 e-mail: walkerjs@uwec.edu 1 2 Encyclopedia of Physical Science and Technology I. Introduction II. Historical background III. Definition of Fourier series IV. Convergence of Fourier series V. Convergence in norm VI. Summability of Fourier series VII. Generalized Fourier series VIII. Discrete Fourier series IX. Conclusion GLOSSARY ¢¤£¦¥¨§ Bounded variation: A function has bounded variation on a closed interval ¡ ¢ if there exists a positive constant © such that, for all finite sets of points "! "! $#&% (' #*) © ¥ , the inequality is satisfied. Jordan proved that a function has bounded variation if and only if it can be expressed as the difference of two non-decreasing functions. Countably infinite set: A set is countably infinite if it can be put into one-to-one £0/"£ correspondence with the set of natural numbers ( +,£¦-.£ ). Examples: The integers and the rational numbers are countably infinite sets. "! "!;: # # 123547698 Continuous function: If , then the function is continuous at the point : . Such a point is called a continuity point for . A function which is continuous at all points is simply referred to as continuous. Lebesgue measure zero: A set < of real numbers is said to have Lebesgue measure ! $#¨CED B ¢ £¦¥ zero if, for each =?>A@ , there exists a collection of open intervals such ! ! D D J# K% $#L) ¢ £¦¥ ¥ ¢ = that <GFIH and . Examples: All finite sets, and all countably infinite sets, have Lebesgue measure zero. "! "! % # % # Odd and even functions: A function is odd if for all in its "! "! % # # domain.
    [Show full text]
  • Solutions to HW Due on Feb 13
    Math 432 - Real Analysis II Solutions to Homework due February 13 In class, we learned that the n-th remainder for a smooth function f(x) defined on some open interval containing 0 is given by n−1 X f (k)(0) R (x) = f(x) − xk: n k! k=0 Taylor's Theorem gives a very helpful expression of this remainder. It says that for some c between 0 and x, f (n)(c) R (x) = xn: n n! A function is called analytic on a set S if 1 X f (k)(0) f(x) = xk k! k=0 for all x 2 S. In other words, f is analytic on S if and only if limn!1 Rn(x) = 0 for all x 2 S. Question 1. Use Taylor's Theorem to prove that all polynomials are analytic on all R by showing that Rn(x) ! 0 for all x 2 R. Solution 1. Let f(x) be a polynomial of degree m. Then, for all k > m derivatives, f (k)(x) is the constant 0 function. Thus, for any x 2 R, Rn(x) ! 0. So, the polynomial f is analytic on all R. x Question 2. Use Taylor's Theorem to prove that e is analytic on all R. by showing that Rn(x) ! 0 for all x 2 R. Solution 2. Note that f (k)(x) = ex for all k. Fix an x 2 R. Then, by Taylor's Theorem, ecxn R (x) = n n! for some c between 0 and x. We now proceed with two cases.
    [Show full text]
  • The Best Approximation of the Sinc Function by a Polynomial of Degree N with the Square Norm
    Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 307892, 12 pages doi:10.1155/2010/307892 Research Article The Best Approximation of the Sinc Function by a Polynomial of Degree n with the Square Norm Yuyang Qiu and Ling Zhu College of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou 310018, China Correspondence should be addressed to Yuyang Qiu, yuyangqiu@gmail.com Received 9 April 2010; Accepted 31 August 2010 Academic Editor: Wing-Sum Cheung Copyright q 2010 Y. Qiu and L. Zhu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The polynomial of degree n which is the best approximation of the sinc function on the interval 0, π/2 with the square norm is considered. By using Lagrange’s method of multipliers, we construct the polynomial explicitly. This method is also generalized to the continuous function on the closed interval a, b. Numerical examples are given to show the effectiveness. 1. Introduction Let sin cxsin x/x be the sinc function; the following result is known as Jordan inequality 1: 2 π ≤ sin cx < 1, 0 <x≤ , 1.1 π 2 where the left-handed equality holds if and only if x π/2. This inequality has been further refined by many scholars in the past few years 2–30. Ozban¨ 12 presented a new lower bound for the sinc function and obtained the following inequality: 2 1 4π − 3 π 2 π2 − 4x2 x − ≤ sin cx.
    [Show full text]
  • Even and Odd Functions Fourier Series Take on Simpler Forms for Even and Odd Functions Even Function a Function Is Even If for All X
    04-Oct-17 Even and Odd functions Fourier series take on simpler forms for Even and Odd functions Even function A function is Even if for all x. The graph of an even function is symmetric about the y-axis. In this case Examples: 4 October 2017 MATH2065 Introduction to PDEs 2 1 04-Oct-17 Even and Odd functions Odd function A function is Odd if for all x. The graph of an odd function is skew-symmetric about the y-axis. In this case Examples: 4 October 2017 MATH2065 Introduction to PDEs 3 Even and Odd functions Most functions are neither odd nor even E.g. EVEN EVEN = EVEN (+ + = +) ODD ODD = EVEN (- - = +) ODD EVEN = ODD (- + = -) 4 October 2017 MATH2065 Introduction to PDEs 4 2 04-Oct-17 Even and Odd functions Any function can be written as the sum of an even plus an odd function where Even Odd Example: 4 October 2017 MATH2065 Introduction to PDEs 5 Fourier series of an EVEN periodic function Let be even with period , then 4 October 2017 MATH2065 Introduction to PDEs 6 3 04-Oct-17 Fourier series of an EVEN periodic function Thus the Fourier series of the even function is: This is called: Half-range Fourier cosine series 4 October 2017 MATH2065 Introduction to PDEs 7 Fourier series of an ODD periodic function Let be odd with period , then This is called: Half-range Fourier sine series 4 October 2017 MATH2065 Introduction to PDEs 8 4 04-Oct-17 Odd and Even Extensions Recall the temperature problem with the heat equation.
    [Show full text]
  • Oversampling of Stochastic Processes
    OVERSAMPLING OF STOCHASTIC PROCESSES by D.S.G. POLLOCK University of Leicester In the theory of stochastic differential equations, it is commonly assumed that the forcing function is a Wiener process. Such a process has an infinite bandwidth in the frequency domain. In practice, however, all stochastic processes have a limited bandwidth. A theory of band-limited linear stochastic processes is described that reflects this reality, and it is shown how the corresponding ARMA models can be estimated. By ignoring the limitation on the frequencies of the forcing function, in the process of fitting a conventional ARMA model, one is liable to derive estimates that are severely biased. If the data are sampled too rapidly, then maximum frequency in the sampled data will be less than the Nyquist value. However, the underlying continuous function can be reconstituted by sinc function or Fourier interpolation; and it can be resampled at a lesser rate corresponding to the maximum frequency of the forcing function. Then, there will be a direct correspondence between the parameters of the band-limited ARMA model and those of an equivalent continuous-time process; and the estimation biases can be avoided. 1 POLLOCK: Band-Limited Processes 1. Time-Limited versus Band-Limited Processes Stochastic processes in continuous time are usually modelled by filtered versions of Wiener processes which have infinite bandwidth. This seems inappropriate for modelling the slowly evolving trajectories of macroeconomic data. Therefore, we shall model these as processes that are limited in frequency. A function cannot be simultaneously limited in frequency and limited in time. One must choose either a band-limited function, which extends infinitely in time, or a time-limited function, which extents over an infinite range of frequencies.
    [Show full text]
  • Shannon Wavelets Theory
    Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2008, Article ID 164808, 24 pages doi:10.1155/2008/164808 Research Article Shannon Wavelets Theory Carlo Cattani Department of Pharmaceutical Sciences (DiFarma), University of Salerno, Via Ponte don Melillo, Fisciano, 84084 Salerno, Italy Correspondence should be addressed to Carlo Cattani, ccattani@unisa.it Received 30 May 2008; Accepted 13 June 2008 Recommended by Cristian Toma Shannon wavelets are studied together with their differential properties known as connection coefficients. It is shown that the Shannon sampling theorem can be considered in a more general approach suitable for analyzing functions ranging in multifrequency bands. This generalization R ff coincides with the Shannon wavelet reconstruction of L2 functions. The di erential properties of Shannon wavelets are also studied through the connection coefficients. It is shown that Shannon ∞ wavelets are C -functions and their any order derivatives can be analytically defined by some kind of a finite hypergeometric series. These coefficients make it possible to define the wavelet reconstruction of the derivatives of the C -functions. Copyright q 2008 Carlo Cattani. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction Wavelets 1 are localized functions which are a very useful tool in many different applications: signal analysis, data compression, operator analysis, and PDE solving see, e.g., 2 and references therein. The main feature of wavelets is their natural splitting of objects into different scale components 1, 3 according to the multiscale resolution analysis.
    [Show full text]
  • Further Analysis on Classifications of PDE(S) with Variable Coefficients
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Applied Mathematics Letters 23 (2010) 966–970 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Further analysis on classifications of PDE(s) with variable coefficients A. Kılıçman a,∗, H. Eltayeb b, R.R. Ashurov c a Department of Mathematics and Institute for Mathematical Research, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor, Malaysia b Mathematics Department, College of Science, King Saud University, P.O.Box 2455, Riyadh 11451, Saudi Arabia c Institute of Advance Technology, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor, Malaysia article info a b s t r a c t Article history: In this study we consider further analysis on the classification problem of linear second Received 1 April 2009 order partial differential equations with non-constant coefficients. The equations are Accepted 13 April 2010 produced by using convolution with odd or even functions. It is shown that the patent of classification of new equations is similar to the classification of the original equations. Keywords: ' 2010 Elsevier Ltd. All rights reserved. Even and odd functions Double convolution Classification 1. Introduction The subject of partial differential equations (PDE's) has a long history and a wide range of applications. Some second- order linear partial differential equations can be classified as parabolic, hyperbolic or elliptic in order to have a guide to appropriate initial and boundary conditions, as well as to the smoothness of the solutions. If a PDE has coefficients which are not constant, it is possible that it is of mixed type.
    [Show full text]
  • Contentscontents 2323 Fourier Series
    ContentsContents 2323 Fourier Series 23.1 Periodic Functions 2 23.2 Representing Periodic Functions by Fourier Series 9 23.3 Even and Odd Functions 30 23.4 Convergence 40 23.5 Half-range Series 46 23.6 The Complex Form 53 23.7 An Application of Fourier Series 68 Learning outcomes In this Workbook you will learn how to express a periodic signal f(t) in a series of sines and cosines. You will learn how to simplify the calculations if the signal happens to be an even or an odd function. You will learn some brief facts relating to the convergence of the Fourier series. You will learn how to approximate a non-periodic signal by a Fourier series. You will learn how to re-express a standard Fourier series in complex form which paves the way for a later examination of Fourier transforms. Finally you will learn about some simple applications of Fourier series. Periodic Functions 23.1 Introduction You should already know how to take a function of a single variable f(x) and represent it by a power series in x about any point x0 of interest. Such a series is known as a Taylor series or Taylor expansion or, if x0 = 0, as a Maclaurin series. This topic was firs met in 16. Such an expansion is only possible if the function is sufficiently smooth (that is, if it can be differentiated as often as required). Geometrically this means that there are no jumps or spikes in the curve y = f(x) near the point of expansion.
    [Show full text]
  • On the Real Projections of Zeros of Almost Periodic Functions
    ON THE REAL PROJECTIONS OF ZEROS OF ALMOST PERIODIC FUNCTIONS J.M. SEPULCRE AND T. VIDAL Abstract. This paper deals with the set of the real projections of the zeros of an arbitrary almost periodic function defined in a vertical strip U. It pro- vides practical results in order to determine whether a real number belongs to the closure of such a set. Its main result shows that, in the case that the Fourier exponents {λ1, λ2, λ3,...} of an almost periodic function are linearly independent over the rational numbers, such a set has no isolated points in U. 1. Introduction The theory of almost periodic functions, which was created and developed in its main features by H. Bohr during the 1920’s, opened a way to study a wide class of trigonometric series of the general type and even exponential series. This theory shortly acquired numerous applications to various areas of mathematics, from harmonic analysis to differential equations. In the case of the functions that are defined on the real numbers, the notion of almost periodicity is a generalization of purely periodic functions and, in fact, as in classical Fourier analysis, any almost periodic function is associated with a Fourier series with real frequencies. Let us briefly recall some notions concerning the theory of the almost periodic functions of a complex variable, which was theorized in [4] (see also [3, 5, 8, 11]). A function f(s), s = σ + it, analytic in a vertical strip U = {s = σ + it ∈ C : α< σ<β} (−∞ ≤ α<β ≤ ∞), is called almost periodic in U if to any ε > 0 there exists a number l = l(ε) such that each interval t0 <t<t0 + l of length l contains a number τ satisfying |f(s + iτ) − f(s)|≤ ε ∀s ∈ U.
    [Show full text]