Abstract
An Application Specific Inflexible FPGA (ASIF) [12] is an FPGA with reduced flexibility that can implement a set of application circuits which will operate at different times. Application circuits are efficiently placed and routed on an FPGA in such a way that total routing switches used in the FPGA architecture are minimized. Later all unused routing resources are removed from the FPGA to generate an ASIF. An ASIF which is reduced from a heterogeneous FPGA (i.e. containing hard-blocks such as Multipliers, Adders and RAMS etc) is called as a Heterogeneous-ASIF. This work shows that a standard-cell based Heterogeneous-ASIF using Multipliers, Adders and Look-Up-Tables for a set of 10 opencores application circuits is 85% smaller in area than a single driver FPGA using the same blocks, and only 24% larger than the sum of areas of their standard-cell based ASIC version. If the Look-Up-Tables are replaced with a set of repeatedly used hard logic gates (such as AND gate, OR gate, flip-flops etc), the ASIF becomes 89% smaller than the Look-Up-Table based FPGA and 3% smaller than the sum of ASICs. The area gap between ASIF and sum of ASICs can be further reduced if repeatedly used groups of standard-cell logic gates in an ASIF are designed in full-custom. One of the major advantages of an ASIF is that just like an FPGA, an ASIF can also be reprogrammed to execute new or modified circuits, but at a very limited scale. A new CAD flow is presented to map application circuits on an ASIF.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Altera, http://www.altera.com
Marquart, A., Betz, V., Rose, J.: Using cluster-based logic block and timing-driven packing to improve FPGA speed and density. In: International symposium on FPGA, Monterey, pp. 37–46 (1999)
Berkeley Logic Synthesis and Verification Group, University of California, Berkeley. Berkeley Logic Interchange Format (BLIF), http://vlsi.colorado.edu/~vis/blif.ps
Betz, V., Marquardt, A., Rose, J.: Architecture and CAD for Deep-Submicron FPGAs (January 1999)
Compton, K., Hauck, S.: Automatic Design of Area-Efficient Configurable ASIC Cores. IEEE Transaction on Computers 56(5), 662–672 (2007)
Hutton, M., Yuan, R., Schleicher, J., Baeckler, G., Cheung, S., Chua, K., Phoon, H.: A Methodology for FPGA to Structured-ASIC Synthesis and Verification. In: DATE, March 2006, vol. 2, pp. 64–69 (2006)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimisation by Simulated Annealing. Science 220(4598), 671–680 (1983)
Kuon, I., Rose, J.: Measuring the Gap Between FPGAs and ASICs. In: FPGA 2006, pp. 21–30 (Februray 2006)
Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operations Research 14, 699–719 (1966)
Lemieux, G., Lee, E., Tom, M., Yu, A.: Directional and Single-Driver Wires in FPGA Interconnect. In: ICFPT (2004)
McMurchie, L., Ebeling, C.: Pathfinder: A Negotiation-Based Performance-Driven Router for FPGAs. In: Proc. FPGA 1995 (1995)
Parvez, H., Marrakchi, Z., Mehrez, H.: ASIF: Application Specific Inflexible FPGA. In: ICFPT 2009 (2009)
Pistorius, J., Hutton, M., Schleicher, J., Iotov, M., Julias, E., Tharmalignam, K.: Equivalence Verification of FPGA and Structured ASIC Implementations. In: FPL 2007, pp. 423–428 (August 2007)
Sentovich, E.M., et al.: Sis: A system for sequential circuit analysis. Tech. Report No. UCB/ERL M92/41, University of California, Berkeley (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parvez, H., Marrakchi, Z., Mehrez, H. (2010). Application Specific FPGA Using Heterogeneous Logic Blocks. In: Sirisuk, P., Morgan, F., El-Ghazawi, T., Amano, H. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2010. Lecture Notes in Computer Science, vol 5992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12133-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-12133-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12132-6
Online ISBN: 978-3-642-12133-3
eBook Packages: Computer ScienceComputer Science (R0)