Scribd
Upload
9 views31 pages

03-04 - Gates & Booelanalg - 2022-23

The document discusses logic design and Boolean algebra. It defines logic levels, basic logic gates like NOT, AND, OR, introduces Boolean variables and functions. It also covers theorems of Boolean algebra and provides examples of simplifying Boolean expressions and implementing logic circuits from expressions and vice versa.

Uploaded by

Eray Güler
Copyright
© © All Rights Reserved
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
9 views31 pages

03-04 - Gates & Booelanalg - 2022-23

The document discusses logic design and Boolean algebra. It defines logic levels, basic logic gates like NOT, AND, OR, introduces Boolean variables and functions. It also covers theorems of Boolean algebra and provides examples of simplifying Boolean expressions and implementing logic circuits from expressions and vice versa.

Uploaded by

Eray Güler
Copyright
© © All Rights Reserved
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/ 31

LOGIC DESIGN

GATES & BOOLEAN ALGEBRA

Doç. Dr.
Birim BALCI CBÜ 2022-23 Spring
Logic Circuit
2

 Used to build computer hardware .


 A system that decides if a circuit in digital electronics is : (T) or (F)
 binary logic circuits two values: 1 and 0

 We interested in the relationship


inputs Logic circuit outputs
between inputs and outputs

 internal structure consists of


switching elements
4

Logic Levels

 1 True / High Voltage / HV / +5V / Logic 1/ SET /LOAD

 0 False / Low voltage / LV/ 0 V / Logic 0 / RESET / UNLOAD

Simplest Binary element : Switch


Boolean variables (X, Y, etc.)
5

 variables represent input or output of a switching network


 Variable may take on only two values (0, 1)
 These symbols are not binary numbers, they simply represent the 2
states of a Boolean variable
 They are not voltage levels, although they commonly refer to the
low or high voltage input/output of some circuit element
6
Basic Gates & Boolean Algebra
7

 NOT (-) (’)


3,5 V 5V
 x=0 then x’=1
 x=1 then x’=0
 x’’=x
Basic Gates
8

AND (.) OR (+)


 X.0 =0  X+0 =X
 X.1 =X  X+1 =1
 X.X =X  X+X =X
 X.X’=0  X+X’=1
Circuit Examples-1
9

 Exp 1:  Exp 2:
Draw the truth table and logic circuit
A logic circuit for the following function and analyse
implemented by the circuit.
F(a,b,c) = ac+bc’
using AND, OR gates

• the circuit
• Analyse
in the case of inputs
(a=1, b=1, c=1)
Logic Gates
10

Design a logic circuit with 3 inputs (x,y,z).


Example 4: Output should be 1 when x=1 and either y or z (or
both) is 1

Possible Circuit
combinations:

* Reduce the
Function could function and
be written as: draw the circuit.
DUALITY
11

Given any logic expression, its dual is formed by replacing all + with · , and
vice versa and replacing all 0s with 1s and vice versa
 f(a,b)=a+b dual of f(a,b)=a’·b’
 f(x)=x+0 dual of f(x)=x’.1
12
13
14
15

Example
Proving the Theorems
16

Prove the other theorems.


Proving the Theorems…
17
18

Exp: Exp:
Prove x+x’·y=x+y Prove (xy)’=x’+y’
Boolean Algebra…
19

The theorems can be applied to both of the expressions


AND or OR.
T6 Commutative (Değişme)  Absorption (Yutma)
 x+x·y=x
 x·y = y·x
T9 x·(x+y)=x Covering
 x+y = y+x
T10 Combining
T7Associative (Birleşme) x·y+x·y’=x

 DeMorgan
 x·(y·z) = (x·y)·z  (x+y)·(x+y’)=x
 x+(y+z) = (x+y)+z (x·y)’=x’+y’
 Complementation
T8 Distributive (Dağılma)  x+x’=1 (x+y)’=x’·y’
 x·(y+z) = x·y+x·z  x . x’=0
 x+y·z = (x+y)·(x+z)  Involution (Çift tersleme)
 x’’=x
Vairables and functions
20

consider
 2 switches controlling the state of the light

 Series connection : light will be on if both switches are closed (1)


 L (x1,x2) = x1 . x2

• if switches are parallel  OR operator.


21

 Exp: Shows output values for all input combinations

Example:

EK
Simplifying (minimizing) an equation
22
simplifying
23

 Exp:
Examples: for your study
24

Exp 1:

Exp 2:

Exp3:

Exp4:

Exp5:
Logical sum and logical product terms
25

Because of the similarity with arithmetic addition and


multiplication operations, the OR and AND operations
are often called the logical sum and product operations.

 ABC+A’BD+ACE’ a sum of 3 product terms

 (A+B+C)(A’+B+D)(A+C+E’) a product of 3 sum terms


26

Inversion (complement ) of a function

f(x1, x2)= x1+ x2

f’(x1, x2)= (x1+ x2)’


Logic Gates…
27

NAND Gate (VeDeğil) NOR Gate (VEYADeğil)

AND + NOT OR + NOT


Symbol

Truth Table

Expression

EK : Inverter, AND, OR implementation by using NAND / NOR gates


Logic Gates…
28
EXOR Gate (Exculusive OR) EXNOR Gate (Exculusive NOR)

Symbol

Truth Table

Expression
Reminding : Logic Gate Symbols

NOT TRANSFER (Buffer)

AND XOR

OR XNOR

NAND

NOR
29
Implementing Circuit From Boolean Expression
30

Example 1: Draw the logic circuit for function F.

EK
Implementing Boolean Expression From Logic
Circuit
31

Example : Write the boolean expression for the given


logic circuit.

F = ( ( X’ . Y ) . Z’ ) + (X .Z’)

EK
32

 Standard symbols

 Alternate (conjugate symbols)

 Logic level incompatibility

Take notes !

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy