SW/HW partition algorithm research based on improved 0-1 dynamic programming

SW/HW partition has been proved to be NP-completeness.Most studies concentrate on the seeking for various rapid approximate algorithms,among which are common include:hill-climbing method,genetic algorithm,simulated annealing(SA),etc.However,most of these algorithms can only solve problems with small-scale,and which study the problem of SW/HW partition solely on algorithmic aspect,without considering the system cost.Based on the uniform Abstract model of SW/HW co-function-library,this paper incorporated some factors into 0-1 dynamic programming algorithm,which included system execution time,system cost and hardware area.Then,obtained the partition plan by improving the computing method of 0-1 dynamic programming algorithms according to practical situation.At last,experiments validate the correctness and effectiveness.