“SPFD: A New Method to Express Functional Flexibility”

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

Research output: Contribution to journalArticle

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)53
Number of pages1
JournalIEEE Circuits and Systems Magazine
Volume2
Issue number2
DOIs
Publication statusPublished - 2002
Externally publishedYes

Fingerprint

Networks (circuits)

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

“SPFD : A New Method to Express Functional Flexibility”. / Yamashita, Shigeru; Sawada, Hiroshi; Nagoya, Akira.

In: IEEE Circuits and Systems Magazine, Vol. 2, No. 2, 2002, p. 53.

Research output: Contribution to journalArticle

Yamashita, Shigeru ; Sawada, Hiroshi ; Nagoya, Akira. / “SPFD : A New Method to Express Functional Flexibility”. In: IEEE Circuits and Systems Magazine. 2002 ; Vol. 2, No. 2. pp. 53.
@article{5ffff635210a4b67801217d30188606b,
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 = "2002",
doi = "10.1109/MCAS.2002.1045860",
language = "English",
volume = "2",
pages = "53",
journal = "IEEE Circuits and Systems Magazine",
issn = "1531-636X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - “SPFD

T2 - A New Method to Express Functional Flexibility”

AU - Yamashita, Shigeru

AU - Sawada, Hiroshi

AU - Nagoya, Akira

PY - 2002

Y1 - 2002

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=85008048573&partnerID=8YFLogxK

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

U2 - 10.1109/MCAS.2002.1045860

DO - 10.1109/MCAS.2002.1045860

M3 - Article

AN - SCOPUS:85008048573

VL - 2

SP - 53

JO - IEEE Circuits and Systems Magazine

JF - IEEE Circuits and Systems Magazine

SN - 1531-636X

IS - 2

ER -