|
|
|
Course Learning Outcomes / Expected
Performance Criteria
- Design simple circuits in the form of
sum-of-product and product-of-sum using truth table. Be able to
implement basic logic operators (e.g., inverter and XOR) using
on-off, toggle and complementary switch.
- Optimize designs using Boolean algebra,
K-Map and/or Quine-MaCluskey algorithm. Understand design
trade-offs between delay, area, modularity and reliability.
- Implement designs using NAND-only,
NOR-only, MUX, ROM, PAL and PLA.
- Verify designs using computer-aided design
tools (XILINX), and understand design steps of modern integrated
circuits.
- Understand state of a sequential
system, how the state can be memorized using different devices
(latches and FFs), and potential problems of these devices such
as glitch, race and catching.
- Use time waveform and/or state transition
diagram to analyze functionality of sequential circuits.
Understand timing constraints (setup time, hold time and
propagation delay) of sequential circuits. Be able to calculate
minimal clock period and maximum clock frequency.
- Implement and analyze a FSM (finite state
machine) based systems. Be able to derive excitation and output
logic, present-next state tables, state transition diagrams.
Understand differences between Mealy and Moore models.
- Understand the concept and necessity of
micro-programmed sequencing. Be able to analyze and program a
micro-program sequencer.
- Uderstand advantage and disadvantage of
asynchronous circuits. Be able to design and analyze
asynchronous sequential circuits using latches
|
|
|
|
|