Avionics Lecture Handouts (L-12)

MAHENDRA ENGINEERING COLLEGE
MAHENDHIRAPURI, MALLASAMUDRAM - 637503 L-12

AE
Lecture Handouts
Subject Name: AVIONICS
VII/IV
Staff Name : Mr. J. GOWRI SHANKAR, AP/ECE
Unit : II (PRINCIPLES OF DIGITAL SYSTEMS) Date of

Lecture:
Topic of Lecture: Boolean Algebra

Introduction :
 Boolean algebra is the branch of algebra in which the values of the variables are the truth
values true and false, usually denoted 1 and 0 respectively.
 Instead of elementary algebra where the values of the variables are numbers, and the main
operations are addition and multiplication, the main operations of Boolean algebra are
the conjunction and, denoted ∧, the disjunction or, denoted ∨, and the negation not, denoted ¬.
 It is thus a formalism for describing logical relations in the same way that ordinary algebra describes
numeric relations.
Prerequisite knowledge for Complete learning of Topic:
 Basics of Binary Numbers

 Basic Arithmetic Operations
Detailed content of the Lecture:
 Boolean algebra was introduced by George Boole

 Boolean algebra has been fundamental in the development of digital electronics, and is provided for
in all modern programming languages. It is also used in set theory andstatistics.
 Logic sentences that can be expressed in classical propositional calculus have an equivalent
expression in Boolean algebra.
 Boolean logic is sometimes used to denote propositional calculus performed in this way.
 Boolean algebra is not sufficient to capture logic formulas using quantifiers, like those from first
order logic.
 Although the development of mathematical logic did not follow Boole's program, the connection
between his algebra and logic was later put on firm ground in the setting of algebraic logic, which also
studies the algebraic systems of many other logics.
 The problem of determining whether the variables of a given Boolean (propositional) formula can
be assigned in such a way as to make the formula evaluate to true is called the Boolean satisfiability
problem (SAT).
BASIC OPERATIONS
The basic operations of Boolean calculus are as follows.
 AND (conjunction), denoted x∧y (sometimes x AND y or Kxy), satisfies x∧y = 1 if x = y = 1

and x∧y = 0 otherwise.
 OR (disjunction), denoted x∨y (sometimes x OR y or Axy), satisfies x∨y = 0 if x = y = 0 and x∨y = 1
otherwise.
 NOT (negation), denoted ¬x (sometimes NOT x, Nx or !x), satisfies ¬x = 0 if x = 1 and ¬x = 1 if x =
0.
Fig 4.1 : Basic Logic Operations
BOOLEAN LAWS:
Fig 4.2 : Boolean Laws

THE AND OPERATION :
 AND Gate Output is HIGH if both the Inputs are HIGH
Fig 6.1 : TRUTH TABLE OF AND GATE

THE OR OPERATION:
 OR Gate output is HIGH if any one of the Input is HIGH
Fig 6.2 : TRUTH TABLE OF OR GATE
THE NOT OPERATION :
Fig 6.3 : TRUTH TABLE OF NOT GATE
SIMPLIFYING SWITCHING FUNCTIONS:

 Finding an equivalent switching expression that minimizes some cost criteria.
 Minimize literal count .
 Minimize literal count in sum-of-products (or product-of-sums) expression .
 Minimize number of terms in a sum-of-products expression provided no other expression exists with
the same number of terms and fewer literals.
 Example: f(x,y,z) = x’yz’ + x’y’z + xy’z’ + x’yz + xyz + xy’z = x’z’ + y’z’ + yz + xz Irredundant
sum-of-products expression: no term or literal can be deleted without changing its logical value •
Not necessarily minimal: f(x,y,z) = x’z’ + xy’ + yz
Not necessarily unique: f(x,y,z) = x’y + y’z’ + xz.
K-MAP TECHNIQUE (KARNAUGH MAP)
TYPES
 2 Variable K map
 For the above Types both SOP and POS with or without don’t care can be Simplified easily.
Video Content / Details of website for further learning (if any):

1. https://www.youtube.com/watch?v=gj8QmRQtVao
2. https://www.youtube.com/watch?v=AnQsznjccUw
Important Books/Journals for further learning including the page nos.:
1. Digital Electronics-Technical Publications D.A Godse & A.P Godse, Page No: 2-1 to 2-3
2. M.Morris Mano , ‘Digital Logic & Computer Design ‘ , Prentice Hall of India,2002
Subject Teacher Verified by HoD

Avionics Lecture Handouts (L-12)

Uploaded by

Copyright:

Available Formats

Avionics Lecture Handouts (L-12)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Avionics Lecture Handouts (L-12)

Uploaded by

Copyright:

Available Formats

MAHENDRA ENGINEERING COLLEGE

MAHENDHIRAPURI, MALLASAMUDRAM - 637503 L-12

Staff Name : Mr. J. GOWRI SHANKAR, AP/ECE

Unit : II (PRINCIPLES OF DIGITAL SYSTEMS) Date of

Topic of Lecture: Boolean Algebra

 Basics of Binary Numbers

Detailed content of the Lecture:

 Boolean algebra was introduced by George Boole

 AND (conjunction), denoted x∧y (sometimes x AND y or Kxy), satisfies x∧y = 1 if x = y = 1

Fig 4.1 : Basic Logic Operations

Fig 4.2 : Boolean Laws

Fig 6.1 : TRUTH TABLE OF AND GATE

Fig 6.2 : TRUTH TABLE OF OR GATE

THE NOT OPERATION :

Fig 6.3 : TRUTH TABLE OF NOT GATE

SIMPLIFYING SWITCHING FUNCTIONS:

Video Content / Details of website for further learning (if any):

Subject Teacher Verified by HoD

You might also like