International Journal of Computational Intelligence Research
  • Year: 2009
  • Volume: 5
  • Issue: 3

New Operators of GA for Improving the Performance of High-level Synthesis

  • Author:
  • F. Choong1, S. Phon-Amnuaisuk2, M.Y. Alias3
  • Total Page Count: 14
  • Page Number: 297 to 310

1University Tunku Abdul Rahman, Faculty of Engineering and Science, Jalan Genting Kelang, 53300 Setapak, Kuala Lumpur, Malaysia. E-mail: florence.choong@gmail.com.

2Multimedia University, Faculty of Information Technology, Jalan Multimedia, 63100 Cyberjaya, Malaysia. E-mail: somnuk.amnuaisuk@mmu.edu.my.

3Multimedia University, Faculty of Engineering, Jalan Multimedia, 63100 Cyberjaya, Malaysia. E-mail: yusoff@mmu.edu.m.

Abstract

Evolutionary algorithms (EAs) have been largely applied to optimization and synthesis of VLSI design. In spite of several successful applications and competitive solutions, the stochastic nature of EAs and the uncertainty of the results have considerably hindered their use in industrial applications. This paper describes an investigation and its results on an evolutionary approach to solving a particular class of highly constrained VLSI problem, the high-level synthesis (HLS). HLS, also called architectural synthesis, is the process of automatically generating a Register Transfer Level (RTL) design from a behavioral specification. Two significant features were added to the standard genetic algorithm (SGA): guided genetic operators based on directional mutation and selection tournaments based on genome vicinity. The approach generates offspring by preserving the building blocks of the parents. The experiment results show that the proposed GA is able to guarantee high performance and low variance in the results from different runs. Computational experiments over real test problems showed promising results.

Keywords

Genetic Algorithm; High-level Synthesis, guided GA, selection tournament