The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1977 vol.26)
pp: 474-479
F.P. Preparata , Coordinated Science Laboratory and Department of Electrical Engineering, University of Illinois
ABSTRACT
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 C<inf>l</inf>log
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
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool