Classification of nonexpansive symmetric extension transforms for multirate filter banks

This paper describes and classifies a family of invertible discrete-time signal transforms, referred to as symmetric extension trans forms (SET's), for finite-length signals. SET's are algorithms for applying perfect reconstruction multirate filter banks to symmetric extensions of finite-length signals, thereby avoiding the boundary artifacts introduced by simple periodic extension. A key point is when such symmetric decompositions can be formed with no increase in data storage requirements (''nonexpansive decompositions''). Transforms based on three types of symmetric extension and four classes of linear phase filters are analyzed in terms of their memory requirements for general M-channel perfect reconstruction filter banks. The classification is shown to be complete in the sense that it contains all possible nonexpansive SET's. Completeness is then used to deduce design constraints on the construction of nonexpansive M-channel SET's, including new obstructions to the existence of certain classes of filter banks. This paper also forms the principal technical reference on the SET algorithms incorporated in the Federal Bureau of Investigation's digital fingerprint image coding standard.