Fundamental of Electronics Engineering Unit 4(Digital Electronics)

Miet
BEC101/201
135 Milt
BEC101/201
Fundamental of Electronics Engineering Unit 4 (Digital Electronics)
Electrorics?
What de we study in Digital 4.1. Introduction of Number system
This unit consists of introduction to Number system, number system conversion, Boolean algebra and A number system defines how a number can be represented using distinct digits or
is iaws fundamental of basic and universal gates, SOP and POS representation of Numbers and symbols.
Introdaction to Karnaugh Map (K-Map) A number can be represented differently in different systems. For example. the two
numbers (2A) and (52) both refer to the same quantity. (42) .but their representations
Why do we need Digital Electroics? 16
are different.
Dieital electronics is the foundation of modern computing and telecommunications. It encompasses a Number systems include decimal, binary, octal and hexadecimal
wide range of device and technclogies, including microprocessors, memory chips, digital signal
prooessors (DSPs) and igital circuits like logic gates, fip-flops, and counters. The primary advantage Number System Base Symbol
of digitalelectronics is its ability to store, process, and transmit data with high accuracy and reliability.
Base 2 B
This field is essential for designing and understanding computers, smart-phones, digital communication Binary
svstems, and manyother clectronic devices that are integral to today's technology-driven world.
Octal Base 8
Where do we ase Digital Electronics?
Decimal Base 10
Digital electronics is pervasive ineveryday life and technology, impacting a wide range of fields. For
instance, it is fundanental in computers and microprocessors, where binary logic and digital circuits are Hexadecimal Base 16 H
systems, digital
used to perforrn computations and process data efficiently. In communication smart-phones
clectronics ensures the accurate transmission and reception of signals in devices like and Table 4.1. Different number system with base and symboi
network infrastructure. It also underpins consumer electronics, including televisions, digital cameras,
digital signal 4.1.1. Decimal Number System:
and audio cquipment, by enabling advanced features and improved performance through used in industrial
processing Additionally, digital electronics plays a vital role in control systems
Embedded systems,
automation and robotics, facilitating precise and reliable operation of machinery. In floating point numbers the position is defined as 0,1,2.3,4,5,. starting from the radix point and
provide specialized
which are found in 2ppliances and medical devices, rely on digital circuits to moving one position at a time towards left, and -1,- 2,-3, ...starting from the radix point and moving
[Link] learning about these applications carly on, students can appreciate how digital electronics towards right one position at a time.
in their field.
shapes technology and prepares them for more advanced study and innovation Position Place
2 1 -1 -2
Value

Digits
10 2

4
10

3
100

6
Radix 8
102

Fig. 4.1. Decimal Number representation

436.85 =4 x 100 +3 x 10 + 6 x 1 .8x0.|+5 x0.01

4.1.2. Binary Number System:

(text, images and others) data in
" Computers store numeric (numbers) as well non- numeric
binary representation (binary number system).
Fundamental ef letrenies Fngtneering Miet Uait 4(Digital Electronics)
Unt 4(Dlgital kHectrontes DBC101/201 Pundamental of Klectronles Engineerlng

4.2.1TypeofGates
(1) E) (B) (2) () Basle gate%, AND, OR,N T
Universal gates: NAND and NOR
" Derived gates: EXOR and EXNOR

0001 1110 1011 0010 1111 I. NOT Gnte

The NOTgate produces an invered version ofthe input at its output.

I is also known as an inverter.
Symbol:

Questions for Practics:: NOT

