Problems for Midterm Two

1. TANT networks. The concept.
2. TANT networks. Reduction of minimization of third level to unate covering.
3. TANT networks. Reduction of minimization of the entire network to binate covering.
4. MMD algorithm for reversible cascade synthesis. Only for those who have related project.
5. Using cube calculus for SOP and ESOP minimization, basic CC operations. Only for those who have related project.
6. Iterative circuits. Types of circuits. Systematic design. Inhibition method to minimize logic.
7. Ashenhurst Decomposition.
8. Curtis Decomposition.
9. AND/OR/XOR - bi-decomposition of Boolean Functions.
10. The concept of repeated variables and its use in any kind of decomposition, for instance Ashenhurst/Curtis decomposition.
11. BDD. Creation of BDD from Shannon Tree. Operations on BDDs.
12. ZDD. Creation of BDD from Shannon Tree. Use to represent characteristic functions.
13. Characteristic functions to represent boolean relations, graphs and automata.
14. MDD - Multiple-valued decision diagrams. Creation of them for complete functions and functions with don't cares and generalized don't cares.
15. Kronecker Functional Decision Diagrams. You have to be able to design a KFDD with Shannon, Positive Davio and Negative Davio nodes, or their subset for a function specified in any form.
16. Symmetric functions. Lattices. Structures from multiplexers to realize symmetric functions.
17. Realization of symmetric functions with structures called nets.
18. The concept of a threshold function. Majority function, its realization and uses.
19. Use of repeated variables and lattices to realize threshold functions.
20. PLA with decoders and use of Multiple-valued logic to minimize such PLAs.
21. Realize Shannon lattice from a set of Kmaps.
22. Realize a (Kronecker) Positive Davio lattice from a PPRM expression.
23. Walsh Transform and its applications. (not mandatory).
24. NPN classification of Boolean functions. (not mandatory).