{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:06:07Z","timestamp":1648850767618},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2005,10]]},"abstract":"<jats:p> This paper presents an FPGA design methodology that can be used to shorten the FPGA design-and-debug cycle, especially as the gate counts increase to multimillions. Core-based incremental placement algorithms, in conjunction with fast interactive routing, are investigated to reduce the design processing time by distinguishing the changes between design iterations and reprocessing only the changed blocks without affecting the remaining part of the design. When combined with a background refinement thread, the incremental approach offers the instant gratification that designers expect, while preserving the fidelity attained through batch-oriented programs. An integrated FPGA design environment is then developed based on the incremental placer and its background refiner. The results show that the incremental design methodology is in orders of magnitude faster than the competing approaches such as the Xilinx M3 tools without sacrificing too much quality. <\/jats:p>","DOI":"10.1142\/s0218126605002672","type":"journal-article","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T06:54:25Z","timestamp":1133506465000},"page":"1015-1026","source":"Crossref","is-referenced-by-count":0,"title":["INCREMENTAL DESIGN METHODOLOGY FOR MULTIMILLION-GATE FPGAs"],"prefix":"10.1142","volume":"14","author":[{"given":"JING","family":"MA","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, University of New Orleans, New Orleans, LA 70148, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PETER","family":"ATHANAS","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24060, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XINMING","family":"HUANG","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, University of New Orleans, New Orleans, LA 70148, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Algorithms for VLSI Design Automation","author":"Gerez S. H.","year":"1998"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/43.67789"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/43.703831"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/43.494707"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/43.828547"},{"key":"rf11","first-page":"144","volume":"23","author":"Shahookar K.","journal-title":"ACM Comput. Surveys"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/54.825674"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126605002672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:44:25Z","timestamp":1565135065000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126605002672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":7,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,10]]}},"alternative-id":["10.1142\/S0218126605002672"],"URL":"https:\/\/doi.org\/10.1142\/s0218126605002672","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}