When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Discrete-time Fourier transform - Wikipedia

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

    The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function.

  3. Discrete Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_transform

    The conversion from continuous time to samples (discrete-time) changes the underlying Fourier transform of () into a discrete-time Fourier transform (DTFT), which generally entails a type of distortion called aliasing. Choice of an appropriate sample-rate (see Nyquist rate) is the key to minimizing that distortion.

  4. Downsampling (signal processing) - Wikipedia

    en.wikipedia.org/wiki/Downsampling_(signal...

    Let X(f) be the Fourier transform of any function, x(t), whose samples at some interval, T, equal the x[n] sequence.Then the discrete-time Fourier transform (DTFT) is a Fourier series representation of a periodic summation of X(f): [d]

  5. Circular convolution - Wikipedia

    en.wikipedia.org/wiki/Circular_convolution

    In particular, the DTFT of the product of two discrete sequences is the periodic convolution of the DTFTs of the individual sequences. And each DTFT is a periodic summation of a continuous Fourier transform function (see Discrete-time Fourier transform § Relation to Fourier Transform). Although DTFTs are usually continuous functions of ...

  6. Fourier analysis - Wikipedia

    en.wikipedia.org/wiki/Fourier_analysis

    The DTFT is the mathematical dual of the time-domain Fourier series. Thus, a convergent periodic summation in the frequency domain can be represented by a Fourier series, whose coefficients are samples of a related continuous time function:

  7. Convolution - Wikipedia

    en.wikipedia.org/wiki/Convolution

    (See row 18 at DTFT § Properties.) A discrete convolution can be defined for functions on the set of integers . Generalizations of convolution have applications in the field of numerical analysis and numerical linear algebra , and in the design and implementation of finite impulse response filters in signal processing.

  8. Group delay and phase delay - Wikipedia

    en.wikipedia.org/wiki/Group_delay_and_phase_delay

    The group delay and phase delay properties of a linear time-invariant (LTI) system are functions of frequency, giving the time from when a frequency component of a time varying physical quantity—for example a voltage signal—appears at the LTI system input, to the time when a copy of that same frequency component—perhaps of a different physical phenomenon—appears at the LTI system output.

  9. Discrete Fourier series - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_series

    In digital signal processing, a discrete Fourier series (DFS) is a Fourier series whose sinusoidal components are functions of a discrete variable instead of a continuous variable.