ABSTRACT
In this chapter, selected methods of classical logic design are revised. The chapter consists of nine sections. In each section we deal with canonical forms for representation of switching functions. In general, the problem is to choose an appropriate form, which complies with particular properties of 3-D implementation. Such a formulation of the problem implies the following strategy for material representation:
The general equation that generates a variety of forms of a switching function is introduced;
The algebraic, matrix and hypercube-based methods of computing a switching function in a given form are described. Two aspects of the problem are the focus of discussion: construction of a given form (direct problem) and restoration of an initial function (inverse problem);
Decision trees and decision diagram design are revisited, as a basis for 3-D embedding techniques.
