Unit - I

DIGITAL FUNDAMENTALS
Unit- 1 topics

• Number Systems – Decimal, Binary, Octal, Hexadecimal

• 1‘s and 2‘s complements
• Codes – BCD, Excess 3, Gray etc.
• Binary addition and subtraction
• Logic gates, Universal gates
• De Morgan's Theorem
• Boolean laws
• Sum of products and product of sums
• Karnaugh map Minimization
 Conversion
Decimal, Binary, Octal and
Hexadecimal
 Decimal to Binary
35.62510
 Decimal to Octal
35.62510
Decimal to Hexadecimal

35.62510
 Binary to Dec
(1010.1101)2=(1×23)+(0×22)+(1×21)+(0×20)+(1×2−1)+(1×2−2
)+(0×2−3)+(1×2−4)
(1010.1101)2=8+0+2+0+0.5+0.25+0+0.0625
=10+0.8125
(1010.1101)2= (10.8125)10

PAWAR673
Octal to Decimal Conversion:

35.538=(3×81)+(5×80)+(5×8−1)+(3×8−2)

35.538=24+5+0.625+0.046875

35.538=29+0.671875

35.538=29.67187510
Hexa Decimal to Decimal

• AB.3216=(A×161)+(B×160)+(3×16−1)+(2×16−2)

AB.3216=160+11+0.1875+0.0078125

AB.3216=171+0.1953125

AB.3216=171.195312510
 Oct to Bin and Bin to Oct
Octal to Binary Conversion
Write equivalent binary for given octal value
35 . 62 011101.110010
3-> 011
5-> 101
6-> 110
2 -> 010

35.628=011101.1100102

Binary to Octal
Split the binary number from left to right each group 3 bits
010101.110100
010 -> 2
101 -> 5
110 -> 6
100 -> 4
25.64
010101.1101002=25.648
 Hex to Bin and Bin to Hex
Hexa Decimal to Binary
Write equivalent binary for given hexa
decimal value
AB . 32
10101011 . 00110010

A -> 1010
B -> 1011
3-> 0011
2 -> 0010

AB.3216=10101011.001100102

Binary to Hexa Decimal

Split the binary number from left to right each group
4 bits
00010101.1101
0001 -> 1
0101 -> 5
1101 -> D
15.D16
 Hex to Oct and Oct to Hex
First convert Hex to Bin First convert Hex to Bin
Then convert Bin to Oct Then convert Bin to Oct
Convert Octal Number into Binary Number
Convert Hexa Decimal number to binary
35 . 53
(AB . 32)16 = ()8
011101 . 101011
10101011 . 00110010
35.538=011101.1010112
AB.3216=10101011.001100102
Convert Binary Number into Hex Number
Convert Binary Number into Octal Number Split the binary number from left to right each group 4 bits
Split the binary number from left to right each 00011101.10101100
group 3 bits 1D.AC
010101011.001100100
253.144 011101.1010112=1D.AC16
10101011.001100102=253.1448
BCD codes
• To determine the BCD code for a decimal number, each digit of the
decimal number must be converted successively into a binary number
consisting of 4 bits. For example, if there is a 5 in the decimal number,
this 5 is converted to "0101".
Compute the following
Hex

BCD Decimal

Octal

Convert 32410 to BCD

Convert (001000101000)BCD to decimal
Convert (1617)8 to BCD
Convert (93F)16 to BCD
Convert (001000101000)BCD to Hex and octal
Examples
Convert 32410 to BCD= 001100100100
Convert (001000101000)BCD to decimal = (228)10
Convert (1617)8 to BCD= (911) 10 =100100010001
Convert (93F)16 to BCD = (2367)10 = 0010001101100111
Convert (001000101000)BCD
To decimal -> 228
to Hex -> E4
to octal-> 344
Excess – 3 code conversion

• Convert decimal number 23 to Excess-3 code.

23+33=56 =0101 0110
Excess three conversion

• (251.36)10 to excess 3
• (221)8 to excess 3
• (DD26)16 to excess 3
Excess three conversion

• (251.36)10 to excess 3 = 0101 1000 0100 . 0110 1001

• (221)8 to excess 3= 14510 = (0100 0111 1000)xs-3
• (DD26)16 to excess 3 = 5661410=10001001100101000111
Gray codes

(1011010)gray=()2
(10111010)2=()gray
Binary addition
Binary Subtraction
1's And 2's Complement of
Binary Number
Two’s Complement Method

• Calculation of 2's Complement

 Logic Gates
• There are seven logic gates:
AND, OR, XOR, NOT, NAND, NOR, and XNOR.

• There are three basic types of digital logic gates

• AND Gate
• OR Gate and
• NOT Gate

• Universal gates
• The NAND gate and the NOR gate both are classed as “Universal” gates as they can be used to
construct any other gate type.
• Any combinational circuit can be constructed using only two or three input NAND or NOR gates.

