{"title":"加权最小二乘FIR滤波器设计中矩阵反演的迭代方法","authors":"Weiping Zhu, M. Omair Ahmad, M.N.S. Szamy","doi":"10.1109/ADFSP.1998.685691","DOIUrl":null,"url":null,"abstract":"It has been shown by some researchers that in a problem of weighted least-square (WLS) design of an FIR filter, most of the design computation pertains to the evaluation of the inverse of a matrix in order to solve a system of equations. A new iterative procedure is developed for the inversion of the matrices involved in the design. By expanding the inverse of a matrix as a convergent series, an updating formula for evaluating the inverse for each iteration is obtained, so that the proposed algorithm requires an inverse for only a few initial iterations but does not need any numerical operations for matrix inversion in succeeding iterations. It is also shown that the proposed iterative procedure is applicable for a wide range of weighting functions used for least-square designs.","PeriodicalId":424855,"journal":{"name":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An iterative procedure for matrix inversion in weighted least-square design of FIR filters\",\"authors\":\"Weiping Zhu, M. Omair Ahmad, M.N.S. Szamy\",\"doi\":\"10.1109/ADFSP.1998.685691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It has been shown by some researchers that in a problem of weighted least-square (WLS) design of an FIR filter, most of the design computation pertains to the evaluation of the inverse of a matrix in order to solve a system of equations. A new iterative procedure is developed for the inversion of the matrices involved in the design. By expanding the inverse of a matrix as a convergent series, an updating formula for evaluating the inverse for each iteration is obtained, so that the proposed algorithm requires an inverse for only a few initial iterations but does not need any numerical operations for matrix inversion in succeeding iterations. It is also shown that the proposed iterative procedure is applicable for a wide range of weighting functions used for least-square designs.\",\"PeriodicalId\":424855,\"journal\":{\"name\":\"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADFSP.1998.685691\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing. Symposium Proceedings (Cat. No.98EX185)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADFSP.1998.685691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An iterative procedure for matrix inversion in weighted least-square design of FIR filters
It has been shown by some researchers that in a problem of weighted least-square (WLS) design of an FIR filter, most of the design computation pertains to the evaluation of the inverse of a matrix in order to solve a system of equations. A new iterative procedure is developed for the inversion of the matrices involved in the design. By expanding the inverse of a matrix as a convergent series, an updating formula for evaluating the inverse for each iteration is obtained, so that the proposed algorithm requires an inverse for only a few initial iterations but does not need any numerical operations for matrix inversion in succeeding iterations. It is also shown that the proposed iterative procedure is applicable for a wide range of weighting functions used for least-square designs.