Issue No. 01 - January (1975 vol. 24)
D.C. Schmidt , Department of Systems and Information Sciences, Vanderbilt University
This paper discusses a technique whereby a logic design which is unconstrained may be replaced quasi-optimally with modules from a constrained library. Necessary and sufficient conditions for the replacement of modules within a network are developed and then reformulated as integer linear programs. These integer linear programs are solved during individual steps of a dynamic programming formulation of the network replacement problem. Execution time of the algorithm increases linearly with the network size and the algorithm produces optimal replacements of fan-out-free networks.
Combinational logic, decomposition, design automation, dynamic programming, integer programming, modules, replacement.
D.C. Schmidt, G. Metze, "Modular Replacement of Combinational Switching Networls", IEEE Transactions on Computers, vol. 24, no. , pp. 29-48, January 1975, doi:10.1109/T-C.1975.224081