• DocumentCode
    2647640
  • Title

    Practical tuning of an OTA-C bandpass biquad via recurrent geometric programming

  • Author

    Chaisricharoen, Roungsan ; Chipipop, Boonruk

  • Author_Institution
    Sch. of Inf. Technol., Mae Fah Luang Univ., Chiang Rai, Thailand
  • fYear
    2009
  • fDate
    20-23 Oct. 2009
  • Firstpage
    1193
  • Lastpage
    1196
  • Abstract
    The geometric programming which can be globally solved special cases of nonlinear problems is operated recurrently with calibrated object and constraints that are based only on ideal behaviors to overcome the unmodeled nonidealities or nuisance factors of a practical current-mode OTA-C bandpass biquad, and successfully tune its responses. By the end of each GP-based optimization, error related to desired goal is computed by measuring practical responses obtained through HSPICE simulations. If the calculated error is significant, next optimization is introduced with calibrated goal based on computed error. A second-order bandpass requirement is successfully tuned within a few iterations. Based on the fact that the HSPICE simulation is the most time-consuming process, this method is very efficient as others heuristic and evolutionary algorithms fundamentally need at least several tens responses measuring.
  • Keywords
    band-pass filters; biquadratic filters; genetic algorithms; geometric programming; operational amplifiers; GP-based optimization; HSPICE simulations; OTA-C bandpass biquad tuning; evolutionary algorithms; heuristic algorithms; operational amplifiers; recurrent geometric programming; second-order bandpass requirement; CMOS process; Circuit simulation; Computational modeling; Cooling; Genetic programming; Mathematical model; Resistors; Solid modeling; Transconductance; Transfer functions; OTA-C; biquad; geometric programming;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    ASIC, 2009. ASICON '09. IEEE 8th International Conference on
  • Conference_Location
    Changsha, Hunan
  • Print_ISBN
    978-1-4244-3868-6
  • Electronic_ISBN
    978-1-4244-3870-9
  • Type

    conf

  • DOI
    10.1109/ASICON.2009.5351182
  • Filename
    5351182