Optimum functional decomposition for LUT-based FPGA synthesis

9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In general, Partially Dependent Functions(PDFs) are meaningful for sharing multiple-output CLBs or an LUT. In this paper, we present a novel encoding algorithm for detecting PDFs during functional decomposition. To exploit all solution space, we have introduced pliable encoding to supplement the classical rigid encoding as the latter failed to catch a satisfactory solution. We show that the best solution can only be found by pliable encoding in some cases, and hence the classical encoding strategy should be modified to take account of pliable encoding. Experimental results on a set of MCNC91 benchmarks are quite encouraging.

Cite

CITATION STYLE

APA

Qiao, J., Ikeda, M., & Asada, K. (2000). Optimum functional decomposition for LUT-based FPGA synthesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1896, pp. 555–564). Springer Verlag. https://doi.org/10.1007/3-540-44614-1_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free