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

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

Research output: Contribution to journalArticle

Abstract

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

Original languageEnglish
Pages (from-to)2915-2922
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE84-A
Issue number11
Publication statusPublished - Nov 2001
Externally publishedYes

Keywords

  • Algebraic decomposition
  • Field programmable gate array (FPGA)
  • Functional decomposition
  • Look-up table (LUT)

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A general framework to use various decomposition methods for LUT network synthesis'. Together they form a unique fingerprint.

  • Cite this