Efficient DDD-Based Interpretable Symbolic Characterization of Large Analog Circuits

Sheldon X.-D. TAN; C.-J.  Richard SHI

Efficient DDD-Based Interpretable Symbolic Characterization of Large Analog Circuits

Sheldon X.-D. TAN, C.-J. Richard SHI

Full Text Views

0

Share
Cite this

Summary :

A systematic and efficient approach is presented to generating simple yet accurate symbolic expressions for transfer functions and characteristics of large linear analog circuits. The approach is based on a compact determinant decision diagram (DDD) representation of exact transfer functions and characteristics. Several key tasks of generating interpretable symbolic expressions--DDD graph simplification, term de-cancellation, and dominant-term generation--are shown to be able to perform linearly by means of DDD graph operations. An efficient algorithm for generating dominant terms is presented based on the concepts of finding the k-shortest paths in a DDD graph. Experimental results show that our approach outperforms other start-of-the-art approaches, and is capable of generating interpretable expressions for typical analog blocks in minutes on modern computer workstations.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.12 pp.3110-3118

Publication Date: 2003/12/01

Publicized

Online ISSN

DOI

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

Category: Analog Design

Cite this

Copy

Sheldon X.-D. TAN, C.-J. Richard SHI, "Efficient DDD-Based Interpretable Symbolic Characterization of Large Analog Circuits" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 12, pp. 3110-3118, December 2003, doi: .
Abstract: A systematic and efficient approach is presented to generating simple yet accurate symbolic expressions for transfer functions and characteristics of large linear analog circuits. The approach is based on a compact determinant decision diagram (DDD) representation of exact transfer functions and characteristics. Several key tasks of generating interpretable symbolic expressions--DDD graph simplification, term de-cancellation, and dominant-term generation--are shown to be able to perform linearly by means of DDD graph operations. An efficient algorithm for generating dominant terms is presented based on the concepts of finding the k-shortest paths in a DDD graph. Experimental results show that our approach outperforms other start-of-the-art approaches, and is capable of generating interpretable expressions for typical analog blocks in minutes on modern computer workstations.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_12_3110/_p

Copy

@ARTICLE{e86-a_12_3110,
author={Sheldon X.-D. TAN, C.-J. Richard SHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient DDD-Based Interpretable Symbolic Characterization of Large Analog Circuits},
year={2003},
volume={E86-A},
number={12},
pages={3110-3118},
abstract={A systematic and efficient approach is presented to generating simple yet accurate symbolic expressions for transfer functions and characteristics of large linear analog circuits. The approach is based on a compact determinant decision diagram (DDD) representation of exact transfer functions and characteristics. Several key tasks of generating interpretable symbolic expressions--DDD graph simplification, term de-cancellation, and dominant-term generation--are shown to be able to perform linearly by means of DDD graph operations. An efficient algorithm for generating dominant terms is presented based on the concepts of finding the k-shortest paths in a DDD graph. Experimental results show that our approach outperforms other start-of-the-art approaches, and is capable of generating interpretable expressions for typical analog blocks in minutes on modern computer workstations.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Efficient DDD-Based Interpretable Symbolic Characterization of Large Analog Circuits
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3110
EP - 3118
AU - Sheldon X.-D. TAN
AU - C.-J. Richard SHI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2003
AB - A systematic and efficient approach is presented to generating simple yet accurate symbolic expressions for transfer functions and characteristics of large linear analog circuits. The approach is based on a compact determinant decision diagram (DDD) representation of exact transfer functions and characteristics. Several key tasks of generating interpretable symbolic expressions--DDD graph simplification, term de-cancellation, and dominant-term generation--are shown to be able to perform linearly by means of DDD graph operations. An efficient algorithm for generating dominant terms is presented based on the concepts of finding the k-shortest paths in a DDD graph. Experimental results show that our approach outperforms other start-of-the-art approaches, and is capable of generating interpretable expressions for typical analog blocks in minutes on modern computer workstations.
ER -