Group 3 (DiGital electronics)

names: 1. IGIRIMPUHWE BYISHIMO Jean de la paix

2. HABUMUGISHA Eric

3. MANZI NDAHIRO Christian

4. AKAYEZU SUGIRA Kenny

5. NIZEYIMANA Jacqueline

LO3. IMPLEMENT COMBINATIONAL LOGIC CIRCUIT

Combinational Logic Circuits

Definition
Combinational logic circuits are electronic circuits where the output depends solely on the
current inputs without any memory elements or feedback loops. In other words, the output is a
function of the present input values only. These circuits perform data processing, arithmetic
operations, and decision making in digital electronic systems.

Working Principle

The working principle of combinational logic circuits is based on logical operations performed
on binary inputs using logic gates (AND, OR, NOT, NAND, NOR, XOR, XNOR). When the
inputs are applied, the circuit processes these inputs through the gates according to predefined
logic, yielding a specific output. The output changes immediately in response to changes in
inputs, maintaining continuous and instantaneous processing without storage elements.

Types of Combinational Logic Circuits

Combinational logic circuits can be categorized into several types based on their functionality:

1. Adders:
 - Half Adder: A basic adder that adds two single binary digits and provides a sum and carry
output.

- Full Adder: Adds three binary digits (two significant bits and a carry bit) and produces a sum
and carry output.

-Ripple Carry Adder: A series of full adders to add binary numbers of more than one bit.

Truth Table and Circuit:

2. Subtractors:

- Half Subtractor: Subtracts one binary digit from another and provides a difference and borrow
output.

- Full Subtractor: Subtracts two binary digits and a borrow from a previous less significant
stage.

Truth Table and Circuit:

3. Multiplexers (MUX): A device that selects one of several input signals based on selector lines
and forwards the selected input to a single output line.

Truth Table and Circuit:

4. Demultiplexers (DEMUX): A device that takes a single input and routes it to one of many
output lines based on selector inputs.
Truth Table and Circuit:

5. Encoders: A circuit that converts multiple inputs into fewer outputs, typically used to convert
binary numbers into a coded form (for example, binary to decimal).
Truth Table and Circuit:
6. Decoders: A circuit that converts binary information from n input lines to a maximum of 2^n
output lines, effectively decoding input binary representation.

Truth Table and Circuit:

7. Comparators: Circuits that compare two binary numbers and provide outputs that indicate
which is greater, or if they are equal.
Truth Table and Circuit:
Implementing Combinational Logic in Digital Electronics

Combinational logic circuits can be implemented using various methods:

1. Logic Gates:
- The fundamental building blocks are basic logic gates (AND, OR, NOT, etc.). These gates can
be combined in various configurations to create more complex circuits.

2. Truth Tables:

- A truth table can illustrate how the outputs of a combinational logic circuit change according
to the various possible combinations of inputs.

3. Boolean Algebra:

- Combinational circuits can be designed and simplified using Boolean algebra, which provides
a mathematical framework for working with binary variables.

4. Karnaugh Maps (K-maps):

- K-maps are a visual method for simplifying Boolean expressions, helping in the design of
more efficient and less complex circuits.

5. Programmable Logic Devices (PLDs):

- Circuitry can also be implemented using PLDs such as FPGAs (Field Programmable Gate
Arrays) and CPLDs (Complex Programmable Logic Devices), which allow for flexible and
reconfigurable designs.

6. Integrated Circuits (ICs):

- Many combinational logic circuits are implemented as ICs, encompassing multiple gates and
logic functions on a single chip, making them compact and efficient for practical applications.

Here is a detailed response to the given problem:

Design Binary Arithmetic Circuits

Designing binary arithmetic circuits involves understanding the fundamental concepts of binary
addition, subtraction, multiplication, and division using digital electronics. Below are key terms
and concepts that are essential for designing these circuits, along with explanations:

Key Terms:

1. Binary Numbers: Binary numbers are a representation of numbers using only two digits: 0
and 1. In digital electronics, all computations and operations are performed using binary
numbers.

2. Truth Table: A truth table is a tabular representation of all possible input combinations for a
logic circuit and their corresponding outputs. Truth tables are used to define the behavior of
binary gates and can help in the design of more complex circuits.

3. Logic Gates: Basic building blocks of digital circuits that perform logical operations on one
or more binary inputs to produce a single binary output. Common logic gates include AND, OR,
NOT, NAND, NOR, XOR, and XNOR.

4. Full Adder: A combinational circuit that performs the addition of three binary bits: two
significant bits and a carry-in. It produces a sum and a carry-out. The truth table for a full adder
is crucial for understanding binary addition.

5. Half Adder: A simpler version of the full adder that adds two binary digits and provides a sum
and carry-out but does not take in a carry-in.

