Issues in nonuniform filter banks
Soura Dasgupta, Ashish Pandharipande
Abstract
Soura Dasgupta, Ashish Pandharipande
Abstract
This paper concerns biorthogonal filter banks. It is shown that a tree structured filter bank is biorthogonal if it is equivalent to a tree structured filter bank whose matching constituent levels on the analysis and synthesis sides are themselves biorthogonal pairs. We then show that a stronger statement can be made about dyadic Filter Banks in general: That a dyadic filter bank is biorthogonal if both the analysis and synthesis banks can be decomposed into dyadic trees. We further show that these decompositions are stability preserving. These results thus generalize earlier comparable results for orthogonal filter banks.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper concerns biorthogonal filter banks. It is shown that a tree structured filter bank is biorthogonal if it is equivalent to a tree structured filter bank whose matching constituent levels on the analysis and synthesis sides are themselves biorthogonal pairs. We then show that a stronger statement can be made about dyadic Filter Banks in general: That a dyadic filter bank is biorthogonal if both the analysis and synthesis banks can be decomposed into dyadic trees. We further show that these decompositions are stability preserving. These results thus generalize earlier comparable results for orthogonal filter banks.
Key concepts: Biorthogonal system, Filter bank, Filter (signal processing), Mathematics, Filter design, Tree (set theory), Statement (logic), Computer science