{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72008"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72008","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Perfect Reconstruction Filter Banks for Adaptive Filtering and Coding","abstract":"This thesis considers the design of perfect reconstruction filter banks (PRFBs) for adaptive filtering and coding applications. The first half of this thesis derives a generalization to the Transform Domain Adaptive Filter (TDAF), which uses filter banks instead of unitary transforms to preprocess input signals. The parametrization for a class of nonparaunitary PRFBs is derived and used to express the minimum mean square error (MMSE) of the Generalized Transform Domain Adaptive Filters, in terms of the filter bank chosen. Using this parametrization, it is shown how to analytically design filter banks to give optimum error and convergence performances given prior knowledge of the adaptive application. Design examples demonstrate the improved error performance of the derived structures relative to the Least Mean Square (LMS) algorithm when prior knowledge is incorporated.","abstract_html":"This thesis considers the design of perfect reconstruction filter banks (PRFBs) for adaptive filtering and coding applications. The first half of this thesis derives a generalization to the Transform Domain Adaptive Filter (TDAF), which uses filter banks instead of unitary transforms to preprocess input signals. The parametrization for a class of nonparaunitary PRFBs is derived and used to express the minimum mean square error (MMSE) of the Generalized Transform Domain Adaptive Filters, in terms of the filter bank chosen. Using this parametrization, it is shown how to analytically design filter banks to give optimum error and convergence performances given prior knowledge of the adaptive application. Design examples demonstrate the improved error performance of the derived structures relative to the Least Mean Square (LMS) algorithm when prior knowledge is incorporated.","abstract_has_math":false,"creators":["Usevitch, Bryan Edward"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Cybenko, G.,"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-16T22:23:15Z","date_published":"2014-12-16T22:23:15Z","updated_at":"2026-07-22T22:26:06Z","subjects":["Engineering, Electronics and Electrical"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9329188"],"render_values":[{"text":"(UMI)AAI9329188","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/72008","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Cybenko, G.,"]},{"key":"dc:creator","label":"Author","values":["Usevitch, Bryan Edward"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-16T22:23:15Z","10000-01-01","1993"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72008","(UMI)AAI9329188"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis considers the design of perfect reconstruction filter banks (PRFBs) for adaptive filtering and coding applications. The first half of this thesis derives a generalization to the Transform Domain Adaptive Filter (TDAF), which uses filter banks instead of unitary transforms to preprocess input signals. The parametrization for a class of nonparaunitary PRFBs is derived and used to express the minimum mean square error (MMSE) of the Generalized Transform Domain Adaptive Filters, in terms of the filter bank chosen. Using this parametrization, it is shown how to analytically design filter banks to give optimum error and convergence performances given prior knowledge of the adaptive application. Design examples demonstrate the improved error performance of the derived structures relative to the Least Mean Square (LMS) algorithm when prior knowledge is incorporated.","The second half of this thesis compares the energy compacting properties of unitary filters from transform coders and paraunitary filters from subband coders using a cost criterion which is proposed. Stationary processes for which paraunitary filters have better energy compaction than unitary filters are denoted as subband optimal, and all subband optimal processes are analytically characterized for the case of length-4 filters. It is shown analytically for length-4 filters and empirically for longer length filters that Markov-1 processes are subband optimal and that the Daubechies maximally smooth wavelet sequences achieve better energy compaction than the best unitary filters for Markov-1 inputs. A class of processes which is subband optimal for longer filter lengths is shown to have autocovariance matrices with a particular eigenstructure. Sample autocovariance matrices from images are shown to exhibit this structure and are also shown to be subband optimal.","Made available in DSpace on 2014-12-16T22:23:15Z (GMT). No. of bitstreams: 1 9329188.pdf: 4125019 bytes, checksum: c18329f47e635e1ad161e311ff4839d2 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72174 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","118 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."]},{"key":"dc:title","label":"Title","values":["Perfect Reconstruction Filter Banks for Adaptive Filtering and Coding"]}]}],"canonical_facts":{"dc:contributor":["Cybenko, G.,"],"dc:creator":["Usevitch, Bryan Edward"],"dc:date":["2014-12-16T22:23:15Z","10000-01-01","1993"],"dc:description":["This thesis considers the design of perfect reconstruction filter banks (PRFBs) for adaptive filtering and coding applications. The first half of this thesis derives a generalization to the Transform Domain Adaptive Filter (TDAF), which uses filter banks instead of unitary transforms to preprocess input signals. The parametrization for a class of nonparaunitary PRFBs is derived and used to express the minimum mean square error (MMSE) of the Generalized Transform Domain Adaptive Filters, in terms of the filter bank chosen. Using this parametrization, it is shown how to analytically design filter banks to give optimum error and convergence performances given prior knowledge of the adaptive application. Design examples demonstrate the improved error performance of the derived structures relative to the Least Mean Square (LMS) algorithm when prior knowledge is incorporated.","The second half of this thesis compares the energy compacting properties of unitary filters from transform coders and paraunitary filters from subband coders using a cost criterion which is proposed. Stationary processes for which paraunitary filters have better energy compaction than unitary filters are denoted as subband optimal, and all subband optimal processes are analytically characterized for the case of length-4 filters. It is shown analytically for length-4 filters and empirically for longer length filters that Markov-1 processes are subband optimal and that the Daubechies maximally smooth wavelet sequences achieve better energy compaction than the best unitary filters for Markov-1 inputs. A class of processes which is subband optimal for longer filter lengths is shown to have autocovariance matrices with a particular eigenstructure. Sample autocovariance matrices from images are shown to exhibit this structure and are also shown to be subband optimal.","Made available in DSpace on 2014-12-16T22:23:15Z (GMT). No. of bitstreams: 1 9329188.pdf: 4125019 bytes, checksum: c18329f47e635e1ad161e311ff4839d2 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72174 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","118 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."],"dc:identifier":["http://hdl.handle.net/2142/72008","(UMI)AAI9329188"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Perfect Reconstruction Filter Banks for Adaptive Filtering and Coding"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:06Z"}