The search functionality is under construction.

Author Search Result

[Author] Akimitsu DOI(4hit)

1-4hit
  • Analysis and Minimization of l2-Sensitivity for Block-State Realization of IIR Digital Filters

    Akimitsu DOI  Takao HINAMOTO  Wu-Sheng LU  

     
    PAPER-Digital Signal Processing

      Vol:
    E101-A No:2
      Page(s):
    447-459

    Block-state realization of state-space digital filters offers reduced implementation complexity relative to canonical state-space filters while filter's internal structure remains accessible. In this paper, we present a quantitative analysis on l2 coefficient sensitivity of block-state digital filters. Based on this, we develop two techniques for minimizing average l2-sensitivity subject to l2-scaling constraints. One of the techniques is based on a Lagrange function and some matrix-theoretic techniques. The other solution method converts the problem at hand into an unconstrained optimization problem which is solved by using an efficient quasi-Newton algorithm where the key gradient evaluation is done in closed-form formulas for fast and accurate execution of quasi-Newton iterations. A case study is presented to demonstrate the validity and effectiveness of the proposed techniques.

  • Weighted Minimization of Roundoff Noise and Pole Sensitivity Subject to l2-Scaling Constraints for State-Space Digital Filters

    Yoichi HINAMOTO  Akimitsu DOI  

     
    PAPER-Digital Signal Processing

      Vol:
    E102-A No:11
      Page(s):
    1473-1480

    This paper deals with the problem of minimizing roundoff noise and pole sensitivity simultaneously subject to l2-scaling constraints for state-space digital filters. A novel measure for evaluating roundoff noise and pole sensitivity is proposed, and an efficient technique for minimizing this measure by jointly optimizing state-space realization and error feedback is explored, namely, the constrained optimization problem at hand is converted into an unconstrained problem and then the resultant problem is solved by employing a quasi-Newton algorithm. A numerical example is presented to demonstrate the validity and effectiveness of the proposed technique.

  • Analysis and Minimization of Roundoff Noise for Generalized Direct-Form II Realization of 2-D Separable-Denominator Filters

    Takao HINAMOTO  Akimitsu DOI  Wu-Sheng LU  

     
    PAPER-Digital Signal Processing

      Vol:
    E103-A No:7
      Page(s):
    873-884

    Based on the concept of polynomial operators, this paper explores generalized direct-form II structure and its state-space realization for two-dimensional separable-denominator digital filters of order (m, n) where a structure with 3(m+n)+mn+1 fixed parameters plus m+n free parameters is introduced and analyzed. An l2-scaling method utilizing different coupling coefficients at different branch nodes to avoid overflow is presented. Expressions of evaluating the roundoff noise for the filter structure as well as its state-space realization are derived and investigated. The availability of the m+n free parameters is shown to be beneficial as the roundoff noise measures can be minimized with respect to these free parameters by means of an exhaustive search over a set with finite number of candidate elements. The important role these parameters can play in the endeavors of roundoff noise reduction is demonstrated by numerical experiments.

  • Roundoff Noise Minimization for a Class of 2-D State-Space Digital Filters Using Joint Optimization of High-Order Error Feedback and Realization

    Akimitsu DOI  Takao HINAMOTO  Wu-Sheng LU  

     
    PAPER-Digital Signal Processing

      Vol:
    E97-A No:9
      Page(s):
    1918-1925

    For two-dimensional IIR digital filters described by the Fornasini-Marchesini second model, the problem of jointly optimizing high-order error feedback and realization to minimize the effects of roundoff noise at the filter output subject to l2-scaling constraints is investigated. The problem at hand is converted into an unconstrained optimization problem by using linear-algebraic techniques. The unconstrained optimization problem is then solved iteratively by applying an efficient quasi-Newton algorithm with closed-form formulas for key gradient evaluation. Finally, a numerical example is presented to illustrate the validity and effectiveness of the proposed technique.