Switching Theory and Logic Design

Unit-wise syllabus

• Number Systems, Codes and Boolean Theorems
  Radix conversions; r's and (r-1)'s complements of signed numbers; Gray, BCD, Excess-3, 2421 codes; error detection and correction (parity, Hamming code); Boolean theorems; De Morgan's theorems; complementation and duality; Logic operations; SOP and POS forms; NAND-NAND and NOR-NOR realizations
• Minimization Techniques and Combinational Logic Design
  K-map (up to 6 variables) and Quine-McCluskey (tabular) method; Half/full adder and subtractor; 4-bit adder-subtractor; BCD adder, Excess-3 adder, carry look-ahead adder; Code converters using Karnaugh method
• Combinational Logic using MSI/LSI and PLDs
  Encoder, decoder, multiplexer, de-multiplexer; higher-order from lower-order circuits; Boolean functions using decoders and multiplexers; Priority encoder, 4-bit digital comparator, seven-segment decoder; PLDs: PROM, PAL, PLA - structures and realization
• Sequential Circuits I
  Synchronous vs asynchronous circuits; NAND/NOR latches; Flip-flops: RS, JK, T, D with reset/clear; flip-flop conversions; Ripple and synchronous counters; Johnson and ring counters; Registers: buffer, shift, bidirectional, universal shift register
• Sequential Circuits II
  Finite state machine; state diagrams and state tables; reduction of state tables; Analysis of clocked sequential circuits; Mealy to Moore conversion and vice-versa; Sequence generator and sequence detector design (with/without overlapping)

Download