Generalized Reasoning Scheme for Redundancy Addition and Removal

Jose Alberto ESPEJO; Luis ENTRENA; Enrique San MILLAN; Celia LOPEZ

Generalized Reasoning Scheme for Redundancy Addition and Removal

Jose Alberto ESPEJO, Luis ENTRENA, Enrique San MILLAN, Celia LOPEZ

Full Text Views

0

Cite this

Summary :

This work provides a generalization of structural logic optimization methods to general boolean networks. This generalization is based on a functional description of the nodes in the network. Therefore, this approach is no longer restricted to networks that consist of simple gates. Within this framework, we present necessary and sufficient conditions to identify all the possible functional expansions of a node that allow to eliminate a wire elsewhere in the network. These conditions are also given for the case of multiple variable expansion, providing an incremental mechanism to perform functional transformations involving any number of variables that can be applied in a very efficient manner. On the other hand, we will show in this paper that relevant simplifications can be obtained when this framework is applied to the particular case of AND-OR-NOT networks, resulting in important savings in the computational effort. When compared to previous approaches, the experimental results show an important reduction in the number of computations required.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.11 pp.2665-2672

Publication Date: 2001/11/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)

Category: Logic Synthesis

Cite this

Copy

Jose Alberto ESPEJO, Luis ENTRENA, Enrique San MILLAN, Celia LOPEZ, "Generalized Reasoning Scheme for Redundancy Addition and Removal" in IEICE TRANSACTIONS on Fundamentals, vol. E84-A, no. 11, pp. 2665-2672, November 2001, doi: .
Abstract: This work provides a generalization of structural logic optimization methods to general boolean networks. This generalization is based on a functional description of the nodes in the network. Therefore, this approach is no longer restricted to networks that consist of simple gates. Within this framework, we present necessary and sufficient conditions to identify all the possible functional expansions of a node that allow to eliminate a wire elsewhere in the network. These conditions are also given for the case of multiple variable expansion, providing an incremental mechanism to perform functional transformations involving any number of variables that can be applied in a very efficient manner. On the other hand, we will show in this paper that relevant simplifications can be obtained when this framework is applied to the particular case of AND-OR-NOT networks, resulting in important savings in the computational effort. When compared to previous approaches, the experimental results show an important reduction in the number of computations required.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_11_2665/_p

Copy

@ARTICLE{e84-a_11_2665,
author={Jose Alberto ESPEJO, Luis ENTRENA, Enrique San MILLAN, Celia LOPEZ, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generalized Reasoning Scheme for Redundancy Addition and Removal},
year={2001},
volume={E84-A},
number={11},
pages={2665-2672},
abstract={This work provides a generalization of structural logic optimization methods to general boolean networks. This generalization is based on a functional description of the nodes in the network. Therefore, this approach is no longer restricted to networks that consist of simple gates. Within this framework, we present necessary and sufficient conditions to identify all the possible functional expansions of a node that allow to eliminate a wire elsewhere in the network. These conditions are also given for the case of multiple variable expansion, providing an incremental mechanism to perform functional transformations involving any number of variables that can be applied in a very efficient manner. On the other hand, we will show in this paper that relevant simplifications can be obtained when this framework is applied to the particular case of AND-OR-NOT networks, resulting in important savings in the computational effort. When compared to previous approaches, the experimental results show an important reduction in the number of computations required.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Generalized Reasoning Scheme for Redundancy Addition and Removal
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2665
EP - 2672
AU - Jose Alberto ESPEJO
AU - Luis ENTRENA
AU - Enrique San MILLAN
AU - Celia LOPEZ
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2001
AB - This work provides a generalization of structural logic optimization methods to general boolean networks. This generalization is based on a functional description of the nodes in the network. Therefore, this approach is no longer restricted to networks that consist of simple gates. Within this framework, we present necessary and sufficient conditions to identify all the possible functional expansions of a node that allow to eliminate a wire elsewhere in the network. These conditions are also given for the case of multiple variable expansion, providing an incremental mechanism to perform functional transformations involving any number of variables that can be applied in a very efficient manner. On the other hand, we will show in this paper that relevant simplifications can be obtained when this framework is applied to the particular case of AND-OR-NOT networks, resulting in important savings in the computational effort. When compared to previous approaches, the experimental results show an important reduction in the number of computations required.
ER -