Sie sind auf Seite 1von 2

10 POWER X.

RSS
LAD 2 -

1.234
10

--- Total Rungs in File = 12

(1.234 * ln10)
=e

F8:0 is ln10
F8:1 is e
F8:2 is input value
F8:3 is (input valaue * ln10) , let's say it 'x'
F8:4 is working register
F8:5 is a pivot of factorial
F8:6 is a factorial value
F8:7 is result
F8:8 is working register
MUL
Multiply
Source A

0000

Source B
Dest

F8:2
-5.5<
F8:0
2.302585<
F8:3
-12.66422<

MOV
Move
Source

0001

F8:3
-12.66422<
Dest
F8:4
1.916497E+035<

resut = 1 + x
0002

ADD
Add
Source A

1.0
1.0<
Source B
F8:4
1.916497E+035<
Dest
F8:7
0.2046869<

0003

MOV
Move
Source
Dest

0004

1.0
1.0<
F8:5
32.0<

MOV
Move
Source

1.0
1.0<
Dest
F8:6
2.631309E+035<

0005

Page 1

Recursive Routine.
It's the routine for exponential power.
Resut = 2nd + 3rd + 4th + 5th + 6th + ...
Note. More loop count, more closer to the exact value, but scan time is increased more. It's depends on you!
Q2:3
ADD
LBL
Add
Source A
Source B
Dest

F8:5
32.0<
1.0
1.0<
F8:5
32.0<

Saturday, July 16, 2005 - 04:10:52

10 POWER X.RSS
LAD 2 -

--- Total Rungs in File = 12

MUL
Multiply
Source A

0006

F8:5
32.0<
Source B
F8:6
2.631309E+035<
Dest
F8:6
2.631309E+035<

MUL
Multiply
Source A

0007

F8:3
-12.66422<
Source B
F8:4
1.916497E+035<
Dest
F8:4
1.916497E+035<

DIV
Divide
Source A
F8:4
1.916497E+035<
Source B
F8:6
2.631309E+035<
Dest
F8:8
0.7283435<

0008

ADD
Add
Source A

0009

Source B
Dest

0010

0011

Page 2

LES
Less Than (A<B)
Source A
F8:5
32.0<
Source B
32.0
32.0<

F8:8
0.7283435<
F8:7
0.2046869<
F8:7
0.2046869<
Q2:3
JMP

END

Saturday, July 16, 2005 - 04:10:53

Das könnte Ihnen auch gefallen