Switching Theory Logic Design of Digital Circuits

Complete course on digital logic ,Boolean theorems, minimizations , k-map, combinational and sequential logic circuits !
Switching Theory Logic Design of Digital Circuits
File Size :
5.66 GB
Total length :
16h 55m

Category

Instructor

SkillGems Education-P.V..V.Satyanarayana M.Tech (Phd)

Language

Last update

3/2023

Ratings

4.3/5

Switching Theory Logic Design of Digital Circuits

What you’ll learn

Introduction to Digital Eectronics and logic design of Digital circuits
Review of Number systems
Logic operations,Error Detection and Correction codes
Minimization of switching functions using K-Maps 3 ,4,5 Variable K-Maps etc.,
Combinatiobal Logic Circuits
Combinational logic circuits ( Advanced)
Sequential Logic Circuits Full Concepts

Switching Theory Logic Design of Digital Circuits

Requirements

There is no need to learn before taking to the course, we will explain each every concept from scratch
All youneed a mobile to listen class or laptop and pen and paper to make a note of it.

Description

Learning switching theory or  digital electronics is like playing a football! Open doors to careers and hobbies in online digital job field Building on the knowledge you gained in the Digital Electronics course will help you to move forward in digital field and opens even more doors to diverse careers, projects and jobs .The trainer is certified person in Coursera and in NPTEL. He has 20 years of teaching field experience in both theoretical and practical. Without computers and digital systems we cannot imagine our lives and coming future rapidly increasing in digital field. Think about how many of them are now operated their works particularly in  industries,  businesses and projects that involve computers or computer control. Even though bio medical ,mechanical and automobiles are chock full of digital electronics now. All of this involves digital electronics, and you want in on it today. In this  course, you will learn digital electronic circuits, switching theory and logic design  and also it will be in use to make digital systems.. You’ll don’t need a good understanding of any  electronics skills but  some simple math skills, a computer, and that’s it!No prior knowledge of digital electronics or programming is required, and yet by the end of this course you’ll have built functioning digital electronic circuits and surely you can design some digital circuits which you want.Lesson overview:In this course ,you further develop your knowledge and skills to include digital electronics and practice your skills on real-life digital components.In the first section you may learn the how the digital era changed  and how it helps your career and Review of number systemsSecond section you may learn the full information on number systems and logic operation,error detection and correction codesIn this course you will gain a wide knowledge on digital systems and this course surely will help you to move forward or jump in VLSI field. In this course we’ll be covering:History of Electronics and how digital field emergedWhat is signal, analog and digital signal?What is digital system?Number systems full and its conversionsIntroduction to Boolean AlgebraBasic Logic operationsBoolean theorems and postulatesDemorgans theoremsConsensus theoremBoolean functionDual of the Boolean function and Complement of a Boolean functionRepresentation of Boolean function: Min term and max termstandard or canonical SOP formConversion of SOP to standard or canonical SOP formConversion of SOP to standard or canonical SOP form with truth table (2 methods)Standard POS & Conversion of POS to standard or canonical POS formConversion SOP TO CPOS and CSOP forms with truth table example problemsConversion SOP TO CPOS and CSOP forms with truth table example problemsConversion of standard SOP and POS( vice versa) with procedure( 3rd model)Conversion of standard CSOP and CPOS with procedure( 3rd model)Minimization of logic functions using Boolean theorems3 Variable minterms and maxtermsDigital logic gatesLogic gatesProperties of Excusive OR gateInverted GatesGeneration of logic diagram with Boolean expressionMulti Level AND-OR realizationTwo Level AND-NOR realizationMulti Level AND-OR and NAND realization problemsMulti Level AND-OR and NOR realization problemsAddition of BCD NumbersAddition of Excess-3Gray code or self reflection code or cyclic codeGray to Binary code conversionBinary to Gray code conversionError Detection and Correction codesHamming codeHamming code 7 bit example.Minimization of switching functions using K-Maps2,3,4,5 variable K-MapsCode convertersBCD to Excess-3 vice versaBinary to Gray vice versa etc.,Combinational logic circuitsHalf adderFull adderHalf subtractorFull subtractorParallel adderDecodersEncodersMultiplexersDE multiplexersSequential logic circuitsFlip flopsRegistersCountersand much more and more!

