False loops through resource sharing

This paper describes the effects of false loops caused by resource sharing. When a separate controller and data path are constructed, two types of false loops can be distinguished: the ones that go through the controller and the ones that loop around in the data path. The paper describes a model to detect both types of loops during the resource sharing phase. Based on this model an algorithm is described which prevents false loops in the combinatorial network to be constructed, while maintaining as much freedom as possible for the resource sharing. Ezperiments show that the loop-free data-paths do not need more functional units than the ones that contain false loops.

[1]  Robert K. Brayton,et al.  Integrating functional and temporal domains in logic design , 1991 .

[2]  Leon Stok,et al.  Architectural synthesis and optimization of digital systems , 1991 .

[3]  Yu-Chin Hsu,et al.  Digital design from concept to prototype in hours , 1994, Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems.

[4]  S. M. Wu,et al.  The IBM High-Level Synthesis System , 1991 .

[5]  Robert B. Hitchcock,et al.  Timing Analysis of Computer Hardware , 1982, IBM J. Res. Dev..

[6]  Daniel Brand,et al.  Timing Analysis Using Functional Analysis , 1988, IEEE Trans. Computers.

[7]  William H. Kautz,et al.  The Necessity of Closed Circuit Loops in Minimal Combinational Circuits , 1970, IEEE Transactions on Computers.

[8]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.