Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization

Hiroshi Sawada, Takayuki Suyama, Akira Nagoya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Citations (Scopus)

Abstract

This paper presents a logic synthesis method for look-up table (LUT) based field programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is effectively carried out by solving a support minimization problem for an incompletely specified function. We can also handle satisfiability don't cares of an LUT network using the technique.

Original languageEnglish
Title of host publicationIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
Editors Anon
PublisherIEEE
Pages353-358
Number of pages6
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design - San Jose, CA, USA
Duration: Nov 5 1995Nov 9 1995

Other

OtherProceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design
CitySan Jose, CA, USA
Period11/5/9511/9/95

Fingerprint

Field programmable gate arrays (FPGA)
Decomposition
Logic Synthesis

ASJC Scopus subject areas

  • Software

Cite this

Sawada, H., Suyama, T., & Nagoya, A. (1995). Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization. In Anon (Ed.), IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers (pp. 353-358). IEEE.

Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization. / Sawada, Hiroshi; Suyama, Takayuki; Nagoya, Akira.

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. ed. / Anon. IEEE, 1995. p. 353-358.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sawada, H, Suyama, T & Nagoya, A 1995, Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization. in Anon (ed.), IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. IEEE, pp. 353-358, Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, USA, 11/5/95.
Sawada H, Suyama T, Nagoya A. Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization. In Anon, editor, IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. IEEE. 1995. p. 353-358
Sawada, Hiroshi ; Suyama, Takayuki ; Nagoya, Akira. / Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization. IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers. editor / Anon. IEEE, 1995. pp. 353-358
@inproceedings{efa4881c8c2a49309590feec4a21732f,
title = "Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization",
abstract = "This paper presents a logic synthesis method for look-up table (LUT) based field programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is effectively carried out by solving a support minimization problem for an incompletely specified function. We can also handle satisfiability don't cares of an LUT network using the technique.",
author = "Hiroshi Sawada and Takayuki Suyama and Akira Nagoya",
year = "1995",
language = "English",
pages = "353--358",
editor = "Anon",
booktitle = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers",
publisher = "IEEE",

}

TY - GEN

T1 - Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization

AU - Sawada, Hiroshi

AU - Suyama, Takayuki

AU - Nagoya, Akira

PY - 1995

Y1 - 1995

N2 - This paper presents a logic synthesis method for look-up table (LUT) based field programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is effectively carried out by solving a support minimization problem for an incompletely specified function. We can also handle satisfiability don't cares of an LUT network using the technique.

AB - This paper presents a logic synthesis method for look-up table (LUT) based field programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is effectively carried out by solving a support minimization problem for an incompletely specified function. We can also handle satisfiability don't cares of an LUT network using the technique.

UR - http://www.scopus.com/inward/record.url?scp=0029510039&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029510039&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029510039

SP - 353

EP - 358

BT - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

A2 - Anon, null

PB - IEEE

ER -