ITT203 DIGITAL SYSTEM

DESIGN

DILSHAD RASHEED V.A

ASSISTANT PROFFESOR (IT)

For More Visit : KtuQbank.com | Fair Use Policy

 SYLLABUS
Module 1: NUMBER SYSTEM (9 Hours)
Number Systems – Decimal, Binary, Octal, Hexadecimal - conversion from one system to another –
Representation of negative numbers using 2’s compliment. Arithmetic Operations – Addition, Subtraction,
Multiplication, Division of Binary numbers, Booths algorithm for multiplication, Representation of negative
numbers, Representation of floating point numbers. Representation of BCD numbers, BCD Addition, Binary
Codes – Gray codes – excess 3 code- Character Coding Schemes – ASCII, EBCDIC.
Module 2: BOOLEAN ALGEBRA & LOGIC GATES (9 Hours)
Boolean Algebra - Postulates of Boolean algebra - Canonical and Standard Forms - Simplification of Boolean
Functions using Karnaugh Map - Product-of-Sums Simplification — Don’t-Care Conditions – Quine –
McClusky minimization technique – Basic GatesUniversal Gates.
Module 3: COMBINATIONAL LOGIC (9 Hours)
Combinational Circuits – Analysis and Design Procedures - Binary Adder-Sub tractor (Half & Full) - Carry look
ahead adder, BCD adder, code converter, - Magnitude Comparator - Decoders – Encoders Parity Generator–
Multiplexers – DE multiplexers – Implementation of Boolean functions using MUX.
Module 4: SEQUENTIAL LOGIC CIRCUITS (9 Hours)
Sequential Circuits - Storage Elements: Latches , Flip-Flops – RS, JK, D, T, Triggering of flip-flops, Master-
Slave- Analysis of Clocked Sequential Circuits - Design Procedure-using JK,D & T
Module 5: COUTERS AND SHIFT REGISTERS (9 Hours)
Registers - Shift Registers – SISO, PIPO, SIPO, PISO- Universal shift registers, CountersDesign of Counters-
Synchronous & Asynchronous Counters — up-down counter, Decade counter, BCD counter, Johnson counter,
Ring counter ,Memory & Programmable logicRAM, ROM, PLA,PAL

For More Visit : KtuQbank.com | Fair Use Policy

 Text Books
1. Mano M. M. and Michael D. Ciletti, Digital Design, 4/e, Pearson Education,
2013.
2. Thomas L. Floyd, Digital Fundamentals, 11th Edition, Pearson Education,
2015.
3. N. N. Biswas, "Minimization of Boolean Functions," in IEEE Transactions on
Computers, vol. C-20, no. 8, pp. 925-929, Aug. 1971. doi: 10.1109/T-
C.1971.223373

For More Visit : KtuQbank.com | Fair Use Policy

 Mark distribution

Total Marks CIE ESE ESE Duration

150 50 100 4 hours

• Continuous Internal Evaluation Pattern:

Attendance : 10 marks
Continuous Assessment Test (2 numbers) : 25 marks
Assignment/Quiz/Course project : 15 marks

For More Visit : KtuQbank.com | Fair Use Policy

 Introduction
• Digital
Concerned with the interconnection among digital component
» Best Digital System example is General Purpose computer
• Digital Signals have two basic states:
1 (logic “high”, or H, or “on”)
0 (logic “low”, or L, or “off”)
• Digital values are in a binary format. Binary means 2 states.
• A good example of binary is a light (only on or off)

For More Visit : KtuQbank.com | Fair Use Policy

 Number System
• Number System is a basic for counting various
items
• Number System is defined as order set of symbols
known as digits which perform arithmetical
calculation with well defined rules

For More Visit : KtuQbank.com | Fair Use Policy

 Number System
Types
1. Decimal
2. Binary
3. Octal
4. Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal Number System
• Base (also called radix) = 10 2 1 0 -1 -2
– 10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
• Digit Position 5 1 2 . 7 4
– Integer & fraction
• Digit Weight 100 10 1 0.1 0.01
– Weight = (Base) 𝑃𝑜𝑠𝑖𝑡𝑖𝑜𝑛
• Magnitude 500 10 2 0.7 0.04
– Sum of “Digit x Weight”
• Formal Notation d2*B2+d1*B1+d0*B0+d-1*B-1+d-2*B2
(512.74)10
For More Visit : KtuQbank.com | Fair Use Policy
 Binary Number System
