A general framework to use various decomposition methods for LUT network synthesis

This paper presents a new framework for synthesizing look-up table (LUT) ne tworks. Some of the existing LUT network synthesis methods are based on one or two functional (Boolean) decompositions. Our method also uses functiona l decompositions, but we try to use various decomposition methods, which in clude algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various d ecomposition methods. We use a cost database file which is a unique charact eristic in our method. We also present comparisons between our method and s ome well-known LUT network synthesis methods, and evaluate the final result s after placement and routing. Although our method is rather heuristic in n ature, the experimental results are encouraging.