GABIND: a GA approach to allocation and binding for the high-level synthesis of data paths

We present here a technique for allocation and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach. This GA uses an unconventional crossover mechanism relying on a force directed data path binding completion algorithm. The data path is synthesized using some supplied design parameters. A bus-based interconnection scheme, use of multi-port memories, and provision for multicycling and pipelining are the main features of this system. The method presented here has been applied to standard benchmark examples and the results obtained are promising.

[1]  Michael D. Vose,et al.  Generalizing the Notion of Schema in Genetic Algorithms , 1991, Artif. Intell..

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

[3]  T. Kailath,et al.  VLSI and Modern Signal Processing , 1984 .

[4]  Chittaranjan A. Mandal,et al.  A design space exploration scheme for data-path synthesis , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[5]  Chittaranjan Mandal,et al.  High-level synthesis of structured data paths , 1997 .

[6]  Donald E. Thomas,et al.  The combination of scheduling, allocation, and mapping in a single algorithm , 1991, DAC '90.

[7]  Yu-Chin Hsu,et al.  STAR: An automatic data path allocator , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  P.G. Paulin,et al.  Algorithms for high-level synthesis , 1989, IEEE Design & Test of Computers.

[9]  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.

[10]  Anshul Kumar,et al.  Heuristic search based approach to scheduling, allocation and binding in Data Path Synthesis , 1995, Proceedings of the 8th International Conference on VLSI Design.