6. Binary Subtraction: This can be performed using the method of complement (usually two's
complement) or by using circuits like the full subtractor, which is similar to a full adder but
designed to handle borrowing.
7. Multiplexer (MUX): A device that selects one of several input signals and forwards the
selected input into a single line. Multiplexers can be used in arithmetic circuits to select different
paths based on control signals.

8. Decoder: A combinational circuit that converts binary information from n input lines to a
maximum of 2^n unique output lines. It can be used in conjunction with other circuits to
facilitate complex operations.

9. Circuit Simplification: The process of minimizing the size and complexity of digital circuits
without affecting their output. This can involve using Boolean algebra or Karnaugh maps (K-
maps) to find the simplest form of logic expressions.

10. Karnaugh Map (K-map): A visual method for simplifying Boolean expressions. K-maps
help to identify opportunities for combining terms and reducing the number of gates needed in a
circuit.

Understanding Binary Arithmetic Circuits:

- Binary Addition:

- Implemented using half adders and full adders. The half adder combines two bits and
generates a sum and carry. A full adder combines three bits (two bits and a carry) to produce a
new sum and carry.

- Binary Subtraction:

- Achieved through full subtractors and using the two's complement method. A full subtractor
takes into account two bits and a borrow to compute the difference.

- Binary Multiplication:

- Can be done using successive addition or using arrays such as the Wallace Tree multiplier.
The operations can also be designed using shift-add methods, which leverage the binary nature
of multiplication.
- Circuit Simplification:

- To design efficient arithmetic circuits, use K-maps to identify groups of logic that can be
combined. This minimizes the number of gates required and improves performance and power
consumption.

1. Circuit Diagrams

Half Adder

A half adder performs addition of two binary digits. It has two inputs (A and B) and two outputs
(Sum and Carry).

Circuit Diagram:

Example:
Full Adder

A full adder adds three binary digits: two significant bits and a carry bit from the previous less
significant bit. It has three inputs (A, B, and Carry-in) and two outputs (Sum and Carry-out).

Example of Full Adder Truth Table:

Circuit Diagram:

Example:
4-Bit Binary Adder

A 4-bit binary adder consists of four full adders connected in series. Each full adder takes the
carry output from the previous adder.

Circuit Diagram:

Example:
Binary Subtractor

A binary subtractor can be implemented using a full adder by supplying the second input with the
complement (using XOR gates) and adding 1 via the carry-in for the subtraction operation.

Circuit Diagram:

Example:
4-Bit Binary Subtractor

This can be implemented in a similar series structure as the 4-bit adder but will require inverting
the second set of inputs and providing the initial carry-in as 1.

Example:
Circuit Diagram

2. Combined Binary Adder/Subtractor

A binary adder/subtractor can be created by using a selection line (control signal) that determines
whether the operation will be addition or subtraction.

Circuit Diagram
Example:

3. 4-Bit Binary Adder/Subtractor

The 4-bit adder/subtractor will have an added control line that selects addition or subtraction.

Circuit Diagram:

Example:
 1. Multiplexer (MUX): A multiplexer is a digital circuit that selects one of several input
signals and routes it to a single output line. It is also known as a data selector or a
scanner.

2. Demultiplexer (DEMUX): A demultiplexer is a digital circuit that takes a single input

signal and routes it to one of several output lines. It is also known as a data distributor or
a distributor.

Inside Multiplexer:
A multiplexer typically consists of an array of AND gates, OR gates, and logic gates. The inputs
of the multiplexer are connected to the inputs of the AND gates, and the select lines are
connected to the inputs of the OR gates. The output of the OR gate is connected to the output of
the multiplexer.

Implementing Boolean Functions with Multiplexers:

Multiplexers can be used to implement Boolean functions using a technique called "sum-of-
products" or "product-of-sums". This involves using the inputs of the multiplexer as the variables
in the Boolean function, and the select lines as the control inputs.

For example, consider a 2-to-1 multiplexer with inputs A and B, and select lines S0 and S1. The
truth table for this multiplexer is:
Using this truth table, we can implement the following Boolean functions:

• f(A, B) = A (A XOR B)
• f(A, B) = (A AND B) OR (A NAND B)

Multiplexers for Parallel-to-Serial Data Conversion:

Multiplexers can be used to convert parallel data to serial data by selecting one bit at a time from
the parallel data bus and routing it to a single output line.

For example, consider a 4-bit data bus with inputs D0, D1, D2, and D3. We can use a 4-to-1
multiplexer to select one bit at a time from the parallel data bus and route it to a single output
line.

Cascading Multiplexer Circuits:

Multiplexers can be cascaded to create more complex circuits. For example, we can use two 4-
to-1 multiplexers to create an 8-to-1 multiplexer.

The first multiplexer selects one of four bits from the parallel data bus, and the second
multiplexer selects one of two bits from the output of the first multiplexer.
Definitions

