Mathialagan, A and Biswas, NN (1980) Optimal Interconnections in the Design of Microprocessors and Digital Systems. In: IEEE Journal of Solid-State Circuits, 15 (1). pp. 81-85.
fulltext.pdf - Published Version
Restricted to Registered users only
Download (634Kb) | Request a copy
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method  into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||02 Feb 2010 10:30|
|Last Modified:||19 Sep 2010 05:43|
Actions (login required)