{"title":"Minimized roundoff noise and pole sensitivity subject to L2-Scaling constraints for IIR filters","authors":"Y. Hinamoto, A. Doi","doi":"10.1109/EUSIPCO.2015.7362558","DOIUrl":null,"url":null,"abstract":"This paper investigates the minimization problem of weighted roundoff noise and pole sensitivity subject to l2-scaling constraints for state-space digital filters. A new measure for evaluating roundoff noise and pole sensitivity is proposed, and an efficient technique for minimizing this measure is developed. It is shown that the problem can be converted into an unconstrained optimization problem by using linear-algebraic techniques. The unconstrained optimization problem at hand is then solved iteratively by employing an efficient quasi-Newton algorithm with closed-form formulas for key gradient evaluation. Finally a numerical example is presented to demonstrate the validity and effectiveness of the proposed technique.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUSIPCO.2015.7362558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper investigates the minimization problem of weighted roundoff noise and pole sensitivity subject to l2-scaling constraints for state-space digital filters. A new measure for evaluating roundoff noise and pole sensitivity is proposed, and an efficient technique for minimizing this measure is developed. It is shown that the problem can be converted into an unconstrained optimization problem by using linear-algebraic techniques. The unconstrained optimization problem at hand is then solved iteratively by employing an efficient quasi-Newton algorithm with closed-form formulas for key gradient evaluation. Finally a numerical example is presented to demonstrate the validity and effectiveness of the proposed technique.