University:
Brown University
Course:
PHYS 0050 | Foundations of Mechanics
Academic year:

2024
Views:

177

Pages:

8
Author:

Jabin F.

Karnaugh-map (K-map)→ K-map is used to simplity of Booleann K-map is used to simplification of sop and pos along with devi't care temn. K-map is completely based on Concept of Gray Code. Gray-Code Binary reflected Code- minimum error Code. Unit distance Code.? Cyclic Code. information Signal +-bit Gnay Code 2-bit Count no. of zero's le. Are we having ewnno. of zero?? Yes then olp is logically high ie even parity detector. Expential prime Implicant P = 4 but 4 group not needed for simplification. fsop ab+96+BC fsop ab + ab + ac The result obtain from K-map may or may not be unique. Expential prime Implicant P = 4 but 4 group not needed for simplification. fsop ab+96+BC fsop ab + ab + ac The result obtain from K-map may or may not be unique. As the rule of K-map P.I does not exist of if it consis of don't Core term. 16 f = Em (1,2,4,7) using K-map, simplify it 4111 3-bit variable = ab (cod)+ab(cod) + ab(d)+ab (cd) cod (ab+ab) + codন (ab+46) ab.cod+ab.cod P2+P2 abcdefgoi Find the no. of min term = ? Som no. of cell 2 = 128 = Or box 2= 27= total cell = EPI Arg