two, and the resulting algorithms are called the fast Fourier transform (FFT) and inverse fast
Fourier transform (IFFT).
The IFFT command uses truncated 15-digit arithmetic and intermediate storage, then rounds the
result to 12-digit precision.
!´L
Access:
Input/Output:
See also:
FFT
IFT
Type:
Command
Description: IF-THEN Command: Executes obj if T/F is nonzero. Discards obj if T/F is zero.
IFT lets you execute in stack syntax the decision-making process of the IF ... THEN ... END
conditional structure. The "true clause" is obj in argument 2 (level 1).
!°
Access:
Input/Output:
See also:
IFTE
IFTE
Type:
Function
Description: IF-THEN-ELSE Function: Executes the obj in argument 2 or level 2 if T/F is nonzero. Executes
the obj in argument 3 or level 1 if T/F is zero.
IFTE lets you execute in stack syntax the decision-making process of the IF ... THEN ... ELSE
... END conditional structure. The "true clause" is obj
clause" is obj
IFTE is also allowed in algebraic expressions, with the following syntax:
When an algebraic containing IFTE is evaluated, its first argument test is evaluated to a test result.
If it returns a nonzero real number, true-clause is evaluated. If it returns zero, false-clause is
evaluated.
!°
Access:
Input/Output:
See also:
IFT
ILAP
CAS:
Return the inverse Laplace transform of an expression that evaluates to a rational fraction.
IM
Type:
Function
Description: Imaginary Part Function: Returns the imaginary part of its complex argument.
FFT IFFT
Level 1/Argument 1
[ array ]
BRANCH IFT
Level 2/Argument 1
Level 1/Argument 2
T/F
in argument 3 or level 1.
false
L
BRANCH
IFTE
Level 3/Argument 1
Level 2/Argument 2
T/F
( ´ is the left-shift of the Pkey).
1
( °is the left-shift of the Nkey).
obj
in argument 2 or level 2. The "false
true
IFTE(test,true-clause,false-clause)
( °is the left-shift of the Nkey).
Level 1/Argument 3
obj
true
Full Command and Function Reference 3-83
Level 1/Item 1
[ array ]
2
Level 1/Item 1
It depends!
Level 1/Item 1
obj
false
It depends!