• Base = 2
– 2 digits { 0, 1 }, called binary digits or “bits”
• Weights
– Weight = (Base) Position
• Magnitude
– Sum of “Bit x Weight”
• Groups of bits
- 4 bits= Nibble
- 8 bits= Byte

For More Visit : KtuQbank.com | Fair Use Policy

 Octal Number System
• Base = 8
– 8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
• Weights
– Weight = (Base) Position
• Magnitude
– Sum of “Digit x Weight”

For More Visit : KtuQbank.com | Fair Use Policy

 Hexadecimal Number System
• Base = 16
– 16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
• Weights
– Weight = (Base) Position
• Magnitude
– Sum of “Digit x Weight”

For More Visit : KtuQbank.com | Fair Use Policy

 Common Number Systems
System Base Symbols Used by Used in
humans? computers?
Decimal 10 0,1, … 9 Yes No
Binary 2 0,1 No Yes
Octal 8 0,1, … 7 No No
Hexadecimal 16 0,1, … 9, No No
A,B, … F

For More Visit : KtuQbank.com | Fair Use Policy

 Quantities/Counting(1 of 3)
Decimal Binary Octal Hexadecimal
0 0 0 0
1 1 1 1
2 10 2 2
3 11 3 3
4 100 4 4
5 101 5 5
6 110 6 6
7 111 7 7

For More Visit : KtuQbank.com | Fair Use Policy

 Quantities/Counting (2 of 3)
Decimal Binary Octal hexadecimal
8 1000 10 8
9 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F

For More Visit : KtuQbank.com | Fair Use Policy

 Quantities/Counting (3 of 3)
Decimal Binary Octal Hexadecimal
16 10000 20 10
17 10001 21 11
18 10010 22 12
19 10011 23 13
20 10100 24 14
21 10101 25 15
22 10110 26 16
23 10111 27 17 etc

For More Visit : KtuQbank.com | Fair Use Policy

 Conversion Among Bases
• The possibilities:

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal to Binary

Decimal
octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal to Binary
Technique
• Divide by two, keep track of the remainder
• First remainder is bit 0 (LSB, Least-significant
bit)
• Second remainder is bit 1
• Etc

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal to Hexadecimal

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal to Octal

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal to Octal
Technique
• Divide by 8
• Keep track of the remainder

For More Visit : KtuQbank.com | Fair Use Policy

 Octal to Decimal
Technique
• Multiply each bit by 8ⁿ, where n is the
“weight” of the bit
• The weight is the position of the bit, starting
from 0 on the right
• Add the results

For More Visit : KtuQbank.com | Fair Use Policy

Hexadecimal to decimal

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Hexadecimal to Decimal
Technique
• Multiply each bit by 16ⁿ, where n “weight” of
the bit
• The weight is the position of the bit, starting
from 0 on the right
• Add the result

For More Visit : KtuQbank.com | Fair Use Policy

 Binary to Decimal

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Binary to Decimal
Technique
• Multiply each bit by 2ⁿ, where n is the
“weight” of the bit
• The weight is the position of the bit, starting
from 0 on the right
• Add the result

For More Visit : KtuQbank.com | Fair Use Policy

 Octal to Binary

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Octal to binary
Technique
• Convert each octal digit to a 3-bit equivalent
binary representation

For More Visit : KtuQbank.com | Fair Use Policy

Hexadecimal to Binary

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Hexadecimal to binary
Technique
• Convert each hexadecimal digit to a 4 bit
equivalent binary representation

For More Visit : KtuQbank.com | Fair Use Policy

 Binary to Octal

Decimal Octal

Binary Hexadecimal

For More Visit : KtuQbank.com | Fair Use Policy

 Binary to Octal
• Technique
Group bits in threes, starting on right
Convert to octal digits

For More Visit : KtuQbank.com | Fair Use Policy

 Binary to hexadecimal
Technique
• Group bits in fours, starting on right
• Convert to hexadecimal digits

For More Visit : KtuQbank.com | Fair Use Policy

 Octal to hexadecimal
Technique
• Convert octal to its binary equivalent
• Then convert binary to its hexadecimal
equivalent

For More Visit : KtuQbank.com | Fair Use Policy

 Hexadecimal to octal
Technique
• Convert hexadecimal to its binary equivalent
• Then convert binary to its octal

For More Visit : KtuQbank.com | Fair Use Policy

 Decimal (Fraction) to Binary
Conversion
• Multiply the number by the ‘Base’ (=2)
• Take the integer (either 0 or 1) as a coefficient
• Take the resultant fraction and repeat the
division

For More Visit : KtuQbank.com | Fair Use Policy

 Signed Binary Numbers
