TYPE 0028

Operation Codes
・ Pj is parameter j (i.e. the parameter being processed) ・ Sk is variable number k in the stack (starting from the top) ・ Xi is the ith input (i is incremented when an input is accessed, it starts at 1) ・ Yj is the jth input (j is incremented when an output is accessed, it starts at 1) ・ Ri is the register (memory spot) i OPERATIONS THAT ADD VARIABLES TO THE STACK Pi    Interpretation -2   put (Elapsed Time since last summary) on top of stack (Sk = Elasped Time). -1  the value of the next Parameter is placed on top of the stack as a constant. (j = j + 1, Sk = Pj) 0  the value of the next Input is placed on top of the stack. (i = i + 1, Sk = Xi) BINARY OPERATIONS Pi    Interpretation 1    the two values on top of the stack are replaced with their product. (Sk-1 = Sk1*Sk) 2   the two values on top of the stack are replaced by the result of the division of the second value from the top of the stack by the value on top of the stack. (Sk-1 = Sk-1/Sk) 3   the two values on top of the stack are replaced by their sum. (Sk-1 = Sk-1 + Sk) 4   the two values on top of the stack are replaced by their difference. The top value on the stack is subtracted from the second value from the top of the stack. (Sk-1 = Sk-1 - Sk) 5   the two values on top of the stack are replaced by the second value from the top of the stack raised to the power of the top value in the stack. (Sk-1 = Sk-1^Sk) UNARY OPERATIONS Pi    Interpretation 6    the top value in the stack is replaced by the log10 of the top value in the stack. (Sk =log10Sk) 7   the top value in the stack is negated (Sk = -Sk) 8    the top value in the stack is left unchanged unless it is negative, in which case it is replaced by 0. (Sk = Sk if Sk ≥ 0, Sk = 0 if Sk < 0). FUNCTIONS USING LOGICAL RELATIONSHIPS Some of the functions here below take their name from the case where all inputs are either 0 or 1 (Boolean variables). If inputs are outside that range, no error is generated, the same equations are applied. Pi   Interpretation 9    the two values on top of the stack are replaced with 1 if the second value is greater than or equal to the top value, and 0 otherwise. (Sk-1 = 1 if Sk-1 > Sk, Sk-1 = 0 if Sk-1 < Sk). 10 the top value in the stack is NOT'ed (Sk = 1 - Sk) 11  the two values on top of the stack are replaced by their Boolean AND (Sk-1 = min(Sk-1,Sk)) 12  the two values on top of the stack are replaced by their Boolean OR (Sk-1 = max(Sk-1,Sk))  UNARY OPERATORS (2) Pi     Interpretation 13  The top value in the stack is replaced by the loge of the top value in the stack (Sk = ln(Sk)). 14 The top value in the stack is replaced by e to the power of the top value in the stack (Sk = exp(SZ)). 15 The top value in the stack is replaced by the sine of the top value in the stac (Sk=sin(Sk)) [Sk must be in degrees] 16  The top value in the stack is replaced by the cosine of the top value in the stack (Sk = cos(Sk)) [Sk must be in degrees] 17  The top value in the stack is replaced by the arcsine of the top value in the stack (Sk = arcsin(Sk)) [in degrees] 18  The top value in the stack is replaced by the arccosine of the top value in the stack (Sk = arccos(Sk)) [in degrees] 19  The top value in the stack is replaced by the arctangent of the top value in the stack (Sk = arctan(Sk)) [in degrees]  OUTPUTS Pi   Interpretation -3   the value on the top of the stack is set as the next Output (j = j + 1, Yj = Sk). -4  like -3, but top value of the stack is removed from stack (j = j + 1, Yj = Sk, Sk = Sk-1). OTHER FUNCTIONS Pi                Interpretation -5          decrement top of stack "pointer" (Sk = Sk-1) -6          increment top of stack "pointer" (Sk-1 = Sk). -7         switch top two values on stack (Temp = Sk, Sk = Sk-1, Sk-1 = Temp). -11       place the 1st Input on top of the stack (Sk = X1). -12       place the 2nd Input on top of the stack (Sk = X2). -20       place the 10th Input on top of the stack (Sk = X10). -(20+i) set register i to the value on the top of the stack; 1 ≤ i ≤ 10 (Ri = Sk, k = k- 1) -(30+i)  place the value in register i on the top of the stack; 1 ≤ i ≤ 10 (k = k + 1, Sk = Ri)