Google
 
Site navigation: [ Home | Theory | Java | About ]

Common circuit examples

4.2.7
Explain the functiuon of a given circuit.

 

example sum (using more than 1 bit):

1 0 1 0 0 1
0 0 1 0 1 0
--------------
1 1 0 0 1 1

Why not convert to decimal to check all this really works?

 

 

 

 

 

 

 

 

 

We leave it as an exercise for you to complete the table.

You will probably also want to draw the Karnaugh Maps for the Sum and Carry out circuits.

Then you could go on to design the full adder although this is a circuit well outside the expected range for this course.

 

 

What would a full-adder circuit look like when expanded to show all logic gates? Draw it using XOR, OR and AND gates.

 

 

 

For these exercises, construct the truth table , derive the expression (minterms), minimise if possible, using algebra and/or K-maps.

 

Adders

Recall that binary addition has the following rules for the addition of two binary digits, A and B:

A
B
Sum AB
Carry
 
0
0
0
0
adding 0 + 0
0
1
1
0
adding 0 and 1
1
0
1
0
adding 1 and 0
1
1
0
1
adding 1 and 1

Following on from the previous page, you should be able to see that the Sum is A XOR B whereas the Carry is A and B, expressed as Boolean algebra:

                         Sum = A and B

                         Carry = A xor B

The half-adder circuit with one XOR and one AND gate is shown.

When adding binary numbers that have more than 1 bit, the carry must be added to the next column on the left, a full-adder has a truth table like the following:.

A
B
Cin
Sum
Cout
0
0
0
0
0
0
0
1
1
0
0
1
0
1
0
0
1
1
0
1
1
0
0
 
 
1
0
1
 
 
1
1
0
 
 
1
1
1
 
 

A full adder is constructed from 2 half adders with the carry from each half adder going to an OR gate. Schematically:

Back to top

Exercise

The following schematic circuit is a 2-to-1 line multiplexer, if C is 0 then -Y=A else Y=B:

1. Draw the truth table and derive the algebraic expression for the circuit. Construct the circuit using appropriate gates.

2. Design a circuit that compares three inputs A, B and C and whose output Y is a one if all inputs are equal.

3. Design a circuit that compares the same three inputs as above but outputs a one if any two out of the three inputs are a 1.

3. Design a circuit that compares the same three inputs as above but outputs a one if an odd number of 1's is input. What could this circuit be used for? Have you seen it before?

Back to top

related: [ Topic 4 home | previous: circuits ]

 


 
The site is partly financed by advertising revenue, partly by online teaching activities and partly by donations. If you or your organisation feel these resouces have been useful to you, please consider a donation, $9.95 is suggested. Please report any issues with the site, such as broken links, via the feedback page, thanks.

Questions or problems related to this web site should be addressed to Richard Jones who asserts his right to be identified as the author and owner of these materials - unless otherwise indicated. Please feel free to use the material presented here and to create links to it for non-commercial purposes; an acknowledgement of the source is required by the Creative Commons licence. Use of materials from this site is conditional upon your having read the additional terms of use on the about page and the Creative Commons Licence. View privacy policy.

Creative Commons License


This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. © 2001 - 2009 Richard Jones, PO BOX 246, Cambridge, New Zealand;
This page was last modified: October 28, 2013