Digital System Design(CE-304)

Course Instructors: Saba Ahsan (Assistant Professor CED)

Sana Alam (Lecturer CED)
 DSD Course Outline
 
 Number Systems:
 Radix conversions, 1’s Complement, 2’s Complement, Signed Magnitude, Direct and Indirect signed
arithmetic, Horner’s rule
 Adders and Subtractors:
 Different implementations of half adders and full adders, Bit serial adders, Ripple carry adders, 4 –
bit Subtractor, Manchester Carry Chain Adder, Carry Look Ahead Adder and Carry Look Ahead
Generator, Carry Skip Adder
 Multipliers:
 Right Shift Sequential Multiplier circuit, Left Shift Sequential Multiplier circuit, Booth’s recoding
(Signed Multiplication with circuit), Multiplication by constant (using shift registers), Hardware
realization of LSSM and RSSM, Wallace & Dadda Trees.
 Dividers:
 Sequential Division with integer and fractional operands, Restoring hardware dividers, Non-
Restoring and unsigned hardware dividers, Non- Restoring signed hardware dividers, Hardware
realization of Restoring and Non- Restoring Divider
 Finite State Machines:
 Types of FSM, Application of FSM, Moore Machine and Mealy Machine with examples
 Programmable Logic Devices:
 Different types of PLDs, Types of SPLD, Generic Structure of CPLD, Generic and Internal Structure of
FPGA, Adder designs of FPGAs, Applications of FPGAs

 
 Learning Outcomes:

CLO No. Course Learning Outcomes (CLOs) PLOs Bloom’s

Taxonomy
Explain & show numbers & their PLO_1 C2
1 encodings, Signed magnitude & (Engineering (Understandin
Biased representations, Digit set and knowledge) g)
 
its conversion.
Construct and. solve the basic data PLO_3 C3
2
paths structures including adders, (Design/Developme (Apply)
subtractors, multipliers, dividers. . nt of Solutions)
Explain Programmable logic devices PLO_1 C2
3 and its types, FPGA and its architecture, (Engineering (Understandin
Explain FSM and its types. knowledge) g)
Implement different types of adders,  
PLO_5 C3
4
subtractor, multiplier, divider and (FSM) (Modern Tool (Apply)
Finite State Machines on Xilinx Software Usage)
Follows & implement different types of PLO_3 P3
5
adders on Spartan 3E FPGA Kit. (Design/Developme (Guided
nt of Solutions) Response)
Relationship between Assessment tools & CLOs

RELATIONSHIP BETWEEN ASSESSMENT TOOLS AND CLOs:

Assessmen CLO- CLO- CLO-

CLO-2(33) CLO-5(5)
t Tools 1(12.5) 3(34.5) 4(15)
Assessme CLO- 6% CLO-
(02) 4.35%
CLO- - BETWEEN
CLO-
RELATIONSHIP - ASSESSMENT TOOLS AND CLOs:
Quizzes 12% (1.5) CLO-5(5)
nt Tools 1(12.5) 2(33) (1.5)
3(34.5) 4(15)
Assignment 8% (01) 3%6%
(01)
(02) 8.7% (03)
4.35% -- --
Quizzes
s 12% (1.5)
(1.5)
Midterm 30.3% (10) - -
Assignmen80%8%(10)
(01) 3% (01) - (03)
8.7% - -
Exam
ts
60.7% (20) 86.95% - -
Final Midterm
Exam 30.3% - -
80% (10) (30)-
Exam -(10) 66.7% 100%(5)
Lab
- 60.7% 86.95%
- -
(10) -
Final Exam
Assessment
(20) (30)
Lab Project
Lab     -   33.3%(5)
66.7%  
100%(5)
Assessmen - - (10)
t
Lab Project       33.3%(5)  
Grading Policy of DSD
Assessment Tools Percentage

Quizzes 5%

Assignments 5%

Midterm Exam 20%

Final Exam 50%

Lab Assessment 20%

TOTAL 100%
Lecture # 1:Introduction of DSD
 System: A set of related components work
as a whole to achieve a goal.
 A system contains:
 Input,Behaviour, Output.
 Behaviour is a function that translate inputs

to outputs.
 Types of System:
 Analog , Digital & Mixed .
Introduction of DSD
 Analog System: It has values from a
continuous set e.g: 0, 0.5, 1.2, 1.8.
 Digital System: It is a system in which signals
have a finite discrete(individually separate &
distinct) values e.g: 0 & 1(so the device which
process this signal is very simple like a “switch”
which is “open” or “ closed”.
 Mixed Signal: It has both digital & analog
values.
Introduction of DSD
 Advantages of Digital System:
 Well suited for numerical processing & non-numerical
processing.
 Easy to design.
 Low cost
 Easy to duplicate similar circuits.
 High noise immunity.
Lecture # 1 Number System

 Radix Number System: The radix no system

is a method that allows you to convert numbers of
different bases including numbers with floating
point values.

 Fixed Radix Number System:

 There are two types of Fixed Radix No. system.
 Conventional
 Unconventional
Number System
 Conventional No. System: It includes Binary
Number System with 2’s Complement
representation of negative numbers, Negative
Radix & Signed-Digit Number System.

 Unconventional No. System: It Includes Sign-

Logarithm number system & the Residue number
system.
Number System
 Conversion from one Radix to another Radix
System:

 Examples:
 (257) = ( 1,6,10 )
10 13 (290)10 = (2,0,2 )12
13 257 12 290
12 24 -2
13 19 -10
2 -0
1 -6
 Reverse Check:

 ( 1,6,10)13 =( )10

=1*13
2
+ 6*13 ¹ + 10*13 ⁰
=169+78+10
= (257)₁₀


Number System
 Practice Problems:

 1: (244) = (
10 )3
 2: (298) = (
10 ) 12
Number System
 Problem: Convert the following Radix Value into Decimal
form:
 1: Radix=14 , Digit set=[-2,5], [-2,1,2,2,2,0]
 Solution:
 =(14)5 *(-2)+1*(14)4 +2*(14)3 +2*(14)2 +2*(14)1 + 0*(14)0

 = -1075648 + 38416 +5488 +392 +28 + 0

 = (-1031324)10


Note: Each individual digit of the resultant value must lie
within the range of digit set [-2,-1,0,1,2,3,4,5]
Radix Conversion:
 Practice Problem
 1:Radix=7,digit set [-2,10],[7,1,10,-2,10,6]

 2:Radix=4,digit set [-2,7],[1,6,-2,7,6,-2]

Classes of Number System:
Integers (fixed-point), unsigned: Chapter 1
Integers (fixed-point), signed
 Signed-magnitude, biased, complement: Chapter 2
 Signed-digit, including carry/borrow-save: Chapter 3
 (but the key point of Chapter 3 is
 using redundancy for faster arithmetic,
 not how to represent signed values)
 Residue number system: Chapter 4
 (again, the key to Chapter 4 is use of parallelism for faster
arithmetic,
 not how to represent signed values
Real numbers, floating-point: Chapter 17
Part V deals with real arithmetic
