enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Fourier_transform

    4.1.3 Frequency shifting. 4.1.4 Time scaling. ... Download as PDF; Printable version; ... Gaussian functions are examples of Schwartz functions ...

  3. Frequency-shift keying - Wikipedia

    en.wikipedia.org/wiki/Frequency-shift_keying

    Rather than directly modulating the frequency with the digital data symbols, "instantaneously" changing the frequency at the beginning of each symbol period, Gaussian frequency-shift keying (GFSK) filters the data pulses with a Gaussian filter to make the transitions smoother.

  4. Gaussian function - Wikipedia

    en.wikipedia.org/wiki/Gaussian_function

    Download as PDF; Printable version ... angular-frequency convention) of a Gaussian function with parameters ... is the shift vector and the matrix can be assumed to ...

  5. Normal distribution - Wikipedia

    en.wikipedia.org/wiki/Normal_distribution

    The moment generating function of a real random variable ⁠ ⁠ is the expected value of , as a function of the real parameter ⁠ ⁠. For a normal distribution with density ⁠ f {\displaystyle f} ⁠ , mean ⁠ μ {\displaystyle \mu } ⁠ and variance σ 2 {\textstyle \sigma ^{2}} , the moment generating function exists and is equal to

  6. Minimum-shift keying - Wikipedia

    en.wikipedia.org/wiki/Minimum-shift_keying

    Thus, the maximum frequency deviation is δ = 0.5 f m where f m is the maximum modulating frequency. As a result, the modulation index m is 0.5. This is the smallest FSK modulation index that can be chosen such that the waveforms for 0 and 1 are orthogonal. A variant of MSK called Gaussian minimum-shift keying (GMSK) is used in the GSM mobile ...

  7. Discrete Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_transform

    Left: A continuous function (top) and its Fourier transform (bottom). Center-left: Periodic summation of the original function (top). 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).

  8. Envelope (waves) - Wikipedia

    en.wikipedia.org/wiki/Envelope_(waves)

    A modulated wave resulting from adding two sine waves of identical amplitude and nearly identical wavelength and frequency. A common situation resulting in an envelope function in both space x and time t is the superposition of two waves of almost the same wavelength and frequency: [2]

  9. Gabor transform - Wikipedia

    en.wikipedia.org/wiki/Gabor_transform

    The function to be transformed is first multiplied by a Gaussian function, which can be regarded as a window function, and the resulting function is then transformed with a Fourier transform to derive the time-frequency analysis. [1] The window function means that the signal near the time being analyzed will have higher weight.