The object of this thesis is to present firstly a new design technique for combinational logic circuits, and secondly a new state assignment method for the design of sequential machines. The combinational design technique to be presented has been based upon two concepts. One of them is minterm-interchange by which it is possible to decompose a Boolean function into the exclusive-OR of two lower cost Boolean functions. The second concept concerns If simplest-threshold functions which are logically simple. The cost of realisation of such functions should also be minimal in comparison with a wider class of functions. The techniques based upon these concepts are implemented in the spectrum domain, which is briefly surveyed in Chapter 1. Chapter 2 details the mathematics of the minterm-interchange operation in the spectrum domain. Chapter 3 is concerned with the design algorithm and also with the conditions of applicability of this technique to the Boolean function realization. Also in Chapter 3, the combination of the already known spectral translation technique and the new minterm-interchange technique has been considered. Finally in Chapter 4 two basic concepts used in combinational logic design are applied in the proposed new state assignment technique for sequential machine design. This new state assignment is implemented by means of a binary tree.
|Date of Award||1979|