• Encoder: An encoder is a combinational circuit that converts information from one

format or code to another, typically from a set of input lines to a smaller set of output
lines. The output is usually a binary representation of the active input.
• Decoder: A decoder is the reverse of an encoder, converting binary data from n input
lines to a maximum of 2n2^n2n unique output lines. It essentially translates encoded
information back to its original format or activates certain output lines based on binary
inputs.

Types of Encoders

1. Binary Encoder: Converts multiple input lines into fewer output lines, typically binary.
For example, a 4:2 binary encoder has 4 inputs and 2 outputs.

2. Priority Encoder: Similar to a binary encoder but gives priority to the highest input line
when more than one input is active. For example, in a 4:2 priority encoder, if inputs 1 and
3 are active, the output will represent input 3.

3. Decimal Encoder: Converts decimal inputs to binary outputs. An example is a 10:4

encoder that converts decimal digits 0-9 into their binary equivalent.

4. Two-out-of-Four Encoder: Produces outputs based on two active inputs out of four,
typically used in redundant systems.

Applications of Encoders

• Data Transmission: Encoders are used in communication systems to compress and

transmit data efficiently.

• Input Devices: Used in devices like keyboards and remote controls to convert key
presses or button presses into digital signals.

• Multiplexing: Encoders are often used in multiplexing applications where multiple

signals need to be routed over a single transmission line.
Types of Decoders
 1. Binary Decoder: Converts binary information from n input lines to 2n2^n2n output lines.
For example, a 2-to-4 decoder has 2 inputs and 4 outputs.

2. BCD to Decimal Decoder: Converts Binary-Coded Decimal (BCD) inputs into decimal
outputs, often used in digital displays.

3. 3-to-8 Decoder: Takes 3 inputs and produces 8 outputs, where only one output line is
activated at a time corresponding to the binary input.

4. Demultiplexer: Often referred to as a decoder, it routes a single input signal to one of the
several output lines based on selected input lines.

Applications of Decoders

• Memory Addressing: Used for selecting memory locations in computers where specific
outputs activate corresponding memory address lines.

• Data Demultiplexing: Converts a single data line into multiple lines for distribution to
various components.

• Display Drivers: Used in driving 7-segment displays to convert binary inputs into
appropriate signals for displaying numerical values.

Implementing Boolean Functions with Decoders

Decoders can be used to implement Boolean functions by connecting the outputs of decoders to
AND gates based on the required logic. This technique uses the minters corresponding to the
equation's variables. For instance, if a Boolean function requires certain combinations of inputs
to produce output, the corresponding outputs of the decoder can be ANDed together to develop
the function.

Cascading Decoder Circuit

Cascading decoders involves connecting multiple decoders to create a more extensive decoder
system, which can handle larger input combinations and produce more outputs. For example, if
you cascade a 2-to-4 decoder and another 2-to-4 decoder, you can implement a 4-to-16 decoder
logic.

In practice:

• The outputs of the first decoder can be used to enable the second decoder, effectively
expanding the range of outputs.

• Cascading is useful for larger systems where one decoder cannot manage all inputs and
outputs alone.
Definition
A binary comparator is a digital circuit that compares two binary numbers and determines the
relationship between them. It outputs signals that indicate whether the two numbers are equal, or
if one is greater than or less than the other. Comparators are essential in various applications,
including arithmetic logic units (ALUs), digital signal processing, and sorting algorithms.
Types of Binary Comparators

Binary comparators can be classified mainly into two types:

1. Identity Comparators

2. Magnitude Comparators

1. Identity Comparators

An identity comparator is a simple type of comparator that checks whether two binary numbers
are equal. The output is typically a single signal that indicates equality.

• Functionality:

o Given two n-bit binary inputs AAA and BBB, the output EEE is high (1) if A=BA
= BA=B and low (0) otherwise.

• Truth Table (for 2-bit inputs):

 • Logic Circuit:

o The circuit can be implemented using AND and NOT gates. For n-bit binary
numbers, n equality checks (XNOR gates) are needed for each bit, followed by an
AND gate to combine the results.

2. Magnitude Comparators

A magnitude comparator is a more complex type of comparator that determines the relative
magnitude of two binary numbers. It can indicate whether one number is less than, greater than,
or equal to another.

• Functionality:

o The magnitude comparator can produce three outputs:

▪ A>BA > BA>B

▪ A<BA < BA<B

▪ A=BA = BA=B
Truth Table (for 2-bit inputs):
• Logic Circuit:

o Magnitude comparators can be constructed using a combination of logic gates

(AND, OR, NOT). By comparing the most significant bits (MSB) first, followed
by the least significant bits (LSB), the comparator can be designed to determine
the output based on the hierarchy of bit importance.