An approximate method for the synthesis of multiple-output combinational networks
作者： A. Grasselli , R. Stefanelli
DOI: 10.1007/BF02576017
关键词: Numerical analysis 、 Mathematics 、 Theory of computation 、 Approximate solution 、 Simple (abstract algebra) 、 Algorithm
摘要: An algorithm for the synthesis of multiple-output combinational networks is proposed. The presupposes predetermination minimal single-output output expressions, and obtains an approximate solution by simple substitutions on these expressions. A continuous control over fan-out first-level gates fan-in second-level one characteristics algorithm.
springer.com
sci-hub.se 参考文章(4)
R. B. Polansky, Minimization of multiple-output switching circuits Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics. ,vol. 80, pp. 67- 73 ,(1961) , 10.1109/TCE.1961.6373075
Robert McNaughton, Bernon Mitchell, The minimality of rectifier nets with multiple outputs incompletely specified Journal of the Franklin Institute. ,vol. 264, pp. 457- 480 ,(1957) , 10.1016/0016-0032(57)90106-0
M. J. Ghazala, Irredundant disjunctive and conjunctive forms of a Boolean function Ibm Journal of Research and Development. ,vol. 1, pp. 171- 176 ,(1957) , 10.1147/RD.12.0171
Thomas C. Bartee, Computer Design of Multiple-Output Logical Networks Ire Transactions on Electronic Computers. ,vol. 10, pp. 21- 30 ,(1961) , 10.1109/TEC.1961.5219148