By Topic

An efficient algorithm for FIR filter bank completion

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
$31 $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

3 Author(s)
Popeea, C. ; Dept. of Control & Comput., Bucharest Politechnica Univ., Romania ; Dumitrescu, B. ; Jora, B.

This paper presents an algorithm for designing an FIR paraunitary filter bank when one or several filters are given. The algorithm is based on the properties of the balanced state-space representation of the polyphase matrix. We show that this representation may be computed via a single RQ decomposition thus gaining significant efficiency with respect to previous work. Application of the algorithm to signal-adapted filter banks is also discussed

Published in:

Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on  (Volume:6 )

Date of Conference:

2001