Overview

Section 1: Basics of course

Lecture 1 Introduction to course outlines

Lecture 2 Review of number systems

Lecture 3 Review of number systems:Positional and Non Positional number system

Lecture 4 Binary number system

Lecture 5 Octal number system

Lecture 6 Hexadecimal number system

Section 2: Review of Number systems

Lecture 7 Types of number systems (Binary,Decimal,Octal and Hexa decimal )

Lecture 8 Conversion possibilities from one radix to another radix

Lecture 9 Radix ‘r’ (Any number system to ) to Decimal

Lecture 10 Decimal to radix r (or any number system)Conversion procedure

Lecture 11 Decimal to hexa,octal number system conversion with examples

Lecture 12 Binary to Hexa decimal conversion

Lecture 13 Binary to decimal conversion

Lecture 14 Hexa decimal to binary and also to Octal conversion

Lecture 15 Hexa decimal to Decimal conversion procedure with examples

Lecture 16 Binary to octal conversion

Lecture 17 Binary to decimal conversion

Lecture 18 Hexa decimal to decimal conversion

Lecture 19 Hexa decimal to Octal conversion

Lecture 20 Octal to decimal conversion

Lecture 21 Diminished radix or ‘r-1’ s complement with 9s and 1s complement examples

Lecture 22 r’s complement (10s and 2’s complements)

Lecture 23 Difference between ‘r’ and r-1’s coplement methods

Lecture 24 Octal arithmetic (addition ,subtraction)

Lecture 25 Octal multiplication

Lecture 26 Hexadecimal arithmetic (Addition and subtraction)

Lecture 27 Data representation methods (Unsigned.signed magnitude,1’sc.& 2’scomplement )

Lecture 28 r’s complement (2’s and 10’s complement ) method of subtraction

Lecture 29 r-1 ‘s complement (1’s and 9’s complement etc.,) method of subtraction problems

Lecture 30 Binary Arithmetic -Addition rules and truth table

Lecture 31 Binary Addition problems

Lecture 32 Binary subtraction rules and problems

Lecture 33 Binary Subtraction (Big number-Small number and vice versa)

Lecture 34 Binary multiplication

Lecture 35 Binary Division

Lecture 36 Binary codes

Lecture 37 Binary codes (Sequential ,Alphanumeric etc.,)

Lecture 38 Examples on weighted codes

Lecture 39 BCD ,EXCESS-3, 2-4-2-1,Self complement codes

Lecture 40 Alphanumeric ,EBCDIC,Hollerith codes in details explanation

Section 3: Logic operations,Error Detection and Correction codes

Lecture 41 Introduction to Boolean Algebra

Lecture 42 Baisc Logic operations

Lecture 43 Boolean theorems and postulates

Lecture 44 Boolean theorems and postulates-2

Lecture 45 Demorgans theorems

Lecture 46 Consensus theorem

Lecture 47 Boolean function

Lecture 48 Dual of the boolean function

Lecture 49 Complement of a boolean function

Lecture 50 Representation of boolean function:Min term and max term

Lecture 51 standard or canonical SOP form

Lecture 52 Conversion of SOP to standard or canonical SOP form

Lecture 53 Conversion of SOP to standard or canonical SOP form with truthtable (2 methods)

Lecture 54 Standard POS & Conversion of POS to standard or canonical POS form

Lecture 55 Conversion SOP TO CPOS and CSOP forms with truth table example problems

Lecture 56 Conversion SOP TO CPOS and CSOP forms with truth table example problems

Lecture 57 Conversion of standaed SOP and POS( vice versa) with procedure( 3rd model)

