Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/81406
DC FieldValue
dc.titleEfficient algorithm to design perfect reconstruction regular quadrature mirror filters using weighted Lp error criteria
dc.contributor.authorGoh, Chee-Kiang
dc.contributor.authorLim, Yong-Ching
dc.date.accessioned2014-10-07T03:07:58Z
dc.date.available2014-10-07T03:07:58Z
dc.date.issued1998
dc.identifier.citationGoh, Chee-Kiang,Lim, Yong-Ching (1998). Efficient algorithm to design perfect reconstruction regular quadrature mirror filters using weighted Lp error criteria. Proceedings - IEEE International Symposium on Circuits and Systems 5 : V-158. ScholarBank@NUS Repository.
dc.identifier.issn02714310
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/81406
dc.description.abstractAn efficient iterative algorithm is presented in this paper to design lattice-type perfect reconstruction regular quadrature mirror filters (PR-QMF) by minimizing the pth power of an appropriate error criteria, where p can be a function of ω. The filter bank design is approximated as an unconstrained weighted least squares problem with respect to the lattice coefficients. Typically, only a few iterations of our algorithm is needed to obtain an optimal solution in the weighted Lp sense. An estimation of the number of canonic signed digit(CSD) terms needed to quantize the lattice coefficients yielding minimal degradation of the filter's stopband attenuation is also derived. Efficient multiplierless implementation of lattice-type regular PR-QMF banks are easily obtained using this result.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleProceedings - IEEE International Symposium on Circuits and Systems
dc.description.volume5
dc.description.pageV-158
dc.description.codenPICSD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.