Scribd
Upload
21 views22 pages

CE212 Chapter2

Uploaded by

meera naaj
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
21 views22 pages

CE212 Chapter2

Uploaded by

meera naaj
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/ 22

Digital Design

CE 212 Chapter 2

Salah Safi
Winter 2024-2025
German Jordanian University
Chapter 2: Boolean
Algebra and Logic
Gates
2.1 INTRODUCTION
● Because binary logic is used in all of today’s digital computers and devices, the cost of the
circuits that implement it is an important factor addressed by designers.

● As computer engineers, electrical engineers, or computer scientists. Finding simpler and


cheaper, but equivalent, realizations of a circuit can reap huge payoffs in reducing the overall
cost of the design.

● Mathematical methods that simplify circuits rely primarily on Boolean algebra.


2.4 BASIC THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA
2.4 BASIC THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA
● Duality Principle:

■ Every algebraic expression deducible from the postulates of Boolean algebra remains
valid if the operators and identity elements are interchanged.

■ We simply interchange OR and AND operators and replace 1’s by 0’s and 0’s by 1’s.
2.4 BASIC THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA
● Operator Precedence:
● The operator precedence for evaluating Boolean expressions is
■ (1) parentheses,
■ (2) NOT,
■ (3) AND,
■ (4) OR.

● In other words, expressions inside parentheses must be evaluated before all other operations.
The next operation that holds precedence is the complement, and then follows the AND and,
finally, the OR.
2.5 BOOLEAN FUNCTIONS
● Boolean function described by an algebraic expression consists of binary variables, the
constants 0 and 1, and the logic operation symbols.

● For a given value of the binary variables, the function can be equal to either 1 or 0.
■ example:

● A Boolean function can be represented in a truth table. The number of rows in the truth table is
2n, where n is the number of variables in the function.
BOOLEAN FUNCTIONS
● A Boolean function can be transformed from an algebraic expression into a circuit diagram
composed of logic gates connected in a particular structure. The logic‐circuit diagram (also
called a schematic) for F1
BOOLEAN FUNCTIONS

Finding the most economic representation of


the logic is an important design task.
Algebraic Manipulation
● When a Boolean expression is implemented with logic gates, each term requires a gate and
each variable within the term designates an input to the gate.

● We define a literal to be a single variable within a term, in complemented or uncomplemented


form.

● The function of Fig. 2.2(a) has three terms and eight literals, and the one in Fig. 2.2(b) has two
terms and four literals.

● By reducing the number of terms, the number of literals, or both in a Boolean expression, it is
often possible to obtain a simpler circuit.

● The manipulation of Boolean algebra consists mostly of reducing an expression for the purpose
of obtaining a simpler circuit.
Algebraic Manipulation
Complement of a Function
● The complement of a function F is F’ and is obtained from an interchange of 0’s for 1’s and 1’s for
0’s in the value of F.
● The complement of a function may be derived algebraically

● The generalized form of DeMorgan’s theorems states that the complement of a function is
obtained by interchanging AND and OR operators and complementing each literal.
Complement of a Function
Complement of a Function
2.6 CANONICAL AND STANDARD FORMS
Minterms and Maxterms
Sum of products (minterms)
A Boolean function can be expressed algebraically from a given truth table by forming a minterm
for each combination of the variables that produces a 1 in the function and then taking the OR of
all those terms.
Sum of products (minterms)
Sum of products (minterms)
● An alternative procedure for deriving the minterms of a Boolean function is to obtain the truth
table of the function directly from the algebraic expression and then read the minterms from
the truth table.
Product of sums (maxterms)
A Boolean function can be expressed algebraically from a given truth table by forming a maxterm
for each combination of the variables that produces a 0 in the function and then taking the AND of
all those terms.
2.7 OTHER LOGIC OPERATIONS
2.8 DIGITAL LOGIC GATES
● Since Boolean functions are expressed in terms of AND,
OR, and NOT operations, it is easier to implement a
Boolean function with these type of gates.

● Still, the possibility of constructing gates for the other


logic operations is of practical interest.

● Factors to be weighed in considering the construction of


other types of logic gates are
■ (1) the feasibility and economy of producing the
gate with physical components,
■ (2) the possibility of extending the gate to more
than two inputs,
■ (3) the basic properties of the binary operator, such
as commutativity and associativity.
■ (4) the ability of the gate to implement Boolean
functions alone or in conjunction with other gates.
2.9 INTEGRATED CIRCUITS
● An integrated circuit (IC) is fabricated on a die of a silicon semiconductor crystal, called a chip,
containing the electronic components for constructing digital gates.

● Digital ICs are often categorized according to the complexity of their circuits, as measured by
the number of logic gates in a single package:

■ Small‐scale integration (SSI): The number of gates is usually fewer than 10.
■ Medium‐scale integration (MSI) devices have a complexity of approximately 10 to 1,000
They usually perform specific elementary digital operations. Examples: decoders,
adders, and multiplexers registers and counters.
■ Large‐scale integration (LSI) devices contain thousands of gates in a single package.
examples: processors, memory chips, and programmable logic devices.
■ Very large‐scale integration (VLSI) devices now contain millions of gates within a single
package. Examples are large memory arrays and complex microcomputer chips.

You might also like