Scribd
Upload
13 views

Hardware Tutorial 07

This document provides an overview of designing an adder for binary-coded decimal (BCD) digits. It describes three problems: 1) designing a circuit to detect incorrect BCD input digits, 2) designing a circuit to produce a BCD carry output signal when the sum is greater than 9, and 3) using another binary adder to generate the correct BCD output sum.

Uploaded by

thisisatest4
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Hardware Tutorial 07

This document provides an overview of designing an adder for binary-coded decimal (BCD) digits. It describes three problems: 1) designing a circuit to detect incorrect BCD input digits, 2) designing a circuit to produce a BCD carry output signal when the sum is greater than 9, and 3) using another binary adder to generate the correct BCD output sum.

Uploaded by

thisisatest4
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial 7: Binary Coded Decimal Adder

Small calculators work with BCD (binary-coded-decimal) digits. These use four bit binary numbers to represent the decimal digits 0 to 9. This means that six combinations of the four bits are not used. A common bit assignment for BCD digits are:

In preparation for the design of a calculator, we want to build an adder of two BCD digits, which will be made up of a binary adder and some extra circuits. First, we need to design a circuit that recognises incorrect BCD input digits.

Problem 1
Design and draw the minimised circuit for the incorrect BCD digit signal generator. First draw the Karnaugh map and determine the minimised Boolean equation, then draw the actual circuit.

Two of the circuits of problem 1, and a two-input OR gate will be needed to provide an Incorrect Input signal which indicates that either or both input digits are made up of invalid bit combinations. We now plan to use a four-bit binary adder to provide the sum of two BCD digits.

DOC112: Computer Hardware Tutorial 7

Problem 2
Design the circut for producing the BCD Carry Out. For a sum of less than 9 the Carry Out signal should have a 0 value. For larger sums it should be 1, equivalent to carry 10. For example two BCD digits, say 5 and 8 should produce 3 for the BCD output and a Carry Out of 1, read as 13. However the binary adder carry does not do this. The possibilities generating a carry are summarised by the following table.

An ingenious classmate of yours comes up with the following scheme for the BCD Carry Out generator:

It works! Find the combinational circuit (shown with the question mark above) that will make it work:

Problem 3
Only the binary sum of the two BCD digits has been generated so far. The same ingenious classmate of yours has a solution for generating the correct BCD output sum as well. All you have to do (she says) is to use another binary adder to x up the output when a BCD carry is generated. What should the circuit (? on the diagram below) be? (Hint: The results will be simpler than you think!)

DOC112: Computer Hardware Tutorial 7

You might also like