Lecture 58 Conversion of standard CSOP and CPOS with procedure( 3rd model)

Lecture 59 Minimization of logic functions using boolean theorems

Lecture 60 3 Variable minterms and maxterms

Lecture 61 Digital logic gates

Lecture 62 LOogic gates

Lecture 63 Properties of Excusive OR gate

Lecture 64 Inverted Gates

Lecture 65 Generation of logic diagram with boolean expression

Lecture 66 Multi Level AND-OR realization

Lecture 67 Two Level AND-NOR realization

Lecture 68 Multi Level AND-OR and NAND realization problems

Lecture 69 Multi Level AND-OR and NOR realization problems

Lecture 70 Addition of BCD Numbers

Lecture 71 Addition of Excess-3

Lecture 72 Gray code or self reflection code or cyclic code

Lecture 73 Gray to Binary code conversion

Lecture 74 Binary to Gray code conversion

Lecture 75 Error Detection and Correction codes

Lecture 76 Hamming code

Lecture 77 Hamming code 7 bit example

Section 4: Minimization of switching functions using K-Maps etc.,

Lecture 78 K-Map method

Lecture 79 K-Map format

Lecture 80 Representation of boolean function:Min term and max term using K-Maps

Lecture 81 Plotting a graphical table of 2,3 and 4 variables on K-Map

Lecture 82 Plotting of switching/Boolean function or expression

Lecture 83 Plot the boolean expressions on K-Map both SOP and POS

Lecture 84 Minimization of switching functions using K-map

Lecture 85 Rules of adjancent cells & Prime implicants,Essential Prime implicants

Lecture 86 4-Variable K-Map

Lecture 87 5-Variable K-Map

Lecture 88 Minimal SOP realization using K-Map

Lecture 89 Minimal POS realization using K-Map

Lecture 90 Conversion of SOP to POS to SOP problems using 3,4 variable using K-Map method

Lecture 91 Code converters:Binary to BCD conversion using K-Map

Lecture 92 Code converters: BCD to EXCESS-3 conversion

Lecture 93 EXCESS-3 TO BCD code converter

Lecture 94 EXCESS-3 TO BCD code converter ‘C’ term modification for better group

Lecture 95 Binary to Gray code converter

Lecture 96 5-Variable K-Map Practice problem

Lecture 97 Don’t Care Conditions

Section 5: Combinatiobal Logic circuits

Lecture 98 Introduction to Combinational logic or switching or digital circuits

Lecture 99 How to design a combinational logic circuits

Lecture 100 Half-Adder

Lecture 101 Full adder

Lecture 102 Half-subtractor

Lecture 103 Full subtractor

Lecture 104 4-8 bit binary adder

Lecture 105 How to design parallel binary adders-subtractors and 2’s complement adder

Lecture 106 4-bit adder-subtractor

Lecture 107 BCD adder combinational logic circuit design

Section 6: Combinational logic circuits ( advanced)

Lecture 108 Introduction to decoders

Lecture 109 2 to 4 decoder

Lecture 110 3 to 8 decoder

Lecture 111 4 to 16 decoder

Lecture 112 4 to 16 decoder using two 3 to 8 decoders

Lecture 113 5 to 32 decoder

Lecture 114 what is encoder?

Lecture 115 Decimal to BCD encoder

Lecture 116 Octal to binary encoder

Lecture 117 4:2 Priority encoder

Lecture 118 Octal to binary priority encoder

Lecture 119 Whatis multiplexer

Lecture 120 4:1 multilexer

Lecture 121 8:1 multiplexer

Lecture 122 32:1 multiplexer design using four 8:1 s MUXes and one 2:4 decoder

Lecture 123 32:1 multiplexer using two 16:1 muxes

Lecture 124 2:1 multiplexer and 3:1 multiplexer using 2:1 multiplexer

Lecture 125 Demultiplexer

Lecture 126 1:2 Demultiplexer

Lecture 127 1:2 Demultiplexer simplified

