Scribd
Upload
31 views26 pages

ECE 333 Logic Circuit

The document discusses a course on logic circuits and switching theory. It provides details about the course content, which includes topics like number systems, Boolean algebra, minimization of Boolean functions, and sequential circuits. It also mentions policies regarding grades appeals and academic dishonesty.

Uploaded by

Josephus Tablada
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
31 views26 pages

ECE 333 Logic Circuit

The document discusses a course on logic circuits and switching theory. It provides details about the course content, which includes topics like number systems, Boolean algebra, minimization of Boolean functions, and sequential circuits. It also mentions policies regarding grades appeals and academic dishonesty.

Uploaded by

Josephus Tablada
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/ 26

ECE 333 Logic Circuit

and Switching Theory

Text: Digital Design by


M. Morris Mano, 2nd Edition
Prentice-Hall International, Inc.
Course Description
• This course presents the basic tools for the
design of digital circuits and provides
methods and procedures suitable for a
variety of digital design applications.
Grades Appeals / Academics Dishonesty
Academic dishonesty will not be tolerated. Any
student found to have participated in academic
dishonesty will receive a “5.0” in the course, and
maybe subject to disciplinary action.

The EVSU Students manual prohibits students from


committing the following acts of academic
dishonesty: academic fraud, copying or allowing
one’s work to be copied, fabrication/falsification,
sabotage of other’s work, substitution (ex., taking
an exam for someone else).
Course Content
• 1. Number System
• 2. Other Number System and Number Conversion System
• 3. Boolean Algebra and Logic Gates
• 4. Minimization of Boolean Functions
• 5. Sequential Circuits
• 6. Algorithmic State Machine (ASM)
• 7. Asynchronous Sequential Logic
More…
• A bit more clear please!…
• We will understand how digital circuits work and how we can
design them

• DIGIT: from Latin ‘digitus’ = finger. ‘Any of the Arabic numerals


from 0-9’. ‘One of the elements that combine to form
numbers in a system other then the decimal one’.
• DIGITAL: ‘of/relating to/using calculation by numerical
methods or by discrete units’. ‘relating to data in the form of
numerical digits’
Chapter 1: Number Systems
• Binary Numbers = base 2 (0-1)
• Decimal Numbers = base 10 (0-9)
• Octal Numbers = base 8 (0-7)
• Hexadecimal Numbers = base 16 (0-9, A-F)
• Other Number System
• Number Base Conversions
• Complements
• Signed Binary Numbers
• Binary Codes
DECIMAL NUMBERS
A Base-10 number system
Decimal number 7392 is represented by:
Positional Weight
7 x 103 + 3 x 102 + 9 x 101 + 2 x 100

10^4 10^3 10^2 10^1 10^0


(thousands) (hundreds) (tens) (units)
1000 100 10 1

7 3 9 2
Decimal numbers are represented by any number from 0-9
multiplied by its positional weight:
The aj coefficients are one of the ten digits (0, 1, 2,…,9)
a5105 + a4104 + a3103 + a2102 + a1101 + a0100 +
a-110-1 + a-210-2 + a-310-3
The decimal number system is said to be of base/radix
10, because it uses ten digits and the coefficients are
multiplied by powers of 10.
BINARY NUMBERS:

• The binary system is different with the decimal system having


only two possible values: 0 and 1.

• For example: 11010.11 is 26.75 in decimals, shown from the


multiplication of the coefficients by powers of 2:
25 24 23 22 21 20 2-1 2-2
32 16 8 4 2 1 0.5 0.25

1 1 0 1 0 1 1
• 1x24 + 1x23 + 0x22 + 1x21 + 0x20 + 1x2-1 + 1x2-2 = 26.7510
Octal Numbers

• A base-8 number system (0-7)


• Maximum count is 7
• An octal number 346 is represented by:
8-2 82 81 80
512 64 8 1

3 4 6
• 3x82 + 4x81 + 6x80 = 23010
HEXADECIMAL NUMBERS

• For hexadecimal, the letters of the alphabet


are use to supplement the ten decimal digits
when the base of the number is greater than
10.
• Letters A, B, C, D, E and F are used for digits
10, 11, 12, 13, 14 and 15 respectively.
A 10
B 11
C 12
D 13
E 14
F 15
• A hexadecimal number 2B1 is represented by:
163 162 161 160
4096 256 16 1