Quesl: Coeverion (AKTU 2023-24) Fig.4.3. Symbol
a) Convert the decimal number 45 to its
b) Conven the binary number 101101to binary cquivalcnt. Truth Table:
Ques2: Conversion (AKTU 2022-2023) hexadecimal.
a) Convert the hexadecimal number iA3 to its binary and
decimal cquivalents.
NOT gate
b) Convert the binary fraction 101.101 to A A
Ques3: Converion (AKTU2021-2022) decimal.
a) Convert the octal number 657 1o binary and then to
decimal.
1
Quesd: Conversion (AKTU2020-2021)
a) Perfom the conversion from decimal 29.25 to binary. 1 0
b) Convert the binary number 1010)0.1101 to its hexadecimal Table 4.4:Truth Table
c) Conven the octal number 234 to binary and hexadecimal. cquivalent. 2. ANDD Gate
Quess: Conversion (AKTU2019-2020) The AND gate is an clcctronic circuit that gives a high output (1 ) only if all its inputs are high.
a) Coftvert the binary number 1011.10l to its equivalent in octal and Adot (.) is used to show the AND operation ie. A.B. Or AB
b) Periotm the conversion of the decimal number 475 to its octal [Link]. Symbol:
Ques6: Conversio (AKTU 2018-2019)
a) Convert the decimal number 198 to hexadecimal.
b) Convert the hexadecimal number A2F to binary and then to decimal. A
Ques7: Conversion (AKTU2017-2018) B
AB
a) Explain the process to convert a floating-point binary number to decimal. Give an example.
b) Convert the following mixed-radix number to decimal: (3A4)1o. AND
4.2. DIGITAL LOGIC GATES: Truth Table:
Fig4.4. Symbol

Boolcan functions may be practically implemented by using electronic gates. 2Input AND qate
Electronic gates requireapower supply. A A8
Gate INPUTSare driven by voltages having two nominal values, e.g. 0V and 5V
logic Oand logic I respectively. representing 0
The OUTPUT of a gate provides two nominal values of voltage only, e.g. 0V and 1 0
5V
representing logic 0 and logic I respectively. In general, there is only one output to a logic gate
except in some spccial cases.
There is always a time delay between an input being applied and the output responding. 1
These gates are the AND, OR, N T, NAND, NOR, EXOR and EXNOR gates. Table 4.5: Truth Table
 ofElectronisEnngineering Unit 4(Digital Electronics) Miet
BEC101/201
43
miet
BEC101/201

Fundamental of Electronlcs Engineering Unit 4 (Digital Electronics)

that gives a high output()if one or more of its inputs are high. 5. NOR Gate
circuit
clectronic
operation.
This is a NOT-OR gate
Kan the OR The outputs of all NOR gates are low if any of the inputs are ngn.
show
dlo
Symbol:
A -A+B
A LA+B B
B NOR
OR Fig.4.7. Symbol
Fig.4.5. Symbol Truth Table:
2Input NOR gate
A B A+B
2Input OR gate 1
A B A+8
00 1
0 11 0
Table 4.8: Truth Table
4

both, of its wo
1 if either, but not
11 6. EXOR Gate
a circuit which will give a high output
gate is
Table 4.6: Truth Table The 'Exclusive-OR'
inputs are high. ExOR operation.
An encircled plus sign (
)is used to show the
NAND Gate
Symbol:
ssa NOT-AND gate inputs are low.
kouts of allNAND gates are high if any of the A -AOB
inversion.
Tk Smal circle represents B
o EOR
A Fig.4.8. Symbol

B Truth Table:
2Input EXOR qate
NAND AB A98
Fig.4.6. Symbol

01 1
Tahle:
10 1
2 Input NAND gate
AB 1|1
A Table
Table 4.9: Truth
0 1
7. EX-NOR Gate opposite to the EOR
gate.
1 'Exclusive-NOR'gate
circuit does the inpuis are high.
The not both, of is two
output if either, but
0 It will give a low

1|1
Truth Table
Table 4.7:
Fundamental of Electronics
The svmbol is an EXOR
Engineering Unit 4 (Digital Electronics) Miet
BEC101/201 Fundamental of
Electronlcs Engineering
Unit 4 (Digital Electronlcs)
Simbol gate with a small circle on the output.

A Ad
-A©B Bd
Fig.4.11. NAND as a NOR gate
ENOR
Fig.4.9. Symbol
Truth Table
[Link] ASs OR GATE
2Input EXNOR gate A'

