{"title":"QMF库的设计与非线性优化","authors":"G. Gu, Jian Huang","doi":"10.1109/SSST.1996.493477","DOIUrl":null,"url":null,"abstract":"This paper considers the design of quadrature mirror filter (QMF) banks whose analysis and synthesis filters have linear phase and are of FIR. An iterative algorithm for minimizing the reconstruction error of QMF banks as well as the stopband error of the prototype filter has been developed in the literature. the authors' results provide new derivations for an explicit expression of the error function to be minimized and the necessary condition for minimality. These results offer new insight to the design of QMF banks and relates it to a more general nonlinear optimization problem. Moreover a new iterative algorithm is proposed that generalizes the one from Chen and Lee (1992). It is shown that this new algorithm is a descending one and is essentially a modified Newton's algorithm. Thus the iterative algorithm not only converges, but also admits a fast convergent rate.","PeriodicalId":135973,"journal":{"name":"Proceedings of 28th Southeastern Symposium on System Theory","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Design of QMF banks and nonlinear optimization\",\"authors\":\"G. Gu, Jian Huang\",\"doi\":\"10.1109/SSST.1996.493477\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the design of quadrature mirror filter (QMF) banks whose analysis and synthesis filters have linear phase and are of FIR. An iterative algorithm for minimizing the reconstruction error of QMF banks as well as the stopband error of the prototype filter has been developed in the literature. the authors' results provide new derivations for an explicit expression of the error function to be minimized and the necessary condition for minimality. These results offer new insight to the design of QMF banks and relates it to a more general nonlinear optimization problem. Moreover a new iterative algorithm is proposed that generalizes the one from Chen and Lee (1992). It is shown that this new algorithm is a descending one and is essentially a modified Newton's algorithm. Thus the iterative algorithm not only converges, but also admits a fast convergent rate.\",\"PeriodicalId\":135973,\"journal\":{\"name\":\"Proceedings of 28th Southeastern Symposium on System Theory\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 28th Southeastern Symposium on System Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.1996.493477\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 28th Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1996.493477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper considers the design of quadrature mirror filter (QMF) banks whose analysis and synthesis filters have linear phase and are of FIR. An iterative algorithm for minimizing the reconstruction error of QMF banks as well as the stopband error of the prototype filter has been developed in the literature. the authors' results provide new derivations for an explicit expression of the error function to be minimized and the necessary condition for minimality. These results offer new insight to the design of QMF banks and relates it to a more general nonlinear optimization problem. Moreover a new iterative algorithm is proposed that generalizes the one from Chen and Lee (1992). It is shown that this new algorithm is a descending one and is essentially a modified Newton's algorithm. Thus the iterative algorithm not only converges, but also admits a fast convergent rate.