Engin112-F07-L16-adders

Engin112-F07-L16-adders - Engin112 Lecture 16 Binary Adders...

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

View Full Document Right Arrow Icon
Maciej Ciesielski Department of Electrical and Computer Engineering 10/10/2007 Engin112 – Lecture 16 Binary Adders 10/10/2007 Engin 112 - Intro to ECE 2 Recap from Last Lectures ± Design and analysis of Boolean circuits ± Truth table for multiple-output functions: y One output column per function y Some minterms shared among several outputs y One K-map per function ± Explain two-level logic ± Today’s lecture y Adders » Half adder » Full adder
Background image of page 1

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

View Full DocumentRight Arrow Icon
10/10/2007 Engin 112 - Intro to ECE 3 Binary Adders ± Addition is important function in computer system ± What does an adder have to do? y Add binary digits y Generate carry if necessary y Consider carry from previous digit ± Binary adders operate bit-wise y A 16-bit adder uses 16 one-bit adders ± Binary adders come in two flavors y Half adder : adds two bits and generate result and carry y Full adder : also considers carry input y Two half adders make one full adder 10/10/2007 Engin 112 - Intro to ECE 4 Binary Half Adder ± Specification: y Design a circuit that adds two bits and generates the sum and a carry
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/16/2008 for the course ENGIN 112 taught by Professor Ciesielski during the Spring '08 term at UMass (Amherst).

Page1 / 8

Engin112-F07-L16-adders - Engin112 Lecture 16 Binary Adders...

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

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