Learning Module in Digital Design
Learning Module in Digital Design
LEARNING MODULE
IN
DIGITAL DESIGN
(DD 101)
PRELIMINARY TERM
1ST SEMESTER A.Y. 2020-2021
GERALD R. ALBANO
Subject Instructor
1
TABLE OF CONTENTS
COVER PAGE........................................................................................................p. 1
WELCOME NOTE..................................................................................................p. 3
INTRODUCTION....................................................................................................p. 4
STUDY GUIDES & HOUSE RULES.......................................................................p. 4
COURSE OUTLINE................................................................................................p. 4-5
LEARNING TASK 1................................................................................................p. 8
Class Orientation
PRE-ASSESSMENT 1............................................................................................p. 8
CONTENT DEVELOPMENT 1...............................................................................p. 9
POST-ASSESSMENT 1.........................................................................................p. 9
LEARNING TASK 2................................................................................................p. 10
Introduction to Number System
Conversion of Base Number System
PRE-ASSESSMENT 2............................................................................................p. 10
CONTENT DEVELOPMENT 2...............................................................................p. 11-15
POST-ASSESSMENT 2.........................................................................................p. 15
LEARNING TASK 3................................................................................................p. 16
One’s and Two’s Complement
Binary Arithmetic Operation
PRE-ASSESSMENT 3............................................................................................p. 16
CONTENT DEVELOPMENT 3...............................................................................p. 17-19
POST-ASSESSMENT 3.........................................................................................p, 20
LEARNING TASK 4................................................................................................p. 21
Octal Arithmetic Operation
Hexadecimal Arithmetic Operation
PRE-ASSESSMENT 4............................................................................................p. 21
CONTENT DEVELOPMENT 4...............................................................................p. 22-24
POST-ASSESSMENT 4.........................................................................................p. 25
LEARNING TASK 5................................................................................................p. 26
Codes in Digital Circuits
BCD
Gray Code
Hamming Code
PRE-ASSESSMENT 5............................................................................................p. 26
CONTENT DEVELOPMENT 5...............................................................................p. 27-31
POST-ASSESSMENT 5.........................................................................................p. 32
PRELIMINARY EXAM............................................................................................p. 33-34
2
NORZAGARAY COLLEGE
Municipal Compound, Brgy. Poblacion
Norzagaray, Bulacan
I. WELCOME NOTE
Dear Students,
I am counting on you to make this your best year at Norzagaray College. We are here to support you every step of the
way.
For those of you returning to Norzagaray College, we are glad to have you back as you continue your journey to the
graduation stage. For those new students who are just joining the institution, we encourage you to make the most of
your time here. Your college experience will be what you make it, and your opportunities will only be limited by the
limits you place on yourself.
As you start a new academic year, take advantage of the many services available to help you achieve your full
potential. Norzagaray College offers many programs to keep you on the road to graduation and professional success,
such as tutoring and workshops on skills and knowledge development, laboratory exercises and test preparation.
During the year, you can also join me for a chat session – an opportunity for me to learn more about you, your plans for
your future, and to answer your questions.
College life however, is not really a hand full of burden if you just know how to start your new academic life – the
right way.
Now that we are going to embrace the new learning modality this 1st Semester of A.Y. 2020-2021 amidst
COVID-19 pandemic, here are some important details that you have to remember:
Please take note that if you have questions regarding your learning modules/tasks, you may reach me
thru my contact details based on our class schedule ONLY.
Since, this is our first day of meeting , I prepared an introduction spiel for you to answer. You just need to
supply the necessary information in the blanks.
Introduce Yourself:
Hello everyone!
3
II. INTRODUCTION
Digital circuits are circuits dealing with signals restricted to the extreme limits of zero and some full amount.
This stands in contrast to analog circuits, in which signals are free to vary continuously between the limits
imposed by power supply voltage and circuit resistances. These circuits find use in “true/false” logical
operations and digital computation.
The circuits in this chapter make use of IC, or integrated circuit, components. Such components are actually
networks of interconnected components manufactured on a single wafer of semiconducting material.
Modern ICs are enormously complicated. An average desktop computer chip, as of 2015, has over 1 billion
transistors. The rules for what can and cannot be manufactured are also extremely complex. Common IC
processes of 2015 have more than 500 rules. Furthermore, since the manufacturing process itself is not
completely predictable, designers must account for its statistical nature. The complexity of modern IC design,
as well as market pressure to produce designs rapidly, has led to the extensive use of automated design tools
in the IC design process.
With the new learning modality that we are going to embrace for this academic year due to COVID-19
pandemic, our major concern now is the health and safety not only of our students but also our school
personnel. Hence, this module is created to ensure that learning will continue amidst the health situation.
My dear students, since we adopted modular approach this Preliminary term, here are some rules and reminders
that you have to bear in mind while accomplishing this module.
1. You are going to accomplish the learning tasks on your own. Therefore, BE HONEST!
2. If you see a certain part which requires your NAME, COURSE & SECTION, then it is the only part that you
must answer and to be submitted to me. You are NOT going to submit the whole learning module.
3. When you encounter unfamiliar word/s while browsing this module, DON’T just ignore it, instead get a
dictionary and look for the meaning of it.
4. If you have queries regarding your learning module, please feel free to reach me thru my provided contact
details during our CLASS SCHEDULE ONLY.
5. If you are going to send me a message, please DON’T FORGET to give your complete name and section so I
can recognize you.
6. If you have social media account/s, please USE your real name and a clear picture of you so it will be easier
for me to recognize you.
7. NEVER HESITATE to ask me questions or raise your concerns for as long as it is related to our learning
module.
8. Always KEEP TRACK of the timetable when to accomplish and to submit the learning tasks.
9. Be reminded that all of us are still adjusting in this new normal, hence, it will be easier for you to accomplish the
learning tasks if you are going to have TIME MANAGEMENT.
10. Lastly, ASK GUIDANCE from our Holy Father while accomplishing your tasks and surely everything will work
well.
IV.COURSE OUTLINE
Course Description :
This course covers the operation, application, and troubleshooting of TTL and CMOS electronic logic devices,
their use in combinatorial and sequential logic circuits, the interface between the logic families, and the
4
interface between digital and analog circuits. The course also provides a study of Boolean algebra, binary
and hexadecimal number systems, binary codes, and the analysis of the basic components and circuits used
in semiconductor switching and the use of K Mapping and Quine Mc Cluskey Method.
Course Content
PRELIMINARY PERIOD
II.
Introduction to Number System Week 2
Conversion of Base Number System September 21-25, 2020
III.
One’s and Two’s Complement Week 3
Binary Arithmetic Operation September 28-October 2, 2020
IV.
Octal Arithmetic Operation Week 4
Hexadecimal Arithmetic Operation October 5-9, 2020
5
V.
Codes In Digital Circuits Week 5
October 12-16, 2020
Week 6
PRELIM EXAM: October 19-24, 2020
MIDTERM PERIOD
VI.
Introduction to Boolean Algebra Week 7
Logic Gates October 26-30, 2020
VII.
Week 8
Simplifying Logic Gates using Boolean November 2-6, 2020
Algebra Law
K Mapping
VIII.
Simplifying Logic gates using K Map Week 9
November 9-13, 2020
Canonical Form Conversion
IX. Week 10
November 16-20, 2020
Sum of Product Form
Product of Sum Form
X. Week 11
November 23-27, 2020
Quine Mc Cluskey Method
Week 12
MIDTERM EXAMINATION: December 1-5, 2020
FINAL PERIOD
Week 18
FINAL EXAMINATION: Jan. 25-30, 2021
Suggested Readings and References: Digital Integrated Electronics
by Herbert Taub , Donald Schilling, 2017
Digital Electronics by John Morris, 2015
6
John F. Wakerly, Digital Design: Principles and Practices,
Pearson Prentice Hall, 2006.
https://www.geeksforgeeks.org/digital-electronics-logic-
design-tutorials
https://www.tutorialspoint.com/digital_circuits/index.htm
https://www.allaboutcircuits.com/textbook/digital
Course Requirements:
Accomplish learning tasks properly
Submit learning tasks on time
Grading System:
7
LEARNING TASK 1 (September 14-18, 2020)
TOPIC
CLASS ORIENTATION
TOPIC OVERVIEW
This week is intended for the class orientation of the students wherein the mission, vision and objectives of
the institution will be discussed as well as the vision and mission of the department where the student belongs.
PRE-ASSESSMENT 1
4. What do you think are the characteristics and skills that you possess that will be an asset to the
program/department where you belong?
Scoring Rubric:
Content/Idea: 5pts
Coherence: 3pts
Handwriting: 2pts
Total Score: 10pts
8
CONTENT DEVELOPMENT
VISION:
Norzagaray College envisions itself to transform lives of individuals and communities through life-long learning.
MISSION:
OBJECTIVES:
Professionalis
m
Responsibility
Integrity
Diversity
Excellence
MISSION
To provide the Computer Science students with a solid, technical foundation that enables them to be
globally competitive professionals.
POST ASSESSMENT 1
Memorize the NC Vision, Mission and Objectives as well as the Vision and Mission of the department where
you belong. Be ready to recite it when face-to-face classroom instruction is allowed.
9
LEARNING TASK 2 (September 21-25, 2020)
TOPIC
TOPIC OVERVIEW
Learning Task 2 will discuss number system in a way to represent numbers. Using the base-10 number
system, called decimal. Other common number systems include base-16 (hexadecimal), base-8 (octal), and
base-2 (binary). These topics also include the different ways to convert numbers into different number system.
PRE-ASSESSMENT 2
10
CONTENT DEVELOPMENT
A digital system can understand positional number system only where there are a few symbols called digits
and these symbols represent different values depending on the position they occupy in the number.
Each position represents a specific power of the base (10). For example, the decimal number 1234
consists of the digit 4 in the units position, 3 in the tens position, 2 in the hundreds position, and 1 in the
thousands position, and its value can be written as
(1×1000) + (2×100) + (3×10) + (4×l)
(1×103)+(2×102)+(3×101)+(4×l00)
1000 + 200 + 30 + 1
1234
Example
Binary Number: 101012
Calculating Decimal Equivalent −
Example
Octal Number − 125708
Calculating Decimal Equivalent −
11
Note: 125708 is normally written as 12570.
Example −
Hexadecimal Number: 19FDE16
Calculating Decimal Equivalent −
Step 2 19FDE16 ((1 × 164) + (9 × 163) + (15 × 162) + (13 × 161) + (14 × 160))10
Step 2 − Get the remainder from Step 1 as the rightmost digit (least significant digit) of new base number.
Step 3 − Divide the quotient of the previous divide by the new base.
Step 4 − Record the remainder from Step 3 as the next digit (to the left) of the new base number.
Repeat Steps 3 and 4, getting remainders from right to left, until the quotient becomes zero in Step 3.
The last remainder thus obtained will be the Most Significant Digit (MSD) of the new base number.
Example −
Decimal Number: 2910
Calculating Binary Equivalent −
Step 1 29 / 2 14 1
Step 2 14 / 2 7 0
Step 3 7/2 3 1
Step 4 3/2 1 1
Step 5 1/2 0 1
As mentioned in Steps 2 and 4, the remainders have to be arranged in the reverse order so that the first
remainder becomes the Least Significant Digit (LSD) and the last remainder becomes the Most Significant Digit
(MSD).
Decimal Number − 2910 = Binary Number − 111012
12
Other Base System to Decimal System
Step 1 − Determine the column (positional) value of each digit (this depends on the position of the digit
and the base of the number system).
Step 2 − Multiply the obtained column values (in Step 1) by the digits in the corresponding columns.
Step 3 − Sum the products calculated in Step 2. The total is the equivalent value in decimal.
Example
Binary Number − 111012
Calculating Decimal Equivalent −
Example
Octal Number − 258
Calculating Binary Equivalent −
Step 1 21 / 2 10 1
Step 2 10 / 2 5 0
Step 3 5/2 2 1
Step 4 2/2 1 0
Step 5 1/2 0 1
13
Decimal Number − 2110 = Binary Number − 101012
Octal Number − 258 = Binary Number − 101012
14
Shortcut method - Binary to Hexadecimal
Step 1 − Divide the binary digits into groups of four (starting from the right).
Step 2 − Convert each group of four binary digits to one hexadecimal symbol.
Example
Binary Number − 101012
Calculating hexadecimal Equivalent −
Example
Hexadecimal Number − 1516
Calculating Binary Equivalent −
POST ASSESSMENT 2
NAME: _ COURSE & SECTION:
STUDENT NO.:___________________________________________SCORE:_________________________
TOPICS
TOPIC OVERVIEW
Learning Task 3 will discuss the use of complements in the digital computers in order to simplify the
subtraction operation and for the logical manipulations. It also includes the different binary arithmetic operation
which is essential part of all the digital computers and many other digital system.
PRE-ASSESSMENT 3
16
CONTENT DEVELOPMENT
Binary Arithmetic
Binary Addition
It is a key for binary subtraction, multiplication, division. There are four rules of binary addition.
In fourth case, a binary addition is creating a sum of (1 + 1 = 10) i.e. 0 is written in the given column and a carry
of 1 over to the next column.
Example − Addition
Binary Subtraction
Subtraction and Borrow, these two words will be used very frequently for the binary subtraction. There are four
rules of binary subtraction.
Example − Subtraction
Binary Multiplication
Binary multiplication is similar to decimal multiplication. It is simpler than decimal multiplication because only 0s
and 1s are involved. There are four rules of binary multiplication.
17
Example − Multiplication
Binary Division
Binary division is similar to decimal division. It is called as the long division procedure.
Example − Division
Complement Arithmetic
Complements are used in the digital computers in order to simplify the subtraction operation and for the logical
manipulations. For each radix-r system (radix r represents base of number system) there are two types of
complements.
1's complement
The 1's complement of a number is found by changing all 1's to 0's and all 0's to 1's. This is called as taking
complement or 1's complement. Example of 1's Complement is as follows.
18
2's complement
The 2's complement of binary number is obtained by adding 1 to the Least Significant Bit (LSB) of 1's
complement of the number.
2's complement = 1's complement + 1
19
POST ASSESSMENT 3
8. Divide the binary number (011010000) by (0101) and find the quotient
a) 100011
b) 101001
c) 110010
d) 010001
10. What is the addition of the binary numbers 11011011010 and 010100101?
a) 0111001000
b) 1100110110
c) 11101111111
d) 10011010011
21
LEARNING TASK 4 (October 5-9, 2020)
TOPICS
TOPIC OVERVIEW
Learning Task 4 will discuss octal and hexadecimal number representation is expressed by subscript 8
and subscript 16. Base of 8 digits ranging from 0 to 7 and base of 16 digits ranging from 0-9 and A-F. Arithmetic
operations of octal and hexadecimal numbers are also performed the same as decimal or binary arithmetic
operations.
PRE-ASSESSMENT 4
5. 3458-1468 = 1778
6. 757.768-451.778 = 305.778
9. B A 316 + 5 D E16 = 1 1 8 1
22
CONTENT DEVELOPMENT
Octal Arithmetic
Example
Octal Number − 125708
Calculating Decimal Equivalent −
To use this table, simply follow the directions used in this example: Add 6 8 and 58. Locate 6 in the A column then
locate the 5 in the B column. The point in 'sum' area where these two columns intersect is the 'sum' of two
numbers.
68 + 58 = 138.
Example − Addition
23
Octal Subtraction
The subtraction of octal numbers follows the same rules as the subtraction of numbers in any other number
system. The only variation is in borrowed number. In the decimal system, you borrow a group of 10 10. In the
binary system, you borrow a group of 210. In the octal system you borrow a group of 810.
Example − Subtraction
Hexadecimal Arithmetic
Example
Hexadecimal Number − 19FDE16
Calculating Decimal Equivalent −
Step 2 19FDE16 ((1 × 164) + (9 × 163) + (15 × 162) + (13 × 161) + (14 × 160))10
24
To use this table, simply follow the directions used in this example − Add A16 and 516. Locate A in the X column
then locate the 5 in the Y column. The point in 'sum' area where these two columns intersect is the sum of two
numbers.
A16 + 516 = F16.
Example − Addition
Hexadecimal Subtraction
The subtraction of hexadecimal numbers follow the same rules as the subtraction of numbers in any other
number system. The only variation is in borrowed number. In the decimal system, you borrow a group of 10 10. In
the binary system, you borrow a group of 210. In the hexadecimal system you borrow a group of 1610.
Example - Subtraction
Hexadecimal Multiplication
Example
25
POST ASSESSMENT 4
26
LEARNING TASK 5 (October 12-16, 2020)
TOPICS
TOPIC OVERVIEW
Learning Task 5 will discuss the numbers, letters or words are represented by a specific group of symbols
being encoded. The group of symbols is called as a code. The digital data is represented, stored and transmitted
as group of binary bits. This group is also called as binary code. The binary code is represented by the number
as well as alphanumeric letter. It also include conversion of gray code and error detecting and correcting through
the use of hamming code.
PRE – ASSESSMENT 5
10
10
11
12
13
14
15
16
17
18
19
27
857910 =
CONTENT DEVELOPMENT
Binary Codes
In the coding, when numbers or letters are represented by a specific group of symbols, it is said to be that number
or letter is being encoded. The group of symbols is called as code. The digital data is represented, stored and
transmitted as group of bits. This group of bits is also called as binary code.
1. Weighted codes
2. Unweighted codes
If the code has positional weights, then it is said to be weighted code. Otherwise, it is an unweighted code.
Weighted codes can be further classified as positively weighted codes and negatively weighted codes.
We have 10 digits in decimal number system. To represent these 10 digits in binary, we require minimum of 4
bits. But, with 4 bits there will be 16 unique combinations of zeros and ones. Since, we have only 10 decimal
digits, the other 6 combinations of zeros and ones are not required.
8 4 2 1 code
The weights of this code are 8, 4, 2 and 1.
This code has all positive weights. So, it is a positively weighted code.
This code is also called as natural BCD BinaryCodedDecimal code.
Example
Let us find the BCD equivalent of the decimal number 786. This number has 3 decimal digits 7, 8 and 6. From
the table, we can write the BCD 84218421 codes of 7, 8 and 6 are 0111, 1000 and 0110 respectively.
∴ 78678610 = 011110000110011110000110BCD
There are 12 bits in BCD representation, since each BCD code of decimal digit has 4 bits
28
Gray Code
The following table shows the 4-bit Gray codes corresponding to each 4-bit binary code.
In the above table, the successive Gray codes are differed in one bit position only. Hence, this code is called as
unit distance code.
1. The Most Significant Bit (MSB) of the gray code is always equal to the MSB of the given binary code.
2. Other bits of the output gray code can be obtained by XORing binary code bit at that index and previous
index.
Example
1. Binary : 0011
Gray : 0010
2. Binary : 01001
Gray : 01101
We know that the bits 0 and 1 corresponding to two different range of analog voltages. So, during transmission
of binary data from one system to the other, the noise may also be added. Due to this, there may be errors in the
received data at other system.
That means a bit 0 may change to 1 or a bit 1 may change to 0. We can’t avoid the interference of noise. But, we
can get back the original data first by detecting whether any error s present and then correcting those errors. For
this purpose, we can use the following codes.
29
Parity Code
It is easy to include append one parity bit either to the left of MSB or to the right of LSB of original bit stream.
There are two types of parity codes, namely even parity code and odd parity code based on the type of parity
being chosen.
The following table shows the even parity codes corresponding to each 3-bit binary code. Here, the even parity bit
is included to the right of LSB of binary code
Here, the number of bits present in the even parity codes is 4. So, the possible even number of ones in these
even parity codes are 0, 2 & 4.
If the other system receives one of these even parity codes, then there is no error in the received data.
The bits other than even parity bit are same as that of binary code.
If the other system receives other than even parity codes, then there will be an error s in the received
data. In this case, we can’t predict the original binary code because we don’t know the bit position s of
error.
Therefore, even parity bit is useful only for detection of error in the received parity code. But, it is not sufficient to
correct the error.
Odd Parity Code
The value of odd parity bit should be zero, if odd number of ones present in the binary code. Otherwise, it should
be one. So that, odd number of ones present in odd parity code. Odd parity code contains the data bits and odd
parity bit.
The following table shows the odd parity codes corresponding to each 3-bit binary code. Here, the odd parity bit is
included to the right of LSB of binary code.
Here, the number of bits present in the odd parity codes is 4. So, the possible odd number of ones in these odd
parity codes are 1 & 3.
30
If the other system receives one of these odd parity codes, then there is no error in the received data. The
bits other than odd parity bit are same as that of binary code.
If the other system receives other than odd parity codes, then there is an error s in the received data. In
this case, we can’t predict the original binary code because we don’t know the bit position s of error.
Therefore, odd parity bit is useful only for detection of error in the received parity code. But, it is not sufficient to
correct the error.
Hamming Code
Hamming code is useful for both detection and correction of error present in the received data. This code uses
multiple parity bits and we have to place these parity bits in the positions of powers of 2.
The minimum value of 'k' for which the following relation is correct valid is nothing but the required number of
parity bits.
The decimal equivalent of the check bits in the received data gives the value of bit position, where the error is
present. Just complement the value present in that bit position. Therefore, we will get the original binary code
after removing parity bits.
31
Example 1
Let us find the Hamming code for binary code, d4d3d2d1 = 1000. Consider even parity bits.
The number of bits in the given binary code is n=4.
We can find the required number of parity bits by using the following mathematical relation.
The minimum value of k that satisfied the above relation is 3. Hence, we require 3 parity bits p1, p2, and p3.
Therefore, the number of bits in Hamming code will be 7, since there are 4 bits in binary code and 3 parity bits.
We have to place the parity bits and bits of binary code in the Hamming code as shown below
Example 2
In the above example, we got the Hamming code as b7b6b5b4b3b2b1=1001011. Now, let us find
the error position when the code received is b7b6b5b4b3b2b1=1001111.
32
POST ASSESSMENT 5
Binary to Gray Code Conversion. Convert the following. Show your solution.
1. 101001 = 6. 1110001 =
2. 10010011 = 7. 111000101 =
3. 010010011 = 8. 00111000101 =
4. 01001001100 = 9. 0001110101 =
5. 0100100110011 = 10. 0001110000 =
Decimal to Gray Code Conversion. Convert the following. Show your solution. Note: First convert the decimal
number to it’s binary representation then convert to gray code.
1. 25 6. 90
2. 45 7. 34
3. 54 8. 18
4. 78 9. 19
5. 67 10. 20
33
NORZAGARAY COLLEGE
Norzagaray Municipal Compound
Norzagaray, Bulacan
A. zero
10. What is the decimal value of 2–1 ?
B. one
A. 0.5
C. that number
B. 0.25
D. ten
C. 0.05
D. 0.1
2. In the decimal numbering system, what is the MSD?
A. The middle digit of a stream of numbers
11. How many unique symbols are used in the decimal
B. The digit to the right of the decimal point
number system?
C. The last digit on the right
A. One
D. The digit with the most weight
B. Nine
C. Ten
3. What are the symbols used to represent digits in the
D. Unlimited
binary number system?
A. 0,1
12. If the decimal number is a fraction then its binary
B. 0,1,2
equivalent is obtained by ________ the number
C. 0 through 8
continuously by 2.
D. 1,2
a) Dividing
b) Multiplying
4.Give the decimal value of binary 10010.
c) Adding
A. 610 d) Subtracting
34
19. 1’s complement of 1011101 is ____________
a) 0101110 III. Binary to Gray Code Conversion.
b) 1001101 Show your complete solution.
c) 0100010
d) 1100101 1. 11111
2. 011111
20. 2’s complement of 11001011 is ____________ 3. 10011111
a) 01010111 4. 0010011111
b) 11010100 5. 00001111
c) 00110101 6. 1100001111
d) 11100010 7. 1010101010
8. 1001001001010
21. On subtracting (01010)2 from (11110)2 using 1’s 9. 00100100
complement, we get ____________ 10. 11110000
a) 01001
b) 11010
c) 10101
d) 10100