Computation Structures

1. 수업 자료

2. 수업 자료

3. 1.2.1 What is Information?

4. 1.2.2 Quantifying Information

5. 1.2.3 Entropy

6. 1.2.4 Encoding

7. 1.2.5 Fixed-length Encodings

8. 1.2.6 Signed Integers: 2's complement

9. 1.2.7 Variable-length Encoding

10. 1.2.8 Huffman's Algorithm

11. 1.2.9 Huffman Code

12. 1.2.10 Error Detection and Correction

13. 1.2.11 Error Correction

14. 1.2.12 Worked Examples: Quantifying Information

15. 1.2.12 Worked Examples: Two's Complement Representation

16. 1.2.12 Worked Examples: Two's Complement Addition

17. 1.2.12 Worked Examples: Huffman Encoding

18. 1.2.12 Worked Examples: Error Correction

19. 2.2.1 Concrete Encoding of Information

20. 2.2.2 Analog Signaling

21. 2.2.3 Using Voltages Digitally

22. 2.2.4 Combinational Devices

23. 2.2.5 Dealing with Noise

24. 2.2.6 Voltage Transfer Characteristic

25. 2.2.7 VTC Example

26. 2.2.8 Worked Examples: The Static Discipline

27. 3.2.1 MOSFET: Physical View

28. 3.2.2 MOSFET: Electrical View

29. 3.2.3 CMOS Recipe

30. 3.2.4 Beyond Inverters

31. 3.2.5 CMOS Gates

32. 3.2.6 CMOS Timing

33. 3.2.7 Lenient Gates

34. 3.2.8 Worked Examples: CMOS Functions

35. 3.2.8 Worked Examples: CMOS Logic Gates

36. 4.2.1 Sum of Products

37. 4.2.2 Useful Logic Gates

38. 4.2.3 Inverting Logic

39. 4.2.4 Logic Simplification

40. 4.2.5 Karnaugh Maps

41. 4.2.6 Multiplexers

42. 4.2.7 Read-only Memories

43. 4.2.8 Worked Examples: Truth Tables

44. 4.2.8 Worked Examples: Gates and Boolean Logic

45. 4.2.8 Worked Examples: Combinational Logic Timing

46. 4.2.8 Worked Examples: Karnaugh Maps

47. 5.2.1 Digital State

48. 5.2.2 D Latch

49. 5.2.3 D Register

50. 5.2.4 D Register Timing

51. 5.2.5 Sequential Circuit Timing

52. 5.2.6 Timing Example

53. 5.2.7 Worked Example 1

54. 5.2.8 Worked Example 2

55. 6.2.1 Finite State Machines

56. 6.2.2 State Transition Diagrams

57. 6.2.3 FSM States

58. 6.2.4 Roboant Example

59. 6.2.5 Equivalent States; Implementation

60. 6.2.6 Synchronization and Metastability