Design of Sequencial Circuits PPT and PDF SLIDES

Design of Sequencial Circuits
Instructor:Marek A.Perkowski
Textbook: Switching and Finite Automata Theory by Zvi Kohavi
Download Slides from here

Finite State Machines and their minimization.

1. Review of Finite State Machines.


2. Introduction to Minimization of Finite State Machines. Completely Specified Machines.

 

Minimization, state assignment and realization of Finite State Machines.

1. Minimization of FSMs.


2. Advanced FSM minization and assignment.


3. FSM State Encoding

State Assignment of FSMs. Advanced methods and partition theory.

1. Rule based state assignment.


2. State assignment using-multiline and partitions.


3. Example of state assignment using rules.


4. Encoding based on partitions.

Design of FSM from Flowcharts and similar techniques.

1. Addition and Subtraction with Signed-Magnitude Data. PPT slides from Mano. Use of flowcharts.Ciesielski. RTL design. Slides in PDF. HSlides in PDF. Control logic design by Ciesielski.


2. Marek Perkowski et al. Automatic Design of Finite State Machines with Electrically Programmable Devices. Paper in PDF.


3. Marek Perkowski. Symbolic Analysis of Sequential and Parallel Program Schemata in the Digital Design Automation System. Paper in PDF.


4. 4.       FSM implementation in VHDL. PPT slides.

Some more slides on Flowcharts and similar techniques  

1. Slides in PDF on Design using flow-charts.


2. Slides in PDF from Mano about basic design on RTL level using flowcharts.


3. Davis. State Machine Design methods. Flowcharts. Slides in PDF>


4. Sequencing and Control. Slides in PPT. Fundamental.


5. Slides in PPT. Instructions in microprocessor. Addressing modes.Slides in PDF in control unit design using flowchart and HDL.


6. Lectures on Assembly Language for Intel Based computers. FSM. While Operator. Flow-charts. Slides in PPT.


7. Slides in PDF> Special Topics in Advanced Digital System Design. Boards and tools.


8. Mano Chapter 8. Slides in PPT about flow-charting and control design.


9. Slides in PPT about Multi-cycle control.


10. Lecture on DSP processor fundamentals. PDF format.


11. Timing of FSM and FFs. Slides in Postscript. Mano. Slides in PDF on assembly leved processor design.

Decomposition of Finite State Machines. Serial and Parallel Decomposition. Links to Encoding.

1. Introduction to experiments with Finite Automata.


2. Examples of homing and synchronizing experiments.


3. Advanced FSM Decomposition Theory.


4. Lecture in PDF on Testing and Testable Design of Digital Circuits.


5. Randomized Parallel Algorithms for the Homing Problem. Paper in PDF.


6. Homing and Synchronizing Sequences. Slides in PDF.


7. Slides in PDF. Principles and Methods of Testing FSM - A Survey.


8. State Identification; homing, synchronizing and distinquishing sequences. Slides in PDF.


9. Slides in PPT on Algorithmic Testing.

Asynchronous Automata.  

1. Introduction to asynchronous Automata.


2. Realization of asynchronous automata.


3. Marek Perkowski. Basic Asynchronous circuit design. File in PDF.

Asynchronous Automata. Asynchronous Systems.  

1. Metastability.


2. Self-timed asynchronous machines.


3. Design of self-synchronized state machines.

Cellular Automata.  

1. Introduction to Cellular Automata and Artificial Life.


2. Cellular Logic Illustrations.


3. Quantum Dot Cellular Automata.


4. Cellular Morphogenesis.

Cellular Automata in Physics. Reversible Cellular Automata. Simulations in biology and social life.

1.  Cellular Automata models in Engineering.


2.  Reversible Cellular Automata.


3. Physical Reversible Models of Cellular Automata.


4. Part 2 of Physical Reversible Models of Cellular Automata.


5. Part 3 of Physical Reversible Models of Cellular Automata.Artificial Life.


6. Cellular Automata Model for Fish and Shark.

Basic concepts of Sequential State Machine Theory. Non-deterministic and deterministic automata.   

1. Set Theory and Introduction to State Machine Theory.


2. Equivalence. Nondeterministic and Deterministic Finite Automata.

Regular Languages versus automata. Complete design procedure starting from regular expressions.  

1. Regular Languages and Regular Expressions.


2. Deterministic and Nondeterministic Finite Automata.


3.  Regular Expressions.


4.  Behavoral Equivalence. Mealy and Moore Automata.

Morphisms of Machines. Homomorphisms, epimosphisms, isomorphisms.