• To represent negative integers, we need a notation for negative
value
• It is customary to represent the sign with a bit placed in the
leftmost position of the number since binary digits
• The convention is to make the sign bit 0 for positive and 1
for negative.
• Example: Signed-magnitude representation: 10001001
Signed-1’s-complement representation: 11110110
Signed-2’s-complement representation: 11110111

• Table 1.3 lists all possible four-bit signed binary numbers in the
three representations
For More Visit : KtuQbank.com | Fair Use Policy
 Signed Binary Numbers
Table 1.3
Signed Binary Numbers
Decimal Sighned-2’s Signed-1’s Signed
complement Complement Magnitude

+7 0111 0111 0111

+6 0110 0110 0110
+5 0101 0101 0101
+4 0100 0100 0100
+3 0011 0011 0011
+2 0010 0010 0010
+1 0001 0001 0001
+0 0000 0000 0000
-0 ------ 1111 1000
-1 1111 1110 1001
-2 1110 1101 1010
-3 1101 1100 1011
-4 1100 1011 1100
-5 1011 1010 1101
-6 1010 1001 1110
-7 1001 1000 1111
-8 1000 -------- -------

For More Visit : KtuQbank.com | Fair Use Policy

 Binary Addition
Rules for binary addition

A B SUM CARRY
0 + 0 0 0

0 + 1 1 0
1 + 0 1 0
1 + 1 0 1

For More Visit : KtuQbank.com | Fair Use Policy

 Binary Subtraction
Rules for binary subtraction

A - B Difference Borrow
0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0

For More Visit : KtuQbank.com | Fair Use Policy

Binary Multiplication

0*0=0
0*1=0
1*0=0
1*1=1

For More Visit : KtuQbank.com | Fair Use Policy

 Binary Division
• Follow the same procedure as division in
decimal

For More Visit : KtuQbank.com | Fair Use Policy

 Booth’s Algorithm for multiplication
• Booth's multiplication algorithm is an
algorithm which multiplies 2 signed or
unsigned integers in 2's complement.
Steps
1. Firstly take two registers Q and M
2. Load multiplicand and multiplier in this
registers
3. For eg., In 4 * 5 , 4 is multiplicand and 5 is
multiplier
For More Visit : KtuQbank.com | Fair Use Policy
 Booth’s Algorithm
• We also need third register A, which is initialize to
0(zero).
• We also need a register to store carry bit resulting
from addition . Hence, we take one bit register Q-
1
• Multiplicand(M) is added to register Q and the
result is stored in register A
• Then all bits of the A,Q,Q-1 are shifted to the
right one bit.
• Depending upon last bit of Q and single bit of Q-1
following arithmetic operations are performed.
For More Visit : KtuQbank.com | Fair Use Policy
 Booth’s Algorithm
• Possible arithmetic actions:
00 - no arithmetic operation
01 - add multiplicand to left half of product
10 -subtract multiplicand from left half of
product
11 - no arithmetic operation

For More Visit : KtuQbank.com | Fair Use Policy

 Flow chart

For More Visit : KtuQbank.com | Fair Use Policy

 Booth : (7) x (3)
A Q Q-1 M
3 7
-------------------------------------------------------------------------------------------------------------------
0000 0011 0 0111
--------------------------------------------- ---------------------------------------------------------------------
1001 0011 0 0111 A <-(A - M) 1st cycle
1100 1001 1 0111 Shift
-------------------------------------------------------------------------------------------------------------------
1110 0100 1 0111 Shift
-------------------------------------------------------------------------------------------------------------------
0101 0100 1 0111 A <-(A + M) 2nd cycle
0010 1010 0 0111 Shift
------------------------------------------------------------------------------------------------------------------
0001 0101 0 0111 Shift

For More Visit : KtuQbank.com | Fair Use Policy

 Booth: (7x(-3)
A Q Q-1 M
(-3) 7
---------------------------------------------------------------
0000 1101 0 0111
-------------------------------------- -------------------------
1001 1101 0 0111 A <- (A - M) 1st cycle
1100 1110 1 0111 Shift
-------------------------------------- ----------------------------
0011 1110 1 0111 A <- (A + M) 2nd cycle
0001 1111 0 0111 Shift
---------------------------------------------------------------------------------- ---------
1010 1111 0 0111 A <- (A - M) 3rd cycle
1101 0111 1 0111 Shift
--------------------------------------------------------------- ----------------------------
1110 1011 1 0111 Shift

For More Visit : KtuQbank.com | Fair Use Policy