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

Keyword Search Result

[Keyword] ARnoldi(6hit)

1-6hit
  • Stochastic Non-homogeneous Arnoldi Method for Analysis of On-Chip Power Grid Networks under Process Variations

    Zhihua GUI  Fan YANG  Xuan ZENG  

     
    PAPER

      Vol:
    E94-C No:4
      Page(s):
    504-510

    In this paper, a Stochastic Non-Homogeneous ARnoldi (SNHAR) method is proposed for the analysis of the on-chip power grid networks in the presence of process variations. In SNHAR method, the polynomial chaos based stochastic method is employed to handle the variations of power grids. Different from the existing StoEKS method which uses extended Krylov Subspace (EKS) method to compute the coefficients of the polynomial chaos, a computation-efficient and numerically stable Non-Homogeneous ARnoldi (NHAR) method is employed in SNHAR method to compute the coefficients of the polynomial chaos. Compared with EKS method, NHAR method has superior numerical stability and can achieve remarkably higher accuracy with even lower computational cost. As a result, SNHAR can capture the stochastic characteristics of the on-chip power grid networks with higher accuracy, but even lower computational cost than StoEKS.

  • Lyapunov-Based Error Estimations of MIMO Interconnect Reductions by Using the Global Arnoldi Algorithm

    Chia-Chi CHU  Ming-Hong LAI  Wu-Shiung FENG  

     
    LETTER

      Vol:
    E90-A No:2
      Page(s):
    415-418

    We present theoretical foundations about error estimations of the global Krylov subspace techniques for multiple-inputs multiple-outputs (MIMO) Interconnect reductions. Analytical relationships between Lyapunov functions of the original interconnect network and those of the reduced system generated by the global Arnoldi algorithm will be developed. Under this framework, a new moment matching reduced network is proposed. Also, we will show that the reduced system can be expressed as the original network with some additive perturbations.

  • MIMO Interconnects Order Reductions by Using the Multiple Point Adaptive-Order Rational Global Arnoldi Algorithm

    Chia-Chi CHU  Ming-Hong LAI  Wu-Shiung FENG  

     
    PAPER

      Vol:
    E89-C No:6
      Page(s):
    792-802

    We extend the adaptive-order rational Arnoldi algorithm for multiple-inputs and multiple-outputs (MIMO) interconnect model order reductions. Instead of using the standard Arnoldi algorithm for the SISO adaptive-order reduction algorithm (AORA), we study the adaptive-order rational global Arnoldi (AORGA) algorithm for MIMO model reductions. In this new algorithm, the input matrix is treated as a vector form. A new matrix Krylov subspace, generated by the global Arnoldi algorithm, will be developed by a Frobenius-orthonormal basis. By employing congruence transformation with the matrix Krylov subspace, the one-sided projection method can be used to construct a reduced-order system. It will be shown that the system moment matching can be preserved. In addition, we also show that the transfer matrix residual error of the reduced system can be derived analytically. This error information will provide a guideline for the order selection scheme. The algorithm can also be applied to the classical multiple point MIMO Pade approximation by the rational Arnoldi algorithm for multiple expansion points. Experimental results demonstrate the feasibility and the effectiveness of the proposed method.

  • An Adjoint Network Approach for RLCG Interconnect Model Order Reductions

    Chia-Chi CHU  Herng-Jer LEE  Ming-Hong LAI  Wu-Shiung FENG  

     
    PAPER

      Vol:
    E89-A No:2
      Page(s):
    439-447

    This work proposes a new method for RLCG interconnect model-order reductions in consideration with the adjoint network. Relationships between an original MNA network and its corresponding adjoint MNA network will be explored first. It will be shown that the congruence transformation matrix used in the one-sided projection can be constructed by using the bi-orthogonal bases developed from the Lanczos-type algorithms. In particular, if the multi-port driving-point impedance of RLCG interconnect circuits is the main concern, the transfer functions and system moments of the adjoint network can be directly calculated from those of the original RLCG interconnect network by exploring symmetric properties of the MNA formulation. Therefore, the cost of constructing the congruence transformation matrix can be simplified by up to 50% of the previous methods. Comparative studies among various standard methods and the proposed methods are also investigated. Experimental results on large-scale RLCG interconnect circuits will demonstrate the accuracy and the efficiency of the proposed method.

  • Indirect Approach for Designing Low-Order Linear-Phase IIR Filters Using the Rational Arnoldi Method with Adaptive Orders

    Herng-Jer LEE  Chia-Chi CHU  Wu-Shiung FENG  

     
    PAPER-Filter Design

      Vol:
    E87-A No:8
      Page(s):
    2018-2028

    A new indirect approach for designing low-order linear-phase IIR filters is presented in this paper. Given an FIR filter, we utilize a new Krylov subspace projection method, called the rational Arnoldi method with adaptive orders, to synthesize an approximated IIR filter with small orders. The synthesized IIR filter can truly reflect essential dynamical features of the original FIR filter and indeed satisfies the design specifications. Also, from simulation results, it can be observed that the linear-phase property in the passband is stilled retained. This indirect approach is accomplished using the state-space realization of FIR filters, multi-point Pade approximations, the Arnoldi algorithm, and an intelligent scheme to select expansion points in the frequency domain. Such methods are quite efficient in terms of computational complexity. Fundamental developments of the proposed method will be discussed in details. Numerical results will demonstrate the accuracy and the efficiency of this two-step indirect method.

  • Automatic Generation of Compact Electro-Thermal Models for Semiconductor Devices

    Tamara BECHTOLD  Evgenii B. RUDNYI  Jan G. KORVINK  

     
    PAPER

      Vol:
    E86-C No:3
      Page(s):
    459-465

    A high power dissipation density in today's miniature electronic/mechanical systems makes on-chip thermal management very important. In order to achieve quick to evaluate, yet accurate electro-thermal models, needed for the thermal management of microsystems, a model order reduction is necessary. In this paper, we present an automatic, Krylov-subspace-based order reduction of a electro-thermal model, which we illustrate by a novel type of micropropulsion device. Numerical simulation results of the full finite element model and the reduced order model, that describes the transient electro-thermal behavior, are presented. A comparison between Krylov-subspace-based order reduction, order reduction using control theoretical approaches and commercially available reduced order modeling has been performed. A Single-Input-Single-Output setup for the Arnoldi reduction algorithm was proved to be sufficient to accurately represent the complete time-dependent temperature distribution of the device.