LOGIC DESIGN /

SYNTHESIS
LOGIC
OPTIMIZATION
 MEMBERS:

CARRETAS, RHEA LYN B.

BLANKER, EUGENE
MARQUEZ, MARK STEVEN
METRAN, BRAYAN REY
 LOGIC DESIGN
O refers to the basic organization of the
circuit components in a digital computer. It
forms an important part of embedded
surfaces and involves designing
components to work together and perform
their logical functions.
O A digital computer is built around a
two-value logic system – true/false,
yes/no, on/off, or 1/0.  To perform
computations, they rely on special
components known as logic gates.
These consist of integrated circuits,
which receive input signals, process
them, and convert them into outputs.
O As a signal or clock pulse travels through
these gates, they could either block it or
allow it to pass. The output portion of the
logic gates may either deliver the result of
the operation or act as the input controls
for other gates they may be connected to.
There are seven main types of logic designs that
Integrated Circuits use to perform fundamental
logical operations.
 AND Gate

O This logic gate gives a “true” output

only when all inputs are “true.” If one
or more inputs happen to be “false,”
then this gate's output will also be
“false.”
 OR Gate

O This logic gate gives a “true” output only

when one or more inputs are “true.” If all
inputs are “false,” then this gate's output
will also be “false.”
 NOT Gate

O This logic gate has a single input and a single

output. The latter performs an inverter
operation on the input. If the input is “true,”
then this gate's output will be “false.”
Likewise, if the input is “false,” then the
output will be “true.”
 NAND Gate

O This logic gate performs an AND operation on

the inputs followed by a NOT. A NAND gate is
effectively a combination of behavior of the
AND and NOT gates. If this gate's inputs are all
“true,” then the output will be “false.” Any other
combination of inputs will always yield a “true”
output.
 NOR Gate

O This logic gate performs an OR operation on

the inputs followed by a NOT. It is effectively a
combination of the behavior of an OR and a
NOT gate. If any one of the inputs is “true,”
then the output will always be “false.” It will
only yield a “true” output when all inputs are
“false.”
 XOR Gate

O The Exclusive-OR gate, or XOR, has two

inputs and only one output. This gate's output
will only be “true” when only one of the
inputs is “true.” If the inputs are either both
“true” or both “false,” then the output will
always be “false.”
 XNOR Gate

O The Exclusive-NOR gate, or XNOR, has two

inputs and only one output. The output of
this gate will only be “true” if the inputs are
either both “true” or both “false.” When only
one of the inputs is “true,” the output will
always be “false.”
Logic Design has several applications in
modern-day circuitry. It is frequently used in:

O Automatic sprinkler systems

O Light-activated burglar alarms
O Locks with push-to-open or push-to-start
buttons
O Safety thermostats
O Streetlights
 SYNTHESIS
LOGIC
OPTIMIZATION
 GOAL OF SYNTHESIS
O To get a Gate-level Netlist
O Inserting clock gates
O Logic Optimization
O Inserting DFT logic
O Logic Equivalence between RTL and Netlist
should be maintained.
 Synthesis in VLSI

O Synthesis transforms the simple RTL

design into a gate-level netlist with all
the constraints as specified by the
designer. In simple language, Synthesis
is a process that converts the abstract
form of design to a properly
implemented chip in terms of logic
gates.
Synthesis takes place in multiple
steps:
O Converting RTL into simple logic gates.
O Mapping those gates to actual
technology-dependent logic gates
available in the technology libraries.
O Optimizing the mapped netlist keeping
the constraints set by the designer
intact.
Basic Synthesis Flow & Example:
 
O Synthesis is a very important process for the
designers as it enables them to see how the
design will actually look like after fabrication.
All parameters including area, timing, power
can be reported and checked by the designer
beforehand only. He/She can make the
necessary changes(if required) before the actual
fabrication process, thus saving both time and
cost.
 Logic Optimization
Introduction

O Welcome to this presentation on logic optimization.

Digital circuits are an essential component of
modern technology, from the smartphones we use
every day to the complex microprocessors that
power our computers. However, as digital systems
become more complex, the number of logic gates
required to implement them can quickly become
unwieldy, leading to problems with size, power
consumption, and delay.
O This is where logic optimization comes in.
Logic optimization refers to the process of
simplifying digital circuits while maintaining
their functionality. By applying techniques
such as Boolean algebra, Karnaugh maps, and
Quine-McCluskey algorithms, we can reduce
the number of gates needed in a circuit,
resulting in circuits that are smaller, faster, and
more efficient.
O In this presentation, we will explore the key
concepts behind logic optimization, including
Boolean algebra, logic gates, algebraic
manipulation, Karnaugh maps, and the Quine-
McCluskey algorithm. We will also discuss the
importance of logic optimization in the design
of digital systems and compare optimized and
non-optimized circuits.
 Overview of Techniques
Boolean Algebra

O Boolean algebra is a mathematical system used

to represent logical statements in terms of
variables and logical operators. In the context
of digital circuits, Boolean algebra is used to
describe the behavior of logic gates and
circuits.
O The three basic Boolean operators are AND, OR, and
NOT. The AND operator returns true if and only if
both of its inputs are true. The OR operator returns
true if at least one of its inputs is true. The NOT
operator, also called the complement, returns the
opposite of its input.

