Timeline for DFT/FFT Transfer function
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:33 | history | edited | CommunityBot |
replaced http://electronics.stackexchange.com/ with https://electronics.stackexchange.com/
|
|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Dec 28, 2015 at 22:30 | comment | added | robert bristow-johnson | uhm, there are several mistakes that need to be corrected before they are reinforced in anyone's understanding: $$ $$ 1. "Fourier is a special case of Laplace for non-negative frequencies." -- that's false. FT specifically has negative frequencies. $$ $$ 2. "Both are not applicable for discrete signals directly." -- both LT and FT can be applied to sampled signals as you get the Z-transform and DTFT. $$ $$ 3. "FFT name an algorithm which approximates the Fourier transformation in it's discrete form, called DFT." -- not an approximation, but an implementation. | |
| Dec 28, 2015 at 16:40 | history | edited | peng | CC BY-SA 3.0 |
added 85 characters in body
|
| Dec 28, 2015 at 16:26 | comment | added | johnnymopo | I'll add that the DFT is a Z - transform where the magnitude is 1, that is, evaluated along the unit circle in the z plane. The FFT is a fast means to evaluate the DFT. | |
| Dec 28, 2015 at 15:07 | history | answered | peng | CC BY-SA 3.0 |