This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Logic Circuits Course Arab International University Faculty of Informatics and Communication Engineering (FICE) Ch. 41 Boolean Algebra and Logic Simplification Dr. Marwan Zabibi 2 1. Boolean Operations and Expressions 2. Laws and Rules of Boolean Algebra 3. DeMorgan’s Theorem 4. Boolean Expression for a Logic Circuit 5. Simplification Using Boolean Algebra 6. Standard Forms of Boolean Expressions 7. Boolean Expressions and Truth Tables 8. The Karnaugh Map 9. Karnaugh Map SOP Minimization 10.Karnaugh Map POS Minimization Contents 3 1 Boolean Operations & Expressions Boolean algebra: • Boolean Algebra is the mathematics of digital systems. • Variable, complement, and literal are terms used in Boolean algebra. • A variable is a symbol (usually an italic uppercase letter) used to represent a logical quantity. Any single variable can have a “1” or a “0” value. • The complement is the inverse of a variable and is indicated by a bar over the variable . • A literal is a variable or the complement of variable. • For example : “not A” or “A bar” 4 Boolean addition : Boolean addition is equivalent to the OR operation and the basic rules are illustrated with their relation to the OR gate as follows: In Boolean algebra, a sum term is a sum of literals. In logic circuits, a sum term is produced by an OR operation with no AND operations involved . Examples : 5...
View
Full
Document
This note was uploaded on 03/12/2012 for the course IT 101 taught by Professor Fadi during the Spring '12 term at University of Damascus.
 Spring '12
 Fadi

Click to edit the document details