• Discrete-time Fourier Transform (DTFT) ...periodic function of a frequency as the variable, <math>\omega</math>. The Fourier series is:
    3 KB (535 words) - 19:30, 29 September 2014
  • <font size="4">'''Discrete-time Fourier Transform with Example''' </font> == Definition of Discrete Time Fourier Transform (DTFT) ==
    4 KB (575 words) - 20:02, 16 March 2015
  • [[Category:fourier transform]] ...following signals x[n] (if possible). How does your answer relate to the Fourier series coefficients of x[n]?
    2 KB (295 words) - 06:30, 29 September 2014
  • ...ansform (DTFT) Slecture by Jacob Holtman]][[Category:Discrete-time Fourier transform (DTFT) Slecture by Jacob Holtman]] ...r transform (DTFT) Slecture by Jacob Holtman|Back to Discrete-time Fourier transform (DTFT) Slecture by Jacob Holtman]]
    584 B (68 words) - 20:37, 29 September 2014
  • ...e Fourier transform (DTFT) Slecture by Jacob Holtman|Discrete Time Fourier Transform with Example]] </font> ...early states the definition and periodic property of Discrete-time Fourier transform. In the exponential example, it's great to make a guess and prove the guess
    4 KB (728 words) - 05:33, 15 October 2014
  • Fourier Transform of Rep and Comb Functions In this slecture, we are going to look at the fourier transforms of the <math>comb_T()</math> and <math>rep_T()</math> functions.
    4 KB (734 words) - 18:56, 16 March 2015
  • =Discrete Time Fourier Transform with example=
    131 B (18 words) - 20:59, 30 September 2014
  • =Discrete Time Fourier Transform with Example=
    331 B (38 words) - 21:01, 30 September 2014
  • Discrete Time Fourier Transform (DTFT) with example The discrete time fourier transform (DTFT) of a finite energy aperiodic signal x[n] can be given by the equatio
    5 KB (862 words) - 20:02, 16 March 2015
  • Fourier Transform of a Rep and Comb
    921 B (136 words) - 11:44, 14 October 2014
  • ...ons and Comments for </font> <font size="4">[[Ftrepcomb mattmiller|Fourier Transform of Rep and Comb Functions]] </font> ...if you explain some of the less intuitive steps, such as when you use the Fourier series representation of an impulse train. Well done, overall.
    6 KB (1,033 words) - 05:33, 15 October 2014
  • Using the discrete-time Fourier transform pair for cosine: Using the discrete-time Fourier transform pair for cosine again:
    5 KB (735 words) - 20:04, 16 March 2015
  • Discrete-time Fourier transform (DTFT) of a sampled cosine
    5 KB (801 words) - 20:04, 16 March 2015
  • ...fectly from its sampling <math>x_s(t)</math>if the continuous-time Fourier Transform (CTFT) of <math>x(t)</math> is zero for all magnitudes of frequency equal t The topmost plot in the figure above shows the continuous-time Fourier Transform (CTFT) of the signal of interest for this example: a 1-Hz cosine wave with
    10 KB (1,650 words) - 19:04, 16 March 2015
  • ...be sampled will be in the time domain <math> x(t) </math> and after it was Fourier transformed, the sampled signal <math> X(f) </math> will be in the frequenc ...al expression of sampling in the view of the frequency domain. The Fourier transform of sampling is given by:
    5 KB (852 words) - 09:58, 14 March 2015
  • ...differences in X(f) and X<sub>s</sub>(f). X<sub>s</sub>(f) is the Fourier Transform of the sampling, x<sub>s</sub>(t), of x(t). Given an arbitrary signal x(t), its Fourier Transform is X(f)
    4 KB (599 words) - 09:58, 14 March 2015
  • F = Fourier transform </math> definition of the Fourier transform of an impulse train.
    2 KB (335 words) - 09:57, 14 March 2015
  • [[Category:fourier transform]]
    2 KB (394 words) - 02:19, 7 October 2014
  • Below we derive Discrete-Time Fourier Transform of ''x<sub>2</sub> [n]'' in terms of DTFT of ''x<sub>1</sub> [n]''.
    7 KB (1,035 words) - 19:07, 16 March 2015
  • [[Category:fourier transform]] ...following signals x[n] (if possible). How does your answer relate to the Fourier series coefficients of x[n]?
    8 KB (1,362 words) - 11:21, 10 October 2014
  • Taking the Discrete Time Fourier Transform of each we get The Fourier representation
    4 KB (566 words) - 09:59, 14 March 2015
  • First we'll take the Discrete Time Fourier Transform of the original signal and the downsampled version of it.<br>
    4 KB (641 words) - 09:58, 14 March 2015
  • ..."4">[[DTFT of a sampled cosine Yijun ECE438 slecture|Discrete-time Fourier transform (DTFT) of a sampled cosine]] </font>
    2 KB (396 words) - 05:39, 15 October 2014
  • ...crete-time_Fourier_transform_Slecture_by_Fabian_Faes Discrete Time Fourier Transform (DTFT) with example ] </font>
    3 KB (568 words) - 05:34, 15 October 2014
  • ...you illustrated the changes the frequency axis goes through in the Fourier transform. I think this is a really important concept which you illustrated clearly.
    4 KB (621 words) - 05:40, 15 October 2014
  • ...a.org/rhea/index.php/Fourier_Transform_rep_com_Ben_ECE438_slecture Fourier Transform of a Rep and Comb ] ...ea/index.php/Fourier_Transform_rep_com_Ben_ECE438_slecture Back to Fourier Transform of a Rep and Comb ]
    2 KB (431 words) - 05:33, 15 October 2014
  • [[Category:fourier transform]]
    7 KB (1,201 words) - 12:28, 14 October 2014
  • [[Category:fourier transform]] Compute the z-transform of the signal
    2 KB (255 words) - 05:50, 22 October 2014
  • *[[Z_Transform_table|Table of z-transform pairs and properties]] *Practice Problems on z-transform and inverse z-transform
    4 KB (446 words) - 05:56, 22 October 2014
  • ...[[HonorsContractECE438CoordinateAndRadon|Coordinate Rotation and the Radon Transform]] Topic 3: [[ECE438HonorsContractFST|Fourier Slice Theorem (FST)]]
    2 KB (259 words) - 19:30, 9 February 2015
  • [[Category:fourier transform]] Compute the z-transform of the signal
    7 KB (1,222 words) - 09:11, 3 November 2014
  • [[Category:fourier transform]]
    4 KB (640 words) - 06:37, 3 November 2014
  • [[Category:fourier transform]]
    1 KB (210 words) - 07:28, 10 November 2014
  • Using the definitions of the Fourier transform, derive an expressoin for&nbsp;<span class="texhtml">''F''(''u'',0)</span>&
    6 KB (1,018 words) - 22:10, 2 December 2015
  • ...phase of speech production we call "excitation". We looked at the Fourier transform of x(t).
    2 KB (255 words) - 06:36, 12 November 2014
  • [[Category:fourier transform]] ...trum.) How does it compare to the graph of the magnitude of the DT Fourier transform of the digital recording of the phoneme?
    3 KB (462 words) - 07:25, 17 November 2014
  • [[Category:fourier transform]] ...ty, this filter will be a two zero filter, using complex conjugates. The Z-transform of this filter is
    5 KB (860 words) - 10:26, 20 November 2014
  • ...e Fourier transform of a pulse-train (a sequence of impulses multiplied by Fourier series coefficients). After discretizing the voiced phoneme, we saw that th
    2 KB (329 words) - 06:44, 24 November 2014
  • [[Category:fourier transform]]
    5 KB (545 words) - 12:20, 9 December 2014
  • ...arability of the filter greatly facilitated the computation of its Fourier transform.
    3 KB (373 words) - 07:08, 24 November 2014
  • [[Category:fourier transform]] ...trum.) How does it compare to the graph of the magnitude of the DT Fourier transform of the digital recording of the phoneme?
    6 KB (1,031 words) - 11:27, 29 November 2014
  • [[Category:fourier transform]]
    10 KB (1,181 words) - 16:07, 2 December 2014
  • <font size="5">Fourier Slice Theorem (FST)</font> ...taken. Then according to the theorem, an inverse Continuous Space Fourier Transform (CSFT) can be used to form the original object,<math>f(x,y)</math>. There a
    8 KB (1,252 words) - 19:26, 9 February 2015
  • [[Category:Fourier transform]]
    9 KB (1,362 words) - 18:06, 23 February 2015
  • ...object evaluated at specific phases. Essentially a MRI scan is the Fourier Transform of a person.
    14 KB (2,487 words) - 19:26, 9 February 2015
  • *Fourier Series **PM's discussion of Linear algebra and Fourier series: pp. 232-240, 247-253, 399-409,
    10 KB (1,356 words) - 13:19, 19 October 2015
  • ...d_fourier_transform_rep_comb_ECE438F14|great explanation of how to Fourier transform a "rep" and a "comb"]], by ECE student Ben Capano. This is the key behind N
    629 B (82 words) - 11:22, 13 March 2015
  • The Fourier transform of "rep" and "comb" of a signal
    660 B (92 words) - 09:51, 14 March 2015
  • ...s a function of frequency <span class="texhtml">"ω"</span> versus Fourier transform as a function of frequency <span class="texhtml">''f''</span> (in hertz). = *[[Slecture Fourier transform w f ECE438|Text slecture]] by Dauren
    3 KB (409 words) - 15:48, 24 March 2015
  • ...as a function of frequency <span class="texhtml">ω</span> versus Fourier transform as a function of frequency <span class="texhtml">''f''</span> (in hertz). **[[Slecture Fourier transform w f ECE438|Text slecture]] by Dauren
    3 KB (389 words) - 19:26, 16 March 2015

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett