2 Combinational Logic Circuit 01
- 1. 논리회로 설계실험담당교수 : 전재욱담당조교 : 석민식, 송지호
- 2. 2
- 3. 1 Analog & digitalSub. Contents.1.1 Analog & Digital1.2 Analog1.3 Digital3
- 4. 1.1 Analog & Digital4AnalogDigitalVVTT00
- 5. 1.2 Analog5Input SignalOutput Signal양적인 비례 관계
- 6. 1.3 Digital6Input SignalOutput Signal논리적인 비례 관계
- 7. 2 Binary digit operationSub. Contents.2.1 Binary System2.2 Boolean Algebra2.3 Venn Diagram7
- 8. 2.1 Binary System Binary System0과 1로 이루어진 수표기법 : 10001001(2)Decimal to Binary Conversion826532 … 1216 … 02128 64 32 16 8 4 2 11000001208 … 00 1 0 0 0 0 0 1Binary :204 … 0202 … 001 … 0
- 9. 2.2 Boolean Algebra Logical Sum : +► A + B = Y 0 + 0 = 0 0 + 1 = 1 1 + 1 = 1 Logical Product : •► A • B = Y 0 • 0 = 0 0 • 1 = 0 1 • 1 = 1 Logical Not : /, ‾,n,`► A ( /A, nA, A`) = Y 0 = 1 1 = 09Truth Table
- 10. 2.2 Boolean Algebra – Single Variable AND X • 0 = 0 X • 1 = X X • 0 = 0 X • X = 0 NOT X = X OR X + 0 = X X + 1 = 1 X + X = X X + X = 110
- 11. 2.2 Boolean Algebra – Multi Variable Commutative Law X + Y = Y + X X • Y = Y • X Associative Law X + (Y + Z) = (X + Y) + Z = X + Y + ZX(Y • Z) = X • Y • Z = XYZ Distributive LawX(Y+Z) = X • Y + X • Z = XY + XZ(X + W)(Y + Z) = X • Y + X • Z + W • Y + W • Z = XY + XZ + WY + WZOther LawX + XY = XX + XY = X + Y11
- 13. 2.4 De-Morgan Law13A + B = A • BA • B = A + B
- 14. 3 Gate symbolSub. Contents.3.1 Buffer & NOT Gate3.2 AND & NAND Gate3.3 OR & NOR Gate3.4 XOR & ExOR Gate3.5 Relativity Theorem14
- 15. 3.1 Buffer & NOT Gate15NOT GateBufferInputOutputInputOutput
- 16. 3.1 Buffer & NOT Gate - Analog Not Gate Circuit16B = 0COutputInputBEB = 1
- 17. 3.2 AND & NAND Gate17AND GateNAND GateInput AInput AOutputOutputInput BInput B
- 18. 3.2 AND & NAND Gate - Analog AND Gate Circuit18BC=>CEBE< TR >< Switch >Input AInput BOutput
- 19. 3.3 OR & NOR Gate19OR GateNOR GateInput AInput AOutputOutputInput BInput B
- 20. 3.3 OR & NOR Gate - Analog OR Gate Circuit20Input AInput BOutput
- 21. 3.4 XOR & ExOR Gate21ExOR(XOR) GateExNORGateInput AInput AOutputOutputInput BInput BA ⊙ B = YA B = Y
- 22. 3.5 Relativity TheoremA + B = B + AA+(B+C) = (A+B)+CA(B+C) = A•B+A•CA+0=AA+1=1A+A=AA+A=1A=AA+B=A•BA+A•B=AA+A•B=A+BA•B=B•AA(B•C)=(A•B)CA+B•C=(A+B)(A+C)A•1=AA•0=0A•A=AA•A=0A=AA•B=A+BA(A+B)=AA(A+B)=A•B22
- 23. 4 Combinational Logic CircuitSub. Contents.4.1 Combinational Logic4.2 Half-Adder4.3 Full-Adder4.4 Half-Subtracter4.5 Full-Subtracter4.6 Subtraction4.7 Adder-Subtracter23
- 24. 4.1 Combinational Logic24Input AInput BOutputInput CInput D(A+B) (CD) = Output
- 25. 4.2 Half-Adder25Input ASUMInput BCARRY(A B) = SUMA • B = CARRY
- 26. 4.2 Half-Adder26 0+000 1+001 0+101 1+111HalfAdderInput ASUMInput BCARRYHalfAdderHalfAdderHalfAdderHalfAdderHalfAdderHalfAdderHalfAdder0010011+10000011010010CARRY ?
- 27. 4.3 Full-Adder27SUMInput AHalfAdderHalfAdderInput BCARRYInput C
- 28. 4.3 Full-Adder28Input ASUMInput BCarryCarryInput
- 30. 4.4 Half-Subtracter30Input ADataHalfSubtracter(HS)Input B1-1001-0010-1110-000BorrowInput ASUMInput BBorrow
- 31. 4.5 Full-Subtracter31DataInput AHSHSInput BBorrowInput C
- 32. 4.5 Full-Subtracter32Input ADataInput BBorrowBorrowInput
- 34. 4.6 Subtraction3410011001-01000001?One’s complementTwo’s complement101111111011111010011001+1011111110101100010011001 = 15301000001 = 65153 - 65 = 8888
- 36. 36End of Page