• Electronics Optics & Control
  • Vol. 21, Issue 4, 77 (2014)
ZHANG Han1, WU Yan-song2, ZHAO Sen3, and MENG Cheng-dong4
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • 3[in Chinese]
  • 4[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1671-637x.2014.04.018 Cite this Article
    ZHANG Han, WU Yan-song, ZHAO Sen, MENG Cheng-dong. A Layout Algorithm for Dynamically Reconfigurable FPGA[J]. Electronics Optics & Control, 2014, 21(4): 77 Copy Citation Text show less

    Abstract

    Due to their flexibility in dynamic structural adjustment, Static Random Access Memory (SRAM) based Field Programmable Gate Arrays (FPGAs) are widely applied in industry and other fields.Aimed at the layout problem of modules on the reconfigurable functional unit, a hierarchical circuit partitioning-based timing-driven placement algorithm was proposed based on analysis to the limitation of the simulated annealing algorithm.The circuit was first divided into limited number of tiers based on principle of minimum cut, and then the layout of each tier was implemented according to top-down principle.The algorithm can also attain the minimum critical path delay.Experimental results show that:compared VPR algorithm, the proposed algorithm achieves better results in delay, wire-length and runtime.
    ZHANG Han, WU Yan-song, ZHAO Sen, MENG Cheng-dong. A Layout Algorithm for Dynamically Reconfigurable FPGA[J]. Electronics Optics & Control, 2014, 21(4): 77
    Download Citation