|
Mod 1 - Boolean Algebra, Minimization of Boolean Functions
|
|
|
|
Welcome to Digital Logic Course
|
|
|
|
Lecture 1 - Boolean Algebra
|
|
|
|
Notes 1 - Digital Logic Lecture 1 Boolean Algebra Annotated Notes
(92 pages)
|
|
|
|
Lecture 2 - Decimal, Binary Number System
|
|
|
|
Notes 2 - Digital Logic Lecture 2 Binary Number System Annotated Notes
(117 pages)
|
|
|
|
Lecture 3 - Boolean Algebra Laws
|
|
|
|
Notes 3 - Digital Logic Lecture 3 Boolean Algebra Laws Annotated Notes
(153 pages)
|
|
|
|
Lecture 4 - Algebraic Simplification
|
|
|
|
Notes 4 - Digital Logic Lecture 4 Algebraic Simplification Annotated Notes
(135 pages)
|
|
|
|
Lecture 5 - Standard Forms of Boolean Expressions
|
|
|
|
Notes 5 - Digital Logic Lecture 5 Annotated Notes
(164 pages)
|
|
|
|
Every Wednesday is Off.
|
|
|
|
Lecture 6 - Minimization using K Map
|
|
|
|
Notes 6 - Digital Logic Lecture 6 Annotated Notes
(168 pages)
|
|
|
|
Lecture 7 - K-Map, Don't Care Combinations
|
|
|
|
Notes 7 - Digital Logic Lecture 7 Annotated Notes
(168 pages)
|
|
|
|
Lecture 8 - Don't Cares, Prime Implicants
|
|
|
|
Notes 8 - Digital Logic Lecture 8 Annotated Notes
(159 pages)
|
|
|
|
Lecture 9 - Prime Implicant, EPI
|
|
|
|
Notes 9 - Digital Logic Lecture 9 Annotated Notes
(138 pages)
|
|
|
|
Dual of a Function
|
|
|
|
Complement, Dual of a Boolean Function | Self Dual Functions | Positive & Negative Logic Systems
|
|
|
|
ExOr, ExNor functions | Odd function, Even function
26:00
|
|
|
|
Dual, Complement, Self Dual, ExOr, ExNor Functions Annotated Notes
(166 pages)
|
|
|
Number System
|
|
|
|
Lecture 10 - Octal, Hexadecimal
|
|
|
|
Notes 10 - Digital Logic Lecture 10 - Number System Annotated Notes
(128 pages)
|
|
|
|
Lecture 11 - Complements, Representations of Signed Numbers
|
|
|
|
Lecture 12 - Complements, Representations of Signed Numbers Part 2
|
|
|
|
Notes 11,12 - Digital Logic Lecture 11,12 Annotated Notes
(156 pages)
|
|
|
|
Lecture 13 - Range of Singed Numbers in Different Representations
|
|
|
|
Notes 13 - Digital Logic Lecture 13 Annotated Notes
(46 pages)
|
|
|
|
Lecture 14 - Addition of Signed Numbers
|
|
|
|
Notes 14 - Digital Logic Lecture 14 Annotated Notes
(44 pages)
|
|
|
|
Lecture 15 - Addition Subtraction of Signed Numbers
|
|
|
|
Lecture 16 - Overflow for Addition Operation
|
|
|
|
Notes 15,16 - Digital Logic Lecture 15,16 Overflow Annotated Notes
(174 pages)
|
|
|
|
Lecture 17 - Sign Extension, Introduction to Binary Codes
|
|
|
|
Notes 17 - Digital Logic Lecture 17 Sign Extension, Binary Codes Annotated Notes
(50 pages)
|
|
|
|
Lecture 18 - Binary Codes, BCD, 2421, Gray Codes
|
|
|
|
Notes 18 - Digital Logic Lecture 18 Binary Codes, BCD, Gray Code Annotated Notes
(84 pages)
|
|
|
|
Lecture 18(b) - Gray Codes
|
|
|
|
Lecture 18(b) - Digital Logic Lecture Gray Codes Annotated Notes
(97 pages)
|
|
|
Functional Completeness Playlist
|
|
|
|
Functional Completeness Playlist
|
|
|
|
Functional Completeness Annotated Notes
(176 pages)
|
|
|
Combinational Circuits
|
|
|
|
Lecture 19 - Compact Truth Table Representation
|
|
|
|
Lecture 20 - Multiplexer
|
|
|
|
Notes 19,20 - Digital Logic Lecture 19,20 Multiplexer Annotated Notes
(171 pages)
|
|
|
|
Lecture 21 - Multiplexer Practice Questions
|
|
|
|
Notes 21 - Digital Logic Lecture 21 Multiplexer Practice Questions Annotated Notes
(44 pages)
|
|
|
|
Lecture 22 - Multiplexer Construction
|
|
|
|
Notes 22 - Digital Logic Lecture 22 Multiplexer Construction Annotated Notes
(106 pages)
|
|
|
|
Lecture 23 - Demux, Encoder
|
|
|
|
Notes 23 - Digital Logic Lecture 23 Demux, Encoder Annotated Notes
(113 pages)
|
|
|
|
Lecture 24 - Decoder
|
|
|
|
Lecture 25 - NAND Decoder & Function Realization
|
|
|
|
Notes 24,25 - Digital Logic Lecture 24,25 Decoder Annotated Notes
(160 pages)
|
|
|
|
Decoder Expansion Lecture
|
|
|
|
Lecture 26 - Decoder Expansion (Only Watch Till 02:06:40)
210:00
|
|
|
|
Notes 26 - Lecture 26 Decoder Expansion Annotated Notes
(178 pages)
|
|
|
|
Lecture 27 - Propagation Delay & Timing Diagrams
|
|
|
|
Lecture 28 - Hazards & Glitches
|
|
|
|
Notes - Digital Logic Lecture 27,28 Propagation Delay & Timing Diagrams Annotated Notes
(101 pages)
|
|
|
|
Lecture 29 - Static Hazards
|
|
|
|
Notes 29 - Digital Logic Lecture 29 Static Hazards Annotated Notes
(215 pages)
|
|
|
|
Adders Lectures
|
|
|
|
Lecture 30 - Adders
230:00
|
|
|
|
Lecture 31 - Adder Part 2
125:00
|
|
|
|
Notes 30,31 - Lecture 30,31 Adders Annotated Lecture Notes
(271 pages)
|
|
|
|
Lecture 32 - Adders & Subtractors
105:00
|
|
|
|
Notes 32 - Lecture 32 Adders, Subtractors Annotated Lecture Notes
(62 pages)
|
|
|
Sequential Circuits
|
|
|
|
Lecture 33 - Sequential Circuits & Latch
|
|
|
|
Notes 33 - Digital Logic Lecture 33 - Sequential Circuits & Latch Annotated Notes
(172 pages)
|
|
|
|
Lecture 34 - Timing Diagram of SR Latch, Clock
|
|
|
|
Lecture 35 - Flipflops, SR Flipflop
|
|
|
|
Notes 34,35 - Digital Logic Lecture 34 FlipFlops SR Flipflop Annotated Notes
(150 pages)
|
|
|
|
Lecture 36 - D Flipflop, Clock Triggering
|
|
|
|
Lecture 37 - T, JK Flipflops
|
|
|
|
Notes 36,37 - Digital Logic Lecture 36,37 D, JK, T FlipFlops Annotated Notes
(187 pages)
|
|
|
|
Lecture 38 - Flipflop Conversion
|
|
|
|
Notes 38 - Digital Logic Lecture 38 Flipflop Conversion Annotated Notes
(128 pages)
|
|
|
|
Lecture 39 - Preset & Clear Inputs
|
|
|
|
Notes 39 - Digital Logic Lecture 39 Flipflop Conversion, Preset, Clear Inputs Annotated Notes
(120 pages)
|
|
|
|
Lecture 40 - Master Slave Flipflops
|
|
|
|
Notes 40 - Digital Logic Lecture 40 Master Slave FlipFlops, Race Condition Annotated Notes
(119 pages)
|
|
|
|
Next Topic: Timing Issues in FlipFlops
|
|
|
|
Setup and Hold Time in Flip Flop | Timing Issues in Flip Flops
26:00
|
|
|
|
Duty Cycle, Clock Width, Clock Terminology
14:00
|
|
|
|
Example 1 : Setup and Hold Time in Flip Flop
20:00
|
|
|
|
Propagation Delay Vs Hold Time in Flip Flops
26:00
|
|
|
|
Timing Violations and Unpredictable Behavior in Flip Flops | Hold Time and Setup Time Violation
9:00
|
|
|
|
Minimum Clock Period | Maximum Clock Frequency Possible
42:00
|
|
|
|
Example 1 : Charles H. Roth Exercise 11.4 | Minimum Clock Period
5:00
|
|
|
|
Example 2 : Charles H. Roth 13.28 | Minimum Clock Period
15:00
|
|
|
|
Example 3 : NPTEL Question | Minimum Clock Period
4:00
|
|
|
|
GATE ECE 2020 | Maximum Frequency Possible
8:00
|
|
|
|
Notes - Timing Issues in Flipflops, Hold Time, Setup Time Annotated Notes
(127 pages)
|
|
|
|
Next Topic: Registers
|
|
|
|
Introduction to Registers and Counters
16:00
|
|
|
|
Registers : Type of Registers
46:00
|
|
|
|
Shift Registers
54:00
|
|
|
|
Universal Shift Register, Bidirectional Shift Register
22:00
|
|
|
|
Linear Feedback Shift Register(LFSR) : Right Shift Register with ExOR GATE
27:00
|
|
|
|
GATE CSE 1987 Shift Register Question : 13-a
15:00
|
|
|
|
ISRO ECE 2010, 2007 Shift Register Question
14:00
|
|
|
|
GATE ECE 1992 Shift Register Question
12:00
|
|
|
|
GATE CSE 1991 Parallel In, Serial Out Shift Register Question
13:00
|
|
|
|
Applications of Shift Registers
30:00
|
|
|
|
GATE ECE 1996 Shift Register
11:00
|
|
|
|
Notes - Registers Annotated Lecture Notes
(231 pages)
|
|
|
|
Next Topic: Finite State Machines (Mealy, Moore Models)
|
|
|
|
State of a Sequential Circuit, State Diagram, State Table, State Equation
81:00
|
|
|
|
Introduction to Finite State Machine FSM, Mealy Machine, Moore Machine
17:00
|
|
|
|
Finite State Machine(FSM) Design Example 1
15:00
|
|
|
|
Mealy Machine, Moore Machine
54:00
|
|
|
|
Mealy Moore Machine Design Example 1 : Increment a binary number by 1
12:00
|
|
|
|
Mealy Moore Machine Design Example 2 : Decrement a binary number by 1
6:00
|
|
|
|
Mealy Moore Machine Design Example 3 : 2's Complement of a binary number
8:00
|
|
|
|
Mealy Moore Machine Design Example 4 : Detect Sequence 01
6:00
|
|
|
|
GATE CSE 1994 Finite State Machine for Addition of two integers
15:00
|
|
|
|
GATE CSE 2002 Finite State Machine | Question: 2.5
9:00
|
|
|
|
GATE CSE 1995 Finite State Machine
10:00
|
|
|
|
GATE CSE 2005 Finite State Machine
4:00
|
|
|
|
GATE CSE 2009 Finite State Machine
8:00
|
|
|
|
GATE CSE 2006 Finite State Machine
9:00
|
|
|
|
Peter Linz Mealy, Moore Machine Question
12:00
|
|
|
|
GATE CSE 2021 Set 2 | Question: 28 | Mealy Machine
17:00
|
|
|
|
Notes - FSM Finite State Machine Mealy and Moore Machine Annotated Notes
(240 pages)
|
|
|
|
Next Topic - Counters
|
|
|
|
Counters : Introduction
22:00
|
|
|
|
Asynchronous Counters Part 1 : Divide by 2 Counter, Frequency Division, Mod-2 counter | Part 1
36:00
|
|
|
|
Asynchronous Counters Part 2 : Divide by 4 Asynchronous Counters, Transient States, Mod-4 counters | Part 2
40:00
|
|
|
|
Notes - Counters, Asynchronous Counters Part 1,2 Annotated Notes
(100 pages)
|
|
|
|
Asynchronous Counters Part 3 - Binary Ripple Counters, Transient States, Maximum Frequency
134:00
|
|
|
|
Asynchronous Counters Part 4 - Binary Up Ripple Counter, Mod-M Ripple Counters
120:00
|
|
|
|
Notes - Asynchronous Counters Part 3,4 - Binary Ripple Counter, Mod-M Counter Annotated Notes
(229 pages)
|
|
|
|
Synchronous Counters Part 1 - Analysis
|
|
|
|
Synchronous Counters Part 2 - Design
|
|
|
|
Notes - Synchronous Counters Part 1,2 Design & Analysis Annotated Notes
(175 pages)
|
|
|
|
Synchronous Counters: Ring Counter, Johnson Counter
|
|
|
|
Notes - Synchronous Counters Ring Counter, Johnson Counter Annotated Notes
(190 pages)
|
|
|
Standard Questions Practice Sessions
|
|
|
|
Digital Logic: Standard Questions Session 1 - Boolean Algebra
147:00
|
|
|
|
Notes 1 - Digital Logic Standard Questions Session 1 Boolean Algebra Annotated Notes
(138 pages)
|
|
|
|
Digital Logic: Standard Questions Session 2 - Minimization, K-Map
115:00
|
|
|
|
Notes 2 - Digital Logic Standard Questions Session 2 K-Map Annotated Notes
(85 pages)
|
|
|
|
Digital Logic: Standard Questions Session 3 - K-Map, Dummy Boolean Variable
46:00
|
|
|
|
Digital Logic: Standard Questions Session 3 - PART 2 - K-Map
75:00
|
|
|
|
Notes 3 - Digital Logic Standard Questions Session 3 Dummy Variable, K-Map Annotated Notes
(94 pages)
|
|
|
|
Digital Logic: Standard Questions Session 4 - Decoder, Encoder, Multiplexer
90:00
|
|
|
|
Notes 4 - Digital Logic Standard Questions Session 4 Decoder, Encoder, Mux Annotated Notes
(72 pages)
|
|
|
Homework
|
|
|
|
Homework 10 - Asynchronous Ripple Counters - GATE ECE Questions
(28 pages)
|
|
|
|
Homework 11 - Synchronous Counters Design & Analysis Questions - Part 1
(47 pages)
|
|