Modular Decomposition of Combinational Switching Networks,
Abstract
The problem of designing a combinational network from a library of fixed configuration, fanout-free modules is investigated. The approach developed consists of two phases: (1) A loop-free combinational network is designed without constraints. (2) The design is translated into terms of the module library. Emphasis is placed on the second phase of this process. A procedure is presented which generates all possible different types of modes (gates) that may be formed by a module. Theorems are then developed which state the necessary and sufficient conditions for a set of modes to be capable of replacing a set of gates and a network. The necessary and sufficient conditions are formulated as integer linear programs which can be used to minimize cost function over any fanout-free network. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1971
- Accession Number
- AD0733859
Entities
People
- Douglas Charles Schmidt
Organizations
- University of Illinois Urbana–Champaign