B A98 (A".B''
00 1 3
1
2
1|0 B

1|1 1 = (A.B')'
= (A"+B")) = A+B
Table 4.10: Truth Table
[Link]. niversal Gates: Fig.4.12. NAND as a OR gate
Auniversal gate is a gate which can 4. NAND AS AND GATE
type. implement any Boolean function without need to use any
other gate
The NAND and NOR gates are
universal gates.
This s advantageous since NAND and NOR
basic gates used in all IC digital logic families. gates are economical and easier to fabricate and are the
NANONOT-AND
NAND GATE IMPLEMENTATION
[Link] AS NOT GATE
=A'. A'
A
-A'

Fig4.10. NAND as a NOT gate

2. NAND AS NOR
Fig.4.13. NAND as a AND gate
NOTNOR
[Link] AS XOR GATE

O CATE
 Miet milt
Engineering
Unít 4(Digital Electronics) BEC101/201
J47 BEC101/201
emental of
Electronics
Fundamental of Electronics Engineering Unit 4(Dtgjtat Electronics)
2. NORASAND GATE
· A. AEB.(A-B)
A.A.B"B.
=A+B
[Link] NOR GATE
ANO GATE

Y=A-B A8
2
[Link]

DED
Y =

J. Y=AGB
A-B
B.A.B
B
Fig.4.14. NAND as a EXOR gate
Fig.4.17. NOR as a AND gate
ENAND ASXNOR GATE
[Link] 3. NOR AS NAND GATE
A

B
DE [Link]
A.B " AB
AND
= A+B

NOT NAND
Fig.4.15. NAND as a EXNOR gate

º NOR GATE IMPLEMENTATION

Y=A+B
A-B
NOR AS NOT GATE A-B
The n drcle reresents ineon

NOT gete
NOR gee
Symbol Fig.4. 18. NOR as a NAND gate
Synbol
4. NOR ASs OR GATE
y"A
-
NOT Gete vsing NOR Gote NOR - NOT- OR
Fig.4. 16. NOR as a NOT gate
Fundamentai ef Elextronics Miet 149 Unit 4 (Digital Electronics)
Engineering Unit 4(Digital Electronics) Fundamental of Electronics
Engineering

BEC101/201 only.
half-adder circuit using NAND gates
2. Design a for a 2-input XOR gate
- A+B Draw the truth table and output waveform
Prove them using truth tables and
3. Morgan's theorems?
Ques2: What are De \ogic
2022-2023) gate. Provide its truth table,
operation of a 2-input AND circut symb
Ques3: Describe the
equation. (AKTU 2021-22)
A+8 gate? Explain the difference between [Link] sequental
Ques4: What is a logic
2020-21)
with examples. (AKTU 3-input OR gate. Draw the logic circuit
Ques5: Write the truth table for a diagram À
Fig 4.19. NOR as a OR operation. (AKTU 2019-20)
S NOR AS EX-OR
GATE gate universal gate. Use it to implement basic
Ques6: Prove that NAND gate is a
NOT). (AKTU 2018-19)

4.3. BOOLEAN ALGEBRA:

AY =AB+AB
DR GATE
4.3.1. Rules in Boolean Algebra:
Variable used can have only two values.
NOR NOT OR Binary 1 = HIGH and Binary 0= LOW.

Y- AB+AB Complement of avariable is represented by an overbar (V(). Thus ifB=0 ie h.

=1then B'=0.
Y= AB+AB+A ADianaior " Logical ORing of the variables is represented by a plus (+) sign between them F
Logical ANDing of the two or more variable is represented by a dot between hem E.
Y= AA+B}+BIA+B) or ABC.
Y= B 4.3.2. Boolean Law:
Y= A+A+Bj+B+A+B )). Commutative law
BA+ Any binary operation which satisfies the following
Fig.4.20. NOR as a EXOR gate Commutative law states that changing the sequenceexpression is referred to as commutatve ipera
of the variables does not have amy efk:
6. NOR AS EX-NOR GATE output of a logic circuit.
(). A.B = B.A (ü). A+B = B+A
Y=
A+(A+B) +B+(A+B) 2) Associative law
This law states that the order in which the logic
the same. operations are performed is irrelevant s tet
A(AB) (). (A.B),C= A.(B.C)
(ii). (A+B+C= A+(B+C)
3) Distributive law
o-Y= AOB Distributive law states the following
condition.
BA+6)
A.(B+C)= A.B+A.C
4) AND law
Fig4.21. NOR as a EXNOR gate
These laws use the AND operation.
Quesl: Gales queston (AKTU 2023-2024) (i). A.0 =0 Therefore they are called as AND laws.
1. Deffnc universal gates. How can NAND (iii). A.A =A (i). A.i = A
gate be used to implement an OR gate? (iv). A.A' =0
 miDt

