# 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
- Parametrized 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 do `y = sum(W.X + B)`, where `W` & `B` are constants
- Update it to include quantization and relu (`rq_cvmac`)