DLC Unit 1 (1).pdf nothing to say about you

rshyamprakash2004 8 views 74 slides Sep 02, 2024
Slide 1
Slide 1 of 74
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22
Slide 23
23
Slide 24
24
Slide 25
25
Slide 26
26
Slide 27
27
Slide 28
28
Slide 29
29
Slide 30
30
Slide 31
31
Slide 32
32
Slide 33
33
Slide 34
34
Slide 35
35
Slide 36
36
Slide 37
37
Slide 38
38
Slide 39
39
Slide 40
40
Slide 41
41
Slide 42
42
Slide 43
43
Slide 44
44
Slide 45
45
Slide 46
46
Slide 47
47
Slide 48
48
Slide 49
49
Slide 50
50
Slide 51
51
Slide 52
52
Slide 53
53
Slide 54
54
Slide 55
55
Slide 56
56
Slide 57
57
Slide 58
58
Slide 59
59
Slide 60
60
Slide 61
61
Slide 62
62
Slide 63
63
Slide 64
64
Slide 65
65
Slide 66
66
Slide 67
67
Slide 68
68
Slide 69
69
Slide 70
70
Slide 71
71
Slide 72
72
Slide 73
73
Slide 74
74

About This Presentation

Not


Slide Content

SECA1201
DIGITAL LOGIC CIRCUITS
Unit –1

Number Systems
Number System is a basis for counting various
items
•Decimal Number System (0 –9)
•Binary Number System (0, 1)
•Octal Number System ( 0 –7)
•HexaDecimal Number System (0 –9, A –F)

Number –Base –Digits
Number Systems

Counting of Number Systems
Decimal Counting
0,1,2,3,4,5,6,7,8,9,10,11,12,13.........
Binary Counting
1 bit binary counting ( Total count 2
1
= 2)
2 bit binary counting ( Total count 2
2
= 4)
Number Systems
2
1
= 2 2
0
= 1
0 0
0 1
1 0
1 1
Equivalent Decimal
0
1
2
3
1bit
0
1
Equivalent Decimal
0
1

Binary Counting
3 bit & 4 bit binary counting
( Total count for 3 bit 2
3
= 8)
( Total count for 4 bit 2
4
= 16)
Number Systems
2
2
= 42
1
= 22
0
= 1
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Decimal
0
1
2
3
4
5
6
7
2
3
= 82
2
= 42
1
= 22
0
= 1
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
Decimal
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

Counting of Number Systems
Octal Counting
0,1,2,3,4,5,6,7,
10,11,12,13,14,15,16,17, 8/8 = 10
20,21,22,23,24,25,26,27, 17/8 = 21
30....................
Hexa Decimal Counting
0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F,
10,11,12,13,14,15,16,17,18,19,1A,1B,1C,1D,1E,1F, 27/16 = 1B
20,21,22,23,24,25,26,27,28,29,2A,2B,2C,2D,2E,2F, 38/16 = 26
30...........................
Number Systems

ConversionofAnyNumberSystemintoDecimalNumber
Decimal Number System
Convert into Decimal
Number Systems Conversions

Conversion of Any Number System into Decimal Number
Cont...
Convert into Decimal
Number Systems Conversions

Conversion of Decimal Number into Any Radix Number
It is performed in 2 Steps
1.Conversion of Integer Part –successive division method
2.Conversion of Fractional Part –successive multiplication method
Successive Division for Integer Part conversion
Successive multiplication for Fractional Part conversion
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 37 into its binary
equivalent
37
10
=
( 1 0 0 1 0 1)
2
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 214 into its octal
equivalent
214
10
=
( 326)
8
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 3509 into its
hexadecimal equivalent
3509
10
=
( DB5)
H
3509
10
=
( DB5)
16
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 54 into radix 4
54
10
=
( 312)
4
Number Systems Conversions

Perform the following Conversions
Convert the decimal number .8125 into its binary
equivalent
.8125
10
=
( .1101)
2
Number Systems Conversions

Perform the following Conversions
Convert the decimal number .45 into its Octal
equivalent
.45
10
=
( .34631)
8
Number Systems Conversions

Perform the following Conversions
Convert the decimal number .64 into its Hex
equivalent
.64
10
=
( . A3D7)
16
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 37.8125 into its binary
equivalent
37
10
=
( 1 0 0 1 0 1. 1 1 0 1)
2
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 214.45 into its octal
equivalent
214.45
10
=
( 326.34631)
8
Number Systems Conversions

Perform the following Conversions
Convert the decimal number 3509.64 into its
hexadecimal equivalent
3509.64
10
=
( DB5.A3D7)
16
Number Systems Conversions

Binary to octal
8 = 2
3
Number Systems Conversions

Binary to Hexadecimal
16 = 2
4
Number Systems Conversions

Octal to Binary
Number Systems Conversions

Hexadecimal to Binary
Number Systems Conversions

Octal to Hexadecimal
This can be performed in 2 steps
•Octal to Binary conversion
•Binary to Hexadecimal conversion
Number Systems Conversions

Hexadecimal to Octal
This can be performed in 2 steps
•Hexadecimal to Binary conversion
•Binary to Octal conversion
Number Systems Conversions

