The search functionality is under construction.

Keyword Search Result

[Keyword] simplex method(6hit)

1-6hit
  • Activation-Aware Slack Assignment Based Mode-Wise Voltage Scaling for Energy Minimization

    TaiYu CHENG  Yutaka MASUDA  Jun NAGAYAMA  Yoichi MOMIYAMA  Jun CHEN  Masanori HASHIMOTO  

     
    PAPER

      Pubricized:
    2021/08/31
      Vol:
    E105-A No:3
      Page(s):
    497-508

    Reducing power consumption is a crucial factor making industrial designs, such as mobile SoCs, competitive. Voltage scaling (VS) is the classical yet most effective technique that contributes to quadratic power reduction. A recent design technique called activation-aware slack assignment (ASA) enhances the voltage-scaling by allocating the timing margin of critical paths with a stochastic mean-time-to-failure (MTTF) analysis. Meanwhile, such stochastic treatment of timing errors is accepted in limited application domains, such as image processing. This paper proposes a design optimization methodology that achieves a mode-wise voltage-scalable (MWVS) design guaranteeing no timing errors in each mode operation. This work formulates the MWVS design as an optimization problem that minimizes the overall power consumption considering each mode duration, achievable voltage lowering and accompanied circuit overhead explicitly, and explores the solution space with the downhill simplex algorithm that does not require numerical derivation and frequent objective function evaluations. For obtaining a solution, i.e., a design, in the optimization process, we exploit the multi-corner multi-mode design flow in a commercial tool for performing mode-wise ASA with sets of false paths dedicated to individual modes. We applied the proposed design methodology to RISC-V design. Experimental results show that the proposed methodology saves 13% to 20% more power compared to the conventional VS approach and attains 8% to 15% gain from the conventional single-mode ASA. We also found that cycle-by-cycle fine-grained false path identification reduced leakage power by 31% to 42%.

  • Digital Multiple Notch Filter Design with Nelder-Mead Simplex Method

    Qiusheng WANG  Xiaolan GU  Yingyi LIU  Haiwen YUAN  

     
    PAPER-Digital Signal Processing

      Vol:
    E100-A No:1
      Page(s):
    259-265

    Multiple notch filters are used to suppress narrow-band or sinusoidal interferences in digital signals. In this paper, we propose a novel optimization design technique of an infinite impulse response (IIR) multiple notch filter. It is based on the Nelder-Mead simplex method. Firstly, the system function of the desired notch filter is constructed to form the objective function of the optimization technique. Secondly, the design parameters of the desired notch filter are optimized by Nelder-Mead simplex method. A weight function is also introduced to improve amplitude response of the notch filter. Thirdly, the convergence and amplitude response of the proposed technique are compared with other Nelder-Mead based design methods and the cascade-based design method. Finally, the practicability of the proposed notch filter design technique is demonstrated by some practical applications.

  • Numerical Design of Matching Structures for One-Dimensional Finite Superlattices

    Hirofumi SANADA  Megumi TAKEZAWA  Hiroki MATSUZAKI  

     
    BRIEF PAPER-Lasers, Quantum Electronics

      Vol:
    E96-C No:11
      Page(s):
    1440-1443

    This paper describes how to design matching structures to improve the frequency characteristics of one-dimensional finite periodic structures. In particular, it deals with one-dimensional finite superlattices. A downhill simplex method is used to determine some of the structural parameters of the matching structure. Numerical examples show that this method is effective in improving the frequency characteristics of finite superlattices.

  • Optimizing Markov Model Parameters for Asynchronous Impulsive Noise over Broadband Power Line Communication Network

    Tan-Hsu TAN  San-Yuan HUANG  Ching-Su CHANG  Yung-Fa HUANG  

     
    LETTER-Numerical Analysis and Optimization

      Vol:
    E91-A No:6
      Page(s):
    1533-1536

    A statistical model based on a partitioned Markov-chains model has previously been developed to represent time domain behavior of the asynchronous impulsive noise over a broadband power line communication (PLC) network. However, the estimation of its model parameters using the Simplex method can easily trap the final solution at a local optimum. This study proposes an estimation scheme based on the genetic algorithm (GA) to overcome this difficulty. Experimental results show that the proposed scheme yields estimates that more closely match the experimental data statistics.

  • Maximum Likelihood Estimation in a Mixture Regression Model Using the Continuation Method

    Hideo HIROSE  Yoshio KOMORI  

     
    PAPER-Numerical Analysis and Optimization

      Vol:
    E86-A No:5
      Page(s):
    1256-1265

    To an extremely difficult problem of finding the maximum likelihood estimates in a specific mixture regression model, a combination of several optimization techniques is found to be useful. These algorithms are the continuation method, Newton-Raphson method, and simplex method. The simplex method searches for an approximate solution in a wider range of the parameter space, then a combination of the continuation method and the Newton-Raphson method finds a more accurate solution. In this paper, this combination method is applied to find the maximum likelihood estimates in a Weibull-power-law type regression model.

  • Special-Purpose Hardware Architecture for Large Scale Linear Programming

    Shinhaeng LEE  Shin'ichiro OMACHI  Hirotomo ASO  

     
    PAPER-Computer Architecture

      Vol:
    E80-D No:9
      Page(s):
    893-898

    Linear programming techniques are useful in many diverse applications such as: production planning, energy distribution etc. To find an optimal solution of the linear programming problem, we have to repeat computations and it takes a lot of processing time. For high speed computation of linear programming, special purpose hardware has been sought. This paper proposes a systolic array for solving linear programming problems using the revised simplex method which is a typical algorithm of linear programming. This paper also proposes a modified systolic array that can solve linear programming problems whose sizes are very large.