ECE3120: Computer Systems Arithmetic Programming - PowerPoint PPT Presentation

1 / 20
About This Presentation
Title:

ECE3120: Computer Systems Arithmetic Programming

Description:

Problem definition: Identify what should be done. - Develop the algorithm. Algorithm is the overall ... ldd $802 ; place the lowest 2 bytes of the minuend D ... – PowerPoint PPT presentation

Number of Views:31
Avg rating:3.0/5.0
Slides: 21
Provided by: xubi
Category:

less

Transcript and Presenter's Notes

Title: ECE3120: Computer Systems Arithmetic Programming


1
ECE3120 Computer SystemsArithmetic Programming
  • Dr. Xubin He
  • http//iweb.tntech.edu/hexb
  • Email hexb_at_tntech.edu
  • Tel 931-3723462, Brown Hall 319

2
  • Today
  • Write programs to do arithmetic

3
Software Development Process - Problem
definition Identify what should be
done. - Develop the algorithm. Algorithm is the
overall plan for solving the problem at
hand. - An algorithm is often expressed in the
following format Step 1 Step
2 - Another way to express overall plan is to
use flowchart. - Programming. Convert the
algorithm or flowchart into programs. - Program
Testing - Program maintenance
4
Symbols of Flowchart
5
Programs to do simple arithmetic Example 2.3
Write a program to add the values of memory
locations at 1800, 1801, and 1802, and save
the result at 1900. Solution
Step 1 A ? m1800 Step 2 A ? A
m1801 Step 3 A ? A m1802 Step 4 1900 ?
A
6
Example 2.4 Write a program to subtract the
contents of the memory location at 805 from the
sum of the memory locations at 801 and 802, and
store the difference at 900. Solution
7
Example 2.6 Write a program to add two 16-bit
numbers that are stored at 1000-1001 and
1002-1003 and store the sum at 1010-1011.
8
Multiprecision arithmetic Arithmetic performed in
a 16-bit microprocessor/microcontroller on
numbers larger than 16 bits. Makes use of the
carry flag (C flag) of the condition code
register (CCR).
The Carry/borrow Flag - Bit 0 of the CCR
register - Set to 1 when the addition operation
produces a carry 1 - Set to 1 when the
subtraction operation produces a borrow
1 - Enables the user to implement multi-precision
arithmetic
Example Ldd 8645 Addd 9978
9
Example 2.7 Write a program to add two 4-byte
numbers that are stored at 1000-1003 and
1004-1007, and store the sum at 1010-1013.
10
Example 2.8 Write a program to subtract the hex
number stored at 804-807 from the hex number
stored at 800-803 and save the result at
900-903.
Solution The subtraction starts from the LSBs
and proceeds toward the MSBs. org 1000 ldd 802
place the lowest 2 bytes of the minuend
D subd 806 subtract the lowest 2 bytes of the
subrahend from D std 902 save subtract and
save the difference of the second to
most-significant bytes ldaa 801 sbca 805 st
aa 901 subtract and save the difference of the
most significant bytes ldaa 800 sbca 804 st
aa 900 end
11
BCD Numbers and Addition - Each digit is encoded
by 4 bits - Two digits are packed into one
byte - The addition of two BCD numbers is
performed by binary addition and an adjust
operation using the DAA instruction. - The
instruction DAA can be applied after the
instructions ADDA, ADCA, and ABA. - Simplifies
I/O conversion For example, the instruction
sequence LDAA 800 ADDA 801 DAA STAA 80
2 adds the BCD numbers stored at 800 and 801
and saves the sum at 802.
12
Multiplication and Division
13
Example 2.10 Write an instruction sequence to
multiply the 16-bit numbers stored at 800-801
and 802-803 and store the product at
900-903. Solution Example 2.11 Write an
instruction sequence to divide the signed 16-bit
number stored at 1005-1006 by the signed
16-bit number stored at 1020-1021 and store the
quotient and remainder at 1030-1031 and
1032-1033, respectively. Solution
14
Illustration of 32-bit by 32-bit Multiplication
- Two 32-bit numbers M and N are divided into two
16-bit halves M MHML N NHNL
15
Example 2.12 Write a program to multiply two
unsigned 32-bit numbers stored at MM3 and
NN3, respectively and store the product at
PP7. Solution org 1000 M ds.b 4 N ds.b 4
P ds.b 8 org 1500 ldd M2 ldy N2 emul
compute MLNL sty P4 std P6 ldd M ldy
N emul compute MHNH sty P std P2 ldd
M ldy N2 emul compute MHNL
16
add MHNL to memory locations
P2P5 addd P4 std P4 tfr Y,D adcb P3
stab P3 adca P2 staa P2 propagate
carry to the most significant byte ldaa P1 ad
ca 0 add carry to the location at
P1 staa P1 ldaa P add carry to the
location at P adca 0 staa P
compute MLNH ldd M2 ldy N emul
17
add MLNH to memory locations P2
P5 addd P4 std P4 tfr Y,D adcb P3 st
ab P3 adca P2 staa P2 propagate carry
to the most significant byte clra adca P1 s
taa P1 ldaa P adca 0 staa P end
18
Example 2.13 Write a program to convert the
16-bit number stored at 800-801 to BCD format
and store the result at 900-904. Convert each
BCD digit into its ASCII code and store it in one
byte. Solution - A binary number can be
converted to BCD format by using repeated
division by 10. - The largest 16-bit binary
number is 65535 which has five decimal
digits. - The first division by 10 obtains the
least significant digit, the second division by
10 obtains the second least significant digit,
and so on. org 800 data dc.w 12345 data
to be tested org 900 result ds.b 5
reserve bytes to store the result org 1000
ldd data ldy result ldx 10 idiv add
b 30 convert the digit into ASCII
code stab 4,Y save the least significant
digit xgdx ldx 10
19
idiv adcb 30 stab 3,Y save the second
to least significant digit xgdx ldx 10 idi
v addb 30 stab 2,Y save the middle
digit xgdx ldx 10 idiv addb 30 stab 1
,Y save the second most significant
digit xgdx addb 30 stab 0,Y save the
most significant digit end

20
Next
  • Program Loops
  • Read Chapter 2.6
Write a Comment
User Comments (0)
About PowerShow.com