ECE 568 SWITCHING THEORY

1
ECE 568 SWITCHING THEORY
Catalog Data Switching circuits,(Lct4)
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.
2

• Textbook
• Z.Kohavi, Switching and Finite Automata theory,
  Mc.Graw Hill Co., Second Edition, 1978
• References
• 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.

3
Co-ordinator Harpreet Singh, Professor Goals
To teach how to design combinational circuits ,
sequential circuits and linear sequential
circuits. Prerequisites by Topic 1. Digital
Logic Analysis 2. Combinational circuit design
4
Topics 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.
5
Schienman method for simplification of Boolean
Functions 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 -------(2
classes) b) Boolean algebra applications in
determining the Reliability of computer
communication network. Schienman
Non-overlapping method for determining
reliability. Fratta and Montanari method
(FM method) for determining terminal
reliability. ------------(2 classes)
6
C) Boolean Algebra and Switching theory
applications in the design of Computer
circuits. Boolean algebra technique for
designing pipelined arithmetic unit of a
computer ----------(2 classes) D) Special
classes of combinational functions such as
Unate functions and Threshold functions -----
-----(2 classes) 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.
7
Correspondence between threshold gate and Neural
networks Boolean neural network technique for
target detections --------(2 classes) f) Binar
y Decision Diagrams and their applications in the
fault analysis g) Symmetric function
synthesis. Properties of symmetric functions.
Identification of symmetric functions Shannons
expansion theorem to symmetric functions ------
-----(2 classes) h) Fuzzy logic analysis and
synthesis
8
3. Selected topics on Sequential
circuits. 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 ---------(2
classes) b) Reduction of sequential circuits and
design using various flip flops. Huffman mealy
procedure for reduction of sequential
circuits. --------(2 classes)
9
C) Generation of compatible set of states and
selection of minimal sets of compatible sets
using implication chart ---------(2
classes) d) Design of linear sequential machines
using unit delays, modulo p adders and modulo p
scalar multipliers. -----------(2
classes) e) Reduction of linear machines.
Diagonostic matrix, Minimization procedure and
realization of reduced machines ----------(2
classes) f) Identification of linear machines.
Identification procedure,Use of distinguishing
tables in the design of linear sequential
machines --------(2 classes)
10
HARPREET SINGH OFFICE Professor, 3111
Engineering Bldg Electrical and Computer
Engineering, Wayne State University
TELEPHONE 1981.
313-577-3917
E-mail hsingh_at_ece.eng.wayne.edu Subject
s taught in ECCS Mini -Micro computers Engineerin
g software design Digital design Switching theory
11
Research Interests Neural Networks Fuzzy
Logic Software Development Image
Processing Switching theory Computer
design Systems Theory
12
Generation of Switching Theory First
Generation - Few Variables - Manual Second
Generation - A large number of variables -
Computer Aided
13
SWITCHING THEORY -- Combinational
Circuits -- Sequential Circuits\ Special
features -- 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
14
SWITCHING THEORY WILL MAKE YOUR RIDE IN THE ECCS
PROGRAM AS SMOOTH , SAFER AND MORE RELIABLE
GOOD LUCK questions???