Bennett University

School of Computer
Science Engineering and
Technology

CSET105 – Digital Design

Course Type - Core L-T-P
Format 3-0-2
Credits – 4
 Vision & Mission
VISION OF THE SCHOOL

To become a known center of excellence that produces skilled, innovative,

ethical and industry ready Computer Science Engineers.

MISSION OF THE SCHOOL

1. To offer qualitative education of global standards in Computer Science &

Engineering with professional ethics through innovative methods of
teaching & learning.

2. To foster the culture of innovation and research in the field of

Computer Science

3. To provide best experiential teaching-learning environment in order to

achieve excellence in technical education.
03/06/2025 2
 Course Details:
LTP - 3 0 2 [Three Lectures /week]

Text Books:
[1] M. Morris Mano, “Digital Design: With an Introduction to the Verilog,
HDL. VHDL, and System Verilog,” Pearson Education, 6th edition,
2018.

Reference Book:
[1] Wakerly John, “Digital Design: Principals and Practice,” Prentice Hall,
5th edition, 2017.

03/06/2025 3
All signals and channels, existing
naturally, are Analog...!!

03/06/2025 6
Digital ??

03/06/2025 7
Some Examples of Digital Devices

Calculator

03/06/2025 8
 Digital means....??
Amplitude can ANALOG
take any value Signal
in continuous
range

REMEMBER Digital
Amplitude
can take only (Binary)
Binary is an two discrete Signal
special case values
of digital..!!
Amplitude
can take any Digital
value from a (M-ary)
set of Signal
discrete
values

03/06/2025 9
Digital Vs. Analog Waveforms
+5

V
Time

–5

+5
1 0 1
V
Time
–5

03/06/2025 10
Digital Electronics
• Digital Electronics represents information (0, 1) with only
two discrete values.
• Ideally
“no voltage” (e.g., 0v) represents a 0 and
“full source voltage” (e.g., 5v) represents a 1
• Realistically
“low voltage” (e.g., <1v) represents a 0 and
“high voltage” (e.g., >4v) represents a 1
• We achieve these discrete values by using switches.
• We use transistor switches, which operates at high speed,
electronically, a small in size.
Analog versus Digital
• Analog systems process time-varying signals that can take on any value
across a continuous range of voltages (in electrical/electronics systems).
• Digital systems process time-varying signals that can take on only one of two
discrete values of voltages (in electrical/electronics systems).
• Discrete values are called 1 and 0 (ON and OFF, HIGH
and LOW, TRUE and FALSE, etc.)
Advantages of Digital System
• Easy to Design
• Reliability
• Highly Flexible
• Low Costs

03/06/2025 13
Digital Devices

•Gates
•Flip-Flops
•PLDs
•FPGAs
Gates
• The most basic digital devices are called gates.
• Gates got their name from their function of
allowing or blocking (gating) the flow of digital
information.
• A gate has one or more inputs and produces an
output depending on the input(s).
• A gate is called a combinational circuit.
• Three most important gates are: AND, OR, NOT
 Digital Logic
• Binary system -- 0 & 1, LOW & HIGH,
negated and asserted.
• Basic building blocks -- AND, OR, NOT
AND, OR, NOT Gates
 Syllabus outline

UNIT-1 Number UNIT-2

System, Boolean MSI devices UNIT-3 Sequential
Algebra, and Logic Combinational Logic Design
Simplification Digital Circuits

03/06/2025 18
UNIT 1: Number Systems, Boolean Algebra, and Logic Simplification

Number Systems:

Boolean Algebra:

03/06/2025 19
Logic Gates:

03/06/2025 20
Numbers in Different Bases
• Good idea to memorize!

Decimal Binary Octal Hexadecimal

(Base 10) (Base 2) (Base 8) (Base 16)
00 00000 00 00
01 00001 01 01
02 00010 02 02
03 00011 03 03
04 00100 04 04
05 00101 05 05
06 00110 06 06
07 00111 07 07
08 01000 10 08
09 01001 11 09
10 01010 12 0A
11 01011 13 0B
12 01100 14 0C
13 01101 15 0D
14 01110 16 0E
15 01111 17 0F
16 10000 20 10
Chapter 1 21
Binary Numbers and Binary Coding

• Flexibility of representation
• Within constraints below, can assign any binary
combination (called a code word) to any data as long as
data is uniquely encoded.
• Information Types
• Numeric
• Must represent range of data needed
• Very desirable to represent data such that simple,
straightforward computation for common arithmetic operations
permitted
• Tight relation to binary numbers
• Non-numeric
• Greater flexibility since arithmetic operations not applied.
• Not tied to binary numbers Chapter 1 22
Non-numeric Binary Codes
• Given n binary digits (called bits), a binary code is a
mapping from a set of represented elements to a
subset of the 2n binary numbers.
• Example: A
binary code Color Binary Number
Red 000
for the seven Orange 001
colors of the Yellow 010
rainbow Green 011
• Code 100 is Blue 101
not used Indigo 110
Violet 111

Chapter 1 23
Digit Representation

• You can represent 4 elements in radix r = 2 with

n = 2 digits: (00, 01, 10, 11).
• You can represent 4 elements in radix r = 2 with
n = 4 digits: (0001, 0010, 0100, 1000).

03/06/2025 24
Negative Numbers

• Negative binary numbers are represented by the ‘-’

sign followed by the magnitude of the number.
• The computer however does not have a means of
representing signs.
• The sign has to be captured in the bit pattern itself.

03/06/2025 25
DECIMAL CODES - Binary Codes for Decimal
Digits
There are over 8,000 ways that you can chose 10
elements from the 16 binary numbers of 4 bits. A
few are useful:
Decimal 8,4,2,1 Excess3 8,4,-2,-1 Gray
0 0000 0011 0000 0000
1 0001 0100 0111 0100
2 0010 0101 0110 0101
3 0011 0110 0101 0111
4 0100 0111 0100 0110
5 0101 1000 1011 0010
6 0110 1001 1010 0011
7 0111 1010 1001 0001
8 1000 1011 1000 1001
9 1001 1100 1111 1000

Chapter 1 26
 BCD Arithmetic
Given a BCD code, we use binary arithmetic to add the digits
8 1000 Eight
+5 +0101 Plus 5
13 1101 is 13 (> 9)
Note that the result is MORE THAN 9, so must be
represented by two digits!
To correct the digit, subtract 10 by adding 6 modulo 16.
8 1000 Eight
+5 +0101 Plus 5
13 1101 is 13 (> 9)
+0110 so add 6
carry = 1 0011 leaving 3 + cy
0001 | 0011 Final answer (two digits)
If the digit sum is > 9, add one to the next significant digit
Chapter 1 27
 UNIT 2: Boolean Algebra, and Combinational Digital Circuits

Combinational logic
• No feedback among inputs and outputs
• Outputs are a pure function of the inputs
• Examples: full adder circuit ,Comparator etc.

Figure: Block Diagram

Figure: Full Adder Circuit

03/06/2025 28
UNIT 3: Sequential Logic Design

J Q

CLK

K Q

Figure: Block Diagram Figure: JK Flip Flop

J K CLK
0 0  No Change
0 1  0 Clear
1 0  1 Set
1 1  Toggle
Truth Table of JK Flip Flop
*( : Rising Edge of Clock)

03/06/2025 29
Course Outcome
By the end of this program, students should have the
following knowledge, skills, and values:

CO1: Identify appropriate truth table and examine gate value

implementation from combinational logic function.

CO2: Build Sequential Circuits.

CO3: Experiment with the circuit design for combinational

and sequential logic using Verilog.

03/06/2025 30
03/06/2025 31
03/06/2025 32
 Thank You

03/06/2025 33