ttves uestuns n Bosdean Lans (AKTLS 2N22 2)

s/pss AKT N2223)

(AKIE W2221)

44 Binary AdaitnN

ii(cary) - 19 (wrE cry 1)

 Fundamental ef Eletromis Unit 4 (Digital Electronics)
Engineering Unit (Digital Electronics) Miet Fundamental of Electronics
Engineering

4.5 Complement Representation: BEC101/201

Subtraction:

d. 2'sComplement
& Cempecme Reresentatiea:
In i's mplecnt Steps:
by inverting its bits and adding I.
nvertmg a the bits pstve numhen arg nenresented as ususl,
ef the ostie while negative numbers are I. Findthe 2's
complement offthe subtrahend
to the minuend.
oHunterpart obtalned oy 2 Add this 2's compie The remaining result is your answer.
Exapbe 5 and -5 asng 4hits 3. If there is a
carry,
numbers.
(0101)from 9 (1001) using 4-bit
Example: Subtract 5

-SlnpiemoNt of -) I. Minuend (9): 1001

Bnar 1010 2. Subtrahend (5): 0101
3. 2's Complement of 5: 1010
h 2Cemptemeet Representation: o l'sComplement of 5:
o Add1: 1011
to Minuend:
in Vlencni cgatcnumbers are represented by lak1ng 4. Add 2's Complement
then sádng l the l's complement off the number and
1001
xampc $ anc - sng 4bitN + 101I

10100(Carry out)
Bnary 0101 decimal
$(2soomnkemont of S) FinalResult: Discard the carry, leaving 0100, which is 4 in
Sacp t 'scompement of O101 = 1010
Sacp 2 Add I to i010 = 10I e. 9's Complement:
The 9's complement of a decimal number is found by subtracting each digit from 9.
I'Ceapteascet Suhtraction: simplify the subtraction process by turming subtraction into addition.

Example: Find the 9's complement of 4652.

