Syllabus

1. Combinational Circuits (Boolean Circuits)
   1. modules (encoders, decoders, shifters, etc)
   2. fast arithmetic (addition, multiplication, division in logarithmic depth circuits)
2. Synchronous Circuits (networks of finite automata)
   1. systolic circuits
   2. retiming
3. Networks
   1. comparator networks (0-1 principle, sorting networks)
   2. Algorithms on the Hypercube, Butterfly, etc.