 |
About "function FFT": Almost any
periodic function can be represented as a Fourier series. This
applet computes the Fourier coefficients and shows how the
corresponding Fourier series approximates the original function.
Note in particular:
 |
More Fourier coefficients result in a better
approximation by the Fourier series |
|
Functions with sharp corners need a lot of
Fourier coefficient for a good approximation and have
oscillating Fourier representation. |
|
|
About "bitwise FFT":
Start the applet and press any key. The key is
converted into its ASCII code, then into a bit pattern
corresponding to that ASCII code. That pattern is "sent"
through a wire that may include a "low-pass" filter
which distorts the signal. The more frequencies are filtered out,
the harder it becomes to reconstruct the original signal. |
|
Operators:
+, -, *, /, ^
Functions:
sin, cos, tan, ln, log, abs, int, frac, asin, acos, atan, sinh, cosh,
tanh, asinh, acosh, atanh, ceil, floor, round, exp, sqr, sqrt, sign, fact
Other:
(, ), <, >, <=, >=, and, or
Conditionals:
if(test,if_true,if_false)
Constants
pi, e
Parser © 1996,
Yanto Suryono
|
|
