B.Tech II Year II Semester - Switching Theory and Logic Design
T P C
4+1* 0 4 '
UNIT I - NUMBER SYSTEMS & CODES :
Contents: 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 :
Contents:Fundamental postulates of Boolean Algebra - Basic theorems and properties - switching functions–Canonical and Standard forms-Algebraic simplification digital logic gates, properties of XOR gates –universal gates-Multilevel NAND/NOR realizations.
UNIT III - MINIMIZATION OF SWITCHING FUNCTIONS :
Contents:Map method, Prime implicants, Don’t care combinations, Minimal SOP and POS forms, Tabular Method, Prime –Implicant chart, simplification rules
UNIT IV - COMBINATIONAL LOGIC DESIGN :
Contents: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 :
Contents:
Basic PLD’s-ROM, PROM, PLA, PLD Realization of Switching functions using PLD’s. Capabilities and limitations of Threshold gate, Synthesis of Threshold functions, Multigate Synthesis
UNIT VI - SEQUENTIAL CIRCUITS - I :
Contents: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 :
Contents: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 cover table.
UNIT VIII - ALGORITHMIC STATE MACHINES :
Contents:
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.
Text Books :
1. Switching & Finite Automata theory – Zvi Kohavi, TMH,2nd Edition.
2. Digital Design – Morris Mano, PHI, 3rd Edition, 2006
Courtesy btechstudycircle.com
4+1* 0 4 '
UNIT I - NUMBER SYSTEMS & CODES :
Contents: 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 :
Contents:Fundamental postulates of Boolean Algebra - Basic theorems and properties - switching functions–Canonical and Standard forms-Algebraic simplification digital logic gates, properties of XOR gates –universal gates-Multilevel NAND/NOR realizations.
UNIT III - MINIMIZATION OF SWITCHING FUNCTIONS :
Contents:Map method, Prime implicants, Don’t care combinations, Minimal SOP and POS forms, Tabular Method, Prime –Implicant chart, simplification rules
UNIT IV - COMBINATIONAL LOGIC DESIGN :
Contents: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 :
Contents:
Basic PLD’s-ROM, PROM, PLA, PLD Realization of Switching functions using PLD’s. Capabilities and limitations of Threshold gate, Synthesis of Threshold functions, Multigate Synthesis
UNIT VI - SEQUENTIAL CIRCUITS - I :
Contents: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 :
Contents: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 cover table.
UNIT VIII - ALGORITHMIC STATE MACHINES :
Contents:
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.
Text Books :
1. Switching & Finite Automata theory – Zvi Kohavi, TMH,2nd Edition.
2. Digital Design – Morris Mano, PHI, 3rd Edition, 2006
Courtesy btechstudycircle.com
