3-64 Full Command and Function Reference
Input/Output:
Level 1/Argument 1 Level 1/Item 1
n
flag number
→
0/1
See also: CF, FC?, FS? FS?C, SF
FDISTRIB
CAS: Perform a full distribution of multiplication and division in a single step.
FFT
Type: Command
Description: Discrete Fourier Transform Command: Computes the one- or two-dimensional discrete Fourier
transform of an array.
If the argument is an N-vector or an N × 1 or 1 × N matrix, FFT computes the one-dimensional
transform. If the argument is an M × N matrix, FFT computes the two-dimensional transform.
M and N must be integral powers of 2.
The one-dimensional discrete Fourier transform of an N-vector X is the N-vector Y where:
Y
k
X
n
e
2πikn
N
----- ----------–
n 0=
N 1–
∑
= i, 1–=
for k = 0, 1, …, N – 1.
The two dimensional discrete Fourier transform of an M × N matrix X is the M × N matrix Y
where:
Y
kl
x
mn
e
2πikm
M
----- --------- --–
e
2πiln
N
------ --------- ---–
n 0=
N 1–
∑
m 0=
M 1–
∑
= i, 1–=
for k = 0, 1, …, M – 1 and l = 0, 1, …, N – 1.
The discrete Fourier transform and its inverse are defined for any positive sequence length.
However, the calculation can be performed very rapidly when the sequence length is a power of
two, and the resulting algorithms are called the fast Fourier transform (FFT) and inverse fast
Fourier transform (IFFT).
The FFT command uses truncated 15-digit arithmetic and intermediate storage, then rounds the
result to 12-digit precision.
Access: !´L
FFT FFT ( ´ is the left-shift of the Pkey).
Input/Output:
Level 1/Argument 1 Level 1/Item 1
[ array ]
1
→
[ array ]
2
See also: IFFT
FILER
Type: Command
Description: Opens File Manager.
Access: !¡
( ¡ is the left-shift of the Gkey).
…µ
FILER
Input/Output: None
FINDALARM
Type: Command
To Next Page
Loading...
