COFFE: Fully-Automated Transistor Sizing for FPGAs

被引:0
|
作者
Masson, Chides [1 ]
Betz, Vaughn [1 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON, Canada
来源
PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT) | 2013年
关键词
ARCHITECTURE;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present COFFE (Circuit Optimization For FPGA Exploration), a new fully-automated transistor sizing tool for FPGAs. Automated transistor-level CAD tools are an important part of the architecture exploration flow because they provide accurate area and delay estimates of low-level FPGA circuitry, which must be obtained for each architecture. We show that modeling transistors as linear resistances and capacitances as has been done in previous FPGA transistor sizing tools is highly inaccurate for fine-grained transistor-level design in advanced process nodes. Therefore, COFFE's transistor sizing algorithm maintains circuit non-linearities by relying exclusively on HSPICE simulations to measure delay. Area is estimated with a transistor size-based model that incorporates a number of improvements to enhance its accuracy in advanced process technologies versus prior methods. In addition to more accurate area and delay estimation, COFFE considers more layout effects than prior published work by automatically accounting for transistor and wire loads, which are computed based on architectural parameters and layout area. This new FPGA transistor sizing tool requires only several hours to produce high-quality transistor sizing results for an entire FPGA tile; a task that would normally take months of manual effort. We demonstrate COFFE's utility in FPGA architecture studies by investigating an important new architectural question at the logic-to-routing interface.
引用
收藏
页码:34 / 41
页数:8
相关论文
共 50 条
  • [31] Automated transistor sizing for FPGA architecture exploration
    Kuon, Ian
    Rose, Jonathan
    2008 45TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2008, : 792 - 795
  • [32] CONTROL OF A FULLY-AUTOMATED HIGH UNIT WITH RETAIL INVENTORY OPERATIONS
    NEUBAUER, H
    MELLIAND TEXTILBERICHTE INTERNATIONAL TEXTILE REPORTS, 1983, 64 (06): : 438 - 438
  • [33] Development of a Novel, Fully-Automated Genotyping System: Principle and Applications
    Suzuki, Shun-ichi
    Komori, Mariko
    Hirai, Mitsuharu
    Ureshino, Norio
    Kimura, Shinya
    SENSORS, 2012, 12 (12): : 16614 - 16627
  • [34] Fully-automated ultrasensitive DSC for high-throughput studies
    Lin, LN
    Brandts, JF
    Brandts, JM
    Plotnikov, V
    Frasca, V
    BIOPHYSICAL JOURNAL, 2003, 84 (02) : 167A - 167A
  • [35] A fully-automated, liquid-moderated neutron spectrometer system
    Archambault, John Paul
    Saull, Patrick R. B.
    NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 2022, 1041
  • [36] Fully-automated Interpretation of Biochemical Tests for Decision Support by Smartphones
    Velikova, Marina
    Lucas, Peter
    Smeets, Ruben
    van Scheltinga, Josien Terwisscha
    2012 25TH INTERNATIONAL SYMPOSIUM ON COMPUTER-BASED MEDICAL SYSTEMS (CBMS), 2012,
  • [37] A fully-automated measurement system for 77-GHz mixers
    Wagner, C.
    Treml, M.
    Hartmann, M.
    Stelzer, A.
    Jaeger, H.
    2007 IEEE INSTRUMENTATION & MEASUREMENT TECHNOLOGY CONFERENCE, VOLS 1-5, 2007, : 1553 - +
  • [38] A fully-automated deep learning pipeline for cervical cancer classification
    Alyafeai, Zaid
    Ghouti, Lahouari
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 141
  • [39] Evaluation of the new immunohematological fully-automated Eflexis-System
    Spenke, S.
    Korb, M.
    Kempe, K.
    Pretzel, K. J.
    Mayer, B.
    Pruss, A.
    TRANSFUSION MEDICINE AND HEMOTHERAPY, 2017, 44 : 56 - 57
  • [40] Fully-automated grating coupler design through adjoint optimization
    Su, Logan
    Trivedi, Rahul
    Sapra, Neil V.
    Piggott, Alexander Y.
    Vercruysse, Dries
    Vuckovic, Jelena
    2018 CONFERENCE ON LASERS AND ELECTRO-OPTICS (CLEO), 2018,