• Discrete Fourier transforms (DFT) Pairs and Properties ...colspan="2" | Discrete Fourier Transform Pairs and Properties [[Discrete Fourier Transform|(info)]]
    4 KB (633 words) - 15:28, 23 April 2013
  • ...ansform. Discrete-time linear systems: difference equations, Discrete-Time Fourier Transform, bilateral z-Transform. Sampling, quantization, and discrete-time ...me Fourier transforms and an ability to compute the transforms and inverse transforms of basic examples using methods such as partial fraction expansions.
    3 KB (394 words) - 07:08, 4 May 2010
  • [[Category:discrete Fourier transform]] ...reek letter has been added. So the goal should be to make such math (these transforms rather) and relate them to real life, not just by telling us where it used
    13 KB (2,348 words) - 13:25, 2 December 2011
  • ..._inverse_z-transforms_ECE438F10|questions about z-transforms and inverse-z-transforms]] ...ed exercises of Fourier series computations for CT signals]], especially [[Fourier series coefficients student 1|this one]].
    9 KB (1,221 words) - 11:00, 22 December 2014
  • *Fourier Series **PM's discussion of Linear algebra and Fourier series: pp. 232-240, 247-253, 399-409,
    9 KB (1,331 words) - 07:15, 29 December 2010
  • In the second lecture, we introduced the CT Fourier transform in terms of frequency "f" and discussed its relationship with the ...ent_summary_CT_DT_Fourier_transform_ECE438F09|Summary of CT and DT Fourier transforms]]
    1 KB (212 words) - 04:24, 27 October 2010
  • ...format as the one use for this [[Laplace_Transforms_Table|table of Laplace transforms]].)
    2 KB (233 words) - 07:52, 7 September 2010
  • ...is the idea. But you should also note the similarities between the Fourier transforms (not just the differences). --[[User:Mboutin|Mboutin]] 12:07, 7 September 2
    1 KB (222 words) - 08:07, 7 September 2010
  • [[Category:Fourier series continuous-time]] = This pages contains exercises to practice computing the Fourier series of a CT signal =
    5 KB (797 words) - 09:43, 29 December 2010
  • In Lecture #8, I showed by example how to compute inverse z-transforms. I gave students two exercises (case b) and case c) in your notes) to try a For those of you wishing to brush up on Fourier series, here are two collective study pages:
    875 B (123 words) - 12:42, 10 September 2010
  • [[Category:Fourier transform]] == The Continuous Time Fourier Transform (CTFT) ==
    4 KB (746 words) - 08:47, 11 November 2013
  • [[Category:Fourier transform]] [[Discrete-time_Fourier_transform_info|Discrete-time (DT) Fourier Transforms]] Pairs and Properties
    7 KB (1,037 words) - 21:05, 4 March 2015
  • =About the Fourier Tranform of a Rectangular Window in discrete-time= [[Table_DT_Fourier_Transforms|Back to the table of DT Fourier transforms]]
    382 B (52 words) - 12:59, 22 October 2010
  • ...understanding how to extent these to the 2D versions of the other Fourier transforms we say (e.g., DTFT and DFT). We also defined some basic 2D signals. [[Category:continuous-space Fourier transform]]
    977 B (131 words) - 09:30, 11 November 2011
  • =About the Multiplication Property of the continuous-time Fourier transform= The multiplication property of the continuous-time Fourier transform can be stated as follows:
    751 B (105 words) - 16:17, 30 November 2010
  • *Video Extract of a talk by Prof. Joe Havlicek explaining the meaning of the Fourier transform very clearly using music. *Computing the Fourier series coefficients of a CT signal
    18 KB (2,485 words) - 10:36, 11 November 2011
  • *[[CT Fourier Transform (frequency in radians per time unit)|Continuous-time Fourier Transform Pairs and Properties]] (function of <span class="texhtml">ω</spa *[[Table DT Fourier Transforms|Discrete-time Fourier Transform Pairs and Properties]]
    890 B (101 words) - 17:30, 21 April 2013
  • *[[CT_Fourier_series_practice_problems_list|Problems on continuous-time Fourier series]] *[[CT_Fourier_transform_practice_problems_list|Problems on continuous-time Fourier transform]]
    12 KB (1,768 words) - 10:25, 22 January 2018
  • ...ible to compute; this was exemplified when we tried to compute the inverse Fourier transform of the constant function 1. *Solve the following practice problem on CT Fourier transform.
    1 KB (161 words) - 14:12, 28 February 2011
  • ...en check your answer using this [[Table_DT_Fourier_Transforms| table of DT Fourier transform pairs and properties]]. (Explain how you checked your answer.) ...ransform (i.e., the integral formula) to compute the inverse Discrete-time Fourier transform of the signal
    4 KB (695 words) - 18:23, 7 March 2011
  • ...r_Transform_Video |Fourier]]/Laplace/[[Compute z-transform u n ECE301S11|Z transforms]] from [[2011 Spring ECE 301 Boutin|ECE301]]!) are utilized to convert, fil ...nications, and networking. Imaging techniques involving diffraction and/or Fourier analysis with application to tomography, magnetic resonance imaging, synthe
    17 KB (2,368 words) - 10:53, 6 May 2012
  • Yes, this signal is band limited. It is a sinc function, and its Fourier transform can be found using the table of formulas in the textbook on page ...in the correct max frequency of the signal. It would be ok to say that the Fourier transform is a non-zero constant multiple of a low-pass filter with gain 1
    3 KB (431 words) - 10:28, 11 November 2011
  • ...says that <br> <math>\frac{2 \sin \left( W t \right)}{\pi t } \ </math> transforms to <math>\left\{\begin{array}{ll}1, & \text{ if }|\omega| <W,\\ 0, & \text ...he Fourier transform of the CT signal representing the sampling in CT. The Fourier transform of the DT signal obtained by storing the values of the samples in
    9 KB (1,462 words) - 07:01, 22 April 2011
  • ...e product of two functions is (1/2pi) times the convolution of the Fourier transforms of the individual functions.
    2 KB (336 words) - 10:31, 11 November 2011
  • In this chapter author explains Fourier Series and Fourier Transforms of CT signals. The explanation is very good and clear. It is very similar t ...in more general form and it is very good because ECE students use Laplace Transforms everywhere and it is very easy to follow the chapter especially with the cl
    6 KB (972 words) - 06:29, 1 November 2011
  • In this chapter author explains Fourier Series and Fourier Transforms of CT signals. The explanation is very good and clear. It is very similar t ...in more general form and it is very good because ECE students use Laplace Transforms everywhere and it is very easy to follow the chapter especially with the cl
    6 KB (955 words) - 10:54, 6 May 2012
  • *Fourier Series **PM's discussion of Linear algebra and Fourier series: pp. 232-240, 247-253, 399-409,
    9 KB (1,341 words) - 03:52, 31 August 2013
  • ...in the [[Lecture3ECE438F11|next lecture]], we shall compute their Fourier transforms. **[[practice_CTFT_computation_rect_and_sinc_ECE438F11|Compute the Fourier transform of a rect and a sinc]]
    2 KB (285 words) - 12:48, 21 September 2011
  • ...he definition, but we found a way around that problem by using the inverse Fourier transform formula to guess the answer. **[[Practice DTFT computation cosine ECE438F11|What is the Fourier transform of this DT cosine?]]
    2 KB (252 words) - 12:48, 21 September 2011
  • [[Category:discrete time Fourier transform]] Topic: Discrete-time Fourier transform computation
    6 KB (1,090 words) - 12:35, 26 November 2013
  • [[Category:discrete-space Fourier transform]] Topic: Discrete-space Fourier transform computation
    4 KB (703 words) - 12:59, 26 November 2013
  • *[[CT_Fourier_Transform_(frequency_in_radians_per_time_unit)|Continuous-time Fourier Transform Pairs and Properties]] *[[Table_DT_Fourier_Transforms|Discrete-time Fourier Transform Pairs and Properties]]
    1 KB (152 words) - 12:17, 24 February 2015
  • ...ure and Compilers, along with classes like Signals and Systems and Fourier Transforms. This afforded me a venerable arsenal of knowledge in both Electrical and C
    3 KB (550 words) - 12:22, 9 February 2012
  • ...n signal analysis classes, which don’t just teach how to compute Fourier transforms, and what to do with that answer. They teach the idea that any signal can b
    4 KB (666 words) - 12:13, 9 February 2012
  • ...he definition, but we found a way around that problem by using the inverse Fourier transform formula to guess the answer. *[[Table DT Fourier Transforms|Table of DT Fourier transform pairs and properties]]
    3 KB (398 words) - 06:10, 3 September 2014
  • | [[FourierSeriesConvergenceBonusProject | Convergence of Parametric Fourier Series]] | [[The_2-D_Fourier_Transform_and_Images|The 2-D Fourier Transform and Images]]
    4 KB (534 words) - 19:10, 4 December 2018
  • *[[CT Fourier Transform (frequency in radians per time unit)|Continuous-time Fourier Transform Pairs and Properties]] (function of <span class="texhtml">ω</spa *[[Table DT Fourier Transforms|Discrete-time Fourier Transform Pairs and Properties]]
    2 KB (236 words) - 11:24, 21 September 2012
  • ...tifacts, people apply different type of windows before applying orthogonal transforms. ;'''Q - Section 2 - For calculationg Sx anlyitically, is this just doing a Fourier transform of and multiplying by its complex conjugate and 1/(N^2)? Not exa
    5 KB (957 words) - 08:11, 9 April 2013
  • ** [[ECE637_tomographic_reconstruction_fourier_slice_theorem_S13_mhossain|Fourier Slice Theorem]] ...te_parameter_signals_and_systems_discrete_transforms_S13_mhossain|Discrete Transforms]]
    2 KB (246 words) - 07:21, 26 February 2014
  • ...ure19 ECE301Fall2008mboutin|Lecture 19]]: TA Example Session w/ DT Fourier Transforms and inverses
    3 KB (328 words) - 17:57, 30 November 2018
  • ...USE A [[CT_Fourier_Transform_%28frequency_in_hertz%29|TABLE OF CT FOURIER TRANSFORMS]] TO DO THESE PROBLEMS.
    4 KB (545 words) - 07:12, 24 April 2013
  • ...USE A [[CT_Fourier_Transform_%28frequency_in_hertz%29|TABLE OF CT FOURIER TRANSFORMS]] TO DO THESE PROBLEMS.
    3 KB (434 words) - 07:02, 24 April 2013
  • ::↳ [[ECE637_tomographic_reconstruction_fourier_slice_theorem_S13_mhossain|Fourier Slice Theorem]] ...as [[ECE637_tomographic_reconstruction_radon_transform_S13_mhossain|Radon Transforms]]. Projections must be collected at every angle <math>\theta</math> and dis
    8 KB (1,168 words) - 07:24, 26 February 2014
  • *[[ECE662_Whitening_and_Coloring_Transforms_S14_MH|Whitening and coloring transforms]] ...n_of_the_Divide_and_Conquer_DFT_via_Matrices|"divide and conquer" Discrete Fourier Transform (DFT)]]
    2 KB (293 words) - 12:25, 27 March 2015
  • * the Fourier transforms of their pdfs exist Taking the inverse Fourier transform, we get<br/>
    6 KB (1,084 words) - 13:20, 13 June 2013
  • ...te_parameter_signals_and_systems_discrete_transforms_S13_mhossain|Discrete Transforms]] <font size= 3> Subtopic 1: Discrete Transforms </font size>
    10 KB (1,726 words) - 07:26, 26 February 2014
  • *Fourier Series **PM's discussion of Linear algebra and Fourier series: pp. 232-240, 247-253, 399-409,
    9 KB (1,353 words) - 09:04, 11 November 2013
  • ...sform. As we will see later, this trick will be very handy for inverting z-transforms in general. **[[practice_DTFT_computation_sine_ECE438F13|Compute the DT Fourier transform of a sinc]]
    3 KB (386 words) - 06:09, 11 September 2013
  • [[Category:fourier transform]] ...ier_Transform_%28frequency_in_radians_per_time_unit%29|table of CT Fourier transforms]] in terms of <math>\omega</math> in radians and to obtain the correspondin
    5 KB (768 words) - 05:49, 9 September 2013
  • From here I solved for Bn. The fourier series I calculated is F(x) = 2/pi sinx - 2/4pi sin2x + 2/9pi sin3x ... Whe and by differentiation of transforms, L{tf(t)} = - derivative( (1+k)/(s^2 + (1+k)^2) )&nbsp;?
    7 KB (1,302 words) - 04:58, 23 October 2013

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

Alumni Liaison

Prof. Math. Ohio State and Associate Dean
Outstanding Alumnus Purdue Math 2008

Jeff McNeal