Computer Architecture Octal Full -Adders Some Extra Information Input: A, B- oct

Question

Computer Architecture

Octal Full -Adders

Some Extra Information

Input: A, B- octal digits (see representation below); C,n- binary digit Output: S- octal digit (see representation below); Cbinary digit out Task: Using only binaryFAs to perform the actual addition, design a circuit that performs as an octal FA. More specificallv, this circuit would input the two octal digits A, B, convert them into binary numbers, add them using only binary FAs, convert the binary result back to octal, and output the sum as an octal digit, and the binary carry out. Input/Output binary representation of octal digits Every octal digit will be represented using the following 8-bit binary representation: Octal 8-bit Input Lines: Digit: Q 1 2 3 4 5 6 Z 1000000 0 010 0 000 0 0010000 0 0001000 0 00 0 0100 0 0 0 0 0 010 0 60 0000010 0 0 0 0 000 1 0 2 4

Explanation / Answer

Full adder having 2 half adders with one or gate function

sum = a exclusive b exclusive c function

carry = AB+BC+AC

23 =8

so that

000 = 0000 0000 =0

001 = 0000 0001= 1

010 = 0000 0010= 2

011 = 0000 0011 =3

100 = 0000 0100 =4

101 = 0000 0101=5

110 = 0000 0110=6

111 = 00000111= 7

base (8) means octal so that its support 0-7 numbers only

in this circuit can accept 0-7 numbers first convert in to equvalent binary 3bit number the process

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.