Create the page "Fourier" on this wiki! See also the search results found.
- ...ourier transform of a periodic signal. We found that we cannot compute the Fourier transform of such signals using the integral formula. However, we were abl We finished the lecture by discussing a few properties of the continuous-time Fourier transform.2 KB (215 words) - 14:12, 28 February 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Continuous-time Signal = Compute the Fourier transform of the signal2 KB (276 words) - 10:25, 11 November 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Continuous-time Signal = Compute the Fourier transform of the signal2 KB (355 words) - 10:26, 11 November 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Continuous-time Signal = Compute the Fourier transform of the signal853 B (122 words) - 10:26, 11 November 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Continuous-time Signal = Compute the Fourier transform of the signal1 KB (196 words) - 10:26, 11 November 2011
- Today we discussed some important properties of the continuous-time Fourier transform (CTFT). I particular, we saw the duality property and the convolu ...er_Transform_(frequency_in_radians_per_time_unit)|Table of continuous-time Fourier transform pairs and properties]]1 KB (144 words) - 14:12, 28 February 2011
- ...test. Get ready for the next lecture where we will begin talking about the Fourier transform for discrete-time signals!928 B (123 words) - 14:12, 28 February 2011
- ...[[CT_Fourier_Transform_%28frequency_in_radians_per_time_unit%29| table of Fourier transform pairs and properties]]. (Explain how you checked your answer.) Compute the Fourier transform of the signal4 KB (633 words) - 12:31, 2 March 2011
- ...ay's lecture, we finished discussing the properties of the continuous-time Fourier transform. We then used these properties to obtain a simple expression for ...ansform of a discrete-time complex exponential. We then "guessed" what the Fourier transform of a discrete-time complex exponential should be. Our guess was s2 KB (346 words) - 14:13, 28 February 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Discrete-time Signal = Compute the Fourier transform of the signal1 KB (198 words) - 10:27, 11 November 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Discrete-time Signal = Compute the Fourier transform of the signal1 KB (161 words) - 10:27, 11 November 2011
- = [[:Category:Problem_solving|Practice Question]] on Computing the Fourier Transform of a Discrete-time Signal = Compute the Fourier transform of the signal1 KB (203 words) - 10:28, 11 November 2011
- ...oblem_solving|Practice Question]] on the Properties of the Continuous-time Fourier Transform = Let x(t) be a continuous time signal with Fourier transform <math class="inline">{\mathcal X} (\omega) </math>.2 KB (401 words) - 10:27, 11 November 2011
- ...tant to both be able to use the Fourier transform properties and prove the Fourier transform properties".1 KB (162 words) - 12:46, 2 March 2011
- ...ever, changing the value of a signal at a single point does not change its Fourier transform. -pm </span> Now, since the Fourier transform (FT) is linear, we have that:10 KB (1,817 words) - 11:34, 7 March 2011
- Today we finished the material on the discrete-time Fourier transform so we have now covered all the material for the second test. We a1,022 B (140 words) - 18:58, 4 March 2011
- *<span style="color:red"> 15 pts </span> for the computation of the Fourier transform of the continuous-time signal. Check every step of the computatio ...nition of the Fourier transform (i.e., the integral formula) to obtain the Fourier transform of either the constant function 1 or of the complex exponential f7 KB (1,161 words) - 18:50, 4 March 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 signal4 KB (695 words) - 18:23, 7 March 2011
- ...complex constant. But I don't know how to compute that constant from the fourier transform.5 KB (793 words) - 10:28, 11 November 2011
- ...ansform of the sampling of a band-limited signal consists of copies of the Fourier transform of the original signal. Satisfying Nyquist's condition insures th1 KB (182 words) - 08:37, 30 March 2011
- I think the table of DT Fourier Transform pairs has a mistake. where it says <math>(n-1)a^nu[n]</math> it s1 KB (258 words) - 06:25, 11 March 2011
- *<span style="color:red"> 15 pts </span> for the computation of the Fourier transform of the discrete-time signal. If an integral was used in place of *<span style="color:red"> 15 pts </span> for the computation of the inverse Fourier transform. If a summation was used in place of the integral, give zero poin6 KB (1,090 words) - 07:36, 22 March 2011
- ...corresponds to the part of the spectrum for k=0) to compute the inverse DT Fourier transform of the given signal:10 KB (1,783 words) - 08:23, 21 March 2011
- ...discrete computer signals. Systems (maybe even [[Fourier_Transform_Video |Fourier]]/Laplace/[[Compute z-transform u n ECE301S11|Z transforms]] from [[2011 Sp ...nications, and networking. Imaging techniques involving diffraction and/or Fourier analysis with application to tomography, magnetic resonance imaging, synthe17 KB (2,368 words) - 10:53, 6 May 2012
- ...th class="inline"> T</math>. For each of the values of T below, sketch the Fourier transform of the sampling and indicate whether or not one can recover <mat3 KB (451 words) - 06:40, 1 April 2011
- 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 13 KB (431 words) - 10:28, 11 November 2011
- ...yle="color:red">Instructor's comment: Reality check: the only signal whose Fourier transform is a constant is an impulse. So your answer cannot possibly be co4 KB (666 words) - 10:29, 11 November 2011
- a) Sketch the spectrum (i.e., the Fourier transform) of y(t). ...form has exactly two poles located at s=-1 and s=-3, respectively. If the Fourier transform of <math class="inline"> g(t)=e^{2t}x(t)</math> converges, could5 KB (797 words) - 09:19, 7 April 2011
- Let x(t) be a signal whose Fourier transform <math>{\mathcal X} (\omega) </math> satisfies2 KB (393 words) - 10:31, 11 November 2011
- Let x(t) be a signal whose Fourier transform <math>{\mathcal X} (\omega) </math> satisfies2 KB (400 words) - 10:31, 11 November 2011
- ...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 in9 KB (1,462 words) - 07:01, 22 April 2011
- ...9|table of CT Fourier transform pairs and properties]], which uses the CT Fourier transform in terms of frequency <math>f</math> in hertz. Note that we will In [[ECE301]], you learned that the Fourier transform of a step function <math>x(t)=u(t)</math> is the following:2 KB (400 words) - 03:53, 31 August 2013
- a) The Fourier series coefficients of <span class="texhtml">''c''(''t'')</span> are: and using the synthesis equation of the Fourier series we get:12 KB (2,109 words) - 05:58, 22 April 2011
- ...rm of the 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 ver In this chapter author introduces Laplace Transform and generalizes Fourier Transforms. Explanations and justifications are very good and useful, it do6 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 ver In this chapter author introduces Laplace Transform and generalizes Fourier Transforms. Explanations and justifications are very good and useful, it do6 KB (955 words) - 10:54, 6 May 2012
- Linearity can be used to simplify the Fourier transform. Integration and differentiation are also linear. Onc2 KB (255 words) - 10:50, 6 May 2012
- =Video on the Fourier Transform= <player>ECE 301 Credit_0.avi|The Fourier Transform</player>234 B (31 words) - 10:52, 6 May 2012
- ...dedicated to LTI systems, Laplace Transfer of CT LTI systems, Z Transform, Fourier Analysis. Which means this book explains material covered over Midterms 1 a Fourier Analysis of CT Signals and Systems: This chapter corresponds to the fourth5 KB (802 words) - 16:44, 23 April 2013
- **[[Practice CTFT from omega to f step function|Obtain the Fourier transform in terms of f of a step function (from FT in terms of omega)]] **[[Practice CTFT computation rect and sinc ECE438F11|Compute the Fourier transform of a rect and a sinc]]10 KB (1,359 words) - 03:50, 31 August 2013
- ...[https://www.projectrhea.org/rhea/images/f/f7/Fourier_series_expansion.pdf Fourier Series Example]<br/>3 KB (456 words) - 10:20, 12 October 2011
- *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
- We finished the lecture with a discussion about the meaning of the Fourier transform and a video where Prof. Joe Havlicek illustrates this meaning usi2 KB (231 words) - 12:48, 21 September 2011
- [[Category:Fourier transform]] Topic: Continuous-time Fourier transform computation (in terms of frequency f in hertz)7 KB (1,302 words) - 09:45, 11 November 2013
- ...ced, and 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 computation6 KB (1,000 words) - 12:33, 26 November 2013
- [[Category:discrete time Fourier transform]] Topic: Discrete-time Fourier transform computation6 KB (1,090 words) - 12:35, 26 November 2013
- [[Category:Fourier transform]] Topic: Continuous-time Fourier transform: from omega to f7 KB (1,143 words) - 09:44, 11 November 2013
- [[Category:Fourier transform]] Topic: Continuous-time Fourier transform of a complex exponential3 KB (610 words) - 09:47, 11 November 2013