enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Time series - Wikipedia

    en.wikipedia.org/wiki/Time_series

    In mathematics, a time series is a series of data points indexed (or listed or graphed) in time order. Most commonly, a time series is a sequence taken at successive equally spaced points in time. Thus it is a sequence of discrete-time data. Examples of time series are heights of ocean tides, counts of sunspots, and the daily closing value of ...

  3. Discrete-time Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete-time_Fourier...

    In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of discrete values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time.

  4. Discrete Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_transform

    Fourier transform (bottom) is zero except at discrete points. The inverse transform is a sum of sinusoids called Fourier series. Center-right: Original function is discretized (multiplied by a Dirac comb) (top). Its Fourier transform (bottom) is a periodic summation (DTFT) of the original transform. Right: The DFT (bottom) computes discrete ...

  5. Discrete Fourier series - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_series

    Discrete Fourier series. In digital signal processing, a discrete Fourier series (DFS) is a Fourier series whose sinusoidal components are functions of discrete time instead of continuous time. A specific example is the inverse discrete Fourier transform (inverse DFT).

  6. Fourier analysis - Wikipedia

    en.wikipedia.org/wiki/Fourier_analysis

    Fourier analysis. Related transforms. In mathematics, Fourier analysis(/ˈfʊrieɪ,-iər/)[1]is the study of the way general functionsmay be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as ...

  7. Dynamic time warping - Wikipedia

    en.wikipedia.org/wiki/Dynamic_time_warping

    In time series analysis, dynamic time warping (DTW) is an algorithm for measuring similarity between two temporal sequences, which may vary in speed. For instance, similarities in walking could be detected using DTW, even if one person was walking faster than the other, or if there were accelerations and decelerations during the course of an ...

  8. Z-transform - Wikipedia

    en.wikipedia.org/wiki/Z-transform

    ISBN 978-1-4419-5153-3. z transform is to discrete-time systems what the Laplace transform is to continuous-time systems. z is a complex variable. This is sometimes referred to as the two-sided z transform, with the one-sided z transform being the same except for a summation from n = 0 to infinity.

  9. Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Fourier_transform

    It has a variety of useful forms that are derived from the basic one by application of the Fourier transform's scaling and time-shifting properties. The formula has applications in engineering, physics, and number theory. The frequency-domain dual of the standard Poisson summation formula is also called the discrete-time Fourier transform.