O Boolean algebra also has several laws, including the

commutative, associative, distributive, and De
Morgan's laws, which allow us to manipulate Boolean
expressions and simplify them. These laws are the
foundation for many of the techniques used in logic
optimization.
 Algebraic Manipulation

Algebraic manipulation is a technique used in

logic optimization to simplify Boolean
expressions using algebraic laws. These laws
are based on the properties of Boolean
operators and enable us to manipulate
Boolean expressions in a way that preserves
their logical behavior.
Example
Some common algebraic laws used in logic optimization
include:

O Commutative law: Allows us to change the order of

operands in an operation without changing its result.
For example, A AND B is equivalent to B AND A.
O Associative law: Allows us to group operands in an
operation without changing its result. For example, (A
AND B) AND C is equivalent to A AND (B AND C).
O Distributive law: Allows us to distribute an operation
over a sum or a product. For example, A AND (B OR
C) is equivalent to (A AND B) OR (A AND C).
O De Morgan's law: Allows us to convert
between OR and AND operations with
negation. For example, NOT (A OR B) is
equivalent to (NOT A) AND (NOT B).
O By applying these algebraic laws, we can
simplify Boolean expressions and reduce the
number of logic gates needed to implement
them. In the next few slides, we will explore
how algebraic manipulation is used in logic
optimization.
 Karnaugh Maps

O Karnaugh maps, also known as K-maps, are a

graphical technique used in logic optimization to
simplify Boolean expressions. They are especially
useful for reducing expressions with three or more
variables.

O Karnaugh maps consist of a grid of cells, with each

cell representing a possible combination of input
values. The cells are arranged in a way that groups
together adjacent cells that differ by only one variable.
O To use a Karnaugh map, we first write down
the truth table for the Boolean expression we
want to simplify. Then, we fill in the
corresponding cells in the Karnaugh map with
1s or 0s depending on the output value for that
combination of inputs.

O Next, we look for groups of adjacent cells that

contain only 1s or only 0s. We then combine
these groups using the Boolean OR operation,
resulting in simplified expressions with fewer
terms.
O Karnaugh maps can be a powerful tool for
simplifying Boolean expressions, but they
require careful attention to detail and can
become difficult to use for expressions with
many variables. In the next few slides, we will
explore how Karnaugh maps are used in logic
optimization and compare them to other
optimization techniques.
Example
 Quine-McCluskey Method

O The Quine-McCluskey method is an algorithmic

technique used in logic optimization to simplify
Boolean expressions. It is a more general approach than
Karnaugh maps and can handle expressions with any
number of variables.
 
O The Quine-McCluskey method works by generating a
table of all the minterms for the Boolean expression,
where each minterm is a product term that contains all
the input variables. We then group together minterms
that differ by only one variable and combine them using
the Boolean OR operation.
O Next, we look for implicants, which are product terms
that cover at least one minterm. We can then use these
implicants to create a prime implicant chart, which is a
table that shows all the possible ways to cover all the
minterms with the smallest number of implicants.

O Finally, we select a set of prime implicants that cover

all the minterms and combine them using the Boolean
OR operation to get the simplified Boolean expression.
O Next, we look for implicants, which are product terms
that cover at least one minterm. We can then use these
implicants to create a prime implicant chart, which is a
table that shows all the possible ways to cover all the
minterms with the smallest number of implicants.

O Finally, we select a set of prime implicants that cover

all the minterms and combine them using the Boolean
OR operation to get the simplified Boolean expression.
Example
 Comparison of Optimization Techniques

O There are several techniques used in logic optimization,

each with its advantages and disadvantages. Here is a brief
comparison of some of the most commonly used
techniques:

O Algebraic manipulation: A technique that uses algebraic

laws to simplify Boolean expressions. It is simple and easy
to use but can become cumbersome for large expressions.
O Karnaugh maps: A graphical technique that simplifies
Boolean expressions by grouping together adjacent cells in
a grid. It is intuitive and easy to use but can be difficult for
expressions with many variables.
 Importance of Logic Optimization
O Logic optimization helps to reduce circuit complexity and
improve performance. By simplifying Boolean expressions, it
can lead to a reduction in the number of gates, wires, and
components required to implement a circuit. This, in turn, can
reduce the cost and power consumption of the circuit, as well as
improve its speed and reliability.
 
O Logic optimization is essential for designing large and complex
digital systems. As the number of gates and components in a
circuit increases, it becomes more challenging to ensure that the
circuit meets the desired performance specifications. By using
optimization techniques, it is possible to simplify the design and
reduce the chances of errors or bugs.
O Logic optimization is a crucial step in the digital design
flow. It typically follows the logic synthesis stage and
precedes the physical design stage. By optimizing the logic
before the physical implementation, it is possible to
minimize the impact of physical constraints such as routing
and placement, and to achieve better timing and power
performance.

O Logic optimization is a core skill for digital design

engineers. As digital systems become more complex, the
ability to optimize circuits becomes increasingly important.
By mastering optimization techniques such as Boolean
algebra, Karnaugh maps, and Quine-McCluskey method,
engineers can improve their design skills and create more
efficient and effective circuits.
 REFERENCE
O https://technav.ieee.org/topic/logic-design
O https://www.vlsifacts.com/
TENKKUUU