Embedded expanded version of learning materials
Blue Bridge cup of theoretical knowledge embedded summary
1. The circuit diagram of a conventional door
2. When the fundamental theorem of algebra ---- Simplifying Logic relatively easy to use
Inversion theorem: For any logical formula Y, wherein if all of the "•" replaced by "+", "+" with "•", into 0 1,1 0 into the original variables into a variable trans , anti-variable result into the original variables, is obtained is Y '.
Duality theorem: For any logical type Y, if all of which "•" replaced by "+", "+" with "•", 0 1,1 replaced replaced 0, resulting formula is still valid, and It referred to as Y Yd of the dual type. in order to demonstrate two logical expressions are equal, they can also prove to complete the antithesis equal.
3. When several key simplifying logic function formula (A 'represents A non)
3.1 Simplifying formulation Simple logic function
A + BC = (A + B ) · (A + C) Using this formula available A A'B = A + B +
A · (A + B) = A
AB = AB + + A'C + BCxxx A ' i.e., C: If the two product terms included in each of a and a 'two factors, and the two remaining factors of product terms form a third product terms, the third product term is redundant and can be eliminated.
（A+B）'=A'B'
3.3 Karnaugh map method
(1) Note Videos encoding Karnaugh map uses the Gray code
(2) A + A = A i.e. circled may have overlapping portion
(3) uppermost and lower most, the leftmost and rightmost can be combined
(4 ) is small may be combined 0 0 Comparative obtained Y '.
4. Gray code to binary conversion
4.1 Binary -> Gray code method
High constant (high bit 0, is equivalent to the XOR constant), starting from the lower adjacent two iso
4.2 Method Gray code -> binary
High unchanged, from high to low or different, pay attention to the arrows
