Skip Navigation

The Computer Journal 1968 11(3):269-276; doi:10.1093/comjnl/11.3.269
© 1968 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Barnard, D. F.
Right arrow Articles by Holman, D. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

D. F. Barnard and D. F. Holman *

Mechanical Engineering Laboratory, The English Electric Company Limited, Whetstone, Nr. Leicester, UK

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.

First received January 1968. revised form May 1968.

* Mechanical Engineering Laboratory, The English Electric Company Limited, Whetstone, Nr. Leicester.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.