DIGITAL LOGIC DESIGN PRESENTATION

PRESENTED BY GROUP#5
ROLL NUMBER NAME
23011556-072 MOAZZMA IRFAN
23011556-090 USWA FATIMA
23011556-092 FATIMA JABBAR
230115560-098 ESHA ZIA
23011556-108 AQSA MUSHTAQ
SUBMITTED TO:
MAM NAILA ANWAR
COURSE CODE:
IT-151
TABLE OF CONTENTS
1.ENCODER/ DECODER (23011556-072)

2.BINARY MULTIPLIER (23011556-108 )

3.DECIMAL ADDER (23011556-090)

4. MULTIPLEXER (23011556-098)

5.BOOLEAN FUNCTIONS (23011556-092)

ENCODER / DECODER

An encoder is a device that converts information from one format or

code to another, typically from a larger number of input lines to fewer
output lines. The basic function of an encoder is to output a binary
code corresponding to the active input line.
• Functionality:
• The encoder takes 2^n inputs and generates an n binary output.
• Only one input is active (HIGH) at a time.

• A decoder is a digital circuit that converts a coded input signal

into a set of output signals. It takes a binary code at the input and
generates multiple output lines.
• Functionality:
• The decoder takes n binary inputs and activates only one of the 2^n outputs, based on the input combination.
Circuit Diagram:
Example of Encoder:

Example of Encoder:
Continue……
Types
TYPES OF ENCODER:

Priority Encoder: A priority encoder assigns priority to the inputs. If multiple inputs
are active simultaneously, it encodes the one with the highest priority..
Binary Encoder: Converts 2^n inputs into an n-bit binary output. Only one input
should be active at a time.
Octal-to-Binary Encoder: Encodes 8 input lines (octal) into a 3-bit binary output.
Decimal-to-BCD Encoder:
Converts decimal inputs (0-9) into a 4-bit binary-coded decimal (BCD) output.
Types of Decoders: .

Binary-to-Decimal Decoder: Converts n-bit binary input into 2^n unique outputs,
each representing a decimal number.
2-to-4 Decoder: Converts a 2-bit binary input into 4 outputs.
3-to-8 Decoder: Converts a 3-bit binary input into 8 outputs.
Binary to hexadecimal: Converts a 4-bit binary input into 16 outputs.
BINARY MULTIPLIER

• A binary multiplier is a digital circuit that multiplies two binary numbers

to produce a product in binary form. It is a fundamental component in
digital systems, used in various applications such as digital signal
processing, cryptography, and computer arithmetic.
• How Binary Multiplier Works:
• 1. Multiply each digit of the second number (multiplier) with the first
number (multiplicand).
• 2. Shift the multiplicand left by one bit position for each digit of the
multiplier.
• 3. Add the results.
Types of Binary Multipliers:
• Serial Binary Multiplier: A serial binary multiplier multiplies two binary
numbers serially, one bit at a time, using a shift register and an adder.
• Parallel Binary Multiplier: A parallel binary multiplier multiplies two binary
numbers in parallel, using an array of adders and logic gates.
• Array Multiplier: An array multiplier is a type of parallel multiplier that uses
an array of full adders to perform the multiplication.
• Booth's Multiplier: A Booth's multiplier is a type of multiplier that uses a
modified Booth's algorithm to reduce the number of partial products and
improve performance.
• Wallace Tree Multiplier: A Wallace tree multiplier is a type of multiplier
that uses a Wallace tree structure to reduce the number of adders and
improve performance.
Binary Multiplier Digital Circuit:
• A binary multiplier can be implemented using a combination of digital logic gates
and adders. The basic components required to build a binary multiplier digital
circuit are:
• AND gates: Used to perform the multiplication of individual bits.
• Full adders: Used to add the partial products generated by the AND gates.
• Half adders: Used in some cases to add the partial products, but full adders are
more commonly used.
• XOR gates are not typically used in a binary multiplier digital circuit.

• The digital circuit consists of an array of AND gates, followed by an array of full
adders. The AND gates perform the multiplication of individual bits, generating
partial products. The partial products are then added together using the full adders
to produce the final product
DECIMAL ADDER

• Decimal adder is a combinational circuit that adds two

decimal numbers represented in Binary-Coded Decimal
(BCD) format. The circuit produces a sum and carry output.
Decimal adders are widely used in digital systems, such as
calculators, computers, and digital instrumentation.
Working of Decimal Adder :

• A decimal adder takes two BCD numbers as input and produces

a sum and carry output. The adder performs the following
operations:
• BCD to Binary Conversion: The input BCD numbers are
converted to binary format.
• Binary Addition: The binary numbers are added using a binary
adder.
• Decimal Correction: The result of the binary addition is
corrected to ensure that it is in BCD format.
• Carry Propagation: The carry output is generated based on the
result of the addition.
Continue....
Types of Decimal Adders

• There are four main types of decimal adders, each with its own unique
characteristics and applications.
• 1. Decimal Half Adder (DHA): A Decimal Half Adder (DHA) is the
simplest type of decimal adder. It adds two BCD digits without
considering carry input and produces a sum and carry output.

• 3.Decimal Full Adder (DFA): A Decimal Full Adder (DFA) is more

complex than a DHA. It adds two BCD digits and considers carry input,
producing a sum and carry output.
CONTINUE...
• Binary-Coded Decimal (BCD) Adder:A Binary-Coded Decimal
(BCD) Adder adds two BCD numbers and considers carry
propagation. It is used in multi-digit decimal arithmetic.
• 4-bit Binary Full Adder with Decimal Correction:A 4-bit Binary
Full Adder with Decimal Correction uses a 4-bit binary full adder and
includes decimal correction logic. It is suitable for high-speed decimal
arithmetic.
• Each type of decimal adder has its own strengths and weaknesses,
and the choice of which one to use depends on the specific
application and requirements.
Multiplexer in Digital Logic Design

• A multiplexer (MUX) is a crucial digital logic device that

enables the selection of one of several input signals and
directs the chosen input to a single output line. This
functionality allows it to act as a digital switch, facilitating the
routing of data based on specific control signals.

• Inputs and Outputs

• Data Inputs: A multiplexer has multiple data inputs, typically
labeled as D0,D1,D2,…,Dn
• Output: The MUX has one output, denoted as Y .
CONTINUE...

• Selection Lines: A set of selection lines, labeled as S_0, S_1, ....,

S_k ), determines which data input is connected to the output.
• Selection Lines
• The number of selection lines required is calculated based on the
number of data inputs:
• Number of selection lines=log2​(n)

• For instance, in a 4-to-1 multiplexer, where there are 4 inputs (D_0 ) to

( D_3 ), 2 selection lines ( S_0 and S_1 ) are necessary to select one of
the 4 inputs.
Truth Table
• The behavior of a 2-to-1 multiplexer can be illustrated with
the following truth table:
• In this table:
• - S is the selection line.
• - D0 and D1 are the two data inputs.
• - O is the output, which reflects the selected data input.
Logical Expression
• The output of the multiplexer can be expressed using a
logical formula. For a 2-to-1 MUX, the expression is:
• “Y=(D0⋅S)+(D1S)”
• For a 4-to-1 multiplexer, the logical expression generalizes
to:

• “Y=D0.S1.S0+D1.S1.S0+D2.S1.S0+D3.S1.S0​”
• This expression indicates how the output Y is determined
based on the state of the selection lines and the values of
the data inputs.
Types of Multiplexers

• Multiplexers can be categorized based on the number of inputs:

• 2-to-1 MUX: Selects between 2 inputs using 1 selection line.
• 4-to-1 MUX: Selects between 4 inputs using 2 selection lines.
• 8-to-1 MUX: Selects between 8 inputs using 3 selection lines.
• N-to-1 MUX: General form that can select from N inputs using
log_2(N) selection lines.

• Multiplexers can be implemented using basic logic gates. For example,

the logical expressions for the multiplexer can be realized with
combinations of AND, OR, and NOT gates
Boolean Functions

• A Boolean function is a mathematical function that operates on binary

variables and yields a binary output. In this context, the variables can
take one of two possible values: 0 (representing false or low) and 1
(representing true or high).

• Boolean Variables: Boolean variables are fundamental elements in

Boolean functions, typically denoted by symbols such as ( A, B, C,... ).
Each variable can independently assume a value of either 0 or 1. For
example, in a circuit, ( A ) might represent a switch being off (0) or on
(1)
Basic Concepts
Boolean Operators:
• The primary operators used in Boolean algebra are:

• AND(.0) : This operator outputs true (1) only when both inputs are true. For
example, ( A . B ) results in 1 only when both ( A ) and ( B ) are 1.

• OR (+ ): This operator outputs true if at least one input is true. For instance, ( A
+ B ) results in 1 if either ( A ) or ( B ) is 1 (or both).

• NOT : The NOT operator inverts the input value, producing 1 when the input is
0 and vice versa.
Representation of Boolean Functions

. Algebraic Form: Boolean functions can be expressed algebraically using the

operators For example, a function ( F ) of two variables can be represented as:
F=Ā+B
• Canonical Forms:
• Sum of Products (SOP): In this form, a Boolean function is expressed as a
sum (OR) of product (AND) terms. Each product term consists of literals (the
variables or their complements). For instance, the SOP form for a function with
inputs ( A ) and ( B ) could be represented as
“F=A.B+Ā.B”
• Product of Sums (POS): Conversely, the POS form expresses a Boolean
function as a product (AND) of sum (OR) terms. For example,
F=(A+B)(Ā+C)”
Truth Table and Logic gate Representation