The Gateway to Computer Science Excellence
+1 vote
49 views

in Digital Logic by Junior (903 points) | 49 views
0
Is it C?
0
Yes please tell in detail
0

We should know that an expression in POS form is always easier to be realized by NOR gates.

Given is the SOP ∑m(0,2,6,10,14) so we should convert it to POS.

Hence piM(1,3,4,5,7,8,9,11,12,13,15) [I couldn't find the "pi" symbol :P]

So the expression is D'.(B'+C).(A'+C)

Now we have to convert this expression in such a way that we can realize it with NOR

( ( D'.(B'+C).(A'+C) )' )' = (  (D')' + (B'+C)' + (A'+C)' )' = (D + BC' + AC' )'

= (D + C'(A+B) )' = (  D + ( ( C'(A+B) )' )'   )' = (D + ( (C')' + (A+B)' )' )' 

= (D + ( C + (A+B)' )' )' 

X=(A+B)'  --> 1 NOR

Y=(C+ X)'  --> 1 NOR

(D+Y)' --> 1 NOR

+2

By k-map, SOP format ===> CD' + A' B' D' ===> D' (C+A'B') ==> D' . ( C + (A+B)' ) ===> ( D + ( C + (A+B)' )'  ) '

TOTAL = 3 NOR GATES

0
Yeah.. Shaik's one is faster.. usually converting to POS works better..but in this case it's not

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,055 comments
104,680 users