Cascaded Bayesian Inferencing for Switching Activity Estimation with Correlated Inputs

S. Bhanja and N. Ranganathan, “Cascaded Bayesian Inferencing for Switching Activity Estimation with Correlated Inputs,” IEEE Transaction on VLSI Systems, Volume 12, Issue 12, pp .1360 – 1370, 2004.


@ARTICLE{1407954,
title={Cascaded Bayesian inferencing for switching activity estimation with correlated inputs},
author={Bhanja, S. and Ranganathan, N.},
journal={Very Large Scale Integration (VLSI) Systems, IEEE Transactions on},
year={2004},
month={Dec},
volume={12},
number={12},
pages={ 1360-1370},
abstract={ In this paper, we investigate the estimation of switching activity in VLSI circuits using a graphical probabilistic model based on cascaded Bayesian networks (CBNs). First, we develop a theoretical analysis for Bayesian inferencing of switching activity and then derive upper bounds for certain circuit parameters which, in turn, are useful in establishing the cascade structure of the CBN model. We formulate an elegant framework for maintaining probabilistic consistency in the interfacing boundaries across the CBNs during the inference process using a tree-dependent (TD) probability distribution function. A TD distribution is an approximation of the true joint probability function over the switching variables, with the constraint that the underlying BN representation is a tree. The tree approximation of the true joint probability function can be arrived at by using a maximum weight spanning tree (MWST) built using pairwise mutual information about the switching occurring at pairs of signal lines on the boundary. Further, we show that the proposed TD distribution function can be used to model correlations among the primary inputs which is critical for accuracy in modeling of switching activity. Experimental results for ISCAS circuits are presented to illustrate the efficacy of the proposed CBN models.},
keywords={ Bayes methods, VLSI, approximation theory, belief networks, boundary-value problems, cascade networks, circuit complexity, circuit switching, electronic engineering computing, estimation theory, inference mechanisms, statistical analysis, statistical distributions, trees (mathematics) ISCAS circuits, VLSI circuits, cascaded Bayesian inference methods, cascaded Bayesian networks, circuit complexity, circuit parameters, correlation inputs, graphical probabilistic model, maximum weight spanning tree, pairwise mutual information, probability distribution function, switching activity estimation, switching activity modeling, switching variables, tree approximation, tree dependent distribution, true joint probability function, upper bounds},
doi={10.1109/TVLSI.2004.837991},
ISSN={1063-8210}, }

Switching activity estimation of VLSI circuits using Bayesian networks

S. Bhanja and N. Ranganathan,“Switching Activity Estimation of VLSI Circuits using Bayesian Networks,” IEEE Transactions on VLSI Systems,
pp. 558- 567, Feb. 2003.


@ARTICLE{1229864,

 title={Switching activity estimation of VLSI circuits using Bayesian networks},
 author={Bhanja, S. and Ranganathan, N.},
 journal={Very Large Scale Integration (VLSI) Systems, IEEE Transactions on},
 year={2003},
 month={Aug.},
 volume={11},
 number={4},
 pages={ 558-567},
 abstract={ Switching activity estimation is an important aspect of
power estimation at circuit level. Switching activity in a node is
temporally correlated with its previous value and is spatially
correlated with other nodes in the circuit. It is important to capture
the effects of such correlations while estimating the switching
activity of a circuit. In this paper, we propose a new switching
probability model for combinational circuits that uses a logic-induced
directed-acyclic graph (LIDAG) and prove that such a graph corresponds
to a Bayesian network (BN), which is guaranteed to map all the
dependencies inherent in the circuit. BNs can be used to effectively
model complex conditional dependencies over a set of random variables.
The BN inference schemes serve as a computational mechanism that
transforms the LIDAG into a junction tree of cliques to allow for
probability propagation by local message passing. The proposed approach
is accurate and fast. Switching activity estimation of ISCAS and MCNC
circuits with random and biased input streams yield high accuracy
(average mean error=0.002) and low computational time (average elapsed
time including CPU, memory access and I/O time for the benchmark
circuits=3.93 s).},

keywords={ VLSI, belief networks, directed graphs, integrated
circuit modelling, logic simulation, probability Bayesian network,
Bayesian networks, ISCAS circuits, LIDAG, MCNC circuits, VLSI circuits,
computational mechanism, computational time, conditional dependencies,
junction tree, local message passing, logic-induced directed acyclic
graph, power estimation, probability propagation, switching activity
estimation, switching probability model},

doi={10.1109/TVLSI.2003.816144},
ISSN={1063-8210},
}

Modeling Switching Activity Using Cascaded Bayesian Networks for Correlated Input Streams

S. Bhanja and N. Ranganathan,” Modeling Switching Activity Using Cascaded Bayesian Networks for Correlated Input Streams ”, International Conference on Computer Design, pp.388-390, 2002.

