Difference between revisions of "Syllabus"
From CSE460t Wiki
Jump to navigationJump to search (Replaced content with '# TBD ## TBD ## TBD # TBD') |
|||
(7 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | # | + | # Boolean Algebra |
− | ## | + | # Two-Level Combinational Logic Minimization |
− | ## | + | ## K-Maps |
− | # | + | ## Quine-McCluskey |
+ | ### Single Functions | ||
+ | ### Single Functions with Don't Cares | ||
+ | ### Multiple-Output Functions | ||
+ | ### Multiple-Output Functions with Don't Cares | ||
+ | # Decomposition | ||
+ | # Technology Mapping to K-Input LUTs | ||
+ | # Sequential Systems | ||
+ | ## State Minimization of Completely Specified Machines | ||
+ | ### Partition Tables | ||
+ | ### Implication Tables | ||
+ | ## State Minimization of Incompletely Specified Machines | ||
+ | ### Implication Tables | ||
+ | # Asynchronous Machines | ||
+ | # Metastability | ||
+ | # Design of the D Flip-Flop | ||
+ | # Advanced Topics |
Latest revision as of 01:57, 13 January 2014
- Boolean Algebra
- Two-Level Combinational Logic Minimization
- K-Maps
- Quine-McCluskey
- Single Functions
- Single Functions with Don't Cares
- Multiple-Output Functions
- Multiple-Output Functions with Don't Cares
- Decomposition
- Technology Mapping to K-Input LUTs
- Sequential Systems
- State Minimization of Completely Specified Machines
- Partition Tables
- Implication Tables
- State Minimization of Incompletely Specified Machines
- Implication Tables
- State Minimization of Completely Specified Machines
- Asynchronous Machines
- Metastability
- Design of the D Flip-Flop
- Advanced Topics