Scan cell reordering to minimize peak power during test cycle: A graph theoretic approach

Scan circuit is widely practiced DFT technology. The scan testing procedure consist of state initialization, test application, response capture and observation process. During the state initialization process the scan vectors are shifted into the scan cells and simultaneously the responses captured in last cycle are shifted out. During this shift operation the transitions that arise in the scan cells are propagated to the combinational circuit, which inturn create many more toggling activities in the combinational block and hence increases the dynamic power consumption. The dynamic power consumed during scan shift operation is much more higher than that of normal mode operation.

Thermal decomposition of haloethanols: single pulse shock tube and ab initio studies

This paper reports single pulse shock tube and ab initio studies on thermal decomposition of 2-fluoro and 2-chloroethanol at T=1000–1200 K. Both molecules have HX (X = F/Cl) and H2O molecular elimination channels. The CH3CHO formed by HX elimination is chemically active and undergoes secondary decomposition resulting in the formation of CH4, C2H6, and C2H4. A detailed kinetic simulation indicates that the formation of C2H4 could not be quantitatively explained as arising exclusively from secondary CH3CHO decomposition. Contributions from primary radical processes need to be considered to explain C2H4 quantitatively. Ab initio calculations on HX and H2O elimination reactions from the haloethanols at HF, MP2, and DFT levels with various basis sets up to 6/311++G**are reported. It is pointed out that due to strong correlations between A and Eα, comparison of these two parameters between experimental and theoretical results could be misleading.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.