1159217915 - Chapter 2 Combinational Logic Circuits Meilin...

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

View Full Document Right Arrow Icon
Chapter 2 Combinational Logic Circuits Meilin Liu Department of Computer Science Wright State University Homepage: http://www.wright.edu Email: [email protected]
Background image of page 1

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

View Full DocumentRight Arrow Icon
CEG 260, Meilin Liu 2 Outline Part 1 – Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 – Circuit Optimization Two-Level Optimization Map Manipulation Multi-Level Circuit Optimization Part 3 – Additional Gates and Circuits Other Gate Types Exclusive-OR Operator and Gates High-Impedance Outputs
Background image of page 2
CEG 260, Meilin Liu 3 Binary Logic and Gates In order to analyze the digital system systematically, we introduce a mathematical notation that specifies the operation of each gate. Boolean Algebra by George Boole. Boolean Algebra : a useful mathematical system for specifying and transforming logic functions. We study Boolean algebra as foundation for designing and analyzing digital systems!
Background image of page 3

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

View Full DocumentRight Arrow Icon
CEG 260, Meilin Liu 4 Binary Logic Binary variables take on one of two values. A, B, C, X, Y, Z, ST. Logical operators operate on binary values and binary variables. Basic logical operators are the logic functions AND, OR and NOT. Logic gates implement logic functions.
Background image of page 4
CEG 260, Meilin Liu 5 Binary Logic There are three basic logical operations: AND, OR, NOT (1)AND operator: “dot” Y=AB name: “product” truth table: A B Y 0 0 0 0 1 0 1 0 0 1 1 1 A B Y Truth table: a tabular listing of the values of a function for all possible combinations of values on its arguments and the corresponding result. A B Y=A·B AND
Background image of page 5

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

View Full DocumentRight Arrow Icon
CEG 260, Meilin Liu 6 Binary Logic (1)OR operator: “+” Y=A+B name: “sum” truth table: A B Y 0 0 0 0 1 1 1 0 1 1 1 1 A B Y OR A B Y=A+B
Background image of page 6
CEG 260, Meilin Liu 7 Binary Logic (1)NOT operator: a bar ( ¯ ), a single quote mark (') after, or (~) before the variable. Y=A, Y=A’, or Y=~A. name: “not” or “complement” truth table: A Y 0 1 1 0 A Y A Y=A’ Inverter
Background image of page 7

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

View Full DocumentRight Arrow Icon
CEG 260, Meilin Liu 8 Boolean Expression Boolean expression : variables, constants, operations and parentheses. Boolean function: A binary variable = A boolean expression.
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/03/2010 for the course CEG 260 taught by Professor Staff during the Spring '08 term at Wright State.

Page1 / 26

1159217915 - Chapter 2 Combinational Logic Circuits Meilin...

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

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