• Exclusive Gates
• EX-OR
• EX-NOR
AND GATE
• The AND gate has two or more inputs and one output signal.
• This is a gate which performs a logical operation
multiplication, which is commonly known as AND function.
• This gate is called an AND gate because the gate gives output
will be high when all input values are high the output is low
or 0 when any of the inputs are low or 0.
• The symbol of AND Gate & Truth Table is shown below.
OR Gate
• The OR gate has two or more inputs and one output signal.
• A logical operation or addition, which is commonly known as
OR function.
• This gate is called an OR gate because the gate gives output
high only if any or all input values are high The output is low or
0 when both the inputs are low or 0.
• The symbol of OR Gate & Truth Table is shown below.
NOT GATE
• Single input and a single output
• Known as an inverter, because it does the inversion of
applied binary signal at the
• The symbol of NOT Gate & Truth Table is shown
below.
NAND GATE
• Has two or more input terminals and one output terminals.
• Cascade combination of AND – NOT gates.
• The output of NAND gate is high or 1 when any one input is
low or 0 and the output is low or 0 when all inputs are high
or 1.
• The symbol of NAND Gate & Truth Table is shown below.
NOR GATE
• Has two or more input terminals and one output terminal.
• Cascade combination of OR – NOT gates.
• The output of NOR gate is high or 1 when all the inputs are
low or 0 and the output is low or 0 when one or all inputs
are high or 1.
The symbol of NOR Gate & Truth Table is shown below.
Exclusive- OR (EX-OR) GATE:
• This gate has two or more input terminals and one output terminal.
• The EX-OR Gate has the output only high when an odd number of
inputs are high and the output is low when both the inputs are low
and both the inputs are high.
• The symbol of EX-OR Gate & Truth Table is shown below.

• Y=AB+AB
Exclusive- NOR (EX-NOR)
GATE
• The EX-NOR gate has terminals like OR gate i.e, two or more
input terminals and one output terminal.
• The EX-NOR Gate has the output only high when both the
inputs have the same values either high or low and the output
is low when an odd number inputs are high.
• The symbol of EX-NOR Gate & Truth Table is shown below.
• Y=^A^B+AB
Logic gates IC nos
 De-Morgans Theorem

• Complement of the sum is equal to product of individual

complement

• Complement of the product is equal to sum of individual complement

DeMorgan’s First Theorem
Boolean Laws
• Prove the foll
• F(A,B,C)=A′B+BC′+BC+AB′C′ = B+AC’
• (A+B)(A+C)= A + BC
• A’B’C+(A+B+C)’+A’B’C’D=A’B’
SOP and POS form
Write the SOP and POS equations for
the following
• Y=∑m(2,7,9,12) = 0010 0111 1001 1100
• SOP-> 0010-> A’B’C D’
• -> 0111->A’BCD
• ->1001->AB’C’D
• ->1100-> ABC’D’
• A’B’C D’+A’BCD+AB’C’D+ ABC’D’

• Y= Π(4,5,10,11,14)
• Y=∑m(1,2,7,8,9,12)
• Y= ΠM(3,4,5,10,11,12,14)
• Y= ΠM(4,5,10,11,14) = 0100 0101 1010 1011 1110
• 0100->A+B’+C+D
• 0101-> A+B’+C+D’
• 1010-> A’+B+C’+D
• 1011-> A’+B+C’+D’
• 1110-> A’+B’+C’+D
• (A+B’+C+D) (A+B’+C+D’) (A’+B+C’+D) (A’+B+C’+D’ ) (A’+B’+C’+D)
Minterms and Maxterms
Practice examples
• Express the following Boolean function in a standard SOP form and POS form

Solution:
Practise Examples
• Convert F(X,Y,Z) = ∑(1,4,5,6,7) into Maxterm.
Karnaugh Maps --- K maps
B B

A
A
• Draw the K map for the following
 Grouping in K maps
• Draw K map for following truth table
Assignment Question Bank
Q.1 Solve the following
Problems
1. (58.25)10 = (111010.01)2 11. (1101.11)2 = ()grey
2. (101110.01101) = (46.40625)10 12. (55.63)10 = ()X-3
3. (1A5.2)16 = (421.125)10 13. (111101.101) X-3 = () BCD
4. (65.4C)16 = (145.23)8 14. 1’s complement of -25
5. (145.23)10 =(221.1656050)8 15. Twos complement of -36 is
6. (126.564)8=(86.726562)10 16. Add 11011+10101+11111
7. 2861.3210 = (B2D.51EB851)16 17. Sub 11011-10101-10001
8. 11101001.112 = (E9.C)16 = (351.6)8
9. (45.824)10 = ()BCD
10. Grey Code of 01001 is
2. Prove De-Morgans theorm
3. Explain the truth table of basic logic gates and universal gates
4. Explain different Boolean laws
5. Convert the following SOP expression to an equivalent POS expression.

6. From the truth table below, determine the standard SOP expression.

7. From the truth table below, determine the standard POS expression.
8. Convert the following SOP Boolean expression to POS form F =X'Y +YZ'+XY'Z?

9. Convert F = ∑ x, y, z (0, 2, 3, 5, 7) to POS

10. Convert the POS function F = Π x, y, z (2, 3, 5)

to SOP
11. Convert F = (p' + q + r) * (q' + r + s') * (p + q' + r' + s) in to standard POS

12 Convert F = AB+ AC+ABD in to standard POS and find minterms and maxterms

13. Use a Karnaugh map to minimize the following SOP expression

14. Map the following standard POS expression on a Karnaugh map:

15. Using a Karnaugh map, convert the following standard POS expression into a minimum POS expression,
a standard SOP expression, and a minimum SOP expression