LOGIC GATES AND

BOOLEAN ALGEBRA

MANTIK DEVRELERİ
Yard.Doç.Dr. Mutlu BOZTEPE
 The NOT gate (inverter)
Indicates inversion

inverter truth table

Input Output
Low (0) High (1)
High (1) Low (0)

Boolean Equation Output = Input

X=A
Indicates inversion
 Inverter operation

Figure 3--2 Inverter operation with a pulse input.

Inverter application example

Figure 3--3 Timing diagram for

the case in Figure 3-2.
The AND gate

A B Output
Low (0) Low (0) Low (0)
Low (0) High (1) Low (0) Boolean Equation X = AB

High (1) Low (0) Low (0)

High (1) High (1) High (1)
Example
 The OR gate

A B Output
Low (0) Low (0) Low (0)
Low (0) High (1) High (1)
Boolean Equation X = A+B
High (1) Low (0) High (1)
High (1) High (1) High (1)
Example
Another example
The NAND gate

A B Output
Low (0) Low (0) High (1)
Low (0) High (1) High (1)
Boolean Equation X = AB
High (1) Low (0) High (1)
High (1) High (1) Low (0)
Pulsed operation
Equivalent operations

(De Morgan rule: discussed later)

AB = A + B
Application
Another application
Example
 The NOR gate

A B Output
Low (0) Low (0) High (1)
Low (0) High (1) Low (0)
Boolean Equation X = A+B
High (1) Low (0) Low (0)
High (1) High (1) Low (0)
Pulsed operation
Equivalent operations

(De Morgan rule: discussed later)

A+B = A.B
Application
 The XOR (exclusive-OR) gate

A B Output
Low (0) Low (0) Low (0) Boolean Equation
Low (0) High (1) High (1) X = AB+BA = AB
High (1) Low (0) High (1)
High (1) High (1) Low (0)
The XNOR (exclusive-NOR) gate

A B Output
Low (0) Low (0) High (1)
Boolean Equation
Low (0) High (1) Low (0)
X = A B + B A = AB
High (1) Low (0) Low (0)
High (1) High (1) High (1)
Example
Application
BOOLEAN ALGEBRA
Boolean Algebra
 1847’de “Mantığın Matematiksel
Çözümlemesi” ve 1854’de “Düşünce Yasaları
Üzerine Bir İnceleme” adlı eserleriyle mantığı
matematikle bağdaştırmayı denemiş
mantıksal yargıya varmayı taklit eden gerçek
bir cebir sunmuştur. George Boole
(1815-1864)
 Bu cebirde bir değişken ya doğru ya da
yanlıştır. (True/False)
 Bu cebir günümüzde dijital sistemlerin yani
gelişmiş bilgisayarların ve yazılımlarının
temelini oluşturmaktadır.
Boolean Algebra Laws and Rules

 Boolean
Addition
X=A + B (logical OR function)

 Boolean Multiplication
X = AB (logical AND function)
Boolean Algebra Laws and Rules
 Toplamanın Değişme Özelliği (Commutative
Law of Addition)
A+B = B+A

X=Y
Boolean Algebra Laws and Rules
 Çarpmanın Değişme Özelliği (Commutative
Law of Multiplication)
AB = BA

X=Y
Boolean Algebra Laws and Rules
 Toplamanın Birleşme Özelliği (Associative
Law of Addition)
A+(B+C) = (A+B)+C

X=Y
Boolean Algebra Laws and Rules
 Çarpmanın Birleşme Özelliği (Associative
Law of Multiplication)
A(BC) = (AB)C

X=Y
Boolean Algebra Laws and Rules
 Dağılma özelliği (Distrubition Law)
A(B+C) = AB+AC

X=Y
Distribution Law
(A+B)(C+D) = AC + AD + BC + BD

X=Y
A+0=A

In math if you add 0 you have changed nothing in

Boolean Algebra ORing with 0 changes nothing

X X=A
A+1=1

ORing with 1 must give a 1 since if any input

is 1 an OR gate will give a 1

A
X=1
X
A•0=0

In math if 0 is multiplied with anything you

get 0. If you AND anything with 0 you get 0

A
X=0

X
A•1 =A

ANDing anything with 1 will yield the anything

X=A
X
A+A = A

ORing with itself will give the same result

A
A A=A

X
A+A=1

Either A or A must be 1 so A + A =1

A
A

X=1
X
A•A = A

ANDing with itself will give the same result

A
A A=A

X
A•A =0

In digital Logic 1 =0 and 0 =1, so AA=0 since

one of the inputs must be 0.

A
A
X=0
X
A=A

If you not something twice you are back to the beginning

X=A
X
A + AB = A

A
B
X
A + AB = A + B

If A is 1 the output is 1 If A is 0 the output is B

A
B

X X=Y
Y
(A + B)(A + C) = A + BC

A
B
C

X
Y
De MORGAN
De Morgan will help to simplify digital circuits
using NORs and ANDs his theorem states

A•B=A+B

A+B=A•B

if more than 2 variables are used follow the

same pattern
De MORGAN

This should show That both circuits have the same output

De Morgan was right they are the same

De MORGAN
Look at A +B +C + D = A • B • C • D

This is the same too

Laws and rules
in Boolean
Algebra
Bir lojik devrenin bool fonksiyonunun
elde edilmesi (Boolean Analysis)

Example 1

X= AB+(C+D)
X= AB + C+ D
Example 2

X = (AB)(CD)
X = ABCD
Example 3

X = ABCD +A’
X = A’ + BCD
Example 4

X = (AB+B’)BC
using distributive law
X = ABBC +B’BC
X = ABC + B’BC
X = ABC + 0•C
X = ABC + O
X = ABC
Basitleştirme (Simplification)
 Verilen bir boolean fonksiyonu daha basit
hale indirgeme işlemine denir.
 Bool cebri kuralları uygulanarak fonksiyon

basitleştirilir.
 Böylece fonksiyon gerçekleştirilirken daha az

lojik kapı kullanılır.

Örnek-1
Örnek -1
(A + B)(CD) = A + B + CD
= A + B + CD

X and Y are
the same
Örnek -2
Örnek -2
X = A + B C + CD + B
= A + B C CD + B
= A + B C (CD + B)
= A B C (C +D +B)
= A B C C + A B C D +A B B C
=ABCD

Now to check our work

Örnek -2

The
circuits
are the
same