Switching Theory & Logic Design
Number Systems and CodesPhilosophy of number systems - complement representation of negative numbers - binary arithmetic - binary codes - error detecting and error correcting codes - hamming codes.Boolean Algebra and Switching FunctionsFundamental 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.Minimization of Switching FunctionsMap method, Prime implicants, Don't care combinations, Minimal SOP and POS forms, Tabular Method, Prime - Implicant chart, simplification rules.Combinational Logic DesignDesign using conventional logic gates, Encoder, Decoder, Multiplexer, De-Multiplexer, Modular design IC chips, MUX Realization of switching functions Parity bit generator, Code-converters, Hazards and hazard free realizations.Programmable Logic Devices, Threshold LogicBasic 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.Sequential Circuits - IClassification of sequential circuits (Synchronous, Asynchronous, Pulse mode, Level mode with examples) Basic flop-flops-Triggering and excitation tables. Steps in synchronous sequential circuit design. Design of modulo-N Ring and shift counters, Serial binary adder, sequence detector.Sequential Circuits - IIFinite 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.Algorithmic State MachinesSalient features of the ASM chart-Simple examples-System design using data path and control subsystems-control implementations-examples of Weighing machine and Binary multiplier.