Title :
Automatic HDL-Based Generation of Homogeneous Hard Macros for FPGAs
Author :
Korf, Sebastian ; Cozzi, Dario ; Koester, Markus ; Hagemeyer, Jens ; Porrmann, Mario ; Ruckert, Ulrich ; Santambrogio, Marco D.
Author_Institution :
Syst. & Circuit Technol., Univ. of Paderborn, Paderborn, Germany
Abstract :
The regularity of resources found in FPGAs is a unique feature, which can be utilized in a number of applications, e.g., in timing critical applications or applications with a demand for homogeneous routing. Current synthesis tools do not support an automatic generation of homogeneous FPGA designs, such that a time-consuming hand-crafted design is required. We present a tool flow, which automatically generates homogeneous hard macros for Xilinx FPGAs starting from a high-level description, such as VHDL. Key functionalities of the tool flow are a homogeneous placer and a suitable routing algorithm, which aim at maintaining the homogeneity of the resulting hard macro. The place and route tools use a resource library that is automatically generated for the target FPGA family by extracting relevant information from the vendor tools. The tool chain is demonstrated for the design of hard macros for a time-to-digital converter and a tiled partially reconfigurable region. The resulting designs are evaluated with respect to resource requirements and timing constraints.
Keywords :
field programmable gate arrays; logic design; network routing; FPGA family; VHDL; Xilinx FPGAs; automatic HDL-based generation; automatic generation; hand-crafted design; high-level description; homogeneous FPGA designs; homogeneous hard macros; homogeneous routing; resource library; routing algorithm; time-to-digital converter; DH-HEMTs; Databases; Field programmable gate arrays; Registers; Routing; Table lookup; Wires; Design Automation; Homogeneous Hard Macros; Reconfigurable Computing;
Conference_Titel :
Field-Programmable Custom Computing Machines (FCCM), 2011 IEEE 19th Annual International Symposium on
Conference_Location :
Salt Lake City, UT
Print_ISBN :
978-1-61284-277-6
Electronic_ISBN :
978-0-7695-4301-7
DOI :
10.1109/FCCM.2011.36