|
I Number
systems, Coding Schemes : BCD, Excess-3, Grey, r's and (r-l)’s
complement. Boolean Algebra, Fundamental theorems, Simplifications of
Boolean expressions. Logic gates and their truth table. gate
implementation and Truth table of Boolean functions.
II Standard forms of Boolean functions. Minterm and Maxterm
designation of functions. Simplification of functions on Karnaugh maps,
Incompletely specified functions. Cubical representation of Boolean
functions and determination of prime implicants. Selection of an optimal
set of prime implicants. multiple output circuits and map minimization of
multiple output circuits. Tabular determination of multiple output prime
implicants.
III Combinational circuits – Adder, subtractor, encode, decoder,
multiplexer. HDL for combinational circuits.
IV Flip Flops: RS , J-K, D, T. Sequential circuits. Clock, pulse
and level mode sequential circuits. Analysis and design of sequential
circuits. Synthesis of state diagrams, Finite memory circuits, equivalence
relations equivalent states and circuits, degeneration of classes 01
indistinguishable states and simplification by implicants tables. Mealy
and Moore machines, state assignment and memory element input equations,
Partitioning and state assignment.
V Switching Devices. Positive and Negative logic of OR, AND, NOR,
NAND, XOR and XNOR gates. Logic Family: RTL, DTL, DCTL, TTL, RCTL, ECL,
HTL, MOS and CMOS logic circuit. Speed and delay in logic circuits,
integrated circuit logic and noise immunity.
|