Scribd
Upload
14 views23 pages

Digital Lecture 8

The document discusses combinational circuits, which consist of logic gates where outputs depend solely on inputs, and contrasts them with sequential circuits that incorporate memory. It outlines a design procedure for combinational circuits, including specification, formulation, optimization, technology mapping, and verification, and provides examples such as a BCD-to-Seven-Segment decoder and binary adders. Additionally, it explains the concepts of half adders and full adders, emphasizing their roles in binary arithmetic and hierarchical design for adding n-bit numbers.

Uploaded by

christinazahreddine1209
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
14 views23 pages

Digital Lecture 8

The document discusses combinational circuits, which consist of logic gates where outputs depend solely on inputs, and contrasts them with sequential circuits that incorporate memory. It outlines a design procedure for combinational circuits, including specification, formulation, optimization, technology mapping, and verification, and provides examples such as a BCD-to-Seven-Segment decoder and binary adders. Additionally, it explains the concepts of half adders and full adders, emphasizing their roles in binary arithmetic and hierarchical design for adding n-bit numbers.

Uploaded by

christinazahreddine1209
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/ 23

Combinational Circuits

Design & Binary Arithmetic

Dr. May Itani


18/03/2024
Combinational circuits
• Two classes of logic circuits:
•
Combinational Circuits
•
Sequential Circuits
• A Combinational circuit consists of logic gates
• Output depends only on input

• A Sequential circuit consists of logic gates and memory


•
Output depends on current inputs and previous ones (stored in memory)
•
Memory defines the state of the circuit.

2
Combinational circuits

• A combinational circuit has:


•
n Boolean inputs (1 or more),
•
m Boolean outputs (1 or more)
•
logic gates mapping the inputs to the outputs

3
Design procedure
1. Specification
•
Write a specification for the circuit if one is not already available
•
Specify/Label input and output
2. Formulation
• Derive a truth table or initial Boolean equations that define the required
relationships between the inputs and outputs, if not in the specification

3. Optimization
• Apply 2-level and multiple-level optimization (Boolean Algebra, K-Map,
software)
• Draw a logic diagram for the resulting circuit using ANDs, ORs, and inverters

4
Design procedure
4. Technology Mapping
• Map the logic diagram to the implementation technology selected (e.g. map
into NAND gates)
5. Verification
• Verify the correctness of the final design manually or using simulation

5
Example 1
Question: Design a circuit that has a 3-bit input and a single output (F)
specified as follows:
•
F=0, when the input is less than 5
•
F=1, otherwise
Solution:
Step 1 (Specification):
• Label the inputs (3 bits) as X, Y, Z
• X is the most significant bit, Z is the least significant bit

• The output (1 bit) is F:


• F = 1 => (101)2, (110)2, (111)2
• F=0 => other inputs

6
Example 1
Step 2 (Formulation) Step 3 (Optimization):

7
Example 2

• A seven-segment display is digital readout found in electronic


devices like clocks, TVs, etc.
• Made of seven light-emitting diodes (LED) segments; each segment is
controlled separately.

• A BCD-to-Seven-Segment decoder is a combinational circuit


• Accepts a decimal digit in BCD (input)
• Generates appropriate outputs for the segments to display the input decimal
digit (output)

8
Example 2

9
Example 2

10
Example 2

B
A
D

11
Example 2

12
Arithmetic circuits

• Adders

• For such circuits we need Binary Arithmetic

13
Binary Arithmetic: Addition
! Decimal Addition

1 1 Carry
5 5
+ 5 5

1 1 0
= Ten ≥ Base
Binary Addition
! Column Addition

Carrying 1 to a column
is equivalent to adding
1 to that column.
1 1 1 1 1 1
1 1 1 1 0 1 = 61
+ 1 0 1 1 1 = 23
0 1 0 1 0 0 = 84
1

≥ (2)10
Half Adder
• Design an Adder for 1-bit numbers?
1. Specification
• 2 inputs (X,Y)
• 2 outputs (C,S)
2. Formulation

c = m3 = XY
S = m1+m2 = x’y+xy’ = x xor y
16
Half Adder
• This adder is called Half Adder, why?
• The half adder can add only two input bits (A and B) and has nothing
to do with the carry if there is any in the input.
• So if the input to a half adder have a carry, then it will be neglected it
and adds only the A and B bits. That means the binary addition
process is not complete and that’s why it is called a half adder.

17
Full Adder
• A combinational circuit that adds 3 input bits to generate a Sum bit
and a Carry bit

18
Full Adder = 2 Half Adders

19
Full Adder = 2 Half Adders

20
Bigger Adders

• To add n-bit numbers:


• Use n Full-Adders in parallel
• The carries propagates as in addition by hand
• This is an example of a hierarchical design
• The circuit is broken into small blocks

20
Bigger Adders

X1X2X3X4
Y1Y2Y3Y4

• It is impossible to add n-bit numbers using half adders

X Y X Y X Y X Y
A A A A

C S C S C S C S

22
Binary Parallel Adder
• To add n-bit numbers:
• Use n Full-Adders in parallel
• The carries propagates as in addition by hand

23

You might also like