@INPROCEEDINGS{1106799,
title={Modeling switching activity using cascaded Bayesian networks for correlated input streams},
author={Bhanja, S. and Ranganathan, N.},
booktitle={Computer Design: VLSI in Computers and Processors, 2002. Proceedings. 2002 IEEE International Conference on},
year={2002},
month={},
volume={},
number={},
pages={ 388-390},
abstract={ We represent switching activity in VLSI circuits using a graphical probabilistic model based on cascaded Bayesian networks (CBNs). We develop an elegant method for maintaining probabilistic consistency in the interfacing boundaries across the CBNs during the inference process using a tree-dependent (TD) probability distribution function. A tree-dependent (TD) distribution is an approximation of the true joint probability function over the switching variables, with the constraint that the underlying Bayesian network representation is a tree. The tree approximation of the true joint probability function can be arrived at using a maximum weight spanning tree (MWST) built using pairwise mutual information between switchings at two signal lines. Further we also develop a TD distribution based method to model correlations among the primary inputs which is critical for accuracy in Bayesian modeling of switching activity. Experimental results for ISCAS circuits are presented to illustrate the efficacy of the proposed methods.},
keywords={ VLSI, belief networks, combinational circuits, integrated circuit modelling, probability, trees (mathematics) Bayesian modeling, ISCAS circuits, VLSI circuits, cascaded Bayesian networks, combinational circuits, correlated input streams, graphical probabilistic model, inference process, interfacing boundaries, maximum weight spanning tree, pairwise mutual information, primary inputs, probabilistic consistency, signal lines, switching activity modeling, switching variables, tree approximation, tree-dependent probability distribution function, true joint probability function},
doi={10.1109/ICCD.2002.1106799},
ISSN={1063-6404 }, }

Switching Activity Estimation of Large Circuits using Multiple Bayesian Networks

S. Bhanja and N. Ranganathan, “Switching Activity Estimationof of Large Circuits using Multiple Bayesian Networks”, 15 th Intl. Conference of VLSI Design & 7th ASP-Design and Automation Conference, pp 187-192, 2002.

@INPROCEEDINGS{994917,
title={Switching activity estimation of large circuits using multiple Bayesian networks},
author={Bhanja, S. and Ranganathan, N.},
booktitle={Design Automation Conference, 2002. Proceedings of ASP-DAC 2002. 7th Asia and South Pacific and the 15th International Conference on VLSI Design. Proceedings.},
year={2002},
month={},
volume={},
number={},
pages={187-192},
abstract={Switching activity estimation is a crucial step in estimating dynamic power consumption in CMOS circuits. In this work, we propose a new strategy for efficient segmentation of large circuits so that they can be mapped to Multiple Bayesian Networks (MBN). The goal here is to achieve higher accuracy while reducing the memory requirements during the computation. In order to capture the correlations among the boundaries of segments, a tree dependent (TD) distribution is proposed between the segment boundaries such that the TD distribution is closest to the actual distribution of switching variable with some distance criterion. We use a Maximum Weight Spanning Tree (MWST) based approximation using mutual information between two variables at the boundary as the weight of the edge between the variables. Experimental results for ISCAS'85 circuits show that the proposed method improves accuracy significantly over other methods},
keywords={CMOS digital integrated circuits, belief networks, combinational switching, directed graphs, integrated circuit design, integrated circuit modelling, trees (mathematics)ISCAS'85 circuits, LIDAG structure, combinational circuit, directed acyclic graph, dynamic power consumption, large CMOS circuits, large circuit segmentation, maximum weight spanning tree based approximation, memory requirements, multiple Bayesian networks, switching activity estimation, switching probability model, switching variable distribution, tree-dependent distribution},
doi={10.1109/ASPDAC.2002.994917},
ISSN={}, }

Dependency Preserving Probabilistic Modeling of Switching Activity using Bayesian Networks

S. Bhanja and N. Ranganathan, “Dependency Preserving Probabilistic Modeling of Switching Activity using Bayesian Networks,” IEEE/ACM Design Automation Conference (DAC), pp209-214, 2001.


@INPROCEEDINGS{935506,
title={Dependency preserving probabilistic modeling of switching activity using Bayesian networks},
author={Bhanja, S. and Ranganathan, N.},
booktitle={Design Automation Conference, 2001. Proceedings},
year={2001},
month={},
volume={},
number={},
pages={ 209-214},
abstract={ We propose a new switching probability model for combinational circuits using a logic-induced-directed-acyclic-graph (LIDBG) and prove that such a graph corresponds to a Bayesian network guaranteed to map all the dependencies inherent in the circuit. This switching activity can be estimated by capturing complex dependencies (spatiotemporal and conditional) among signals efficiently by local message-passing based on the Bayesian networks. Switching activity estimation of ISCAS and MCNC circuits with random input streams yield high accuracy (average mean error=0.002) and low computational time (average time=3.93 seconds).},
keywords={ belief networks, combinational circuits, logic CAD, probability 3.93 s, Bayesian network, Bayesian networks, ISCAS circuits, MCNC circuits, combinational circuits, computational time, conditional complex dependencies, dependency preserving probabilistic modeling, local message-passing, logic-induced-directed-acyclic-graph, mean error, spatiotemporal complex dependencies, switching activity},
doi={},
ISSN={0738-100X }, }

A Qualitative Expert System for Clinical Trial Assignment

S. Bhanja, M. Fletcher-Heath, L. O. Hall, D. B. Goldgof and J. P. Krischer, “A Qualitative Expert System for Clinical Trial Assignment”, 11th Int. Florida Artificial Intelligence, pp.84-88, 1998.

@conference{bhanja1998qualitative,
title={{A qualitative expert system for clinical trial assignment}},
author={Bhanja, S. and Fletcher, L.M. and Hall, L.O. and Goldgof, D.B. and Krischer, J.P.},
booktitle={Proceedings of the Eleventh International Florida Artificial Intelligence Research Society Conference},
pages={84--88},
year={1998}
}