 # Digital Electronics - I

#### Features Includes:

• 176 - 3D/2D Animation
• 850 Pages of Content
• 60 Lecture Hours
• 30 Solved Problems
• 180 Quiz
• Suitable for All Technical University Syllabus

#### Course Description

This learning course deals with the fundamentals of digital electronics and lays strong foundations to the combinational and sequential logic circuits

#### OBJECTIVES:

• Learn various number systems, Boolean algebra and logic gates
• Outline the formal procedures for the analysis and design of combinational logic circuits
• Be familiar with designing synchronous sequential circuits
• Illustrate the concept of asynchronous sequential circuits
###### UNIT I – BASICS OF DIGITAL ELECTRONICS

Introduction to digital electronics - History of digital system, Basics of digital electronics, Digital revolution. Introduction to number system - What is number system, Types of number systems. Different types of number system - Binary number system, Decimal number system, Octal number system, Hexadecimal number system. Number base conversion - Binary to decimal conversion, Conversion of octal number systems, Conversion of hexadecimal number systems. Arithmetic operations - Binary arithmetic, Negative numbers in 1's complement form, Negative numbers in 2's complement form, Binary multiplication, Binary division, Hexadecimal arithmetic. Binary codes - Binary codes, BCD (Binary Coded Decimal) code, Excess-3 code, Gray code, Gray to binary and binary to gray code conversion, Five-bit BCD codes. Boolean Algebra and theorems – Introduction, Boolean postulates and law, Duality theorem. DeMorgan's theorem - DeMorgan's theorem, DeMorgan's theorem and other postulates to simplify Boolean expressions. Boolean Expression - Boolean Expression, Sum of Product Form, Product of Sum Form, Standard SOP and POS Forms, Converting expressions in Standard SOP or POS Forms, M-Notations: Minterms and Maxterms - Complements of Canonical formulae. Minimization of Boolean expression - Minimization of Boolean expression. Karnaugh (K) map - Introduction of Karnaugh (K) map, Variable of K – map, Plotting a Karnaugh map, Grouping cells for simplification. Simplification of SOP And POS Expressions - Simplification of SOP Expressions, Incompletely specified Functions (Don't Care Terms), Describing incomplete boolean function, Don't Care conditions in logic design, Minimization of incompletely specified Function, Simplification of POS Expressions, Five variable K-map. Quine - Mccluskey method - Limitations of Karnaugh map, Quine-Mccluskey minimization technique, Example of Quine-Mccluskey method, Quine-Mccluskey using don't care terms, Prime implicant table and Redundant prime implicants. Logic gates - Introduction to logic gates, Types of logic gates, OR gate, AND gate, NOT gate (inverter), Derived or complex gates, Boolean function for logic gates, Alternative logic-gates Representation. Universal gates - Introduction of universal gates, NAND gate - NOR gate, Conversion of AND/OR/NOT Logic to NAND/NOR Logic using Graphical Procedure, Properties of EX-OR gates. Implementation of logic function using logic gates - Implementing the expression with logic gates, Implementation of SOP boolean expression, Implementation of POS boolean expression, NAND – NAND implementation, NOR – NOR implementation, Multilevel gate implementations, Multilevel NAND and NOR implementation. Multilevel gates - Multilevel gate implementations, Multilevel NAND and NOR implementation, Multiple output implementation.