초록

용어보기논문에서 용어와 풀이말을 자동 추출한 결과로, 시범 서비스 중입니다. AI-Helper

Abstract ▼ AI-Helper

The floorplan algorithm using O-tree is based on a deterministic method. It searches solution space by deleting each module one by one for all modules and inserting it into the best location. It causes such problem that the solution quality depends on the order of deletion and insertion sequence. To...

The floorplan algorithm using O-tree is based on a deterministic method. It searches solution space by deleting each module one by one for all modules and inserting it into the best location. It causes such problem that the solution quality depends on the order of deletion and insertion sequence. To overcome this problem, this paper proposes an effective search method of solution space using simulated annealing frame. We use two simple but effective perturbation operations to visit neighbor solutions. First, we select a pair of modules and exchange their locations. Second, we select a module randomly and delete it from the O-tree. Then we insert it into the best location after examining all the possible locations. Proposed method improves the solutions 3% to 20% on average depending on circuits, compared to the results obtained by the original O-tree method.

주제어