With the developing of IC and the increasing of integration level,high—level synthesis becomes a practical and efficient method of digital system design.In this paper,atask of high—level synthesis,allocation,is studied.First of all,allocationis modeled as an integer programming problem.Then a heuristic algorithm,called clustering allocation algorithm,is introduced.The experimental results show that the algorithm gets the same results or even better results than other published algorithms in less CPU time.
1 苏明,薛宏熙,洪先龙.数字系统的高层次综合.计算机辅助设计与图形学学报,1993.5(2):81—87.
2 McFaland M C,Parker A C,Camposano R.Tutorial in high—level synthesis.Proc.of the 25th DAC,Anaheim,
1988.330—336.
3 Su M,Xue HX,Hong XL.A global scheduling algorithm for CDFG with nested conditional branches.Proc.of the
3rd CAD/CG,Hangzhou,1993.526—530.
4 苏明,元彦宏,薛宏熙等.基于浓度扩散的调度算法.计算机学报,1993,16(4)t257—264.
5 Papadimitriou C H,Steiglitz K.Combinative optimization:algorithms and complexity.Englewood Cliffs:Printice
Hall,1982.
6 Kung S Y,Whitehouse H J,Kailath T.VLSI and modern signal processing.Englewood Cliffs: Prentice Hall,
1985.256—264.
7 Ly T A,Elwood W L,Girczyc E F.A generalized interconnect model for data path synthesis.Proc.of the 27th
DAC.Orlando,1990.168—173.
8 Paulin P G.Knight J P.Force—directed scheduling for the behavioral synthesis of ASIC'S.IEEE Trans.on CAD,
1989,8(6):661—679.
9 Thomas D E,Hitchcok C Y,Kowalski T J et al.The system architect'S workbench.Proc.of the 25th DAC, Ana-
heim.1988.337—343.