Reduction of Depth of Boolean Networks with a Fan-In Constraint

F.P. Preparata; D.E. Mulller; A.B. Barak

doi:10.1109/TC.1977.1674864

Publication
1977
Issue No. 5 - May
Abstract - Reduction of Depth of Boolean Networks with a Fan-In Constraint

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by F.P. Preparata Articles by D.E. Mulller Articles by A.B. Barak

Reduction of Depth of Boolean Networks with a Fan-In Constraint (PDF)

May 1977 (vol. 26 no. 5)

pp. 474-479

	ASCII Text	x
	F.P. Preparata, D.E. Mulller, A.B. Barak, "Reduction of Depth of Boolean Networks with a Fan-In Constraint," IEEE Transactions on Computers, vol. 26, no. 5, pp. 474-479, May, 1977.

	BibTex	x
	@article{ 10.1109/TC.1977.1674864, author = {F.P. Preparata and D.E. Mulller and A.B. Barak}, title = {Reduction of Depth of Boolean Networks with a Fan-In Constraint}, journal ={IEEE Transactions on Computers}, volume = {26}, number = {5}, issn = {0018-9340}, year = {1977}, pages = {474-479}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1977.1674864}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - Reduction of Depth of Boolean Networks with a Fan-In Constraint IS - 5 SN - 0018-9340 SP474 EP479 EPD - 474-479 A1 - F.P. Preparata, A1 - D.E. Mulller, A1 - A.B. Barak, PY - 1977 KW - Boolean KW - expressions KW - combinational networks KW - computational complexity KW - design algrithms KW - fan-in KW - network depth KW - number of levels KW - parallel computation. VL - 26 JA - IEEE Transactions on Computers ER -

F.P. Preparata, Coordinated Science Laboratory and Department of Electrical Engineering, University of Illinois

D.E. Mulller

A.B. Barak

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1977.1674864

In this paper we presentt family of techniques for the design of combinational networks whose objective is the reduction of the number of levels, subject to a constraint on the fan-in of the logic gates. We show that a Boolean expression with n literals and involving the connectivest AND and OR can be restructured so that the resulting network of AND and OR gates has depth at most Cllog

Index Terms:

Boolean, expressions, combinational networks, computational complexity, design algrithms, fan-in, network depth, number of levels, parallel computation.

Citation:

F.P. Preparata, D.E. Mulller, A.B. Barak, "Reduction of Depth of Boolean Networks with a Fan-In Constraint," IEEE Transactions on Computers, vol. 26, no. 5, pp. 474-479, May 1977, doi:10.1109/TC.1977.1674864

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.