Finding an optimal functional decomposition for LUT-based FPGA synthesis

Authors:
Jian Qiao;Makoto Ikeda;Kunihiro Asada
Affiliations:
Department of Electronic engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan;VLSI Design and Education Center, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan;VLSI Design and Education Center, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
Venue:
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Year:
2001

Citing 8
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)
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 this paper, we propose a novel approach to the optimal functional decomposition for LUT-based FPGA synthesis. We focus on exploring all design space and finding a set of which can be merged, to the maximal extent, into multiple-output CLBs or an LUT such that the decomposition constructed from the components is also minimal. In particular, to exploit more degrees of freedom, pliable encoding has been introduced to take over the classical rigid encoding process when the latter fails to get a satisfactory solution. Experimental results on a set of MCNC91 benchmarks show that our method is promising.