0% found this document useful (0 votes)
15 views

Lecture 12

The document outlines the process of designing digital circuits, specifically focusing on combinational logic design. It details steps such as determining inputs and outputs, creating truth tables, and deriving minimized Boolean functions, with a specific example of converting binary coded decimal (BCD) to a seven-segment display. The importance of using multiple representations and 'don't care' conditions for simplification is also emphasized.

Uploaded by

seunadepoju64
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
0% found this document useful (0 votes)
15 views

Lecture 12

The document outlines the process of designing digital circuits, specifically focusing on combinational logic design. It details steps such as determining inputs and outputs, creating truth tables, and deriving minimized Boolean functions, with a specific example of converting binary coded decimal (BCD) to a seven-segment display. The importance of using multiple representations and 'don't care' conditions for simplification is also emphasized.

Uploaded by

seunadepoju64
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/ 17

Combinational Design

Asst. Prof. Mohanad Alayedi


Department of Software Engineering
Haliç University
[email protected]

CEN203, Summer 2024

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 1


Overview

➢ Design digital circuit from specification


➢ Digital inputs and outputs known
Need to determine logic that can transform data
➢ Start in truth table form
➢ Create K-map for each output based on function of inputs
➢ Determine minimized sum-of-product representation
➢ Draw circuit diagram

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 2


Design Procedure (Mano)

➢ Design a circuit from a specification.


1. Determine number of required inputs and outputs.
2. Derive truth table
3. Obtain simplified Boolean functions
4. Draw logic diagram and verify correctness A B C RS
0 0 0 0 0
0 0 1 0 1
S=A+B + C 0 1 0 0 1
R = ABC 0 1 1 0 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 3


Previously, we have learned…

➢ Boolean algebra can be used to simplify expressions, but


not obvious:
how to proceed at each step, or
if solution reached is minimal.
➢ Have seen five ways to represent a function:
- Boolean expression
- truth table
- logic circuit
- minterms/maxterms
- Karnaugh map

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 4


Combinational logic design

➢ Use multiple representations of logic functions


➢ Use graphical representation to assist in simplification of
function.
➢ Use concept of “don’t care” conditions.
➢ Example - encoding BCD to seven segment display.
➢ Similar to approach used by designers in the field.

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 5


BCD to Seven Segment Display

➢ Used to display binary coded decimal (BCD) numbers using


seven illuminated segments.
➢ BCD uses 0’s and 1’s to represent decimal digits 0 - 9.
Need four bits to represent required 10 digits.
➢ Binary coded decimal (BCD) represents each decimal digit with
four bits

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 6


BCD to seven segment display

➢ List the segments that should be illuminated for each digit.

0 a,b,c,d,e,f
1 b,c
2 a,b,d,e,g
3 a,b,c,d,g
4 b,c,f,g
5 a,c,d,f,g
6 a,c,d,e,f,g
7 a,b,c
8 a,b,c,d,e,f,g
9 a,b,c,d,f,g

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 7


BCD to seven segment display

➢ Derive the truth table for the circuit.


➢ Each output column in one circuit.
Inputs Outputs
Dec w x y z ab c d e .
0 0 0 0 0 11 1 1 1 .
1 0 0 0 1 01 1 0 0 .
2 0 0 1 0 11 0 1 1 .
         .
7 0 1 1 1 11 1 0 0 .
8 1 0 0 0 11 1 1 1 .
9 1 0 0 1 11 1 1 0 .
CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 8
BCD to seven segment display

➢ Find minimal sum-of-products representation for each output

For segment “a” :


yz
wx 00 01 11 10
Note: Have only
00 1 0 1 1 filled in ten
01 0 1 1 1 squares,
corresponding to
11
the ten numerical
10 1 1 digits we wish to
represent.

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 9


Don’t care conditions (BCD display) ...

➢ Fill in don’t cares for undefined outputs.


Note that these combinations of inputs should never happen.
➢ Leads to a reduced implementation

For segment “a” :

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 10


Don’t care conditions (BCD display) ...

➢ Circle biggest group of 1’s and Don’t Cares.


➢ Leads to a reduced implementation

For segment “a” :

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 11


Don’t care conditions (BCD display)

➢ Circle biggest group of 1’s and Don’t Cares.


➢ Leads to a reduced implementation

For segment “a” :

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 12


Don’t care conditions (BCD display) ...

➢ Circle biggest group of 1’s and Don’t Cares.


➢ All 1’s should be covered by at least one implicant

For segment “a” :

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 13


Don’t care conditions (BCD display) ...

➢ Put all the terms together


➢ Generate the circut

For segment “a” :

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 14


BCD to seven segment display

➢ Derive the truth table for the circuit.


➢ Each output column in one circuit.
Inputs Outputs
Dec w x y z a b c d e .
0 0 0 0 0 1 1 1 1 1 .
1 0 0 0 1 0 1 1 0 0 .
2 0 0 1 0 1 1 0 1 1 .
          .
7 0 1 1 1 1 1 1 0 0 .
8 1 0 0 0 1 1 1 1 1 .
9 1 0 0 1 1 1 1 1 0 .
CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 15
BCD to seven segment display

➢ Find minimal sum-of-products representation for each output

For segment “b” :

See if you
complete this
example

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 16


Summary

➢ Need to formulate circuits from problem descriptions


1. Determine number of inputs and outputs
2. Determine truth table format
3. Determine K-map
4. Determine minimal SOP
➢ There may be multiple outputs per design
Solve each output separately

CEN203, Fall 2024 2024, Dr. Mohanad Alayedi (Haliç University) 17

You might also like