Timing Optimization of Multi-Level Networks Using Boolean Relations

Yuji KUKIMOTO; Masahiro FUJITA

Timing Optimization of Multi-Level Networks Using Boolean Relations

Yuji KUKIMOTO, Masahiro FUJITA

Full Text Views

0

Share
Cite this

Summary :

In this paper we propose a new timing optimization technique for multi-level networks by restructuring multiple nodes simultaneously. Multi-output subcircuits on critical paths are extracted and resynthesized so that the delays of the paths are reduced. The complete design space of the subcircuits is captured by Boolean relations, which allow us to perform more powerful resynthesis than previous approaches using don't cares. Experimental results are reported to show the effectiveness of the proposed technique.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.3 pp.362-369

Publication Date: 1993/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)

Category

Cite this

Copy

Yuji KUKIMOTO, Masahiro FUJITA, "Timing Optimization of Multi-Level Networks Using Boolean Relations" in IEICE TRANSACTIONS on Fundamentals, vol. E76-A, no. 3, pp. 362-369, March 1993, doi: .
Abstract: In this paper we propose a new timing optimization technique for multi-level networks by restructuring multiple nodes simultaneously. Multi-output subcircuits on critical paths are extracted and resynthesized so that the delays of the paths are reduced. The complete design space of the subcircuits is captured by Boolean relations, which allow us to perform more powerful resynthesis than previous approaches using don't cares. Experimental results are reported to show the effectiveness of the proposed technique.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e76-a_3_362/_p

Copy

@ARTICLE{e76-a_3_362,
author={Yuji KUKIMOTO, Masahiro FUJITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Timing Optimization of Multi-Level Networks Using Boolean Relations},
year={1993},
volume={E76-A},
number={3},
pages={362-369},
abstract={In this paper we propose a new timing optimization technique for multi-level networks by restructuring multiple nodes simultaneously. Multi-output subcircuits on critical paths are extracted and resynthesized so that the delays of the paths are reduced. The complete design space of the subcircuits is captured by Boolean relations, which allow us to perform more powerful resynthesis than previous approaches using don't cares. Experimental results are reported to show the effectiveness of the proposed technique.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Timing Optimization of Multi-Level Networks Using Boolean Relations
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 362
EP - 369
AU - Yuji KUKIMOTO
AU - Masahiro FUJITA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1993
AB - In this paper we propose a new timing optimization technique for multi-level networks by restructuring multiple nodes simultaneously. Multi-output subcircuits on critical paths are extracted and resynthesized so that the delays of the paths are reduced. The complete design space of the subcircuits is captured by Boolean relations, which allow us to perform more powerful resynthesis than previous approaches using don't cares. Experimental results are reported to show the effectiveness of the proposed technique.
ER -