# Chapter4_1 - Chapter 4 (Lect 1) Combinational Circuits...

This preview shows pages 1–9. Sign up to view the full content.

Chapter 4 (Lect 1) Combinational Circuits Analysis Design Half and Full Adders

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

View Full Document
Combinational Circuit: A circuit whose outputs at any time are determined solely on the state of current inputs. Combinational Circuit: can be specified completely by a set of Boolean expressions. n - binary inputs ----- 2 n possible combinations m - Boolean functions to describe the outputs n inputs m outputs Gates
Analysis of Combinational Logic: Given a circuit find: 1. Boolean functions that describes the circuit behavior 2. Truth table based on the functions 3. Possible narrative of circuit

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

View Full Document
Boolean Expressions: (use intermediate outputs when helpful) A B A C F2 F1 B C A C C
Truth Table: F1 = F2 = A B C F1 F2 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

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

View Full Document
Design of Combinational Logic: Given Circuit specifications: 1. Determine the number of inputs and outputs 2. Make a truth table that defines the relationship of inputs and outputs 3. Derive simplified Boolean expression 4. Create logic diagram and verify
Create a circuit that converts BCD to Excess-3 code List BCD List Excess-3 How many inputs? ____________ How many outputs? ____________

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

View Full Document
Truth Table and K-Maps: A B C D wxyz w = don’t cares?
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/15/2011 for the course E 202 taught by Professor Staff during the Fall '11 term at University of Alabama - Huntsville.

### Page1 / 21

Chapter4_1 - Chapter 4 (Lect 1) Combinational Circuits...

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

View Full Document
Ask a homework question - tutors are online