LogicsgateBooleanAlgebra-NICADD.PDFVIP

Logics gate Boolean Algebra Lecture: • Logic gates and Boolean Algebra • Common logical gates – OR, AND, XOR, … • Logic level • Implementation – TTL – CMOS based Lab: • Logic gates P. Piot PHYS 375 – S rin 2008 Logic gate • A gate is a circuit that operates on binary logics • Can perform operation such as • “Truth tables” are used to present the maping of input signal into ouput signal • Karnaugh map are used to optimize a system (we will not use this) P. Piot PHYS 375 – S rin 2008 Boolean Algebra • Close to “classical” algebra • Boolean Algebra allows: – Mathematical expression of logical function, – Manipulate variable to optimize an algorithm. • Boolean “space” – 2 possible value: 0 or 1 – 3 operations: • Addition (OR + ) • Multiplication (AND ×or •) • Inversion (/ or ¯ ) • Equations are typically sum of product or product of sum. P. Piot PHYS 375 – S rin 2008 Boolean Algebra (CNT’D) • Boole’s Theorems • Associativity x • Comutativity • Distributivity • Other P. Piot PHYS 375 – S rin 2008 Boolean Algebra • Morgan’s theorems • Boolean Algebra allows to implement from a given set of logical gate any type of logical (=Boolean) equation P. Piot PHYS 375 – S rin 2008 Identity and inverter gate Identity (unitary gate)