Page 243 - FUNDAMENTALS OF COMPUTER

NPP Number System, Boolean Algebra and Logic Circuits 243

Now, perform the second operation: Cnamoº$ n[anW na H«§$. 2 H$s {H«$`m H$aZo na:
A B C

F

Now, perform the third step: Vrgar {H«$`m H$aZo na…
A NPP C
B

F

(ii) NOR-NOR Implementation: (ii) NOR-NOR Båßbr_|Q>oeZ…
Consider the POS Form: POS ê$n H$mo boZo na:

F = (A+ B+ C ) (A. + B+ C ) (A. + B+ C )
The NOR implementation Circuit can be {ZåZ VrZ {H«$`mAm| go NOR Båßbr_|Q>oeZ àmßV
obtained in three steps-
{H$`m Om gH$Vm h¡:
Step 1: Draw logic Circuit using Basic Gates. Step 1: _yb^yV JoQ>m| go Vm{H©$H$ n[anW ~ZmAmo Ÿ&

Step 2: Convert OR into NOR. Step 2: àË`oH$ OR H$mo NOR _| ~Xbmo Ÿ&
Step 3: Convert NOT and bubbled AND into Step 3: NOT VWm ~~ëS> AND H$mo NOR _| ~Xbmo Ÿ&
NOR.