Scribd
Upload
588 views1 page

Logic Gates-Boolean Algebra-Karnaugh Map

This document provides information on logic functions and gates, Boolean theorems, and Karnaugh maps. It defines common logic gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR. It includes truth tables showing the input and output relationships for 1, 2, and 3-input gates. Key Boolean theorems like commutative, associative, distributive, double inversion, AND, OR, and XOR properties are also listed. Finally, it introduces Karnaugh maps as a method to minimize Boolean logic functions with up to four variables.

Uploaded by

berickson_14
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
588 views1 page

Logic Gates-Boolean Algebra-Karnaugh Map

This document provides information on logic functions and gates, Boolean theorems, and Karnaugh maps. It defines common logic gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR. It includes truth tables showing the input and output relationships for 1, 2, and 3-input gates. Key Boolean theorems like commutative, associative, distributive, double inversion, AND, OR, and XOR properties are also listed. Finally, it introduces Karnaugh maps as a method to minimize Boolean logic functions with up to four variables.

Uploaded by

berickson_14
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Logic Functions & Gates + Boolean Theorems + Karnaugh Map v1.01.

03

Logic Functions & Gates


Logic Gate NOT AND OR NAND NOR XOR XNOR
Symbol
Y is invert Y = 1 if A OR B = 1, not if both = Y = 0 if A OR B = 1, not if both =
Description Y = 1 if A AND B = 1 Y = 1 if A OR B = 1 Y = 0 if A AND B = 1 Y = 0 if A OR B = 1
of A 1 1
Y = A⊕ B Y = A⊕ B
Function Y=A Y = A× B Y = A+ B Y = A× B Y = A+ B
Y = AB + AB Y = AB + AB
2-Input A B Y E/I A B Y E/I
Truth A B Y E/I A B Y E/I A B Y E/I A B Y E/I
0 0 1 (Y=1) 0 0 1
Table A Y 0 0 0 (Y=0) 0 0 0 (Y=B) (Y= B 0 0 0 (Y=B) 0 0 1
0 1 1 Inhibit (Y= B )
Showing 0 1 0 1 0 Inhibit 0 1 1 Enable 0 1 0 ) 0 1 1 Enable 0 1 0
1 0 1 Enable
Enable & 1 0 1 0 0 (Y=B) 1 0 1 (Y=1) (Y= B Enable 1 0 1
1 0 0 (Y=0) (Y= B ) 1 0 0 (Y=B)
Inhibit 1 1 1 Enable 1 1 1 Inhibit 1 1 0 ) 1 1 0 Enable
Inhibit Enable 1 1 1
Enable 1 1 0
Y = A⊕ B ⊕C Y = A⊕ B ⊕C
Function Y = A× B × C Y = A+ B +C Y = A× B × C Y = A+ B +C
Y = ABC + ABC + ABC + ABC Y = ABC + ABC + ABC + ABC
Note: A o A B C Y A B C Y A B C Y A B C Y A B C Y A B C Y
on the 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1
inputs or 0 0 1 0 0 0 1 1 0 0 1 1 0 0 1 0 0 0 1 1 0 0 1 0
3-Input outputs 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0
Truth represents 0 1 1 0 0 1 1 1 0 1 1 1 0 1 1 0 0 1 1 0 0 1 1 1
Table active LOW 1 0 0 0 1 0 0 1 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 0
1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 0 1 0 1 1
1 1 0 0 1 1 0 1 1 1 0 1 1 1 0 0 1 1 0 0 1 1 0 1
1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0

Theorems of Boolean Algebra


Commutative Double Inversion AND OR XOR Karnaugh Map
(K-Map)
x+ y= y+ x x=x x×0 = 0 x+0= x x⊕0= x
x× y = y× x DeMorgan x ×1 = x x +1=1 x ⊕1 = x Two Variable Three Variable Four Variable

Associative xy = x + y x× x = x x+ x= x x⊕ x =0 B B C C CD CD CD CD
B C / CD
A AB
x + ( y + z) = ( x + y) + z x + y = xy x× x = 0 x + x =1 x ⊕ x =1 0 1 0 1 00 01 11 10
x( yz) = ( xy) z Other Multivariable A 0 AB 00
Distributive x + xy = x A 1 AB 01
x( y + z) = xy + xz ( x + y)( x + z) = x + yz AB 11
( x + y)( w + z) = xw + xz + yw + yz x + xy = x + y AB 10

[email protected]

You might also like