Digital Electronics
About Course
Digital Electronics is the study of electronic circuits that are used to process and control digital signals.
In contrast to analog electronics, where information is represented by a continuously varying voltage, digital signals are represented by two discreet voltages or logic levels. This distinction allows for greater signal speed and storage capabilities and has revolutionized the world’s electronics. Digital electronics is the foundation of all modern electronic devices such as cellular phones, MP3 players, laptop computers, digital cameras, high definition televisions, etc.
The major focus of the DE course is to expose students to the design process of combinational and sequential logic design, teamwork, communication methods, engineering standards, and technical documentation.
Digital Electronics is one of three foundation courses in the Project Lead The Way
high school preengineering program. The course applies and concurrently develops secondarylevel knowledge and skills in mathematics, science, and technology.
About the instructor
Course Curriculum
Digital Electronics

Representation of Number Systems and Basics of Number System
00:00 
Addition operation in Different Number systems (Binary, Octal & Hexadecimal Addition)
00:00 
Subtraction operation in Different Number Systems (Binary, Octal and Hexadecimal Subtraction)
00:00 
Octal and Binary Multiplication, Number System Multiplication
00:00 
Decimal to Binary Conversion
00:00 
Decimal to Octal Conversion
00:00 
Decimal to Hexadecimal Conversion
00:00 
Octal, Binary and Hexadecimal to Decimal conversion
00:00 
Hexadecimal to Binary to Octal conversion and Visa versa
00:00 
X Number System to Y Number System conversion, Number System Conversion
00:00 
1’s & 2’s Compliment, 7’s & 8’s Compliment, 9’s & 10’s Compliment and 15’s & 16’s Compliment
00:00 
Simple Signed Representation, Example and Block Diagram of Simple Signed Representation
00:00 
1’s compliment signed Representation, Example & Blockdiagram of 1’s compliment signed Representation
00:00 
2’s compliment signed Representation, Example & Blockdiagram of 2’s compliment signed Representation
00:00 
Examples on 1’s compliment signed Representation and 2’s compliment signed Representation
00:00 
Shortcut Method to find 2’s compliment
00:00 
Binary Subtraction using 1’s compliment
00:00 
Binary Subtraction using 2’s compliment
00:00 
Classification of Codes
00:00 
BCD code, Binary Coded Decimal Code
00:00 
BCD Addition
00:00 
BCD to Binary conversion
00:00 
Binary to BCD conversion
00:00 
2421 BCD code and 2*421 BCD code
00:00 
Excess 3 Code basics and its properties
00:00 
Excess 3 Addition
00:00 
Identification of self complimenting code
00:00 
ASCII code, American Standard Code for Information Interchange
00:00 
Gray Code basics, properties, Importance and applications
00:00 
Binary to Gray code conversion
00:00 
Gray to Binary Code conversion
00:00 
Identification of Base or Radix of given number
00:00 
Total bits required to represent a number
00:00 
Minimal Decimal Equivalent
00:00 
Hamming Code Basics
00:00 
Hamming Code generation
00:00 
Hamming Code error detection and Hamming Code error correction
00:00 
IEEE 754 floating point single precision 32 bit format
00:00 
IEEE 754 floating point double precision 64 bit format
00:00 
De Morgen’s Theorem and Proof of De Morgen’s Theorem
00:00 
Boolean Algebra Rules
00:00 
Consensus Theorem and Proof of Consensus Theorem
00:00 
Boolean Algebra Examples part 1
00:00 
Boolean Algebra Examples Part 2
00:00 
Boolean Algebra examples part 3
00:00 
Dual and Self Dual of Boolean equation
00:00 
SOP – Sum Of Product, POS – Product Of Sum and Canonical Form of Boolean function Representation
00:00 
Minterms and Maxterms in Boolean function Representation
00:00 
SOP to SSOP conversion, Sum Of Product to Standard Sum Of Product Conversion
00:00 
POS to SPOS conversion, Product Of Sum to Standard Product Of Sum Conversion
00:00 
SSOP to SPOS conversion and SPOS to SSOP conversion
00:00 
Examples on SOP and POS
00:00 
Logic GATE’s Introduction
00:00 
NOT gate and NOT gate Applications, Logic gates
00:00 
AND gate, Properties of AND gate and Examples of AND gate, Logic Gate’s
00:00 
OR gate, Properties of OR gate and Examples of OR gate, Logic Gate’s
00:00 
NAND gate and NOR Gate in Logic Gate’s
00:00 
XOR gate and XNOR gate, Properties of XOR and XNOR gate in Logic GATE’S
00:00 
Examples on XOR and XNOR gate part 1
00:00 
Examples on XOR and XNOR gate Part 2
00:00 
NOR as universal GATE
00:00 
NAND as universal GATE
00:00 
Minimum Two input NAND for multiple input AND & Minimum Two input NAND for multiple input NAND
00:00 
Minimum two input NAND gates for Boolean expression
00:00 
Minimum two input NAND gates for Boolean equation
00:00 
Boolean expression to NAND gate implementation
00:00 
AOI to NAND gate implementation
00:00 
Boolean expression to NOR gate implementation
00:00 
AOI to NOR implementation
00:00 
Stuck at 1 and Stuck at 0 fault in Logic circuit
00:00 
Karnaugh Map basics & Key points of Karnaugh Map, K Map
00:00 
K Map rules for grouping cells, K map rules for formation of Boolean function, K map
00:00 
Implicants, Prime Implicants and Essential Prime Implicants in K Map
00:00 
K Map Examples, Karnaugh Map Examples, K Map, Part 1
00:00 
K Map Examples, Karnaugh Map Examples, K Map, Part 2
00:00 
K Map with Don’t care examples, Karnaugh Map with don’t care examples, Part 1
00:00 
K Map with Don’t care examples, Karnaugh Map with don’t care examples, Part 2
00:00 
K Map for POS expression, Karnaugh Map for POS expression, K Map
00:00 
5 variable K Map, 5 variable Karnaugh Map, 5 variable K Map Example, 5 variable Karnaugh Map Example
00:00 
6 variable K Map, 6 variable Karnaugh Map, 6 variable K Map Example, 6 variable Karnaugh Map Example
00:00 
K Map Examples of GATE, ISRO and DRDO Examination
00:00 
Quine Mccluskey Minimization Technique for Boolean expression
00:00 
Combinational circuit and Sequential circuit in Digital Electronics
00:00 
Combinational circuit designing examples
00:00 
Combinational circuit examples
00:00 
Half Adder
00:00 
Full Adder
00:00 
Full Adder using Half Adder
00:00 
Half Adder using NAND gates
00:00 
4 bits parallel Adder
00:00 
BCD Adder by Parallel Adder
00:00 
1’s Compliment Subtraction using Parallel Adder
00:00 
2’s Compliment Subtraction using Parallel Adder
00:00 
Half Subtractor
00:00 
Half Adder using Half Subtractor
00:00 
Half Subtractor using Half Adder
00:00 
Full Adder using Half Subtractor
00:00 
Full Subtractor
00:00 
Parallel Subtractor using Full Subtractor and Half Subtractor
00:00 
2 Bits Multiplier using Half Adder
00:00 
Excess 3 Addition by Parallel Adder
00:00 
2 bits Data comparator
00:00 
Seven Segments Display Decoder
00:00 
Carry Look Ahead Adder, CLA Adder
00:00 
Even Parity Generator and Odd Parity Generator
00:00 
Decoder Basics and 2 to 4 Decoder
00:00 
3 to 8 Decoder working, Truth Table and Circuit Diagram
00:00 
Combinational Circuit Output Waveforms with Delay at Gates – Part 1
00:00 
Combinational Circuit Output Waveforms with Delay at Gates – Part 2
00:00 
Priority Encoder Basics, Working, Truth Table and Circuit
00:00 
Decimal to BCD Encoder Basics, Working, Truth Table, Boolean Expression and Circuit
00:00 
Implementation of Full Adder using Decoder
00:00 
Binary Code to Gray Code Converter
00:00 
Multiplexer MUX Basics, Working, Advantages, Applications and Types
00:00 
2 to 1 Multiplexer
00:00 
4 to 1 Multiplexer
00:00 
8 to 1 Multiplexer
00:00 
MUX Tree, Multiplexer Tree
00:00 
Designing of 4 to 1 Multiplexer using 2 to 1 Multiplexer
00:00 
Designing of 8 to 1 Multiplexer using 2 to 1 Multiplexer
00:00 
8 to 1 MUX using 4 to 1 MUX by two different Methods
00:00 
SOP Implementation using Multiplexer
00:00 
Full Adder Implementation using 4 to 1 Multiplexer
00:00 
Full Adder using 2 to 1 Multiplexer
00:00 
Identification of Boolean Expression from Multiplexer Circuit
00:00 
Identification of logic Gate’s from Multiplexer circuit
00:00 
Examples based on Multiplexer from GATE/ISRO
00:00 
Examples Based on Multiplexer
00:00 
Coincidence Logic and Problems based on Coincidence Logic
00:00 
Demultiplexer and 1 to 2 Demultiplexer
00:00 
1 to 4 Demultiplexer Working, Truth Table, Boolean Expression and Circuit
00:00 
1 to 8 Demultiplexer Working, Truth Table, Boolean expression and circuit
00:00 
Implementation of Full Subtractor using 1 to 8 Demultiplexer
00:00 
Demultiplexer as Decoder
00:00 
Implementation of Boolean Expression using Demultiplexer
00:00 
Sequential circuit
00:00 
Clock and Triggering by clock in Sequential circuit
00:00 
Difference between Latch and Flip Flop
00:00 
SR Latch by NOR gates
00:00 
SR Latch using NAND gates
00:00 
Truth Table, Characteristic Table and Excitation Table of Flip Flop
00:00 
SR Flip Flop or Set Reset Flip Flop
00:00 
D Flip Flop or Data Flip Flop
00:00 
JK Flip Flop
00:00 
Race Around Condition in JK Flip Flop
00:00 
Master Slave JK Flip Flop
00:00 
T Flip Flop or Toggle Flip Flop
00:00 
Preset and Clear Input in Flip Flop
00:00 
SR Flip Flop to D Flip Flop conversion
00:00 
SR Flip Flop to JK Flip Flop conversion
00:00 
SR Flip Flop to T Flip Flop conversion
00:00 
JK Flip Flop to D Flip Flop Conversion
00:00 
JK Flip Flop to T Flip Flop conversion
00:00 
D Flip Flop to JK Flip Flop conversion
00:00 
D Flip Flop to T Flip Flop conversion
00:00 
T Flip Flop to D Flip Flop Conversion
00:00 
T Flip Flop to JK Flip Flop conversion
00:00 
JK Flip Flop to SR Flip Flop, D Flip Flop to SR Flip Flop and T Flip Flop to SR Flip Flop conversion
00:00 
Examples on Flip Flop
00:00 
Examples on Latch
00:00 
D Latch
00:00 
Counter in Digital Electronics
00:00 
Asynchronous Up Counter or Ripple Up Counter
00:00 
Asynchronous Down Counter or Ripple Down Counter
00:00 
Modulo Counter by Asynchronous Counter
00:00 
BCD Counter or Decade Counter or Modulo 10 Counter
00:00 
2 bits Synchronous Counter using JK Flip Flop
00:00 
3 bits Synchronous Counter using T Flip Flop
00:00 
3 bits Synchronous Up Down Counter
00:00 
Ring Counter
00:00 
Johnson’s Counter / Twisted Ring Counter / Switch Tail Ring Counter
00:00 
Arbitrary Sequence Counter Example 1
00:00 
Arbitrary Sequence Counter Example 2
00:00 
Sequence Generator Example 1
00:00 
Sequence Generator Example 2
00:00 
Sequence Detector Example 1
00:00 
Sequence Detector Example 2
00:00 
Examples of Counter in Digital Electronics
00:00 
Register Basics, Format and Classification
00:00 
SISO Shift Register, Serial Input Serial Output Shift Register
00:00 
SIPO Shift Register, Serial Input Parallel Output Shift Register
00:00 
PIPO Register, Storage Register, Buffer Register
00:00 
PISO Shift Register, Parallel Input Serial Output Shift Register
00:00 
Bidirectional Shift Register
00:00 
Universal Shift Register
00:00 
Examples based on Shift Register
00:00 
Moore State Machine and Example on Moore State Machine
00:00 
Mealy State Machine and Example on Mealy State Machine
00:00 
Comparison of Mealy State Machine and Moore State Machine
00:00 
ROM – Read Only Memory
00:00 
RAM – Random Access Memory
00:00 
PLA – Programmable Logic Array
00:00 
PAL – Programmable Array Logic
00:00 
Binary Weighted Digital to Analog Converter DAC
00:00 
Example of Binary Weighted Digital to Analog Converter DAC
00:00 
R2R ladder Digital to Analog Converter DAC (Voltage Switched Network)
00:00 
Example on R2R Ladder Digital to Analog Convertor DAC
00:00 
R2R Ladder Digital to Analog Convertor DAC (Current Switched Network)
00:00 
Counter Type ADC, Counter Type Analog to Digital Converter
00:00 
Tracking Type ADC, Tracking Type Analog to Digital Converter
00:00 
Successive Approximation Type ADC, Successive Approximation Type Analog to Digital Converter
00:00 
Flash ADC, Flash Analog to Digital Converter
00:00 
Half Flash ADC, Half Flash Analog to Digital Converter
00:00 
Dual Slope ADC, Dual Slope Analog to Digital Converter
00:00 
Sigma Delta ADC, Sigma Delta Digital to Analog Converter
00:00 
Examples on ADC, Examples on Analog to Digital Converter
00:00