in Digital Logic edited by
14,127 views
45 votes
45 votes

Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$.

 

Assume for all inputs $\left ( a,b,c,d \right )$, the respective complements $\left ( \bar{a}, \bar{b}, \bar{c}, \bar{d} \right )$ are also available. The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .

in Digital Logic edited by
by
14.1k views

4 Answers

61 votes
61 votes
Best answer

From K-map simplification we get the min-term as $CA'$. So We can simplyfy it for NOR gate expression

I.e. C' NOR $A = (C'+A)' = CA'$
Now complemented inputs are also given to us so, for $2$ input NOR gate we need only 1 NOR gate.

1 is correct answer .

edited by

4 Comments

I've done same mistake.

while computing POS, take don't care also to get the minimize POS form.

POS is A'C

1
1
if complemented inputs are not available then 2 NOR gates are required for $CA’$?? please verify.

$\overline{\overline {C\bar A}}\implies\overline{\bar C+A}$
0
0

@Hira Thakur yes, you’re correct.

0
0
21 votes
21 votes

Answer : 1 Only

Here we should take note that all inputs (a,b,c,d) and their respective complements are available.

And now when we solve the K-map the we get minterms like :

- >    cb'a'+ cba' 

- >    ca'(b+b')

- >    ca' 

If we give input to a NOR gate as c' and a the output will be (c' + a )' =  ca'.

So, only 1 NOR gate is Required.

4 Comments

the expression which comes is only ca'  how did u get cb'a'+cba' ????

0
0
ca' is the minimized form .
Check my answer again.
2
2

@Bikram sir check pls

if  question is max number of nor gate :

 (c' + a )'

term with a single literal  (c' ) requires an inverter 

(instead using inverter we can also  use nor gate to get this ) in this case max nor gate =2

0
0

See this  Shivam Chauhan

in this case max nor will be 2

0
0
6 votes
6 votes
Applying logic of k-map the simplified expression id ca'

now it is given that all inverted inputs are also available

so we can express ca' in terms of nor gate

(c'+a)'=ca'

so only 1 NOR gate required

1 is answer

ps: more editing will come
6 votes
6 votes

The expression of $K-map$ is $c.\bar a$

so the expression should be in $POS$ form for $NOR$ gate 

$\overline{\overline{c.\bar a}} = \overline{\bar c + a} $

Now the expression is in $POS$ form

NOTE : $\bar a , \bar a , \bar c \text { is given so no need to use NOT gate for that}$

 

 

So only 1 $NOR$ gate required

edited by

9 Comments

What if the given K map itself is converted into a maxterms K map?
0
0

It should be $CA'$  brother, though the final answer won't change

@Sambhrant Maurya --> you will get $CA'$ itself as there are two octet of zero's .

1
1

@Hemanth_13 corrected

0
0

NOTE : a¯,a¯,c¯ is given so no need to use NOT gate for that

 It mean that if this was not given then minimum of nor gate required 2 ?
am i correct? 

0
0
edited by

OR-AND realization is equal to NOR - NOR realization, so we should write the POS(product of sum) form rather than the SOP(sum of product) form.

SOP: $f(b,a,d,c) = c \cdot a' $

POS: $f(b,a,d,c) = c\cdot a’ $

So, only one NOR gate is required.

2
2

 Pls can you Explain more after finding POS as (c + a'). How to apply this POS expression from NOR Gate?
I follow the same approach rather find POS not SOP.

 

Also In this Below question suggest me which approach to follow, as Convert min term SOP to POS or any other? 
What is the minimum number of 2-input NOR gates required to implement a 4-variable function function expressed in sum-of-minterms form as f = Σ(0, 2, 5, 7, 8, 10, 13, 15)? Assume that all the inputs and their complements are available._________3.(Answer).

0
0
Actually the above method is more suitable when POS is given. But we got $a'+c$ which is sum term.
0
0
edited by

 $f(a,b,c,d) = \sum{(0,2,5,7,8,10,13,15)}$ Sum of Minterms(SOP)

$f(a,b,c,d) = \Pi{(0,2,5,7,8,10,13,15)}$ Product of Maxterms(POS)

Using $k-$map,we get

$f(a,b,c,d) = B'D'+BD$ (SOP)

$f(a,b,c,d) = (B'+D)\cdot(B+D')$ (POS)

Using the POS,we can easily make NOR gate.

0
0
We know,

Pos = (sop)'

Here sop expression is ca'

So converting to pos we get

(ca')' = (c'+a)

How you are applying double complement over the sop expression can u please explain?
0
0
Answer:

Related questions