An efficient reduction algorithm for computation of interconnect delay variability for statistical timing analysis in clock tree planning

In this paper, we propose a novel and efficient algorithm for modelling sub-65 nm clock interconnect-networks in the presence of process variation. We develop a method for delay analysis of interconnects considering the impact of Gaussian metal process variations. The resistance and capacitance of a distributed RC line are expressed as correlated Gaussian random variables which are then used to compute the standard deviation of delay Probability Distribution Function (PDF) at all nodes in the interconnect network. Main objective is to find delay PDF at a cheaper cost. Convergence of this approach is in probability distribution but not in mean of delay. We validate our approach against SPICE based Monte Carlo simulations while the current method entails significantly lower computational cost.

A Computationally Efficient PWM Algorithm for Multilevel Inverters

Centred space vector PWM (CSVPWM) technique is popularly used for three level voltage source inverters. The reference voltage vector is synthesized by time-averaging of the three nearest voltage vectors produced by the inverter. Identifying the three voltage vectors, and calculation of the dwelling time for each vector are both computationally intensive. This paper analyses the process of PWM generation in CSVPWM. This analysis breaks up a three-level inverter into six different conceptual two level inverters in different regions of the fundamental cycle. Control of 3-level inverter is viewed as the control of the appropriate 2-level inverter. The analysis leads to a systematic simplification of the computations involved, finally resulting in a computationally efficient PWM algorithm. This algorithm exploits the equivalence between triangle comparison and space vector approaches to PWM generation. This algorithm does not involve any 3-phase/2-phase or 2-phase/3-phase transformation. This also does not involve any transformation from rectangular to polar coordinates, and vice versa. Further no evaluation of trigonometric functions is necessary. This algorithm also provides for the mitigation of DC neutral point unbalance, and is well suited to digital implementation. Simulation and experimental results are presented.

Antimicrobial activity of highly stable silver nano particles embedded in agar-agar matrix as a thin film

Highly stable silver nanoparticles (Ag NPs) in agar-agar (Ag/agar) as inorganic-organic hybrid were obtained as free-standing film by in situ reduction of silver nitrate by ethanol. The antimicrobial activity of Ag/agar film on Escherichia coli (E. coil), Staphylococcus aureus (S. aureus), and Candida albicans (C albicans) was evaluated in a nutrient broth and also in saline solution. In particular, films were repeatedly tested for antimicrobial activity after recycling. UV-vis absorption and TEM studies were carried out on films at different stages and morphological studies on microbes were carried out by SEM. Results showed spherical Ag NPs of size 15-25 nm, having sharp surface plasmon resonance (SPR) band. The antimicrobial activity of Ag/agar film was found to be in the order, C. albicans > E. coil > S. aureus, and antimicrobial activity against C. albicans was almost maintained even after the third cycle. Whereas, in case of E. coil and S. aureus there was a sharp decline in antimicrobial activity after the second cycle. Agglomeration of Ag NPs in Ag/agar film on exposure to microbes was observed by TEM studies. Cytotoxic experiments carried out on HeLa cells showed a threshold Ag NPs concentration of 60 mu g/mL, much higher than the minimum inhibition concentration of Ag NPs (25.8 mu g/mL) for E. coli. The mechanical strength of the film determined by nanoindentation technique showed almost retention of the strength even after repeated cycle. (C) 2010 Elsevier Ltd. All rights reserved.

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the ``evaporation concept'' applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The ``evaporation concept'' is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.

A Low-Complexity Algorithm for Intrusion Detection in a PIR-Based Wireless Sensor Network

We present a low-complexity algorithm for intrusion detection in the presence of clutter arising from wind-blown vegetation, using Passive Infra-Red (PIR) sensors in a Wireless Sensor Network (WSN). The algorithm is based on a combination of Haar Transform (HT) and Support-Vector-Machine (SVM) based training and was field tested in a network setting comprising of 15-20 sensing nodes. Also contained in this paper is a closed-form expression for the signal generated by an intruder moving at a constant velocity. It is shown how this expression can be exploited to determine the direction of motion information and the velocity of the intruder from the signals of three well-positioned sensors.

Silver nitrate-acetonitrile and iodine-benzene complexes as studied by NMR in thermotropic liquid crystals

