메뉴 건너뛰기




Volumn , Issue , 2009, Pages 154-161

Replace: An incremental placement algorithm for field programmable gate arrays

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN HIERARCHY; FLOOR-PLANNING; FLOORPLANS; INCREMENTAL PLACEMENT; INCREMENTAL PLACEMENT ALGORITHM; LARGE CIRCUITS; LARGE REGIONS; LOW TEMPERATURES; QUALITY DEGRADATION; RECOMPILING; REFINEMENT PROCESS; RUNTIMES; SUB-CIRCUITS; TIME-CONSUMING PROCESS;

EID: 70449922666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPL.2009.5272520     Document Type: Conference Paper
Times cited : (5)

References (16)
  • 1
    • 70449885737 scopus 로고    scopus 로고
    • Incremental Placement for Field-Programmable Gate Arrays,
    • M.A.Sc. Thesis, Dept of ECE, University of British Columbia, Nov
    • D. Leong, "Incremental Placement for Field-Programmable Gate Arrays," M.A.Sc. Thesis, Dept of ECE, University of British Columbia, Nov., 2006.
    • (2006)
    • Leong, D.1
  • 2
    • 70450104432 scopus 로고    scopus 로고
    • V. Betz, 1. Rose, S. Marquardt Architecture and CAD for Deep-Submicron FPGAs, Kluwer, Feb., 1999.
    • V. Betz, 1. Rose, S. Marquardt Architecture and CAD for Deep-Submicron FPGAs, Kluwer, Feb., 1999.
  • 3
    • 70449955288 scopus 로고    scopus 로고
    • Incremental Layout Placement Modification Algorithms
    • Apr
    • C. Choy, T. Cheung, K. Wong, "Incremental Layout Placement Modification Algorithms," Trans. CAD, pp. 437445, Apr 1996.
    • (1996) Trans. CAD , pp. 437445
    • Choy, C.1    Cheung, T.2    Wong, K.3
  • 5
    • 29144530300 scopus 로고    scopus 로고
    • An Incremental Placement Algorithm for Building Block Layout Design Based on the O-Tree Representation
    • J. Li, J. Yu, H. Miyashita, "An Incremental Placement Algorithm for Building Block Layout Design Based on the O-Tree Representation," IEICE Trans. Fundamentals, vol. E88-A, no. 12, pp 3398-3404, 2005.
    • (2005) IEICE Trans. Fundamentals , vol.E88-A , Issue.12 , pp. 3398-3404
    • Li, J.1    Yu, J.2    Miyashita, H.3
  • 6
    • 0036292562 scopus 로고    scopus 로고
    • Z. Li, W. Wu, X. Hong, 1. Gu, Incremental Placement Algorithm for Standard Cell Layout, IEEE ISCAS, 2 pp. 883-886, 2002.
    • Z. Li, W. Wu, X. Hong, 1. Gu, "Incremental Placement Algorithm for Standard Cell Layout," IEEE ISCAS, vol.2 pp. 883-886, 2002.
  • 7
    • 0032659075 scopus 로고    scopus 로고
    • Using Cluster-Based Logic Blocks and Timing-Driven Packing to Improve FPGA Speed and Density
    • A. Marquardt, V. Betz, J. Rose, "Using Cluster-Based Logic Blocks and Timing-Driven Packing to Improve FPGA Speed and Density," FPGA, pp. 37-46, 1999.
    • (1999) FPGA , pp. 37-46
    • Marquardt, A.1    Betz, V.2    Rose, J.3
  • 8
    • 0036385606 scopus 로고    scopus 로고
    • A. Singh and M. Marek-Sadowska, Efficient Circuit Clustering for Area and Power Reduction in FPGAs, FPGA, 2002.
    • A. Singh and M. Marek-Sadowska, "Efficient Circuit Clustering for Area and Power Reduction in FPGAs," FPGA, 2002.
  • 9
    • 0036917243 scopus 로고    scopus 로고
    • Incremental Placement for Layout Driven Optimizations on FPGAs
    • D. Singh, S. Brown, "Incremental Placement for Layout Driven Optimizations on FPGAs," ICCAD, pp. 752-759, 2002.
    • (2002) ICCAD , pp. 752-759
    • Singh, D.1    Brown, S.2
  • 10
    • 2442466856 scopus 로고    scopus 로고
    • Incremental Physical Resynthesis for Timing Optimization
    • P. Suaris, L. Liu et al, "Incremental Physical Resynthesis for Timing Optimization," FPGA, pp. 99-108,2004.
    • (2004) FPGA , pp. 99-108
    • Suaris, P.1    Liu, L.2
  • 11
    • 0032218623 scopus 로고    scopus 로고
    • An Incremental Placement and Global Routing Algorithm for Field Programmable Gate Arrays
    • ASP-DAC
    • N. Togawa, K. Hagi, M. Yanagisawa, "An Incremental Placement and Global Routing Algorithm for Field Programmable Gate Arrays," ASP-DAC, 1998.
    • (1998)
    • Togawa, N.1    Hagi, K.2    Yanagisawa, M.3
  • 13
    • 70450080799 scopus 로고    scopus 로고
    • Perturb+Mutate: Semi-Synthetic Circuit Generation Incremental Placement and Routing
    • Sept
    • D. Grant, G. Lemieux, "Perturb+Mutate: Semi-Synthetic Circuit Generation Incremental Placement and Routing", ACM TRETS, Sept. 2008.
    • (2008) ACM TRETS
    • Grant, D.1    Lemieux, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.