Euclidean Algorithm for Laurent Polynomial Matrix Extension |A note on dual-chain approach to construction of wavelet lters
Jianzhong Wang · 2015
In this paper, we develop a novel and eective Euclidean algorithm for Laurent polynomial matrix extension (LPME), which is the key of the construction of perfect reconstruction lter banks (PRFBs). The algorithm simplies the dual-chain approach to the construction of PRFBs in the paper [5]. The algorithm in this paper can also be used in the applications where LPME plays a role.