• DocumentCode
    2215034
  • Title

    Using Hard Macros to Reduce FPGA Compilation Time

  • Author

    Lavin, Christopher ; Padilla, Marc ; Ghosh, Subhrashankha ; Nelson, Brent ; Hutchings, Brad ; Wirthlin, Michael

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA
  • fYear
    2010
  • fDate
    Aug. 31 2010-Sept. 2 2010
  • Firstpage
    438
  • Lastpage
    441
  • Abstract
    The FPGA compilation process (synthesis, map, placement, routing) is a time-consuming process that limits designer productivity. Compilation time can be reduced by using pre-compiled circuit blocks (hard macros). Hard macros consist of previously synthesized, mapped, placed and routed circuitry that can be relatively placed with short tool runtimes and that make it possible to reuse previous computational effort. Two experiments were performed to demonstrate feasibility that hard macros can reduce compilation time. These experiments demonstrated that an augmented Xilinx flow designed specifically to support hard macros can reduce overall compilation time by 3x. Though the process of incorporating hard macros in designs is currently manual and error-prone, it can be automated to create compilation flows with much lower compilation time.
  • Keywords
    field programmable gate arrays; network routing; network synthesis; FPGA compilation time reduction; augmented Xilinx flow; circuit map; circuit placement; circuit routing; circuit synthesis; hard macros; precompiled circuit blocks; short tool runtimes; time-consuming process; Designer Productivity; FPGAs; Hard Macros; Placement; Rapid Compilation; XDL;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field Programmable Logic and Applications (FPL), 2010 International Conference on
  • Conference_Location
    Milano
  • ISSN
    1946-1488
  • Print_ISBN
    978-1-4244-7842-2
  • Type

    conf

  • DOI
    10.1109/FPL.2010.90
  • Filename
    5694290