The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] network reduction(4hit)

1-4hit
  • Realizable Reduction of RC Networks with Current Sources for Dynamic IR-Drop Analysis of Power Networks of SoCs

    Hong Bo CHE  Hyoun Soo PARK  Jin Wook KIM  Young Hwan KIM  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E92-A No:2
      Page(s):
    475-480

    The authors present R2Power, an effective approach to the realizable reduction of RC networks with independent current sources. The proposed approach is based on the entrywise perturbation theory for diagonally dominant M-matrices. The accuracy of the node voltages of the reduced network, as compared to those of the original network, is maintained on the order of the entrywise perturbation performed during reduction. R2Power can be used to reduce the size of RC networks used to model the power networks of SoCs, for efficient IR-drop analysis. Experiments showed that R2Power reduced the size of industrial examples by more than 95%, with maximum relative node voltage errors of less than 0.012%.

  • An Improved Algorithm to Compute Marginal Reliability Importance in a Network System

    Takeshi KOIDE  Shuichi SHINMORI  Hiroaki ISHII  

     
    PAPER-Reliability, Maintainability and Safety Analysis

      Vol:
    E87-A No:2
      Page(s):
    454-460

    Marginal reliability importance (MRI) of a component in a system is defined as the rate at which the system reliability changes over changes of the component reliability. MRI helps network designers to construct a reliable network layout. We consider a problem to compute MRI of all components in a network system considering all-terminal reliability in order to rank the components with respect to MRI. The problem is time-consuming since computing network reliability is #P-complete. This paper improves the traditional approach for the problem to proposes an efficient algorithm. The algorithm applies some network transformations, three network reductions and one network decomposition. We have proved lemmas with respect to the relationship between the transformations and MRI, which compute MRI for an original network by using MRI and reliability for transformed networks. Additionally, we have derived a deformed formula to compute MRI, which can also reduce computational task. Numerical experiments revealed that the proposed algorithm reduced computational time considerably compared to the traditional approach.

  • A New Methodology for Optimal Placement of Decoupling Capacitors on Printed Circuit Board

    Atsushi KAMO  Takayuki WATANABE  Hideki ASAI  

     
    LETTER-Circuit Theory

      Vol:
    E84-A No:12
      Page(s):
    3177-3181

    This report describes a new methodology for the optimal placement of decoupling capacitors on the printed circuit board (PCB). This method searches the optimal position of decoupling capacitor so that the impedance characteristics at the power supply is minimized in the specified frequency range. In this method, the PCB is modeled by the PEEC method to handle the 3-dimensional structures and Krylov-subspace technique is applied to obtain efficiently the impedance characteristics in the frequency domain.

  • A Share Assignment Method to Maximize the Probability of Secret Sharing Reconstruction under the Internet

    Ching-Yun LEE  Yi-Shiung YEH  Deng-Jyi CHEN  Kuo-Lung KU  

     
    PAPER-Applications of Information Security Techniques

      Vol:
    E83-D No:2
      Page(s):
    190-199

    The use of Internet for various business applications and resource sharing has grown tremendously over the last few years. Internet security has become an important issue for both academic and industrial sectors. Much related network security research has been conducted such as user authentication, data confidentiality, and data integrity. In some applications, a critical document can be divided into pieces and allocated in different locations over the Internet for security access concern. To access such an important document, one must reconstruct the divided pieces from different locations under the given Internet environment. In this paper, a probability model for reconstructing secret sharing and algorithms to perform share assignment are presented. Also, an evaluation algorithm to measure the probability of secret sharing reconstruction is proposed. Illustrative examples and simulation results are provided to demonstrate the applicability of our method.