ECE 568 SWITCHING THEORY. Catalog Data : Switching circuits,(Lct:4) Cr.4 Pre req : ECE 468 Threshold symmetric functions, and iterative networks. Multivalued and fuzzy logic. Complex Sequential machine realization. State equivalence and minimization. Automata and linear machines.
Catalog Data: Switching circuits,(Lct:4) Cr.4
Pre req: ECE 468
Threshold symmetric functions, and iterative
networks. Multivalued and fuzzy logic. Complex
Sequential machine realization. State equivalence
and minimization. Automata and linear machines.
State identification and fault detection.
Z.Kohavi, Switching and Finite Automata theory, Mc.Graw Hill Co., Second Edition, 1978
* N.N. Biswas, Introduc2tion to Logic and Switching Theory
* Gordon and Breach. Science Publishers, Inc 1975.
* N. Biswas, Logic Design Theory, Prentice Hall, 1993
* Handouts of several research papers.
Harpreet Singh, Professor
To teach how to design combinational circuits ,
sequential circuits and linear sequential circuits.
Prerequisites by Topic:
1. Digital Logic Analysis
2. Combinational circuit design
1. Review of Combinational and Sequential
Circuits (2 classes)
2. Selected Topics on Combinational Circuits.
a) Gating functions for three or more variable cases
Minimization of combinational circuits for a very
large number of variables.
* Schienman method for overlapping and Non-overlapping cases
* Schienman method for multiple output simplification
* Combination of Schienman method and K-map method for
simplification of very large number of variables
b) Boolean algebra applications in determining the Reliability of
computer communication network. Schienman Non-overlapping
method for determining reliability. Fratta and Montanari method (F&M
method) for determining terminal reliability.
design of Computer circuits. Boolean algebra technique for
designing pipelined arithmetic unit of a computer
D) Special classes of combinational functions such as Unate
functions and Threshold functions
E) Design of threshold functions using Dertouzos method.
Design of Boolean functions using implied Minterm
structure(IMS). Design of Boolean functions using Minimal
True and Maximal False vertices. Use of K map in the design
of Unate functions.
Boolean neural network technique for target detections
f) Binary Decision Diagrams and their applications in the
g) Symmetric function synthesis. Properties of symmetric
functions. Identification of symmetric functions
Shannons expansion theorem to symmetric functions
h) Fuzzy logic analysis and synthesis
a) T,R-S,J-K,RST and T-G flip flops and their input eqns.
Design of sequential circuits using T,R-S,J-K,RST, and
T-G flip flops. Computer aided disign of sequential circuits
using tabular charts for large number of variable cases
b) Reduction of sequential circuits and design using various
flip flops. Huffman mealy procedure for reduction of
minimal sets of compatible sets using implication chart
d) Design of linear sequential machines using unit delays,
modulo p adders and modulo p scalar multipliers.
e) Reduction of linear machines. Diagonostic matrix,
Minimization procedure and realization of reduced
f) Identification of linear machines. Identification
procedure,Use of distinguishing tables in the design
of linear sequential machines
Professor, 3111 Engineering Bldg
Electrical and Computer Engineering,
Wayne State University TELEPHONE
Subjects taught in ECCS
Mini -Micro computers
Engineering software design
- Few Variables
- A large number of variables
- Computer Aided
-- Combinational Circuits
-- Sequential Circuits\
--Boolean Neural Networks
-- Fuzzy Switching Theory
-- Boolean Algebra Approach to Reliability
-- Boolean Algebra for VLSI Application
--State variable approach to sequential machine design
--Design using Verilog
SWITCHING THEORY WILL MAKE YOUR RIDE IN THE ECCS PROGRAM AS SMOOTH , SAFER
AND MORE RELIABLE