Huang, J.-M.J.-M.HuangLeou, J.-L.J.-L.LeouSHYH-KANG JENGTarng, J.-H.J.-H.Tarng2020-06-112020-06-11200013502417https://scholars.lib.ntu.edu.tw/handle/123456789/499905https://www.scopus.com/inward/record.uri?eid=2-s2.0-0034246148&doi=10.1049%2fip-map%3a20000361&partnerID=40&md5=c9f4a7a6f12f3a1ea288d710b03a69e7An effective quadrature mirror filter (QMF) proposed by Vaidyanathan has been used to solve 2D scattering problems. QMF has been popular for some time in digital signal processing, under the names of multirate sampling, wavelets, etc. In this work, the impulse response coefficients of QMF were used to construct the wavelet transform matrix. Using the matrix to transform the impedance matrices of 2D scatterers produces highly sparse moment matrices that can be solved efficiently. Such a presentation provides better sparsity than the celebrated and widely used Daubechies wavelets. These QMF coefficients are dependent on the filter parameters such as transition bandwidth and filter length. It was found that the sharper the transition bandwidth, the greater the reduction in nonzero elements of the impedance matrix. It also can be applied in the wavelet packet algorithm to further sparsify the impedance matrix. Numerical examples are given to demonstrate the effectiveness and validity of our finding.Algorithms; Data compression; Digital signal processing; Light scattering; Matrix algebra; Mirrors; Wavelet transforms; Quadrature mirror filters (QMF); Transition bandwidth; Wavelet packet algorithms; Optical filtersjournal article10.1049/ip-map:200003612-s2.0-0034246148