11-30-2013, 12:03 AM
how to minimize POS expression Using a karnaugh map:
Find all essential prime implicants Cover the remaining 1's/0's with as few as possible prime implicants SOP = EPIs + (as few as possible)PIs POS = (EPIs)(as few as possible PIs)
Gray Code to Binary Conversion:
This conversion method strongly follows the operation of Exclusive-OR gate. The following steps let you know how to achieve Gray Code to Binary number conversion
1. The left most significant bit of a given grey code number is same as the most left significant bit of the binary number
2. To obtain the successive binary bits to produce the equivalent binary number for the given grey code number, add the first bit of grey code to the second one and write down the result next to the first bit, add the second grey code bit to third one and write down the result and so on next to the second bit and repeat the same operation until the last bit
Find all essential prime implicants Cover the remaining 1's/0's with as few as possible prime implicants SOP = EPIs + (as few as possible)PIs POS = (EPIs)(as few as possible PIs)
Gray Code to Binary Conversion:
This conversion method strongly follows the operation of Exclusive-OR gate. The following steps let you know how to achieve Gray Code to Binary number conversion
1. The left most significant bit of a given grey code number is same as the most left significant bit of the binary number
2. To obtain the successive binary bits to produce the equivalent binary number for the given grey code number, add the first bit of grey code to the second one and write down the result next to the first bit, add the second grey code bit to third one and write down the result and so on next to the second bit and repeat the same operation until the last bit