Optimum Functional Decomposition for LUT-Based FPGA Synthesis

Authors:
Jian Qiao;Makoto Ikeda;Kunihiro Asada
Affiliations:
-;-;-
Venue:
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Year:
2000

Citing 9
Cited 0

Optimum functional decomposition using encoding

DAC '94 Proceedings of the 31st annual Design Automation Conference
Lambda set selection in Roth-Karp decomposition for LUT-based FPGA technology mapping

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Compatible class encoding in Roth-Karp decomposition for two-output LUT architecture

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Partially-dependent functional decomposition with applications in FPGA synthesis and mapping

FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
Compatible class encoding in hyper-function decomposition for FPGA synthesis

DAC '98 Proceedings of the 35th annual Design Automation Conference
A Generalized Tree Circuit

Journal of the ACM (JACM)
Minimization over Boolean graphs

IBM Journal of Research and Development
Computing support-minimal subfunctions during functional decomposition

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

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.