A generalized interconnect model for data path synthesis

A generalized interconnect model for data path synthesis is presented. This is a multi-level interconnect model designed for synthesis under interconnect constraints. Two novel algorithms for dynamic interconnect allocation and interconnect synthesis are also described. These algorithms help implement the generalized interconnect model in the Elf hardware compiler.

[1]  Daniel Gajski,et al.  Design Tools for Intelligent Silicon Compilation , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Daniel P. Siewiorek,et al.  The Modeling and Synthesis of Bus Systems , 1981, 18th Design Automation Conference.

[3]  Pierre G. Paulin,et al.  Scheduling and Binding Algorithms for High-Level Synthesis , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Donald E. Thomas,et al.  A Method of Automatic Data Path Synthesis , 1983, 20th Design Automation Conference Proceedings.

[5]  T. A. Ly,et al.  Applying simulated evolution to scheduling in high level synthesis , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

[6]  Alice C. Parker,et al.  MAHA: A Program for Datapath Synthesis , 1986, DAC 1986.

[7]  Pierre Gaston Paulin.  High-level synthesis of digital circuits using global scheduling and binding algorithms , 1988 .

[8]  Fadi J. Kurdahi,et al.  Module assignment and interconnect sharing in register-transfer synthesis of pipelined data paths , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.