High-level synthesis of digital circuits using genetic algorithms

Describes a high-level synthesis system that uses genetic algorithms (GAs). The use of GAs allows for a synthesis method that is more flexible and more adaptable to new constraints than the traditional heuristic and integer linear programming approaches. The proposed GA tool is suitable for large, realistic problems. It performs simultaneous scheduling, allocation and binding of functional and storage units minimizing multiple related performance constraints such as latency, area throughput and power. The synthesis tool is capable of performing with control/data flow graphs.

[1]  Catherine H. Gebotys Optimal scheduling and allocation of embedded VLSI chips , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[2]  Robert A. Walker,et al.  A Survey of high-level synthesis systems , 1991 .

[3]  Robert H. Storer,et al.  Datapath synthesis using a problem-space genetic algorithm , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[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]  Tai A. Ly,et al.  Applying simulated evolution to high level synthesis , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Forrest Brewer,et al.  A new symbolic technique for control-dependent scheduling , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  M.J.M. Heijligers,et al.  The application of genetic algorithms to high-level synthesis , 1996 .