Wk
|
Date
|
Subject
|
Required Reading
|
Additional Reading
|
Homeworks and Projects
|
|
2
|
|
STATE ASSIGNMENT OF SYNCHRONOUS FINITE STATE MACHINES.
|
|
|
Tuesday, October 2 |
- State Assignment. Partition Pairs. Exact State Assignment based on Partitions.
- State Assignment: Multi-line Method based on Partition Pairs. Hypercube Embedding.
- Other algorithms for State Assignment.
- PAPER:
S. Devadas, H.K.Ma, R.Newton, and A. Sangiovanni-Vincentelli,
MUSTANG: State Assignment of Finite State Machines Targeting Multilevel Logic Implementations.
- PAPER:
A. Ghosh, S. Devadas, K. Keutzer, J. White,
Estimation of Average Switching Activity in Combinational and Sequential Circuits.
|
- SLIDES: State Assignment. Flip-flops. Excitations. Rules leading to
state assignment. Heuristic rules and their explanation.
- SLIDES: State Assignment based on Partition Pairs. Multi-Line Method.
- SLIDES: PS. Two-Dimensional Minimization of Finite State Machines. Based on the work
of a student in this class.
|
Complete reading slideas and chapters 7 and 8 from Hachtel. Read chapter 10 in Kohavi, and
if necessary, previous chapter(s).
|
HOMEWORK 2.
State Minimization problem.
|
|
|
Thursday, October 4 |
Discussion of various FSM state assignment algorithms.
Partition Pairs. Hypercubes. MV-encoding types.
|
Nothing.
|
Read or review chapters in Kohavi and Hachtel/Somenzi about state assignment and structural design of FSMs.
|
Continue working on the project.
|
|
3
|
|
STATE ASSIGNMENT CONTINUED.
|
|
|
Tuesday, October 9 |
Continue on state assignment ideas.
- State Assignment. Partition Pairs. Exact State Assignment based on Partitions.
- State Assignment. Continuation on Multi-line Method based on Partition Pairs. Hypercube Embedding.
- Other algorithms for State Assignment.
|
- Read or review state assignment methods from my book.
- Read state assignment method from Kohavi.
|
none.
|
none.
|
|
|
Thursday, October 11 |
Student presentations about projects.
|
- Read or review state assignment methods from my book.
- Read state assignment method from Kohavi.
|
none.
|
none.
|
|
4
|
|
STRUCTURAL THEORY OF FINITE STATE MACHINES.
|
|
|
|
|
|
Tuesday, October 16 |
- Review on regular layout and design for submicron technologies.
- Review on logic blocks.
|
- SLIDES: Four-Level PLA.
- SLIDES: Realization Technologies.
- SLIDES: Modern Tools for VLSI.
- SLIDES: Pass Transistor circuits.
- SLIDES: Design Methodologies in VLSI.
|
Review on CAE tools and basic technologies in which FSMs are realized.
|
HOMEWORK 4:
Design an FSM using any of the presented technologies.
|
|
|
Thursday, October 18 |
- Structural Theory of machines based on partitions.
- Decomposition of FSMs.
- Input-Output Encoding of FSMs and combinational logic.
|
- SLIDES: Multiplexers, Decoders, ROMs. Use in design.
- SLIDES: PAL, PLA, EPLD, FPGA. Complex PLD (CPLD).
- SLIDES: Arithmetic Circuits. Full adder. Adder/Subtractor. Ripple Carry Chain.
Carry Look-Ahead adder. Carry Select Adder. Generalization of these Principles.
- SLIDES: Arithmetic Circuits. Serial Adder. ALU, Parity. Comparators. Multiplier.
|
Review on logic and sequential blocks. Use of logic blocks in sequential machines.
Shifters, counters.
|
First presentations of student projects.
|
5
|
|
STRUCTURAL THEORY OF FINITE STATE MACHINES.
|
|
|
|
|
|
Tuesday, October 23 |
- Design of state machines in FPGAs.
- Realization of non-deterministic machines.
- Linear Sequential Machines.
- Theory of cellular logic and automata.
|
SLIDES: Cellular automata.
|
- Book of indian authors about Cellular automata.
- Qihong Chen M.S. about Cube Calculus Machine (CCM).
|
HOMEWORK 5:
Conceptual Design and hardware Realization of a Cellular automaton.
|
|
|
Thursday, October 25 |
- Regular sequential structures.
- Finite-state recognizers.
- Comprehensive systems for synthesis of programmable devices.
- Design automation for sequential circuits and Finite State Machines.
- Non-deterministic and Parallel FSMs.
|
Nothing.
|
Nothing.
|
No homework. Continue work on project. |
|
6
|
|
DESIGN OF SPECIAL PURPOSE LOGIC MACHINES.
|
|
|
Tuesday, October 30 |
- Pipelined machines.
- Systolic machines.
- Array machines.
- Stack machines.
- Machines for logic.
|
- SLIDES: pipelined machines.
- SLIDES: systolic machines.
- SLIDES: stack machines.
|
None.
|
None.
|
|
|
Thursday, November 1 |
Continuation on special purpose machines.
|
None.
|
None.
|
None.
|
|
7
|
|
MACHINES FOR LOGIC PROGRAMMING.
|
|
|
Tuesday, November 6 |
- Logic Programming.
- Machines for Logic Programming.
|
SLIDES.
|
Papers of Ulug and Bowen.
|
none.
|
|
Thursday, November 8 |
Continuation on logic machines. |
none.
|
none.
|
Project presentations. Project discussion. Additional meetings for projects demo and discussions.
|
|
8
|
|
REGULAR EXPRESSIONS AND MICROPROGRAMMING.
|
|
|
Tuesday, November 13 |
- Regular Expressions, Brzozowski's Algorithm for Generalized Regular Expressions.
- Microprogramming and systematic design of control units.
- Hardware scheduling and allocation.
Sources: my book, Kohavi's book.
|
none
|
none
|
none
|
|
|
Thursday, November 15 |
|
9
|
|
CELLULAR AUTOMATA AND CUBE CALCULUS MACHINE.
|
|
|
|
November 22 |
- Cube Calculus Machine.
- Design for Test of Sequential Circuits.
- Automatic System Verification.
- Fuzzy, analog and probabilistic machines.
- Language processors (recursion,stacks,Lisp,Prolog).
|
none.
|
none.
|
none.
|
|
|
November 24 |
-
Asynchronous Machines. Hazards. Creation of machine table.
|
-
here is my text on asynchronous machines without figures and with bugs.
|
-
Kohavi, chapter about asynchronous FSMs.
|
-
none.
|
|
10
|
|
ASYNCHRONOUS FINITE STATE MACHINES AND LOW POWER DESIGN.
|
|
|
|
November 27 |
Continue on asynchronous FSMs.
- Asynchronous Machines. Hazards. Creation of machine table.
Sources: my book, Kohavi. here is my text on asynchronous machines without figures and with bugs.
- Asynchronous Machines. Minimization, Assignment, Realization.
- Asynchronous Machines realized in PLDs.
CY7C361 chip from Cypress.
- Use of differentiation elements and Flip-Flops for Asynchronous Machines.
- Performance Optimization of Finite State Machines.
|
SLIDES.
|
papers.
|
none.
|
|
|
November 29 |
Additional problems about complex machines with structures. |
.
|
.
|
.
|
|
11
|
|
PROJECT PRESENTATIONS AND FINAL EXAM.
|
|
|
|
December 4 |
Presentation and discussion of projects. |
links to student www pages with projects. |
links to student www pages with projects. |
This is the last week for presentations of projects. |
|
|
|
How to write the project report. |
no new reading. Please
work on project report and slides.
Everybody has to return at least 4 homeworks out of all those assigned.
|
|
|
|
|
December 6 |
Final Examination. Written. Open Book.
Whole material of lectures and readings is covered, project not covered. |
Review the material. No new reading. |
Review the material. No new reading. |
Project demonstrations. Complete past homeworks.
Projects are due Sunday. The last day of finals week. |
|