J. Bae, J. Chun, Taekshik Jeong, Beobmo Gu, Sang Tae Kim
{"title":"利用循环矩阵分解法设计FIR/IIR晶格滤波器","authors":"J. Bae, J. Chun, Taekshik Jeong, Beobmo Gu, Sang Tae Kim","doi":"10.1109/OCEANS.2001.968752","DOIUrl":null,"url":null,"abstract":"We propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur's (1917) algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization. Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. The Schur algorithm is a method for fast Cholesky factorization of the Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the IIR filter are included, and the performance of our method is checked by comparison with other methods (polynomial root finding and cepstral deconvolution).","PeriodicalId":326183,"journal":{"name":"MTS/IEEE Oceans 2001. An Ocean Odyssey. Conference Proceedings (IEEE Cat. No.01CH37295)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design of FIR/IIR lattice filters using the circulant matrix factorization\",\"authors\":\"J. Bae, J. Chun, Taekshik Jeong, Beobmo Gu, Sang Tae Kim\",\"doi\":\"10.1109/OCEANS.2001.968752\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur's (1917) algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization. Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. The Schur algorithm is a method for fast Cholesky factorization of the Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the IIR filter are included, and the performance of our method is checked by comparison with other methods (polynomial root finding and cepstral deconvolution).\",\"PeriodicalId\":326183,\"journal\":{\"name\":\"MTS/IEEE Oceans 2001. An Ocean Odyssey. Conference Proceedings (IEEE Cat. No.01CH37295)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MTS/IEEE Oceans 2001. An Ocean Odyssey. Conference Proceedings (IEEE Cat. No.01CH37295)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OCEANS.2001.968752\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MTS/IEEE Oceans 2001. An Ocean Odyssey. Conference Proceedings (IEEE Cat. No.01CH37295)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OCEANS.2001.968752","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of FIR/IIR lattice filters using the circulant matrix factorization
We propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur's (1917) algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization. Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. The Schur algorithm is a method for fast Cholesky factorization of the Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the IIR filter are included, and the performance of our method is checked by comparison with other methods (polynomial root finding and cepstral deconvolution).