Optimizing coarse-grained units in floating point hybrid FPGA

TitleOptimizing coarse-grained units in floating point hybrid FPGA
Publication TypeConference Paper
Year of Publication2008
AuthorsYu, C. W., A. M. Smith, W. Luk, P. H. W. Leong, and S. J. E. Wilton
Conference NameICECE Technology, 2008. FPT 2008. International Conference on
Pagination57 -64
Date Publisheddec.
Keywordsadders, coarse-grained units, field programmable gate array, field programmable gate arrays, floating point adders, floating point benchmark circuits, floating point multipliers, floating point subtracters, hybrid FPGA
Abstract

This paper introduces a novel methodology to optimize coarse-grained floating point units (FPUs) in a hybrid FPGA. We employ common subgraph extraction to determine the number of floating point adders/subtracters (FAs), multipliers (FMs) and wordblocks (WBs) in the FPUs. We flrst study the area, speed and utilization trade-off of the selected FPU subgraphs in a set of floating point benchmark circuits. We then explore the impact of density and flexibility of FPUs on the system in terms of area, speed and routing resources. We derive an optimized coarse-grained FPU by considering both architectural and system level issues. The results show that: (1) embedding more types of coarse-grained FPU in the system causes at most 21.3% increase in delay, (2) the area of the system can be reduced by 27.4% by embedding high density subgraphs, (3) the high density subgraphs requires 14.8% fewer routing resources.

URLhttp://dx.doi.org/10.1109/FPT.2008.4762366
DOI10.1109/FPT.2008.4762366

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2018 The University of British Columbia