1,672 views

2 Answers

Best answer
3 votes
3 votes

This can be done using some observation :

Number of minterms that are present at the output of a 2 input XOR gate  =  2   [i.e. for A ⊕ B , we have 2 minterms]

Number of minterms that are present at the output of a 3 input XOR gate  =  4  

                                                                                                           =  22 [i.e. for A ⊕ B ⊕ C , we have 4 minterms]

Number of minterms that are present at the output of a 4 input XOR gate  =  23

In this way ,

Number of minterms that are present at the output of an 8 input XOR gate  =  27

                                                                                                             = 128 

selected by
4 votes
4 votes

For XOR gate, if the no. of 1s in the input is even then it results in 0 otherwise 1.

eg- 11010100 will result in 0 whereas 11010101 will give 1

So, possible inputs from 8 bits are 28 =256

Minterms are those which result in 1 or those combinations which give 1 OR Minterms = Total possible inputs(28) - Combinations of inputs which give 0.

Inputs which result in 0 value have 0,2,4,6,8 number of 1s = 8C0 + 8C2 + 8C4 + 8C6 + 8C8 = 128

Minterms = 256-128 =128

Related questions

4 votes
4 votes
1 answer
2
AniMan_7 asked Jun 29, 2023
1,140 views
Does EX-NOR Gate follow Associativity ?How 3 input EX-NOR function is equal to 3 input EX-OR function ?
0 votes
0 votes
0 answers
3
Mizuki asked Sep 27, 2018
1,153 views
$A\odot(BC) = (A\odot B)(A\odot C)$Does it hold? Please solve.
0 votes
0 votes
2 answers
4
Priyankalora asked Jul 31, 2023
466 views
Reduce the following Boolean expression to the required number of literals(A+C+D)(A+C+D')(A+C+D)(A+B')