Lectures scanned
- Lecture 2
Design of reversible code converter using Feynman gates.
Project for Matlab group.
Rewriting rules for ESOP and their visualization.
Sequential Branching ESOP minimizer as an example of sequential search applied to logic circuit synthesis.
Affine functions.
Positive Unate and unate functions. The concept of polarity.
Haase Diagram and definitions of unateness.
- Lecture 3
Reversible gates and functions. Unitary and permutative matrices.
Various notations for Toffoli, Feynman and Fredkin gates.
Analysis of reversible circuits.
Big controlled gates. Realization of ESOP as a reversible circuit.
Convertion from irreversible to reversible logic.
Analysis of reversible circuits using Kronecker Product and Matrix multiplication.
Formulation of Homework 2.
- Lecture 4
Operators. Kronecker multiplication. Convolution. Cartesian Product. Reed-Muller forms of Boolean Functions.
Butterfly diagrams for various Fixed-Polarity Reed-Muller
forms. Synthesis of a circuit with reversible gates to calculate all Fixed-Polarity RM forms.
Symmetric functions. Calculate number of ones circuit. Inhibition method.
Using multiplexers in synthesis.
- Lecture 5
Covering problems.
Unate covering. Covering table. Methods of solving. Essential implicants and secondary essential implicants. Binate covering. Even-Odd Covering. Decision functions.
Tree search to solve decision functions.
Graph Coloring. Satisfiability.