DOCSLIB.ORG

Recursively Generated Periodic Sequences

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Recursively Generated Periodic Sequences Can. J. Math., Vol. XXVI, No. 6, 1974, pp. 1356-1371 RECURSIVELY GENERATED PERIODIC SEQUENCES R. P. KURSHAN AND B. GOPINATH 1. Introduction. A sequence (xn) (n = 1, 2, . .) is periodic if xn+p = xn for some p and all n. Periodic sequences arise naturally in geometry and arith­ metic in the study of mosaic patterns [4], continued fractions and frieze patterns [3; 5]. Some digital oscillators and tone generators also generate periodic sequences. In these cases one computes the period p of the sequence in question. On the other hand, in pseudo random sequences and cryptography [8] it is required to recursively generate sequences of large periods. We say a sequence (xn)n=i of ^-dimensional vectors is recursively generated if there exists a (vector valued) function f such that xn+i = f(xw). This is a generalization of the more usual recursion (1.1) yn = g(yn-k, . , 3>w_i) (n > k) where the y/s are scalars. The f associated with (1.1) is (1.2) f (xi, . , xk) = (x2, ...,**, g(xu . , xk)). The advantage of the representation (1.2) is that the periodicity of (yn)n can be examined through the structure of g via periodicity of f : if yn+v = yn for all n (independent of the initial values yit ... , yk), then p-io\d composition of f : fp = fofo...of satisfies P(x) = x; indeed, p f*(yi, • • •, Jic) = f -Hy2,..., y*, g(yu • • •, y*)) = ... = f(yp,yp+u • • •,yp+k-i) = (yv+u • • •,yP+k) = (yi,... ,yk). In this paper we consider those recursions whose respective generators f have a power series expansion about a fixed point; in particular, it makes sense to consider the Jacobian of f at that point (i.e., the linear part of f with respect to its power series expansion). We show that one can determine the period of f by merely computing the period of the Jacobian at zero of f, a certain affine translation of f. Using this, we provide sharp bounds for the minimum k, given the period of f, and the maximum period of f, given k, when the ground field is the rationals. The theory is applied to differential equations; and some examples are discussed. Throughout, F will denote a subfield of the complex numbers. (Actually, it suffices to assume char F = 0, if all power series are either taken to be poly­ nomials or are considered as formal series (''expanded" about 0)-thus obvi- Received May 1, 1973 and in revised form, October 26, 1973. 1356 Downloaded from https://www.cambridge.org/core. 23 Sep 2021 at 15:35:31, subject to the Cambridge Core terms of use. PERIODIC SEQUENCES 1357 ating (1.7) and concern about convergence.) Vectors and vector valued functions will be distinguished by natural bold face type, e.g., x is a vector, k k xt is the ith component of x and X = (xi, ...,xk); similarly, if U C F , f : U—» F y then f = (/i, . , fk) where ft : U —> F. The dimension k of the underlying space will be called the memory of f (cf. (1.1)), and unless otherwise stated, we assume throughout that all vector valued functions are of memory k. h Let N denote the nonnegative integers and let a = (ai, . , ak) £ N . Given a vector x £ Fk, we will use the notation x* to denote the scalar 1 ak xf • . • xk . We say that a scalar valued function g is analytic in a neighbor­ k hood U of a point x0 G F*, if there are scalars ca(a £ N ) such that for each x £ U and each 1-1 onto map co: N —> Nk the series (1.3) É *.(fl(x-Xo)-(i) 1=0 converges to g(x). In this case, instead of (1.3) we can write (1.4) g(x) = £ c.(x-Xo) without ambiguity. Note that this is equivalent to the condition that (1.3) converges absolutely to g(x), and hence the power series expansion (1.4) is unique in the sense that if XXa(x ~~ xo)a also converges absolutely to g(x) in £/, then ca = Ca for all a. We say g is analytic in an open set if g is analytic in a neighborhood of each point of that open set. We say f is analytic in an open set U if each component ft is analytic there. If f is analytic in an open set U and g is analytic in an open set containing f(Z7), then g o f is analytic in U. The proofs of this and the preceding assertions can be found in [7, §9.1-9.3]. (All functions are single-valued.) One can alternatively view f in a formal sense. Let x be a ^-dimensional indeterminate, x = (xi, . , xk) and for ca Ç F let f be the formal power series (1.5) f(x) = £ cjt. (With formal power series, operations are performed term by term, and for r f (x) = S^a'x"» f = f if and only if each cj = ca.) The term analytic will also be used to designate the formal power series (1.5); this will not lead to confusion, as assertions regarding functions analytic (in the first sense) in a neighborhood of 0 remain true when "analytic" is construed in the second (formal) sense: one must merely disregard mention of neighborhoods and domains. For f the formal power series (1.5), we define f (0) to be the "constant" term C(0 o) ; the reader should construe the phrase "f is analytic in a neighbor­ hood of a fixed point" as applied to (1.5), to mean merely: f (0) = 0. The function f will be said to have a fixed point x0 if there exists some vector x0 such that f(x0) = x0. We will use 1(1) to denote the identity function (matrix) I(x) = x(7x = x). The w-fold iteration of f : f o . of will be denoted fn. Whenever we write in we assume there is some open set U C Fk Downloaded from https://www.cambridge.org/core. 23 Sep 2021 at 15:35:31, subject to the Cambridge Core terms of use. 1358 R. P. KURSHAN AND B. GOPINATH such that f is defined on Uti V(U). Where there is a possibility of confusing fn(x) with the n-fold product/(x) -f(x) «... •/(#), the latter will be denoted A sequence of vectors (xn)n is said to be periodic of period p if xn+p = xn for all ny and p is the smallest such positive integer. If the sequence is recursively generated by f (so xn+i = f (xw) for all n), f need not be periodic in the sense that for x in the domain of f, P(x) = x (for example, fix) = —x3 recursively n generates the periodic sequence xn = ( — l) , but is not itself periodic in any open set); however, if in some set U, P(x) = x, then for any initial vector Xi Ç U, the sequence (xn)n recursively generated by f is periodic. Notice that if for some set D, f is defined in U = Utîf'CD) and P = I in D, then f (U) = U and P = I in 17. We define the period of the generator f, denoted per f, to be the smallest positive integer^ such that P = I in the domain [/of f. If (xn)n is recursively generated by a periodic f, then the period p of (xn)n divides q = per f, as xn+p = xn = P{xn) = xn+Q for all w. Notice that if f is also continuous in U, then f is a homeomorphism between U and f (£/). Furthermore, if fp is analytic in a connected open set U, and f is periodic of period p in some nonempty open subset Ur C U, then f is periodic of period p in all of U: this follows by the "principle of analytic continuation" [7, 9.4.2] which in this case says that since P = I in U', this must hold throughout U. In fact, more can be said if f is a rational function (that is, each ft is a quotient of polynomials). In this case, suppose by means of a power series expansion valid in some neighborhood U, it is determined that f is periodic of period p in U. Then each component (P)i(i = 1, . , k) is a rational function, say P JQu and in U, P i{x)/Qt(x) — xt = 0; i.e., (1.6) Pt(x) - xtQt(x) = 0 in the nonempty open set U. Hence (1.6) holds for all x Ç Fk, and thus f is periodic of period p in the complement of {x|<2(x) = 0}. On the other hand, one may think of (xn)n as a sequence of indeterminates, defined formally by xn+1 = f(xn) where f is now considered to be a formal power series. In this case, of course, the period of (xn)n and the period of f are identical. For X (E F we define per X to be the multiplicative order of X. The following proposition, of course, does not apply to formal power series. (1.7) PROPOSITION. Suppose f is periodic in a neighborhood U of a fixed point v x0. Define f'(x) = f (x + x0) — x0; then t (0) = 0 and V is analytic in a neighborhood Ur of 0. Furthermore, V is periodic in U' and the period of f in U is equal to the period of ff in U''.
Load more

Recommended publications
  • 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: [email protected] 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]
  • 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]
  • Almost Periodic Sequences and Functions with Given Values
    ARCHIVUM MATHEMATICUM (BRNO) Tomus 47 (2011), 1–16 ALMOST PERIODIC SEQUENCES AND FUNCTIONS WITH GIVEN VALUES Michal Veselý Abstract. We present a method for constructing almost periodic sequences and functions with values in a metric space. Applying this method, we find almost periodic sequences and functions with prescribed values. Especially, for any totally bounded countable set X in a metric space, it is proved the existence of an almost periodic sequence {ψk}k∈Z such that {ψk; k ∈ Z} = X and ψk = ψk+lq(k), l ∈ Z for all k and some q(k) ∈ N which depends on k. 1. Introduction The aim of this paper is to construct almost periodic sequences and functions which attain values in a metric space. More precisely, our aim is to find almost periodic sequences and functions whose ranges contain or consist of arbitrarily given subsets of the metric space satisfying certain conditions. We are motivated by the paper [3] where a similar problem is investigated for real-valued sequences. In that paper, using an explicit construction, it is shown that, for any bounded countable set of real numbers, there exists an almost periodic sequence whose range is this set and which attains each value in this set periodically. We will extend this result to sequences attaining values in any metric space. Concerning almost periodic sequences with indices k ∈ N (or asymptotically almost periodic sequences), we refer to [4] where it is proved that, for any precompact sequence {xk}k∈N in a metric space X , there exists a permutation P of the set of positive integers such that the sequence {xP (k)}k∈N is almost periodic.
    [Show full text]
  • Fourier Transform for Mean Periodic Functions
    Annales Univ. Sci. Budapest., Sect. Comp. 35 (2011) 267–283 FOURIER TRANSFORM FOR MEAN PERIODIC FUNCTIONS L´aszl´oSz´ekelyhidi (Debrecen, Hungary) Dedicated to the 60th birthday of Professor Antal J´arai Abstract. Mean periodic functions are natural generalizations of periodic functions. There are different transforms - like Fourier transforms - defined for these types of functions. In this note we introduce some transforms and compare them with the usual Fourier transform. 1. Introduction In this paper C(R) denotes the locally convex topological vector space of all continuous complex valued functions on the reals, equipped with the linear operations and the topology of uniform convergence on compact sets. Any closed translation invariant subspace of C(R)iscalledavariety. The smallest variety containing a given f in C(R)iscalledthevariety generated by f and it is denoted by τ(f). If this is different from C(R), then f is called mean periodic. In other words, a function f in C(R) is mean periodic if and only if there exists a nonzero continuous linear functional μ on C(R) such that (1) f ∗ μ =0 2000 Mathematics Subject Classification: 42A16, 42A38. Key words and phrases: Mean periodic function, Fourier transform, Carleman transform. The research was supported by the Hungarian National Foundation for Scientific Research (OTKA), Grant No. NK-68040. 268 L. Sz´ekelyhidi holds. In this case sometimes we say that f is mean periodic with respect to μ. As any continuous linear functional on C(R) can be identified with a compactly supported complex Borel measure on R, equation (1) has the form (2) f(x − y) dμ(y)=0 for each x in R.
    [Show full text]
  • 6.436J / 15.085J Fundamentals of Probability, Homework 1 Solutions
    MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2018 Problem Set 1 Readings: (a) Notes from Lecture 1. (b) Handout on background material on sets and real analysis (Recitation 1). Supplementary readings: [C], Sections 1.1-1.4. [GS], Sections 1.1-1.3. [W], Sections 1.0-1.5, 1.9. Exercise 1. (a) Let N be the set of positive integers. A function f : N → {0, 1} is said to be periodic if there exists some N such that f(n + N)= f(n),for all n ∈ N. Show that the set of periodic functions is countable. (b) Does the result from part (a) remain valid if we consider rational-valued periodic functions f : N → Q? Solution: (a) For a given positive integer N,letA N denote the set of periodic functions with a period of N.Fora given N ,since thesequence, f(1), ··· ,f(N), actually defines a periodic function in AN ,wehave thateach A N contains 2N elements. For example, for N =2,there arefour functions inthe set A2: f(1)f(2)f(3)f(4) ··· =0000··· ;1111··· ;0101··· ;1010··· . The set of periodic functions from N to {0, 1}, A,can bewritten as, ∞ A = AN . N=1 ! Since the union of countably many finite sets is countable, we conclude that the set of periodic functions from N to {0, 1} is countable. (b) Still, for a given positive integer N,let AN denote the set of periodic func- tions with a period N.Fora given N ,since the sequence, f(1), ··· ,f(N), 1 actually defines a periodic function in AN ,weconclude that A N has the same cardinality as QN (the Cartesian product of N sets of rational num- bers).
    [Show full text]
  • Fourier Series
    Chapter 10 Fourier Series 10.1 Periodic Functions and Orthogonality Relations The differential equation ′′ y + 2y = F cos !t models a mass-spring system with natural frequency with a pure cosine forcing function of frequency !. If 2 = !2 a particular solution is easily found by undetermined coefficients (or by∕ using Laplace transforms) to be F y = cos !t. p 2 !2 − If the forcing function is a linear combination of simple cosine functions, so that the differential equation is N ′′ 2 y + y = Fn cos !nt n=1 X 2 2 where = !n for any n, then, by linearity, a particular solution is obtained as a sum ∕ N F y (t)= n cos ! t. p 2 !2 n n=1 n X − This simple procedure can be extended to any function that can be repre- sented as a sum of cosine (and sine) functions, even if that summation is not a finite sum. It turns out that the functions that can be represented as sums in this form are very general, and include most of the periodic functions that are usually encountered in applications. 723 724 10 Fourier Series Periodic Functions A function f is said to be periodic with period p> 0 if f(t + p)= f(t) for all t in the domain of f. This means that the graph of f repeats in successive intervals of length p, as can be seen in the graph in Figure 10.1. y p 2p 3p 4p 5p Fig. 10.1 An example of a periodic function with period p.
    [Show full text]
  • Fourier Series for Periodic Functions Lecture #8 5CT3,4,6,7
    Fourier Series for Periodic Functions Lecture #8 5CT3,4,6,7 BME 333 Biomedical Signals and Systems 2 - J.Schesser Fourier Series for Periodic Functions • Up to now we have solved the problem of approximating a function f(t) by fa(t) within an interval T. • However, if f(t) is periodic with period T, i.e., f(t)=f(t+T), then the approximation is true for all t. • And if we represent a periodic function in terms of an infinite Fourier series, such that the frequencies are all integral multiples of the frequency 1/T, where k=1 corresponds to the fundamental frequency of the function and the remainder are its harmonics. Tjkt 2 1 2 T aftedtk T () T 2 j22kt j kt j 2 kt j 2 kt TT T T ft() a00 [aakk e * e ] a k e a2Re[ a k e ] kkk11 jkt2 j k ftak( ) a0 C cos( kkk ), where 2aa Ce and 00 C k1 T BME 333 Biomedical Signals and Systems 3 - J.Schesser Another Form for the Fourier Series 2 kt ft() C0 Ckk cos( ) k1 T 22kt kt AA0 kkcos( ) B sin( ) k1 TT where Akk CBCACcos k and k - k sin k and 00 BME 333 Biomedical Signals and Systems 4 - J.Schesser Fourier Series Theorem • Any periodic function f (t) with period T which is integrable ( f ( t ) dt ) can be represented by an infinite Fourier Series • If [f (t)]2 is also integrable, then the series converges to the value of f (t) at every point where f(t) is continuous and to the average value at any discontinuity.
    [Show full text]
  • Periodic Linear Systems Lecture 17 Math 634 10/8/99
    Periodic Linear Systems Lecture 17 Math 634 10/8/99 We now consider x˙ = A(t)x (1) when A is a continuous periodic n n matrix function of t; i.e., when there × is a constant T>0 such that A(t + T )=A(t) for every t R . When that condition is satisfied, we say, more precisely, that A is T -periodic∈ .IfT is the smallest positive number for which this condition holds, we say that T is the minimal period of A. Let A be T -periodic, and let X(t) be a fundamental matrix for (1). Define ˜ n n ˜ ˜ R R X : R ( , )byX(t)=X(t + T ). Clearly, the columns of X are linearly→L independent functions of t. Also, d d X˜(t)= X(t + T )=X0(t + T )=A(t + t)X(t + T )=A(t)X˜(t), dt dt so X˜ solves the matrix equivalent of (1). Hence, X˜ is a fundamental matrix for (1). Because the dimension of the solution space of (1) is n, this means that there is a nonsingular (constant) matrix C such that X(t + T )=X(t)C for every t R . C is called a monodromy matrix. ∈ n n TB C Lemma There exists B (C , ) such that C = e . ∈L Proof. Without loss of generality, we assume that T = 1, since if it isn’t we can just rescale B by a scalar constant. We also assume, without loss of generality, that C is in Jordan canonical form. (If it isn’t, then use the fact 1 B PBP 1 that P − CP = e implies that C = e − .) Furthermore, because of the way the matrix exponential acts on a block diagonal matrix, it suffices to 1 show that for each p p Jordan block × λ 0 0 ··· ··· .
    [Show full text]
  • Discrete Signals and Their Frequency Analysis
    Discrete signals and their frequency analysis. Valentina Hubeika, Jan Cernock´yˇ DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz • recapitulation – fundamentals on discrete signals. • periodic and harmonic sequences • discrete signal processing • convolution • Fourier transform with discrete time • Discrete Fourier Transform 1 Sampled signal ⇒ discrete signal During sampling we consider only values of the signal at sampling period multiplies T : x(nT ), nT = ... − 2T, −T, 0,T, 2T, 3T,... For a discrete signal, we forget about real time and simply count the samples. Discrete time becomes : x[n], n = ... − 2, −1, 0, 1, 2, 3,... Thus we often call discrete signals just sequences. 2 Important discrete signals Unit step and unit impulse: 1 for n ≥ 0 1 for n =0 σ[n]= δ[n]= 0 elsewhere 0 elsewhere 3 Periodic discrete signals their behaviour repeats after N samples, the smallest possible N is denoted as N1 and is called fundamental period. Harmonic discrete signals (harmonic sequences) x[n]= C1 cos(ω1n + φ1) (1) • C1 is a positive constant – magnitude. • ω1 is a spositive constant – normalized angular frequency. As n is just a number, the unit of ω1 is [rad]. Note, that in the previous lecture we denoted with the same simbol an angular frequency of continuous signals. Although in the last lecture we used ′ symbol ω1 for discrete time, we will not do it any longer. You will recognize continuous time frequency if there is real time associated with it (for instance cos(ω1t)). If you see discrete time n (for instance cos(ω1n)) you should know we are talking about normalized angular frequency.
    [Show full text]
  • Fourier Transform
    Fourier Transform 1 The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different “color”, or frequency, that can be split apart usign an optic prism. Each component is a “monochromatic” light with sinusoidal shape. Following this analogy, each signal can be decomposed into its “sinusoidal” components which represent its “colors”. Of course these components in general do not correspond to visible monochromatic light. However, they give an idea of how fast are the changes of the signal. 2 Contents • Signals as functions (1D, 2D) – Tools • Continuous Time Fourier Transform (CTFT) • Discrete Time Fourier Transform (DTFT) • Discrete Fourier Transform (DFT) • Discrete Cosine Transform (DCT) • Sampling theorem 3 Fourier Transform • Different formulations for the different classes of signals – Summary table: Fourier transforms with various combinations of continuous/ discrete time and frequency variables. – Notations: • CTFT: continuous time FT: t is real and f real (f=ω) (CT, CF) • DTFT: Discrete Time FT: t is discrete (t=n), f is real (f=ω) (DT, CF) • CTFS: CT Fourier Series (summation synthesis): t is real AND the function is periodic, f is discrete (f=k), (CT, DF) • DTFS: DT Fourier Series (summation synthesis): t=n AND the function is periodic, f discrete (f=k), (DT, DF) • P: periodical signals • T: sampling period • ωs: sampling frequency (ωs=2π/T) • For DTFT: T=1 → ωs=2π • This is a hint for those who are interested in a more exhaustive theoretical approach 4 Images as functions • Gray scale images:
    [Show full text]