2.3k views

Consider a Boolean function $f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $i_{1}=\left \langle w_{1}, x_{1}, y_{1},z_{1}\right \rangle$ and $i_{2}=\left \langle w_{2}, x_{2}, y_{2},z_{2}\right \rangle$ , we would like the function to remain true as the input changes from $i_{1}$ to $i_{2}$ ($i_{1}$ and $i_{2}$ differ in exactly one bit position) without becoming false momentarily. Let $f(w,x,y,z)=\sum (5,7,11,12,13,15)$ . Which of the following cube covers of $f$ will ensure that the required property is satisfied?

1. $\overline{w}xz,wx\overline{y},x\overline{y}z,xyz,wyz$
2. $wxy, \overline{w}xz,wyz$
3. $wx\overline{y} \overline{z}, xz, w\overline{x}yz$
4. $wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$
Could someone explain me the question plz.. ?
What to do with inputs i1 and i2 ?
How should I group ? In kmap every adjacent coloum differ by one bit , so should I group only adjacent coloums ?
Im not able to understand this question.

The question is indirctly asking for static hazard in the circuit - that is output becoming 1 momentarily when it is supposed to be 0 or vice verse.

Here $f(w,x,y,z) = \sum (5,7,11,12,13,15)$

So, K-map will be

y'z' y'z yz yz'
w'x'
w'x   5 7
wx 12 13 15
wx'     11

So, its minimized sum of products expression will be $xz + wxy + w'yz$. Since all the minterms are overlapping, there is no chance of static hazard here.

Now, lets consider the options one by one:

A. $\overline{w}xz,wx\overline{y},x\overline{y}z,xyz,wyz$

y'z' y'z yz yz'
w'x'
w'x   5 7
wx 12 13 15
wx'     11

Chance of static hazard

Here, when $y$ changes from $0$ to $1$, the GATE for $wyz$ should give 1 (from earlier 0, assuming $w=z=1$) and that of $wy'z$ should give 0 (from earlier 1). But there is a possibility of circuit giving 0 (static 1 hazard) momentarilly due to gate delays. In order to avoid this, we must add a gate with $wxz$ also which ensures all adjacent blocks in K-map are overlapped.

We can also have the sum of products as $xy'z + w'yz + wxy$ which is of course not minimal. But this also has hazard as when  $w$ changes from $0$ to $1$, the GATE for $wxy$ should give 1 (from earlier 0) and that of $w'yz$ should give 0 (from earlier 1). But there is a possibility of circuit giving 0 momentarilly (assuming $x=0$). This hazard can be avoided by adding $xyz$ and similarly we need $w'xz$ and $wxz$. Thus we get $xy'z + w'yz + wxy + xyz + w'xz + wxz$

Now, each of these term will correspond to a GATE when the circuit is implemented. What we require is to avoid the output to change when any of the input literal changes its value (hazard).

B. $\overline{w}xz,wx\overline{y},x\overline{y}z,xyz,wyz$

y'z' y'z yz yz'
w'x'
w'x   5 7
wx 12 13 15
wx'     11

Chance of static hazard

Here, when $y$ changes from $0$ to $1$, the GATE for $wyz$ should give 1 (from earlier 0, assuming $w=z=1$) and that of $wy'z$ should give 0 (from earlier 1). But there is a possibility of circuit giving 0 (static 1 hazard) momentarilly due to gate delays. In order to avoid this, we must add a gate with $wxz$ also which ensures all adjacent blocks in K-map are overlapped.

We can also have the sum of products as $xy'z + w'yz + wxy$ which is of course not minimal. But this also has hazard as when  $w$ changes from $0$ to $1$, the GATE for $wxy$ should give 1 (from earlier 0) and that of $w'yz$ should give 0 (from earlier 1). But there is a possibility of circuit giving 0 momentarilly (assuming $x=0$). This hazard can be avoided by adding $xyz$ and similarly we need $w'xz$ and $wxz$. Thus we get $xy'z + w'yz + wxy + xyz + w'xz + wxz$

Now, each of these term will correspond to a GATE when the circuit is implemented. What we require is to avoid the output to change when any of the input literal changes its value (hazard).

B. $wxy, \overline{w}xz,wyz$

Is not correct as $wxy$ is not a minterm for the given function

C. $wx\overline{y} \overline{z}, xz, w\overline{x}yz$

y'z' y'z yz yz'
w'x'
w'x   5 7
wx 12 13 15
wx'     11