I Fnd x soamnieent of the subtrahend (the number being
2 Add ths I's compiement te the mnuend (the number from which subtracted). Subtract each digit from 9:
you are
here s a carry, add the cafry back to the result (end-around carry), Ifsubtracting).
o 94=$9 - 4 = 59-4=5
3
the is compiemons of the result there is no carry, take o 9-6=39 - 6= 39-6=3
9-5=49-S =49-5=4
o 9-2=79 -2 =79-2=7
Exampie Subtra $(0101;from 9 001)using 4-bit numbers.
Manucnd (9) 4001 The 9's complement of 4652 is 5347.
2 Subsrahcnd (S 0101
3 sonplenent of S 010 (. 10's Complement:
4 Add Is Complecnt e M
imucnd
I01 The 10's complement of adecimal number is oblaincd by adding 1to its 9s complement. It is ofes
directly for subtraction without necding an cnd-around carry. similar to the 2's complemcnt in bas
Example: Find the 10's complement of 4652.
i (Ne carry, take I's conplenent)
I. Find the 9's complement: $347.
tnat Resut: l's compienscat of 011 sJ00. whch Is 4 in decimal. The result is -4 when 2. Add I: S347 + | $348.
subractung from $. ndcatisng the seed to borow bits
So, the 10's complenment of 4652 is $348.
AndamentallofElectronics Engineering Unit 4 (Digital Electronics)
Miet
BEC101/201
155
Miet
BEC101 /201
Fundamental of Electronics Engineering Unit 4 (Digital Electronies)

& Usage in
Subtraction:
SOP form: F(A,B,CEA+BC'+A'BC
complement: The variables in cach term are not necessarily all the variables of the function
or 10's
Tsubtract using 9's
9's Complement: Add the 9's complement of the subtrahend to the minuend. If there's a carry.
4.6.2. Standard or CanonicalSOP Form:
complemented form or in
result. StandardSOP term must contain all the function variables either im
add it to the
At Complement: Add the 10's complement of the subtrahend to the minuend. If there's a uncomplemented form.
either in complemented form or in
r it's discarded, and the result is positive. lf there's no carry, the result is negative, and the A product term which contains all the function variables
answer must be in its 10's complement form. uncomplemented form is called a minterm.
F(A,B,CEAB'C+A'BC'+A'BC

Erample of Subtraction Using 10's Complement: F(A,B,CEm (2,3,5)

Subtract 4652 from 7200 using 10's complement.
Minterrns & Maxterms for 2 varabies
1. 10's complement of 4652 is 5348. " Two variable minterms and naxter ms
2. Add S348 to 7200:
Index Mintermn Masten
7200
0
+ 5348
m, =Ty
12548 M,-+-y
Discard the carry (1), leaving 2548.
3 M, - - 7
So, T200-4652=25487200 - 4652 = 25487200-4652-2548.
The minterm m, shoukd evaluate to 1 for each
Questions for Practice: combination of s and y.
Quesl: Convert the decimal number -13to an 8-bit 2's complement binary number. Show all steps . The mmxterm is the complement of the minterm
including the binary representation of the positive number and the 2's complement conversion. (AKTU
2021-22)
Ques2: Represent the decimal number -7 in an 8-bit l's complement fon. Show the steps involved in Fig.4.22. Min-tems and Max-terms
converting the number to binary and its 1's complement form. (AKTU 2021-22)
Ques3: Find the result of 1011_2+1101_2 using 2's complement arithmetic. Show all steps including 4.6.3. Standard or Canonical POS Form:
handling overflow and carry. (AKTU 2023-24)
Ques4: Compute the result of 1110 2 + 0011 2using l's complement arithmetic. Demonstrate all POS fom means that the inputs of each term are Added together using OR function then a
intermediate steps including carrying and final correction if necessary. (AKTU 2023-24)
terms are maltiplied together using AND function.
The variables in each term are not necessarily all the variables of the function.
4.6. Boolean Function Representation: POS fom:
F(A,B,CFA(B+C).(A+B+C)
Various way of representing a given function
1- Sum of Product Form (SOP)
2- Product of Sum Form (POS) 4.6.4. Standard or Canonical POS Form:
3- Standard or Canonical SOP Fom
4- Standard or Canonical POS Form Standard POS tem must contain all the function variables either in complemented fomn
5- Truth Table Form uncomplemented form.
A sum term which contains all the function variables either in complemented form
4.6.1. SOP Form: uncomplemented form is called a maxiem.
The Sum of Products is abbreviated as SOP. F(A,B,C{A+B'+C)(A+B+C)(A+B+C)
It is the logical expression Boolean algebra where all the input terms are ANDed (Product)
first and then ORed (summed) together. F(A,B,CF IIM0,3,4)
 Unit 4 ((Digltal Sleetroniea)
Miot of Flectrontcs
Engineering

BEC101/201 hundamental
C)-m4,56,7) to POS FORM
n,
Ouerd:- (overt FA, mintermeems
ofmaxterms

Misíng terme of mntems

Ans maNems terms of
Missing tems of *M(O,2,3)
.45.6,7)
HA, BC)- Fy'+y'tvz
Quess-Convert Boolean
expression instandardfom
Ans. Fy''tNyz
F-(ry'+x(yty')e' txyz
Fy(zt2')xy(z+2' yyz'+xy'z'txyz

A4-8l-nÀNA8R}(AB) F-\y'z+ Ny'z'+xy'z+'y'2'+ yz'try'z'+xyz

Fm$, m4, ml, mo, m6, m4, m7

F Sm (0,1,4,5,6,7)

u-Erh Rookcan tunt Questions for Practice:

F-A BCasdard sum of
minterts. Quesl: Convert the Boolean function: F(A,B,CFAB+AC to its canonical Sum of d
4 A8ABYC
-C- AR+ABC'+ ABC+ ABC
fom. (AKTU2019-20)
Ques2: Convert the Boolean function: F(A,B,C)=AB+AB'C to its canonical Product of S
F=A8- ABC - A8C - ABO AB form. (AKTU 2019-20)
Ques3: Convert the Boolean function: F(A,B,C,DFAB+AB'C+ACD to its canonIc S
e-Exares the Baolcan funaon F=(A+B`XB+C)s a (SOP) formm. (AKTU 2021-22)
E(A-88-C) product of nav-tems Ques4: Given the Boolean function: F(A,B,CFA+B°C Convert it to canonical Produxt of Sa
form (AKTU2021-22)
-(A-8CHA-B-C) Quess: Convert the following function to canonical SOP form: FA,B,[Link]-ABCD-
emB-C=(AAB-C) (AKTU 2021-22)
=(A-B-C(A-8-O Quesó:Convert the following function to canonical POS fom: F(A,B,[Link]+BYAC-)e
Combenng boch (AKTU2021-22)
F(A-BChA-BC)A-B-C)(A+B+C) Ques7: Given the Boolean function: F(A,B.C=AB+BC Find the canonical SOP om. (AT :
=M2S MO M4 24)
= IM0234)
4.6.5. Truth Table Form:
Qeei: - Exgros the Boolcan funtion F= xy +x'z saproduct of maxterms
RsF = y Use of truth tabie to show all the possible combinations of input conditions that wil producs
lin case of SOP expression andO in case of POS.
=(1yxx Zy +z) Example: Generate truth tabie for F= xy + x'z.
INPUTS OUTPUT

=(x-y Z7x' y+z') 0

0 0
"z=y z u
=(x*y* Lðx tyt )
"F(x*} rIxytzx* *y*z7x *ytz) )
=MOM2*M4*M5 0
- 0245)
Table 4.I:Truth Table
Aamdamental of Electronics Engineering Unit 4 (Digital Electronics)
Miet
BEC101/201 Unit 4 (Digital Electronics)
Miet
BEC101/201
Fundamental of Electronics Engineering
MINIMIZATION:.
1L. KARNAUGH MAP 7. Wrap around is allowed.
8. Get the fewest number of groups possible.
provides asystematic method for simplifying Boolean expressions and, if prope+ty
4Karnaugh map
oducethe simplest SOP or POS expression possible, known as the minimum expression. A
hv sen, the effectiveness of algebraic simplification depends on your familiarity with all 1

bws,rules, and theorems of Boolean algebra and on your ability to apply them. The Karmaugh o 0:
map, on the other
. provides a"cookbook" method for simplification.
hand,

Kanaugh map is similar to a truth table because it presents all of the possible values of input
A 2IGHT
aribles and the resulting output for cach value. Instead of being organized into columns and rows RIGHT / WRONG X
wRONG X
Rea truth table, the Karmaugh map is an array of cells in which cach cell represents a binary value
fthe input variables. The cells are arranged in a way so that simplification ofa given expression is A
simply amatter of properly grouping the cells. Karnaugh maps can be used for expressions with two,
11 10

three, four. and five variables. Another method, called the Quine-McClusky method can be used for \43, 10 ABM 01 11 10
higher numbers of variables. Lefmot tell F t t cel

input variable
The number of cells in a Karnaugh map is equal to the total number of possible of cells is 2' =
combinations as is the number of rows in a truth table. For three variables, the number
&For four variables, the number of cells is 2 = 16. RIOHT V WRONG X Botam cel

Fig.4.23. Grouping in K map

LGaide To The K-Map (Karnaugh Map):
find expression with minimum variables.
In many digital circuits and practical problems we need to 4.7.1. K Map: 2 Variable K map:
variables very easily using the K-map without
We can minimize Boolean expressions of 2, 3, or 4
can take two forms Sum of Product (SOP) and
Using any Boolean algebra theorems. The K-map
problem. The K-map is table-like representation
roduct of Sum (POS) according to the needs of the
A. SO9 8. POS:

information than TRUTH TABLE. We fill the grid

of K-map with 0's and l's then
but it gives more
solve it by making groups. A 0 A+9 A+B
2 Steps to solve expression using the K-map:
1. Select K-map according to the number of variables. A AB AP

2 ldentify mintems or maxterms as given in the problem.

respective to the minterms (0's elsewhere).
3. For SOP put l's in blocks of K-map Fig4.24. 2 Variable K map
blocks of K-map respective to the maxterms( l's elsewhere).
+. For POS put 0's in ..(except 1) and try
containing totalterms in power of two like 2,4,8
Make rectangular groups
to cover as many elements as you can in one group.
the product terms and sum them up for
SOP fom. 4.7.2. KMap: 3 Variable K map:
O. om the groups made in step S find
B
3. Groaping Rales: 01

grouping
for the simplification of expressions by
Lhe kamaugh map uses the following rules ABC AC ABC APC
A

ogether adjacent cells containing ones

L No zeros allowed
2 No dagonals. AB' AB'C ASC ARC

3 Only power of 2 number of cells in cach group.

4. Groups should be as large s possble.
5 Evervone must be in at least onc group sOP(MENTERMS)
6 Overtapping allowed
Fundamental of Electronics Engineering Unit 4 (Digital Electronics)
Miet 161
Fundamental of Electronics
Engineering Unit 4 (Digital Electronics)
BEC101/201
In POS form (B+C)(A+ B)(B +C)
f-01.23) -Ã 1 1 1 0
00 01 11 10 00 01 11 10 01 10 11
1

Nm (1,3,2)

Answer : (A+C)(A+ B)
(-i46)- AC f- S(02)-AC f-z0246)- Fig.4.27.

BO BO
00 01 11 10 00 01 11 10 00 01 11 10 Ques3: Simplify the sop function F(A,B,C) - E (1,2,3,7)
Ans.

BC BC BC BC BC F=F,+E,t F,
Fig.4.25. 3 Variable K map A F- F,- F%0
Solved Numericais : F=
Qeesi:
2=21136J
ABs. Fig.4.28.
F(A,B,C) =A'C+A'B+BC
4.7.3. K Map: 4 Variable Kmap:
CD
C
Ag
AA

|A'B'CD Aco ASCD A'CO

A'B CACoACO
A'BCO

Fig4. 26. AB 11
A8C'' ABC'O ABCD ASCD

ZIAB,C-AB"ÁC
AS
AB'C'D' ASCO AS'CO ASCO A
A
Ques2:
F-n(1,2,3) soPNNTERNS) POS(NANTERAS)

ASs.
Fig. 4.29. 4 Variable K map
 miet
Gnit 4(Dgl Bectromies)
Miet
d E e t r s i s Engpneering
BEL101/201
Sstved Nmerak:
HWYZ) -fK3,7.12,1 3y

Fig4.M
4.74. Don't care onditionsz
(WXY7) - IM),14552912.13 14)
(H mmal redt f the surrne for the functkn
wiceer s n f e s e
cncs
the t tto be hez
In thee caeS We an chE
1

ABCD

1
C

Fig 4.28.
FYOX+Z)
10,1,2,5,%,9,10)
the funtion: F(WX,YZ}=
bain minimal product of the surs for

1 1

(a) Trà ebe ee s s a s A CD

WX' Fig 4.3} Don' t care condton
Fig4.31.
Quesl: Sirnplify given function wth the help of K-Map. DABCD+ARCD-ABCD
F (x'zw x'y ) WY + W'YZ' F=A'B'CD+ABCD+A BC D+A BCD+ABC D+ABC
(sest. Simplify K-Map. F= WX'Y'+
gIven function with the help of
[Link]' + WY + W'YZ
- WX*Y(Z+Z'ywYX+x+WYZKX)
WXYy+ W'XYZ' +W'X'YZ
W*YZ*Wx'YZ'+ wXy+
 miet

Fig437.

ngK-Map d iplemet sing NAND ty

psers: samgiy gNn functn
F= ]2347.1 1.13)-a915)

ezgressEWbe n he iorm ofSOP The K-mp min I2tion of the

gives functs s

01 11 10

1 1 1
1

11 1
10 1

Fig4.38.
F=ad d- a'b'd +abe- a be'd
eng g nn Ssr ABC,Dy- M6.7.8.9, +a12. 12. 14. 15)

Fig4.39. Implementation using NAND gate

 Miet miet
Unit 4(Digital Electronics) 167 BEC101 /201
Electronics
Engineering

BEC101/201 Fundamental of Electronics Engineering Unft 4 (Digtat Electronics)

alof BCD E
Kmap:
- A ' R ' C E + A B c p E A B C D F + A C D E A B C D E + A

Variable
uesz: F(A,B,C,DE)
Map: S ABCDE+ AB'C'D'E'+AB'C'D'E+ABCD'E+ABCDE+ABCDE
A A Ans.

DE DE
11 10 BC 00 01 11 10
R C0 01
00 m6] mË7 my9 m8 on ACDE

01 m m6 01 M20 m21 m3 m22 11

1
A0
11/m12 M3 ism 11 m8 m9m31 M30 BCE

| Fig.4.42.
10| m 9
F(A,B,C,D,E) = A'D'E' + B'C'D' +
BCE + ACDE

Fig 4.40. 5 Variable K map

4.7.6. K Map: 6 Variable K map:
m
m m m m. m m
Mo, M16, M21, M3, m4, M27, M31) Quesl: F = (m, m,, m. m, "o 16
t: F(ARCD.E) =) (mo, M2, ms, M7, ms, m
63

Ans.
A A
EF. 01 11 10
CD
DE 1
DE BC00, 01 11 10 00

BC 01 10 01

11

001 00|1 11 1

1
101
11
10
01 0 11 0
01 0 1 1 1 o

01

11
11| 0 1 1 10

Fig.4.43
10 0
16 0 1 F=D'F' + A'B'CE'+ A'CE'F + BÇDE + AB'EF

Ques2: t8.20,'A632,34,40,4142,4S,47,48,SsO S6,S7,$8.60,61)

FAT+oF +6CE +ABDE F([Link],D,E,F) =Y0,24,8,10,13,15, i6,
Ans.
Fig.4.41.
 Pandamentalof Eectrontcs ngineering Unit (Digital ilectronies)
Miet
BEC101/201

Fig.4.44.
FDF+ACE'+BCDF+ACEF+ABCE+A'BC'DEF

Questions for Practice:

Quesl: Simplify the BooBcan function
Also implement using NOR gte only. using a 4-variable K-map and express the result in
Ques2: Usng a K-map, derive the POSF(A.B,C,D=(1,3,7,11,15) (AKTU 2023-2024) SOP form.
function: F([Link]\0.l4.8,9) fom and implement using NAND
(AKTU Gate only for the following
Ques3: Given a S-variabie Boolean 2023-2024)
RAB.C=S0.1.5.7) (AKTU 2022-2023) function, draw the K-map and find the
Ques4: Simplify the following Boolean minimal SOP expression.
POS fom function using a 4-variable K-map and
[Link].DFN2.[Link])
Quess: Simplify the Booiean (AKTU 2022-2023). express the result in
function using a K-map and
F(A.B.CDF02.6.8.10,14)
Quesb: (AKTU 2021-2022).
Constructa 3-variabie K-map for the given
derive both SOP and POS forms.
using NAND gates only. function and express it in POS form and
Ques7: Simpl1ty the givenF(A,B,C=N(1,2,4,5)
Boolean
(AKTU 2021-2022). implement
care conditions. Aiso impicment function using a 4-variable K-map in SOP
using NAND gates only. form considering don't
2020-2021 ). F(A,B,C,D)E(1,3,7,11)+d(2,10,14) (AKTU
Ques8: Derive the SOP form
for the following Boolean
F(W,X,YZ-l0.24,6.8.10) (AKTU 2020-2021)
Ques9: Using a K-map, simpify the
function using a K-map.
using basic gates. Boolean function and express it in POS
F(A,B,CF02,4,6)
Quesl0: Constnuct the K-map and(AKTU 2019-2020) form. Also implement
find the minimal POS
F(A,BC.D-M,5,9,13)(AKTU
Quesii: Using a K-map. simplify a 2019-2020) form for the given
function.
impiement using basic gates. 4-variable Boolean function and express it in
Quesl 2: Draw the K-map FA,B,C,DF3,7,1
for the
1,15) (AKTU2018-2019) SOP form and
NOR gate oniy. given function and simplify it into POS
F(AB,C,D-TkI3,5,7, 13,1S) (AKTU 2018-2019) form and implement using