The Fanout Structure of Switching Functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Fanout Structure of Switching Functions

Full text

Pdf (1.24 MB)

Source

Journal of the ACM (JACM) archive
Volume 22 , Issue 4 (October 1975) table of contents

Pages: 551 - 571

Year of Publication: 1975

ISSN:0004-5411

Author

John P. Hayes

Department of Electrical Engineering and Computer Science Program, University of Southern California, Los Angeles, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 25, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321906.321918 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ARMSTRONG, D B. On finding a nearly mimmal set of fault detection tests for combinational logic nets IEEE Trans. Electronic Computers EC-15 (Feb 1966), 66-73.
	2	HAYES, J. P A NAND model for fault dxagnosis in combinational logic networks IEEE Trans. Computers C-20 (Dec 1971), 1496-1506
	3	MINNICK, R. C , ET AL. Magnetic bubble computer systems. Proc AFIPS 1972 FJCC, Vol. 41, AFIPS Press, Montvale, N J , pp 1279-1298.
	4	McCLUSKEY, E J. Introductwn to the Theory of Switching circuts. McGraw-Hill, New York, 1965
	5	MUROOA, S. Threshold Logic and ts Apphcatwns. Wiley, New York, 1971
	6	SHANNON, C. E The synthesis of two-terminal switching circuits Bell Syst. Tech. J. 28 (Jan. 1949), 59-98.
	7	CURTIS, H A. A New Approach to the Design of Switching Crcuts. Van Nostrand, Princeton, NJ , 1962
	8	HAYES, J .P . Mimmizatlon of fanout in switching networks. Proc. 15th Symp on Switching and Automata Theory, New Orleans, La, Oct. 1974, pp. 133-139.F

CITED BY 8

	Martin C. Golumbic , Aviad Mintz , Udi Rotics, Factoring and recognition of read-once functions using cographs and normality, Proceedings of the 38th conference on Design automation, p.109-114, June 2001, Las Vegas, Nevada, United States
	Edward A. Bender, The Number of Fanout-Free Functions with Various Gates, Journal of the ACM (JACM), v.27 n.1, p.181-190, Jan. 1980
	Winfried Nöth , Reiner Kolla, Node normalization and decomposition in low power technology mapping, Proceedings of the 1997 international symposium on Low power electronics and design, p.275-280, August 18-20, 1997, Monterey, California, United States
	Jon T. Butler, Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates, Journal of the ACM (JACM), v.25 n.3, p.481-498, July 1978
	Aviad Mintz , Martin Charles Golumbic, Factoring boolean functions using graph partitioning, Discrete Applied Mathematics, v.149 n.1-3, p.131-153, 1 August 2005
	John P. Hayes, Enumeration of Fanout-Free Boolean Functions, Journal of the ACM (JACM), v.23 n.4, p.700-709, Oct. 1976
	Tsutomu Sasao , Jon T. Butler, A fast method to derive minimum SOPs for decomposable functions, Proceedings of the 2004 conference on Asia South Pacific design automation: electronic design and solution fair, p.585-590, January 27-30, 2004, Yokohama, Japan
	Martin Charles Golumbic , Aviad Mintz , Udi Rotics, Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees, Discrete Applied Mathematics, v.154 n.10, p.1465-1477, 15 June 2006

INDEX TERMS

Primary Classification:
C. Computer Systems Organization

Additional Classification:
G. Mathematics of Computing
G.2 DISCRETE MATHEMATICS
G.2.2 Graph Theory
Subjects: Network problems

General Terms:
Design, Performance, Theory, Verification

Collaborative Colleagues:

John P. Hayes: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player