Week 3 – Sequential Logic

Lecture

• Intro

  • All circuits are a mix of combinational and sequential logic

  • Why a chip needs a clock

• Flip-flop, Register

• Counter

• Parameterized Binary Reduction Tree to find the minimum value in a vector y = min(X)

• Setup time, hold time, critical path

• Nested counters

Assignment

• Create a module: adder tree y = sum(X)

• Create a constant-vector MAC to compute y = sum(W.X + B), where W and B are constants

• Update it to include quantization and ReLU (rq_cvmac)