lecture14 - Combinational Circuits Page 5 Full Adder -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CMPT 150 Combinational Circuits Page 1 Half Adder Example Create a circuit that has two 1-bit numbers as inputs and produces a 1-bit sum and carry as output. Input: Output: CMPT 150 Combinational Circuits Page 2 Half Adder Example - Logic Diagram CMPT 150 Combinational Circuits Page 3 Full Adder Example b Consider adding the following 4-bit binary numbers, A and B: 1101 1011 b CMPT 150 Combinational Circuits Page 4 Full Adder Continued… b Truth table is as follows: k-map for S : X Y Z S C 0 0 0 0 0 1 k-map for C : 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CMPT 150
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Combinational Circuits Page 5 Full Adder - Logic Diagram CMPT 150 Combinational Circuits Page 6 4-bit Binary Ripple Carry Adder b E.g. to build a 4-bit binary ripple carry adder: A A b Which gives us the following 4-bit adder package: FA FA FA FA 4-bit adder CMPT 150 Combinational Circuits Page 7 8-bit Adder b We can build an 8-bit adder out of two 4-bit adders: A 4 B 4 A 5 B 5 A 6 B 6 A 7 B 7 A B A 1 B 1 A 2 B 2 A 3 B 3 4-bit adder 4-bit adder S 1 S S 3 S 2 S 5 S 4 S 7 S 6...
View Full Document

This note was uploaded on 04/27/2011 for the course CMPT 150 taught by Professor Dr.anthonydixon during the Spring '08 term at Simon Fraser.

Page1 / 2

lecture14 - Combinational Circuits Page 5 Full Adder -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online