Lecture 128 1:4 Demultiplexer

Lecture 129 1:8 Demultiplexer

Lecture 130 Designa 1 to 8 demux with two 1 to4 demuxes

Lecture 131 How to design Design different types of demultiplexers

Lecture 132 Higher order Demultiplexer

Section 7: Sequential logic circuits

Lecture 133 Introduction to sequential logic circuits and its comparisions

Lecture 134 One bit memory cell

Lecture 135 One bit memory cell with simple example

Lecture 136 What is latch and Flip-Flop?

Lecture 137 SR Latch using NOR gates

Lecture 138 S’R’ Latch , SR latch and Gated SR latch Using NAND gates

Lecture 139 What is Flip-Flop and Types of Triggering (positive and negative edge triggering

Lecture 140 Types of Flip-Flops

Lecture 141 Clocked SR Flip Flop using NOR gate

Lecture 142 Clock SR Flip Flop and Its Truth Table

Lecture 143 Characteristic Table of SR Flip Flop

Lecture 144 Excitation Table of SR Flop-Flop and state Diagram

Lecture 145 Clocked SR Flip Flop using NAND gate

Lecture 146 Clocked SR Flip Flop using NAND gate Characteristic Table

Lecture 147 Clocked SR Flip Flop using NAND gate Excitation Table

Lecture 148 D Flip Flop using SR flip flop of Truth Table ,Characteristic ,Excitation Table

Lecture 149 State Diagram and Timing Diagram of D flip flop

Lecture 150 JK Flip Flop using NAND Gates includes Truth,Characteristic,Excitationtables etc

Lecture 151 Timing Diagram of JK Flip Flop

Lecture 152 T FLIP FLOP Truth ,Characteristic,Excitation,Timing, Diagram etc.,

Lecture 153 Conversion of One Flip-Flop to another Flip Flop with example

Lecture 154 Conversion of SR FlipFlop to D-Flip Flop

Lecture 155 Conversion of SR FlipFlop to T-Flip Flop

Lecture 156 Conversion of SR FlipFlop to J-K-Flip Flop

Lecture 157 Conversion of JK FlipFlop to T-Flip Flop

Lecture 158 Applications of Flip Flops(freequency division,registers.parallel data storage)

Lecture 159 Introduction to counters

Lecture 160 3 bit Asynchronous up Counter

Lecture 161 4 bit Asynchronous up Counter

Lecture 162 Design of Ripple counter with Modulus <2 power n

Lecture 163 Design of MOD-6 synchronous up counter

Lecture 164 Timing Diagram of MOD-6 synchronous up counter

Lecture 165 Design of MOD-10 (or Decade Counter) Synchronous Up Counter

Lecture 166 Design of Asynchronous 2 bit Down Counter

Lecture 167 Design of Asynchronous 3 bit Down Counter

Lecture 168 Design of synchronous 4 bit Up Counter

Lecture 169 Design of synchronous 4 bit Down Counter

Lecture 170 Design of Synchronous MOD 5 Counter

Lecture 171 Design of BCD synchronous Counter using T-Flip Flops

Lecture 172 Ring Counter

Lecture 173 Johnson Counter or Twisted Ring Counter

Lecture 174 Introduction to Shift Registers

Lecture 175 Controlled Buffer Register

Lecture 176 SISO,SIPO,PIPO Shift Registers

Lecture 177 PISO Shift Registers

Lecture 178 Bi Directional Shift Registers

Lecture 179 Universal Shift Registers

This course is perfectly suited to those who are studying or working in digital or in electronics and communication field.,Electrical & Electronics Engineers,Computer Science or Engineers or even Mechanical students also necessary the concepts of digital electronics

Course Information:

Udemy | English | 16h 55m | 5.66 GB
Created by: SkillGems Education-P.V..V.Satyanarayana M.Tech (Phd)

You Can See More Courses in the IT & Software >> Greetings from CourseDown.com

New Courses

Scroll to Top