Advanced Logic Synthesis: Absolute Minimum to Know

1. PROFESSOR: Marek A. Perkowski
   1. SOP, POS, Prime Implicants, Essentials, Covering Problem, Kmpaps and Hypercubes.
   2. Approaches to Set Covering.
   3. EPLDs and FPGA architectures.
   4. Binary Decision Diagrams, definitions, operations and applications.
   5. Positive and Negative Davio Expansions. Kronecker Decision Diagrams.
   6. EXOR-SUM of Product circuits. Canonical versus non-canonical.
   7. Multi-Valued logic, use of PLAs with decoders.
   8. Post Logic.
   9. Galois Logic.
   10. Graph Coloring. Maximum Clique, clique partitioning, clique covering.
   11. Combinatorial Problems: maximum cliques, maximum independent sets,
   12. Satisfiability, Tautology and Complementation.
   13. Covering problems (unate and binate).
   14. Solving Boolean Equations, Satisfiability, Tautology.
   15. Petrick function and the methods of solving it.
   16. Methods of finding minimal set of support variables.
   17. Decomposition of Boolean and Multi-valued Functions and Relations.
   18. Use of Decomposition in Machine Learning.
   19. Arithmetic, design of adder, multiplier.
   20. Iterative Circuits.
   21. Lattice Diagrams using Shannon and Davio expansions.
   22. Modern FPGAs and synthesis for FPGAs.
   23. Layout-Driven Logic Synthesis: various approaches.
   24. EXOR logic and decision diagrams. Generalizations of Ordered Kronecker Functional Decision Diagrams
   25. Factorization, rectangle covering.
   26. State Assignment.
   27. Cube Calculus: encoding and operations, implementation.
   28. Cellular, Pipelined and Systolic Machines.