NOTES
These notes outline the course. Individual lecturers will, as always,
revise, interpret and explain the topics in their own way.
The notes change about 10% per year.
For a reference for Prof. Ray's lectures, either one is probably all right.
For those following Prof. Knight's lectures, it is suggested you do not print
files too far ahead of the lectures.
The notes are in pdf files. The last character in the file name is the
revision number(letter). The middle digit tells the sequence number of an
n part set of notes. Thus the actual file name (not the description
below) Dig2DeMorganC.pdf is the 2nd section of the notes
on digital circuits containing gates but no storage(Dig). The section is
mainly concerned with DeMorgan's Theorem and is the Cth
or 3rd revision.
Basic
Logic Gates and Formulas Rev E 2007
Demorgan's
Theorems and Applications Rev C 2007
Karnaugh
Maps, 3 and 4 Variables Rev B 2006
Multiplying
Out and Factoring Rev
F 2007; revised explanation on slides 5 and 6; corrected formulas on slide
2.
Karnaugh
Maps, 5 Variables and Multiple Outputs Experimental April, 2007 Changed
story in multiple output K-maps
Latches and Flip-Flops Rev B 2008
Array
Logic Rev K 2006
For those interested in low-priced
microcontrollers, try Don Lancasters
page or MicrochipC
Finite
State Machines (Sequential Circuits with Flip Flops) Rev E 2007 ---
Finite
State Machines (Product and Other Graphs) Rev B March 5, 2007.
State minimization
State
assignment Rev B March 22, 2007
This
is for synchronous state machines. Prof. Ray usually de-emphasizes this in
favour of asynchronous state assignment.
Hazards
Rev L 2007.
Asynchronous
Circuits with Storage, Rev H 2006 Prof. Knight tends
to spend more time on synchronous state assignment and less on asynchronous
Review
--------------------xx--------------------