For 8 & 9, fill in the truth Tables below to implement a one-bit full subtractor

Question

For 8 & 9, fill in the truth Tables below to implement a one-bit full subtractor -- the

binary 1-bit arithmetic Difference and Borrow output logic functions. The outputs

should be the Difference (Diff) and Borrow output (Bout) for the three input bits X, Y,

and Bin (the Borrow input). The Diff and Bout should be the result result of X minus Y

minus Bin. Fill in the K-maps, and write the minimized SOP equations. Then draw the

logic gates corresponding to your Boolean equations. (i.e.: X=0, Y=1, Bin=0 results in

outputs Diff=1, Bout=1, since 0-1 = 1 with a borrow out, and so on.)

8) Difference output:

X Y Bin Diff

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

K-map:

Diff =

9) Borrow output:

A B Bin Bout

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

K-map:

Bout =

Explanation / Answer

Full subtractor (FS):

This has 3 inputs- 2 are the numbers to be subtracted and c is the borrow which is taken for previous bit and we have 2 outputs Difference and the Borrow. The following table shows the results for all combinations of inputs:

A B C B(borrow)          D(difference)= D = a

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

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