Q-Implement the parity generator (a) Even (b) Odd for 3-bit message Ans: (a) Following is the truth table and K-map for even parity a b c P(even) 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 […]
Tag: kmaps
PARITY GENERATOR (4-bit MESSAGE)
Q-Implement the parity generator (a) Even (b) Odd for 4-bit message Ans: (a) Following is the truth table and K-map for even parity Binary number Parity (even) 0000 0 0001 1 0010 1 0011 0 0100 1 0101 0 0110 0 0111 1 1000 1 1001 0 1010 […]
K-maps for XOR and XNOR gates
Even variable map: For 4 variables (even), we have XOR and XNOR compliment of each other and can be represented in K-maps as follow: For XNOR gate we have 2n/2 number of min terms with output as 1 (i.e. we have even number of 0s) For XOR gate we have 2n/2 number of min terms with […]
Example: K MAPS FACTS
Q- Simplify the following Boolean function in (a) sum of products form (SOP) (b) Product of sums form (POS) F(x, y, z, w) = ∑(0, 1, 2, 5, 8, 9, 10) Ans: We mark 1s in the squares corresponding to the terms present in the function and 0s for the terms missing from the function […]
Some facts of K-map
The 1’s in the map represent min terms and 0’s represent max terms If we combine 1’s and make groups, we get simplified function. If we combine 0’s and then make groups, we get the simplified compliment function. To derive the simplified function in POS form from K map, we combine 0s and then get […]
Redundant groups
A groups of 1s or 0s whose all members are overlapped by other groups is called redundant group. We don’t consider this group while writing the simplified equations from the K-map. In the above K-map the group which is represented by the oval is a redundant group and hence while writing the equations we ignore […]
K Maps: DON’T CARES
When ever there are don’t cares present in the K-map then we have the option of including don’t care in the group to maximize the size of group and hence we get more minimized form but this is not compulsory to include each and every don’t care. So we can use don’t care to our […]
K Maps – INTRODUCTION
We want the simplest algebraic expression to represent any function so that we need minimum circuitry to implement it. The simplest algebraic expression is the one with minimum number of literals. We need to find a method to get the simplest expression. This method is called Karnaugh map method. K-map method: If we have n […]