2 B 1
• 2x16^2 + 11x16^1 + 1x16^0 = 68910
Other Numbers
• In general, a number expressed in base-r
system has coefficients multiplied by powers
of r:
• The coefficients aj range in value from 0 to r -
1.
• Example: (4021.2)5 = 4x53 + 0x52 +2x51 + 1x50
+2x5-1 = (511.4)10
• Note that coefficients for base 5 can be only 0,
1, 2, 3, and 4.
Number Base Conversion
• Note:
• From any base number to decimal, use
Positional Weight.
• From decimal to any base number, use
division for whole #s or multiplication for
decimal pt.
• From binary to octal, use 421 code
• From binary to Hex, use 8421 code
1-3 Number Base Conversions
Binary to Decimal
• A binary number can be converted to a decimal by
forming the sum of the powers of 2 of those
coefficients whose value is 1.
Example:
(1010.011)2 = 23 + 21 + 2-2 + 2-3
= (10.375)10
• The binary number has four 1’s and the decimal
equivalent is found from the sum of four powers of
2.
• ( 1 0 1 0 . 0 1 1 )2
• 1 x 0.125 = 0.125
• 1 x 0.25 = 0.25
• 0 x 0.5 =0
• 0 x 1 =0
• 1 x 2 =2
• 0 x 4 =0
• 1 x 8 =8
• 10.375
•
Decimal to Binary
• Convert decimal 41 to binary.
– Follow these simple steps:
• To do this, divide 41 by 2 to give an integer quotient of
20 and a remainder of ½.
• The quotient is again divided by 2 to give a new
quotient and remainder.
• This process is continued until the integer quotient
becomes 0.
(The process should be shown on the board)
• Read from right to left
• answer: (101001)2
• Other method: Using positional weight: 32 16 8 4 2 1
• Note:
• If # contains decimal point. Multiply the decimal fraction by the radix.
1-3 Number Base Conversions
• The following is an example of Octal-to-
decimal conversion:
(630.4)8 = 6 x 82 + 3 x 8 + 4 x 8-1
= 408.5
• The conversion from decimal to binary or to
any other base-r system is more convenient if
the number is separated into an integer part
and a fraction part and the conversion of each
part done separately.
1-3 Number Base Conversions
• Convert decimal 153 to octal.
– Follow these simple steps:
• The required base r is 8.
• First, divide 153 by 8 to give an integer quotient of 19
and a remainder of 1.
• Then divide 19 by 8 to give a quotient of 2 and a
remainder of 3.
• Finally, 2 is divided by 8 to give a quotient of 0 and a
remainder of 2.
(Process continued on the board)
1-3 Number Base Conversions
• Convert (0.513) to octal.
– 0.513 x 8 = 4.104
– 0.104 x 8 = 0.832
– 0.832 x 8 = 6.656
– 0.656 x 8 = 5.248
– 0.248 x 8 = 1.984
– 0.984 x 8 = 7.872
• The answer, to seven significant figures, is obtained
from the integer part of the products: (0.513)10 =
(0.406517…)8
1-3 Number Base Conversions
• Convert (0.6875)10 to binary.
INTEGER FRACTION COEFFICIENTS

– 0.6875 x 2 = 1 + 0.3750 a-1 = 1


– 0.3750 x 2 = 0 + 0.7500 a-2 = 0
– 0.7500 x 2 = 1 + 0.5000 a-3 = 1
– 0.5000 x 2 = 1 + 0.0000 a-4 = 1
Answer: (0.6875)10 = (0.a-1a-2a-3a-4)2 = (0.1011)2
1-4 OCTAL Numbers
• Conversion of binary to octal:
– 10110001101011.111100000110)2
– 10 110 001 101 011 . 111 100 000 110 =
2 6 1 5 3 7 4 0 6
– (26153.7460)8
1-4 Hexadecimal Numbers
• Conversion of binary to hex:
– 10110001101011.11110010)2
– 10 1100 0110 1011 . 1111 0010 =
2 C 6 B F 2
– (2C6B.F2)16
Seatwork/Assignment #1

You might also like