Starting a new Lecture Notes Series on MIT 6.004 Computation Structures, Spring 2017
.png)
Youtube Lecture Playlist CreditsChannel Name: MIT OpenCourseWare
So Let Us Start to This Journey of Learning
MIT 6.004 Computation Structures, Spring 2017 By Lecture Notes together!
Lecture 1: 1.2.1 What is Information?
Lecture 2: 1.2.2 Quantifying Information
Lecture 3: 1.2.3 Entropy
Lecture 4: 1.2.4 Encoding
Lecture 5: 1.2.5 Fixed-length Encodings
Lecture 6: 1.2.6 Signed Integers: 2's complement
Lecture 7: 1.2.7 Variable-length Encoding
Lecture 8: 1.2.8 Huffman's Algorithm
Lecture 9: 1.2.9 Huffman Code
Lecture 10: 1.2.10 Error Detection and Correction
Lecture 11: 1.2.11 Error Correction
Lecture 12: 1.2.12 Worked Examples: Quantifying Information
Lecture 15: 1.2.12 Worked Examples: Huffman Encoding
Lecture 16: 1.2.12 Worked Examples: Error Correction
Lecture 17: 2.2.1 Concrete Encoding of Information
Lecture 18: 2.2.2 Analog Signaling
Lecture 19: 2.2.3 Using Voltages Digitally
Lecture 20: 2.2.4 Combinational Devices
Lecture 21: 2.2.5 Dealing with Noise
Lecture 22: 2.2.6 Voltage Transfer Characteristic
Lecture 23: 2.2.7 VTC Example
Lecture 24: 2.2.8 Worked Examples: The Static Discipline
Lecture 25: 3.2.1 MOSFET: Physical View
Lecture 26: 3.2.2 MOSFET: Electrical View
Lecture 27: 3.2.3 CMOS Recipe
Lecture 28: 3.2.4 Beyond Inverters
Lecture 29: 3.2.5 CMOS Gates
Lecture 30: 3.2.6 CMOS Timing
Lecture 31: 3.2.7 Lenient Gates
Lecture 32: 3.2.8 Worked Examples: CMOS Functions
Lecture 33: 3.2.8 Worked Examples: CMOS Logic Gates
Lecture 34: 4.2.1 Sum of Products
Lecture 35: 4.2.2 Useful Logic Gates
Lecture 36: 4.2.3 Inverting Logic
Lecture 37: 4.2.4 Logic Simplification
Lecture 38: 4.2.5 Karnaugh Maps
Lecture 39: 4.2.6 Multiplexers
Lecture 40: 4.2.7 Read-only Memories
Lecture 41: 4.2.8 Worked Examples: Truth Tables
Lecture 42: 4.2.8 Worked Examples: Gates and Boolean Logic
Lecture 44: 4.2.8 Worked Examples: Karnaugh Maps
Lecture 45: 5.2.1 Digital State
Lecture 46: 5.2.2 D Latch
Lecture 47: 5.2.3 D Register
Lecture 48: 5.2.4 D Register Timing
Lecture 49: 5.2.5 Sequential Circuit Timing
Lecture 50: 5.2.6 Timing Example
Lecture 51: 5.2.7 Worked Example 1
Lecture 52: 5.2.8 Worked Example 2
Lecture 53: 6.2.1 Finite State Machines
Lecture 54: 6.2.2 State Transition Diagrams
Lecture 55: 6.2.3 FSM States
Lecture 56: 6.2.4 Roboant Example
Lecture 57: 6.2.5 Equivalent States; Implementation
Lecture 58: 6.2.6 Synchronization and Metastability
Lecture 60: 6.2.7 Worked Examples: FSM Implementation