The use of Roth's decomposition algorithm in multi-level design of circuits

Open Access
Publisher Website
Google Scholar
Abstract
The paper describes a procedure for synthesising multi-level combinatorial switching circuits. This procedure is based on an algorithm of Roth and Karp to find the possible decompositions of a partial switching function. The procedure builds up a circuit using a specified set of gates of vertex type. By repeated application of the algorithm, a complete realisation of the function is obtained whose cost is defined to be the sum of the costs of the basic elements. This cost can then be used as a cost bound in a systematic search for a realisation of minimum cost.

This publication has 0 references indexed in Scilit: