Scribd
Upload
62 views36 pages

Lec1 Boolean Algebra

Here are the steps to solve these examples using Boolean algebra identities and De Morgan's laws: (a) (a(b + c) + a'b)' = (a(b + c))' + (a'b)' (De Morgan's law) = a' + (b + c)' + b'a (De Morgan's law) = a' + b'c' + b'a = b'(a' + c') (b) ab + a'c + bc = ab + a'c (bc is redundant since b = 1) (c) (a + b)(a' + c)(b + c)

Uploaded by

Betül
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
62 views36 pages

Lec1 Boolean Algebra

Here are the steps to solve these examples using Boolean algebra identities and De Morgan's laws: (a) (a(b + c) + a'b)' = (a(b + c))' + (a'b)' (De Morgan's law) = a' + (b + c)' + b'a (De Morgan's law) = a' + b'c' + b'a = b'(a' + c') (b) ab + a'c + bc = ab + a'c (bc is redundant since b = 1) (c) (a + b)(a' + c)(b + c)

Uploaded by

Betül
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 36

Digital Logic

The digital computer is a digital system that performs


various computational tasks. The word digital implies
that the information in the computer is represented
by variables that take a limited number of discrete
values.

Digital computers use the binary number system,


which has two digits: 0 and 1. A binary digit is called
a mi. Information is represented in digital
computers in groups of bits.
• A computer system is sometimes subdivided into two
functional entities: hardware and software. The
hardware of the computer consists of all the electronic
components and electromechanical devices that
comprise the physical entity of the device. Computer
software consists of the instructions and data that the
computer manipulates to perform various data-
processing tasks. A sequence of instructions for the
computer is called a program. The data that are
manipulated by the program constitute the data base
A computer system is composed of its hardware and the system software
available for its use. The system software of a computer consists of a
collection of programs whose purpose is to make more effective use of the
computer. The programs included in a systems software package are referred
to as the operating system. They are distinguished from application programs
written by the user for the purpose of solving particular problems. For
example, a high-level language program written by a user to solve particular
data-processing needs is an application program, but the compiler that
translates the high-level language program to machine language is a system
program. The customer who buys a computer system would need, in addition
to the hardware, any available software needed for effective operation of the
computer. The system software is an indispensable part of a total computer
system. Its function is to compensate for the differences that exist between
user needs and the capability of the hardware.
The hardware of the
computer is usually divided
into three major parts,
as shown in Fig.

The central processing unit (CPU) contains an arithmetic and logic unit for manipulating data, a
number of registers for storing dala, and control circuits for fetching and executing instructions.
The memory of a computer contains storage for instructions and data. It is called a random·
access memory (RAM) because the CPU can access any location in memory at random and
retrieve the binary information within a fixed interval of time. The input and output processor
(lOP) contains electronic circuits for communicating and controlling the transfer of information
between the computer and the outside world. The input and output devices connected to the
computer include keyboards, printers, terminals, magnetic disk drives, and other communication
devices.
• Computur organization is concerned with the way the
hardware compo­nents operate and the way they are
connected together to form the computer system. The various
components are assumed to be in place and the task is to
investigate the organizational structure to verify that the
computer parts oper­ate as intended.
• Compute design is concerned with the hardware design of
the computer. Once the computer specifications are
formulated, it is the task of the designer to develop hardware
for the system. Computer design is concerned with the
determination of what hardware should be used and how the
parts should be connected. This aspect of computer hardware
is sometimes referred to as computer implementation.
• Computer architecture is concerned with the
structure and behavior of the computer as seen by
the user. It includes the information formats, the
instruction set, and techniques for addressing
memory. The architectural design of a computer
system is concerned with the specifications of the
various functional modules, such as processors and
memories, and structuring them together into a
computer system
Boolean Algebra
LOGIC GATES

Formal logic: In formal logic, a statement (proposition) is a


declarative sentence that is either
true(1) or false (0).
It is easier to communicate with computers using formal logic.

• Boolean variable: Takes only two values – either


true (1) or false (0).
They are used as basic units of formal logic.
Boolean function and logic diagram

• Boolean function: Mapping from Boolean


variables to a Boolean value.

• Truth table:
• Represents relationship between a Boolean function
and its binary variables.
• It enumerates all possible combinations of
arguments and the corresponding function values.
Boolean function and logic diagram

• Boolean algebra: Deals with binary variables and


logic operations operating on those variables.

• Logic diagram: Composed of graphic symbols for


logic gates. A simple circuit sketch that represents
inputs and outputs of Boolean functions.
Gates

• Refer to the hardware to implement Boolean operators.


• The most basic gates are
Boolean function and truth table
BASIC IDENTITIES OF
BOOLEAN ALGEBRA
• Definition: A Boolean algebra is a closed algebraic
system containing a set K of two or more elements
and the two operators · and + which refer to logical
AND and logical OR
Basic Identities of Boolean Algebra
(Existence of 1 and 0 element)

(1) x+0=x
(2) x ·0=0
(3) x+1=1
(4) x·1=1

(Table 1-1)
Basic Identities of Boolean Algebra
(Existence of complement)

(5) x + x = x
(6) x · x = x
(7) x + x’ = x
(8) x · x’ = 0
Basic Identities of Boolean
Algebra (Commutativity):
(9) x + y = y + x
(10) xy = yx
Basic Identities of Boolean Algebra
(Associativity):

(11) x + ( y + z ) = ( x + y ) + z
(12) x (yz) = (xy) z
Basic Identities of Boolean
Algebra (Distributivity):
(13) x ( y + z ) = xy + xz
(14) x + yz = ( x + y )( x + z)
Basic Identities of Boolean
Algebra (DeMorgan’s Theorem)
(15) ( x + y )’ = x’ y’
(16) ( xy )’ = x’ + y’
Basic Identities of Boolean
Algebra (Involution)
(17) (x’)’ = x
Function Minimization using Boolean Algebra

• Examples:
(a) a + ab = a(1+b)=a

(b) a(a + b) = a.a +ab=a+ab=a(1+b)=a.

(c) a + a'b = (a + a')(a + b)=1(a + b) =a+b

(d) a(a' + b) = a. a' +ab=0+ab=ab


Try

• F = abc + abc’ + a’c


The other type of question
Show that;
1- ab + ab' = a
2- (a + b)(a + b') = a

1- ab + ab' = a(b+b') = a.1=a


2- (a + b)(a + b') = a.a +a.b' +a.b+b.b'
= a + a.b' +a.b + 0
= a + a.(b' +b) + 0
= a + a.1 + 0
= a +a=a
More Examples
• Show that;
(a) ab + ab'c = ab + ac
(b) (a + b)(a + b' + c) = a + bc

(a) ab + ab'c = a(b + b'c)


= a((b+b').(b+c))=a(b+c)=ab+ac

(b) (a + b)(a + b' + c)


= (a.a + a.b' + a.c + ab +b.b' +bc)
=…
DeMorgan's Theorem

(a) (a + b)' = a'b'


(b) (ab)' = a' + b'

Generalized DeMorgan's Theorem


(a) (a + b + … z)' = a'b' … z'
(b) (a.b … z)' = a' + b' + … z‘
DeMorgan's Theorem

• F = ab + c’d’
• F’ = ??

• F = ab + c’d’ + b’d
• F’ = ??
DeMorgan's Theorem

Show that: (a + b.c)' = a'.b' + a'.c'


More DeMorgan's example

Show that: (a (b + z (x + a')))' =a' + b' (z' + x')


(a (b + z(x + a')))' = a' + (b + z (x + a'))'
= a' + b' (z (x + a'))'

= a' + b' (z' + (x + a')')


= a' + b' (z' + x'(a')')

= a' + b' (z' + x'a)


=a‘+b' z' + b'x'a
=(a‘+ b'x'a) + b' z'
=(a‘+ b'x‘)(a +a‘) + b' z'
More Examples

(a(b + c) + a'b)'=b'(a' + c')


ab + a'c + bc = ab + a'c
(a + b)(a' + c)(b + c) = (a + b)(a' + c)

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