Research On Hardware/Software Partitioning Method Using 0-1 Algorithm Based On Co-Design Model

The HW/SW co-design of the digital systems is becoming the hotspot in recent years. With the complicating design and the maturating technology, the researchers in this field gradually change RTL design into system-level design. However, the domestic researches are still short of high-level system design in this field in the past years. They keep fixating on RTL and chip design, resulting in insufficiency of the system standard description and less realization of the whole design environment. As one of key technologies of the HW/SW co-design, the partition of the HW/SW extremely influences the performance and cost of the entire system, so the research of HW/SW partitioning has great academic and application values. Facing the different application system and the design level, the technologies of HW/SW partitioning have a lot of differences. The requirement-driven HW/SW co-design method in this dissertation focuses on the high-level (namely system-level, chip-level and register-level) design of digital systems.In view of the characteristic of high-level design, the HW/SW partitioning method using 0-1 algorithm based on CDM model is presented. Based on the analysis of the traditional HW/SW partitioning algorithms and the discussion how to get the optimal solution of HW/SW partitioning, the innovative 0-1 algorithm in HW/SW partitioning is proposed. Besides, the 0-1 algorithm efficiency is analyzed in this dissertation.The main contributions are summarized as follows:1. Because of the complexity and multiplicity of the digital system structures, the requirement is higher for reusing of components in high-level design. Using CDM graph to model the digital system, the main problems of HW/SW partitioning, such as objective systemic structure and optimization goal, are resolved.2. This thesis proposes the HW/SW partitioning algorithm based on 0-1 programming (0-1 algorithm), aiming at the situations that most HW/SW partitioning algorithms rely on the heuristic algorithms and their improvements. The 0-1 algorithm inherits the thought of linear programming algorithm and genetic algorithm, while it both reduces computation complexity by simplifying decision variable and distributes equally the search individuals by the classification and transformation of the individuals. As a result, 0-1 algorithm can approach the search quality of linear programming and the efficiency of genetic algorithm.3. A prototype system, called HSP0-1 sub-system, is designed based on the HW/SW partitioning method using 0-1 algorithm. It is made up of the base component database...