By Topic

Constraint Based Design of Two-Channel Paraunitary Filter Banks of a Given Length Over {\rm GF}(2^{r})

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Catriona M. Lucey ; Dept. of Electr. & Electron. Eng, Univ. Coll. Cork ; Colin C. Murphy

Over the real field all degree-J paraunitary (PU) multirate systems can be described by the multiplication of J degree-1 lattice blocks and a unitary matrix. Over the finite field GF(2r) this degree-1 factorization is not complete, i.e., it only describes a subset of all possible PU systems. In the two-channel case degree-2tau blocks are also required to completely describe all PU systems over GF(2 r). Therefore, different factorizations can be considered. Each factorization generates a subset of PU systems. It is interesting to consider if these different factorizations have distinct properties. In this correspondence, we specifically consider constraining the length of the filter bank to be equal to N+1. This is required in certain error control coding applications. We contrast this factorization based method with an existing trial and error approach employing the Berlekamp factoring algorithm. A key advantage of the proposed method is the elimination of redundant polyphase factorizations. Further simplifications over GF(2) identified by this method are also discussed

Published in:

IEEE Transactions on Signal Processing  (Volume:55 ,  Issue: 5 )