Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

Since the various tasks as scheduling, operator allocation and module selection involved in the high level synthesis are strongly interdependent, a global solution to the high level synthesis problems becomes necessary. Therefore, a global optimization process which simultaneously performs scheduling, operators allocation and module selection, is presented in this paper. The search for a good solution in a "realistic enough" design space is made possible thanks to a global optimization algorithm which is simulated-annealing-based and improved by a pseudo-deterministic control. In the absence of other challenging global methods for both scheduling-operator allocation and module selection, the proposed global optimization algorithm is compared to a regular simulated annealing. Experimental results are shown in this paper and highlight a significant speed-up over a regular simulated annealing.- ranging from 45% to 73% on medium size problems (for instance the fifth order elliptic digital wave filter).- ranging from 82% to 235% on small size problems (the radix-2 FFT example (pipelined architecture)).- A much more complex example (from line-detection algorithm of [Danielson]) is briefly exposed and used to test the "capability" of the proposed method for processing such level of complexity.

REFERENCES

• 1: Michael C. McFarland , Alice C. Parker , Raul Camposano, Tutorial on high-level synthesis, Proceedings of the 25th ACM/IEEE conference on Design automation, p.330-336, June 12-15, 1988, Atlantic City, New Jersey, United States
• 2: A. Safir, B. Zavidovique. "On the synthesis of Specific Image Processing Automata from Emulation Results" EURO ASIC 89, January 1989, Grenoble France.
• 3: A. Safir, B. Zavidovique. "Automatic Synthesis of Specific Image Processing Automata by a simulated annealing based design space search." 1989 International Symposium on Circuits and Systems. May 1989 Portland, Oregon USA.
• 4: P. G. Paulin , J. P. Knight, Force-directed scheduling in automatic data path synthesis, Proceedings of the 24th ACM/IEEE conference on Design automation, p.195-202, June 28-July 01, 1987, Miami Beach, Florida, United States [doi>10.1145/37888.37918]
• 5: Rajiv Jain , Alice Parker , Nohbyung Park, Module selection for pipelined synthesis, Proceedings of the 25th ACM/IEEE conference on Design automation, p.542-547, June 12-15, 1988, Atlantic City, New Jersey, United States
• 6: E. Martin "Les architectures de circuits de traitement du signal à la demande. Une approche de conception automatisable. "Doctorat de 3° cycle, Université Paris-sud, ORSAY. Juin 1986.
• 7: M. R. Lightner, S. W. Director. "Multiple Criterion Optimization for the Design of Electronic Circuits". IEEE trans. on Circuits and Systems, Vol. Cas-28, No. 3, March 81.
• 8: Jimmy Lam , Jean-Marc Delosme, Performance of a new annealing schedule, Proceedings of the 25th ACM/IEEE conference on Design automation, p.306-311, June 12-15, 1988, Atlantic City, New Jersey, United States
• 9: J. L. Lutton, E. Bonomi. Simulated Annealing Algorithm for the Minimum Weighted Matching Problem. R.A.I.R.O. Operations Research vol. 20, no 3, August 1986, pp 177--197.
• 10: S. Y. Kung , Thomas Kailath , Harper J. Whitehouse, VLSI and Modern Signal Processing, Prentice Hall Professional Technical Reference, 1984