This document outlines the course units for a Switching Theory and Logic Design class, including:
1. Number systems and codes such as binary arithmetic, error detecting and correcting codes like Hamming codes.
2. Boolean algebra and switching functions including canonical forms, logic gates, and multilevel NAND/NOR realizations.
3. Minimization of switching functions using methods like map, prime implicants, and don't cares to find minimal SOP and POS forms.
4. Combinational logic design using gates, encoders, decoders, multiplexers, and modular design with ICs including hazards and hazard-free realizations.
5. Programmable logic devices including ROM, PROM
This document outlines the course units for a Switching Theory and Logic Design class, including:
1. Number systems and codes such as binary arithmetic, error detecting and correcting codes like Hamming codes.
2. Boolean algebra and switching functions including canonical forms, logic gates, and multilevel NAND/NOR realizations.
3. Minimization of switching functions using methods like map, prime implicants, and don't cares to find minimal SOP and POS forms.
4. Combinational logic design using gates, encoders, decoders, multiplexers, and modular design with ICs including hazards and hazard-free realizations.
5. Programmable logic devices including ROM, PROM
This document outlines the course units for a Switching Theory and Logic Design class, including:
1. Number systems and codes such as binary arithmetic, error detecting and correcting codes like Hamming codes.
2. Boolean algebra and switching functions including canonical forms, logic gates, and multilevel NAND/NOR realizations.
3. Minimization of switching functions using methods like map, prime implicants, and don't cares to find minimal SOP and POS forms.
4. Combinational logic design using gates, encoders, decoders, multiplexers, and modular design with ICs including hazards and hazard-free realizations.
5. Programmable logic devices including ROM, PROM
This document outlines the course units for a Switching Theory and Logic Design class, including:
1. Number systems and codes such as binary arithmetic, error detecting and correcting codes like Hamming codes.
2. Boolean algebra and switching functions including canonical forms, logic gates, and multilevel NAND/NOR realizations.
3. Minimization of switching functions using methods like map, prime implicants, and don't cares to find minimal SOP and POS forms.
4. Combinational logic design using gates, encoders, decoders, multiplexers, and modular design with ICs including hazards and hazard-free realizations.
5. Programmable logic devices including ROM, PROM
KAKINADA II Year B.Tech EEE I-Sem T P C 4+1* 0 4 SWITCHING THEORY AND LOGIC DESIGN UNIT I NUMBER SYSTEMS & CODES : Philosophy of number systems complement representation of negative numbers-binary arithmetic-binary codes-error detecting & error correcting codes hamming codes. UNIT II BOOLEAN ALGEBRA AND SWITCHING FUNCTIONS : Fundamental postulates of Boolean Algebra Basic theorems and properties - switching functionsCanonical and Standard forms-Algebraic simplification digital logic gates, properties of XOR gates universal gates-Multilevel NAND/NOR realizations. UNIT III MINIMIZATION OF SWITCHING FUNCTIONS : Map method, Prime implicants, Dont care combinations, Minimal SOP and POS forms, Tabular Method, Prime Implicant chart, simplification rules. UNIT IV COMBINATIONAL LOGIC DESIGN Design using conventional logic gates, Encoder, Decoder, Multiplexer, De-Multiplexer, Modular design using IC chips, MUX Realization of switching functions Parity bit generator, Code-converters, Hazards and hazard free realizations. UNIT V PROGRAMMABLE LOGIC DEVICES, THRESHOLD LOGIC : Basic PLDs-ROM, PROM, PLA, PLD Realization of Switching functions using PLDs. Capabilities and limitations of Threshold gate, Synthesis of Threshold functions, Multigate Synthesis. UNIT VI SEQUENTIAL CIRCUITS - I : Classification of sequential circuits (Synchronous, Asynchronous, Pulse mode, Level mode with examples) Basic flip-flops-Triggering and excitation tables. Steps in synchronous sequential circuit design. Design of modulo-N Ring & Shift counters, Serial binary adder,sequence detector. UNIT VII SEQUENTIAL CIRCUITS - II : Finite state machine-capabilities and limitations, Mealy and Moore modelsminimization of completely specified and incompletely specified sequential machines, Partition techniques and Merger chart methods-concept of minimal cover table. UNIT VIII ALGOROTHIMIC 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. TEXTBOOKS : 1. Switching & Finite Automata theory Zvi Kohavi, TMH,2nd Edition. 2. Digital Design Morris Mano, PHI, 3rd Edition, 2006. REFERENCES : 1. An Engineering Approach To Digital Design Fletcher, PHI. Digital Logic Application and Design John M. Yarbrough, Thomson. 2. Fundamentals of Logic Design Charles H. Roth, Thomson Publications, 5th Edition, 2004. 3. Digital Logic Applications and Design John M. Yarbrough, Thomson Publications, 2006.
Jawaharlal Nehru Technological University Anantapur B. Tech III-I Sem. (EEE) L T P C 3 1 0 3 15A04510 Digital Circuits and Systems (Moocs-I) Course Outcomes