|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
A Relocation Method for Circuit Modifications
Kunihiko YANAGIBASHI Yasuhiro TAKASHIMA Yuichi NAKAMURA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E90-A
No.12
pp.2743-2751 Publication Date: 2007/12/01 Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.12.2743 Print ISSN: 0916-8508 Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms) Category: Circuit Synthesis Keyword: non full-reverse-order constraint, circuit modification, relocation, sequence-pair, simulated annealing,
Full Text: PDF(613.9KB)>>
Summary:
In this paper, we propose a novel migration method. In this method, the resultant placement retains the structure of the original placement, called model placement, as much as possible. For this purpose, we minimize the sum of the difference in area between the model placement and the relocated one and the total amount of displacement between them. Moreover, to achieve a short runtime, we limit the solution space and change the packing origin in the optimization process. We construct the system on Sequence-Pair. Experimental results show that our approach preserves the chip area and the overall circuit structure with 98% less runtime than that realized by naive simulated annealing.
|
open access publishing via
|
|
|
|
|
|
|
|