Silver nitrate-acetonitrile and π iodine-benzene complexes in thermotropic liquid crystals have been studied by 1H, 2H, and 13C NMR spectroscopy and by optical microscopy. Evidence for at least two silver complexes in each liquid crystal is presented.

Silver- and Gold-Related Deep Levels in Gallium Arsenide

Characterization of silver- and gold-related defects in gallium arsenide is carried out. These impurities were introduced during the thermal diffusion process and the related defects are characterized by deep-level transient spectroscopy and photoluminescence. The silver-related center in GaAs shows a 0.238 eV photoluminescence line corresponding to no-phonon transition, whereas its thermal ionization energy is found to be 0.426 eV. The thermal activation energy of the gold-related center in GaAs is 0.395 eV, but there is no corresponding luminescence signal.

Biomimetic synthesis of silver nanoparticles by Citrus limon (lemon) aqueous extract and theoretical prediction of particle size

In the present study silver nanoparticles were rapidly synthesized at room temperature by treating silver ions with the Citrus limon (lemon) extract The effect of various process parameters like the reductant con centration mixing ratio of the reactants and the concentration of silver nitrate were studied in detail In the standardized process 10(-2) M silver nitrate solution was interacted for 411 with lemon Juice (2% citric acid concentration and 0 5% ascorbic acid concentration) in the ratio of 1 4(vol vol) The formation of silver nanoparticles was confirmed by Surface Plasmon Resonance as determined by UV-Visible spectra in the range of 400-500 nm X ray diffraction analysis revealed the distinctive facets (1 1 1 200 220 2 2 2 and 3 1 1 planes) of silver nanoparticles We found that citric acid was the principal reducing agent for the nanosynthesis process FT IR spectral studies demonstrated citric acid as the probable stabilizing agent Silver nanoparticles below 50 nm with spherical and spheroidal shape were observed from transmission electron microscopy The correlation between absorption maxima and particle sizes were derived for different UV-Visible absorption maxima (corresponding to different citric acid concentrations) employing MiePlot v 3 4 The theoretical particle size corresponding to 2% citric acid concentration was corn pared to those obtained by various experimental techniques like X ray diffraction analysis atomic force microscopy and transmission electron microscopy (C) 2010 Elsevier B V All rights reserved

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

An efficient algorithm for linear programming

A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.

A systolic algorithm for hidden surface removal

With the advent of VLSI it has become possible to map parallel algorithms for compute-bound problems directly on silicon. Systolic architecture is very good candidate for VLSI implementation because of its regular and simple design, and regular communication pattern. In this paper, a systolic algorithm and corresponding systolic architecture, a linear systolic array, for the scanline-based hidden surface removal problem in three-dimensional computer graphics have been proposed. The algorithm is based on the concept of sample spans or intervals. The worst case time taken by the algorithm is O(n), n being the number of segments in a scanline. The time taken by the algorithm for a given scene depends on the scene itself, and on an average considerable improvement over the worst case behaviour is expected. A pipeline scheme for handling the I/O process has also been proposed which is suitable for VLSI implementation of the algorithm.

Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems

We present a low-complexity algorithm based on reactive tabu search (RTS) for near maximum likelihood (ML) detection in large-MIMO systems. The conventional RTS algorithm achieves near-ML performance for 4-QAM in large-MIMO systems. But its performance for higher-order QAM is far from ML performance. Here, we propose a random-restart RTS (R3TS) algorithm which achieves significantly better bit error rate (BER) performance compared to that of the conventional RTS algorithm in higher-order QAM. The key idea is to run multiple tabu searches, each search starting with a random initial vector and choosing the best among the resulting solution vectors. A criterion to limit the number of searches is also proposed. Computer simulations show that the R3TS algorithm achieves almost the ML performance in 16 x 16 V-BLAST MIMO system with 16-QAM and 64-QAM at significantly less complexities than the sphere decoder. Also, in a 32 x 32 V-BLAST MIMO system, the R3TS performs close to ML lower bound within 1.6 dB for 16-QAM (128 bps/Hz), and within 2.4 dB for 64-QAM (192 bps/Hz) at 10(-3) BER.