B.Tech II Year II Semester (R18)
This course provides in-depth knowledge of switching theory and the design
techniques of digital circuits, which is the basis for design of any digital circuit. The main objectives are:
Upon completion of the course, students should possess the following skills:
Number System and Boolean Algebra and Switching Functions: Number Systems, Base Conversion Methods, Complements of Numbers, Codes- Binary Codes, Binary Coded Decimal Code and its Properties, Unit Distance Codes, Alpha Numeric Codes, Error Detecting and Correcting Codes. Boolean Algebra: Basic Theorems and Properties, Switching Functions, Canonical and Standard Form, Algebraic Simplification of Digital Logic Gates, Properties of XOR Gates, Universal Gates, Multilevel NAND/NOR realizations.
Minimization and Design of Combinational Circuits: Introduction, The Minimization with theorem, The Karnaugh Map Method, Five and Six Variable Maps, Prime and Essential Implications, Don’t Care Map Entries, Using the Maps for Simplifying, Tabular Method, Partially Specified Expressions, Multi- output Minimization, Minimization and Combinational Design, Arithmetic Circuits, Comparator, Multiplexers, Code Converters, Wired Logic, Tristate Bus System, Practical Aspects related to Combinational Logic Design, Hazards and Hazard Free Relations.
Sequential Machines Fundamentals: Introduction, Basic Architectural Distinctions between Combinational and Sequential circuits, The Binary Cell, Fundamentals of Sequential Machine Operation, The Flip-Flop, The D-Latch Flip-Flop, The “Clocked T” Flip-Flop, The “Clocked J-K” Flip- Flop, Design of a Clocked Flip-Flop, Conversion from one type of Flip- Flop to another, Timing and Triggering Consideration, Clock Skew.
R18 B.TECH MECHATRONICS
Sequential Circuit Design and Analysis: Introduction, State Diagram, Analysis of Synchronous Sequential Circuits, approaches to the Design of Synchronous Sequential Finite State Machines, Design Aspects, State Reduction, Design Steps, Realization using Flip-Flops Counters - Design of Single mode Counter, Ripple Counter, Ring Counter, Shift Register, Shift Register Sequences, Ring Counter Using Shift Register.
Sequential Circuits: Finite state machine-capabilities and limitations, Mealy and Moore models- minimization of completely specified and incompletely specified sequential machines, Partition techniques, and Merger chart methods-concept of minimal covertable. Algorithmic State Machines: Salient features of the ASM chart-Simple Examples-System design using data path and control subsystems-control implementations-examples of Weighing machine and Binary multiplier.
Loading Question Papers
Fetching data from database...