Here, also there are hazards possible as the middle 4 pairs are separated by 1 bit difference to both $wxy'z'$ as well as $wx'yz$. Could have been avoided by using $wxy'$ instead of $wxy'z'$ and $wyz$ instead of $wx'yz$ which ensures all neighbouring blocks are overlapped.

D. $wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$

These minterms cover all the minterms of $f$ and also, all the neighbouring blocks are overlapping. So, no chance of hazard here and hence is the required answer.

selected by
why not option C or D?

in c option , it is not full fill the condition 1 bit change ...minterms ...

and in option d ) which have 5 correct term but one is not matched ... in fact that is not 1 bit difference ....

https://gateoverflow.in/?qa=blob&qa_blobid=5729794528540919919

In K-map all adjacent terms are 1 bit different rt? And in your figure there are 6 such terms- as in D (I have changed its first term). Option A has only 5 terms. But I did not get the question fully.
yes sir , but here we have to consider as with given minterms ...only

sorry i did not see option d ) correctly so ans is D)

actually few month before i answered it here as well fb group ....you edited question .. as given answer key ...
"momentarily" - why this?
Yes. I just edited it yesterday- but there is no answer key before GATE 2012 :(
ok... i also dont know whats the correct one ...in  some gate book i think given answer is A)

why, momentarily , i dont know :( ... as i understand its only about cube with one bit difference ....
if I were in GATE I would go with option 'D'. Why- because otherwise many terms in question does not make sense. But I'm not getting the meaning of "momentarily", input changes from i1 to i2 etc. Are the inputs for $f$ or for cube covers? If it is for $f$ then how it matters as which cube cover we choose. May be this is too simple for an electronics/digital person.
yes sir its not about f only , for given f we have to apply property of 1 bit difference ...

IMHO, the question means that when there is a 1-bit change from 0 to 1 or vice-versa, the state of circuit/bit is indeterminate because it has left one of the stage and not reached the other for that fraction-of-second/moment. When the circuit does not understand whether it is 1 or 0, it declares it as false.

@Gaurav So, how to make use of that fact?

Not sure about it but may be it is referring to boolean hazard as in this question.

Yes , You are right @Gaurav
@pC clear now?

@Sonam,Is D the right answer?You mentioned that there is no one bit difference?Can you please tell what is the correct answer?And I have seen at some places the first term in D option is not there,and with remaining 5 terms there is no static hazard as all adjacent blocks are overlapped.

What do you mean by comment

"and in option d ) which have 5 correct term but one is not matched ... in fact that is not 1 bit difference ...."

@Rahul, the answer was later edited by me and hence the comments don't make sense now. Everything is explained now in answer- there is no use in saying what is the "correct answer" unless you yourself get to know the reason. (GATE is not ISRO exam where they copy the same question and options again).

The question paper was taken from here:

thankyou. finally understood. :)
Shouldn't the minimized SOP be $xz+wx\overline{y}+wyz$?

Given that,  function to remain true as input changes from i1 to i2 and i1, i2 differ in exactly one bit position.

We know that adjacent cells in kmap differ by exactly 1 bit. So, we have to group cells in function represented by kmap such that all adjacent cells are grouped as below.

all these 6 groups gives :

+1 vote

I found a better way to answer this question .

Go according to the Question .  i1 and i2 differs in exactly one bit position without becoming false momentarily.

Go to option (a)

Draw K map and find  the binary covered by implicant

w'xz =5,7    0101 , 0111    here you will see it is one bit different

wxy'=12,13   1100,1101   here you will see it is also one bit different

xy'z=5,13  0101,1101  here you will see it is one bit different

xyz=7,15 0111, 1111 here you will see it is one bit different

wyz=11,15  1011,1111 here you will see it is one bit different

Option (a) misses wxz possible one bit  change.So it is false.

(b)

wxy = 15,14 but 14 is not covered by K map so b is wrong option

(c)

wxy'z' = 12 =1100  here there is not bit change so it is wrong option

(d)

wyz=11,15  1011,1111 here you will see it is one bit different

wxz=13,15  1101,1111 here you will see it is one bit different

w'xz =5,7    0101 , 0111    here you will see it is one bit different

xy'z=5,13  0101,1101  here you will see it is one bit different

xyz=7,15 0111, 1111 here you will see it is one bit different

wxy'=12,13   1100,1101   here you will see it is also one bit different

So option d satisfy whole f so it is Answer .

edited

We construct the K – Map as :

After simplification of this K – Map we get answer as : w’xz, wxy’, xy’z, xyz, wyz