SPFD: a new method to express functional flexibility

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

In this paper, we propose a unique way to express functional flexibility by using sets of pairs of functions called 'Sets of Pairs of Functions to be Distinguished'(SPFDs) rather than traditional incompletely specified functions. This method was very naturally derived from a unique concept for distinguishing two logic functions, which we explain in detail in this paper. The flexibility represented by an SPFD assumes that the internal logic of a node in a circuit can be freely changed. SPFDs make good use of this assumption, and they can express larger flexibility than incompletely specified functions in some cases. Although the main subject of this paper is to explain the concept of SPFDs, we also present an efficient method for calculating the functional flexibilities by SPFDs because the concept becomes useful only if there is an efficient calculation method for it. Moreover, we present a method to use SPFDs for circuit transformation along with a proof of the correctness of the method. We further make a comparison between SPFDs and compatible sets of permissible functions (CSPFs), which express functional flexibility by incompletely specified functions. As an application of SPFDs, we show a method to optimize LUT (look-up table) networks and experimental results.

Original languageEnglish
Pages (from-to)840-849
Number of pages10
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume19
Issue number8
DOIs
Publication statusPublished - Aug 2000
Externally publishedYes

Fingerprint

Networks (circuits)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

SPFD : a new method to express functional flexibility. / Yamashita, Shigeru; Sawada, Hiroshi; Nagoya, Akira.

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 19, No. 8, 08.2000, p. 840-849.

Research output: Contribution to journalArticle

@article{e810e19b66f445d68e80e331112b232f,
title = "SPFD: a new method to express functional flexibility",
abstract = "In this paper, we propose a unique way to express functional flexibility by using sets of pairs of functions called 'Sets of Pairs of Functions to be Distinguished'(SPFDs) rather than traditional incompletely specified functions. This method was very naturally derived from a unique concept for distinguishing two logic functions, which we explain in detail in this paper. The flexibility represented by an SPFD assumes that the internal logic of a node in a circuit can be freely changed. SPFDs make good use of this assumption, and they can express larger flexibility than incompletely specified functions in some cases. Although the main subject of this paper is to explain the concept of SPFDs, we also present an efficient method for calculating the functional flexibilities by SPFDs because the concept becomes useful only if there is an efficient calculation method for it. Moreover, we present a method to use SPFDs for circuit transformation along with a proof of the correctness of the method. We further make a comparison between SPFDs and compatible sets of permissible functions (CSPFs), which express functional flexibility by incompletely specified functions. As an application of SPFDs, we show a method to optimize LUT (look-up table) networks and experimental results.",
author = "Shigeru Yamashita and Hiroshi Sawada and Akira Nagoya",
year = "2000",
month = "8",
doi = "10.1109/43.856972",
language = "English",
volume = "19",
pages = "840--849",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - SPFD

T2 - a new method to express functional flexibility

AU - Yamashita, Shigeru

AU - Sawada, Hiroshi

AU - Nagoya, Akira

PY - 2000/8

Y1 - 2000/8

N2 - In this paper, we propose a unique way to express functional flexibility by using sets of pairs of functions called 'Sets of Pairs of Functions to be Distinguished'(SPFDs) rather than traditional incompletely specified functions. This method was very naturally derived from a unique concept for distinguishing two logic functions, which we explain in detail in this paper. The flexibility represented by an SPFD assumes that the internal logic of a node in a circuit can be freely changed. SPFDs make good use of this assumption, and they can express larger flexibility than incompletely specified functions in some cases. Although the main subject of this paper is to explain the concept of SPFDs, we also present an efficient method for calculating the functional flexibilities by SPFDs because the concept becomes useful only if there is an efficient calculation method for it. Moreover, we present a method to use SPFDs for circuit transformation along with a proof of the correctness of the method. We further make a comparison between SPFDs and compatible sets of permissible functions (CSPFs), which express functional flexibility by incompletely specified functions. As an application of SPFDs, we show a method to optimize LUT (look-up table) networks and experimental results.

AB - In this paper, we propose a unique way to express functional flexibility by using sets of pairs of functions called 'Sets of Pairs of Functions to be Distinguished'(SPFDs) rather than traditional incompletely specified functions. This method was very naturally derived from a unique concept for distinguishing two logic functions, which we explain in detail in this paper. The flexibility represented by an SPFD assumes that the internal logic of a node in a circuit can be freely changed. SPFDs make good use of this assumption, and they can express larger flexibility than incompletely specified functions in some cases. Although the main subject of this paper is to explain the concept of SPFDs, we also present an efficient method for calculating the functional flexibilities by SPFDs because the concept becomes useful only if there is an efficient calculation method for it. Moreover, we present a method to use SPFDs for circuit transformation along with a proof of the correctness of the method. We further make a comparison between SPFDs and compatible sets of permissible functions (CSPFs), which express functional flexibility by incompletely specified functions. As an application of SPFDs, we show a method to optimize LUT (look-up table) networks and experimental results.

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

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

U2 - 10.1109/43.856972

DO - 10.1109/43.856972

M3 - Article

AN - SCOPUS:0034250771

VL - 19

SP - 840

EP - 849

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 8

ER -