Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates

Full text

Pdf (1.04 MB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 3 (July 1978) table of contents

Pages: 481 - 498

Year of Publication: 1978

ISSN:0004-5411

Author

Jon T. Butler

Department of Electrical Engineering, Northwestern University, Evanston, IL

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/322077.322089 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	BANDYOPADHYAY, S, PAL, A, AND CHOUDHURY, A K Characterization of unate cascade realmabdlty using parameters IEEE Trans Comptrs C-24 (Feb 1975), 218-219
	2	BENDER, E A, AND BUTLER, J T Asymptotic approxlmanons to the number of fanout-free functions Submitted to IEEE Trans. Comptrs
	3	CURTIS, H A A New Approach to the Design of Swuchmg Czrcults Van Nostrand, Pnnceton, N J, 1962
	4	G OLOMB, S W On the classification of Boolean functions IRE Trans Circuit Theory CT-6, Spec Supp (May 1959), 176-186
	5	HARRISON, M A lntroductwn to Switching and Automata Theory McGraw-Hall, New York, 1965
	6	John P. Hayes, The Fanout Structure of Switching Functions, Journal of the ACM (JACM), v.22 n.4, p.551-571, Oct. 1975 [doi>10.1145/321906.321918]
	7	John P. Hayes, Enumeration of Fanout-Free Boolean Functions, Journal of the ACM (JACM), v.23 n.4, p.700-709, Oct. 1976 [doi>10.1145/321978.321988]
	8	KLEITMAN, D On Dedekmd's problem The number of monotone Boolean functions Proc. Amer Math Soc 21 (1969), 677-682
	9	KODANDAPANI, K L, AND SETH, S C On combinational networks wRh restricted fanout To appear in IEEE Trans Comptrs
	10	Zvi Kohavi , Richard W. Hamming , Edward A. Feigenbaum, Switching and Finite Automata Theory: Computer Science Series, McGraw-Hill Higher Education, 1990
	11	LEWIS II, P M, AND COATES, C L Threshold Logic Wiley, New York, 1967
	12	Robert C. Minnick, A Survey of Microcellular Research, Journal of the ACM (JACM), v.14 n.2, p.203-241, April 1967 [doi>10.1145/321386.321387]
	13	MINNICK, R C A system of magnetic bubble logic IEEE Trans Comptrs (7-24 (Feb 1975), 217-218
	14	MUKHOPADHYAY, A Unate cellular logic IEEE Trans Comptrs. C-18 (Feb 1969), 114-121
	15	MUROGA, S., TSUBOI, T., AND BAUGH, C Enumerauon of threshold funcuons of e~ght variables. IEEE Trans. Comptrs. C-19 (Sept. 1970), 818-825.
	16	SAS^O, T., AND KllqOSHITA, K. On fanout-free funcUons and unate cascade functions (in Japanese) In Papers Tech. Group Electron Comput, lnst Electron Commun Eng Japan, Paper EC77-7, May 1977
	17	YAU, S.S., AND TANG, Y S. On identification of redundancy and symmetry of swathing funcuons IEEE Trans. Comptrs C- 20 (Dec 1971), 1609-1613.