By Topic

A polynomial transform approach to transmultiplexing

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

1 Author(s)
H. Nussbaumer ; Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

In this paper, we introduce a new algorithm for the implementation of uniform digital bandpass filter banks. This technique first uses a conventional filter breakdown process to convert a set of fast bandpass filters into a set of slow bandpass filters of reduced length, plus an odd-time DFT. The slow bandpass filters are computed by DFTs, and it is shown that the combination of these DFTs with the odd-time DFT yields a simple algorithm using an inverse polynomial transform. with this method, almost all operations reduce to FFT-type calculations which can be implemented efficiently in signal processors. Moreover, the polynomial transform approach reduces significantly the computational complexity over conventional techniques. The polynomial implementation of digital filter banks may be used in a number of applications such as TDM-FDM transmultiplexers, speech compression systems and spectrum analyzers.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.  (Volume:7 )

Date of Conference:

May 1982