Binary Arithmetic
•Binary Addition
•Binary Subtraction
•Binary Multiplication
•Binary Division
Note:

Binary Addition
Perform the binary addition
Binary Arithmetic

Binary Subtraction
Perform the binary subtraction
Binary Arithmetic

Binary Multiplication
Perform the binary multiplication
Binary Arithmetic

Perform the binary multiplication
Binary Arithmetic

Perform the binary multiplication
Binary Arithmetic

Binary Division
Perform the binary division
Binary Arithmetic

Perform the binary division
Binary Arithmetic

Complements
Binary :
•r complement –2’s complement
•( r-1) complement -1’s
complement
Decimal
•r complement –10’s complement
•( r-1) complement -9’s
complement
There are two types of complements for each base-rsystem:
•The radix complement –r complement
•The diminished radix complement -( r-1) complement
Octal :
•r complement –8’s complement
•( r-1) complement -7’s
complement
Hexadecimal
•r complement –16’s complement
•( r-1) complement -15’s
complement
Given a number Nin base rhaving ndigits, the (r–1)’s complement of Nis defined as:
(r
n
–1) –N
Binary Arithmetic

Complements Examples
Binary Arithmetic

Subtraction of Binary Numbers using
Complement Addition
Let the given Number is X -Y
Using 1’s complement
•Find the 1’s complement of Y
•Add with X
•If carry =1, then add the carry with the LSB of the result ( This is called end around
carry)
•Check MSB, if MSB is 0 it represent result is positive and it’s final result. If MSB is 1
it represent result is negative, so 1’s complement of result is final result.
Using 2’s complement
•Find the 2’s complement of Y
•Add with X
•If carry =1, then remove the carry ( This is called discard carry)
•Check MSB, if MSB is 0 it represent result is positive and it’s final result. If MSB is 1
it represent result is negative, so 2’s complement of result is final result.
Binary Arithmetic

Given two numbers A= 1010100 and B=1000011, Perform
subtraction (a) A-B (b) B-A using 1’s complement method
No.of digits in A and B must be equal
Binary Arithmetic

Given two numbers A= 1010100 and B=1000011, Perform
subtraction (a) A-B (b) B-A using 2’s complement method
Binary Arithmetic

Home work
1.Given two numbers X= 111010 and Y=10011,
Perform subtraction (a) X-Y (b) Y-X using 1’s and 2’s
complement method
2. Given two numbers X= 11010.01 and Y=10001.11,
Perform subtraction (a) X-Y (b) Y-X using 1’s and 2’s
complement method
Note :No.of digits in A and B must be equal
Binary Arithmetic

Binary Codes

Binary Codes

Gray code
Only one bit
change in two
consecutive
numbers
Binary Codes

Binary to Gray code conversion
Binary Codes

Gray to Binary code conversion
Binary Codes

Convert the following binary numbers into
Gray
Binary Codes

Convert the following Gray numbers into
binary
Binary Codes

Logic Functions

Basic Logic Gates
Logic Functions

Basic Logic Gates
Logic Functions

Universal Gates
1. NAND Gate-
A NAND Gate is constructed by connecting a NOT Gate at the output terminal of the
AND Gate.
The output of NAND gate is high (‘1’) if at least one of its inputs is low (‘0’).
The output of NAND gate is low (‘0’) if all of its inputs are high (‘1’).
A B Y = (A.B)’
0 0 1
01 1
1 0 1
1 1 0
Truth Table
Logic Symbol-
Logic Functions

Universal Gates
2. NOR Gate-
A NOR Gate is constructed by connecting a NOT Gate at the output terminal of the
OR Gate.
The output of OR gate is high (‘1’) if all of its inputs are low (‘0’).
The output of OR gate is low (‘0’) if any of its inputs is high (‘1’).
Truth Table
A B Y = A + B
0 0 1
0 1 0
1 0 0
1 1 0
Logic Symbol-
Logic Functions

Boolean Operators
Boolean Algebra
Boolean function relates the input and output variable
with the operators

Boolean Algebra

Properties of Boolean Algebra
Boolean Algebra

Consensus Theorem
Boolean Algebra

Problems
Simplify the following Boolean expression
Boolean Algebra

Simplify the following Boolean expression
Boolean Algebra

Simplify the following Boolean expression
Boolean Algebra

Simplify the following Boolean expression
Boolean Algebra

Simplify the following Boolean expression
Boolean Algebra

Home Work
Simplify the following Boolean expression
Boolean Algebra

NOT function using NAND gate
Functionally complete operation sets

AND function using NAND gate
Functionally complete operation sets

OR function using NAND gate
Functionally complete operation sets

NOR function using NAND gate
Complement of OR is NOR
Functionally complete operation sets

NOT function using NOR gate
Functionally complete operation sets

OR function using NOR gate
Functionally complete operation sets

AND function using NOR gate
Functionally complete operation sets

NAND function using NOR gate
Complement of AND is NAND
Functionally complete operation sets

Realization of switching function

Realization of switching function

Realisation of switching function using
NAND / NOR gates

Cont...