Design and implementation of wavelet packet-based filter bank trees for multiple access communications

Author

Sablatash, Mike ; Cooklev, Todor ; Lodge, John

Author_Institution

Commun. Res. Centre, Ottawa, Ont., Canada

Volume

1

fYear

1997

fDate

8-12 Jun 1997

Firstpage

176

Abstract

The relationship of filter bank trees to wavelet packet trees for subspaces, decimation operators, and coordinates of the projections of a function onto the subspaces is briefly explained. Two designs for the filter banks are summarized and the equations for the designs are provided. For one of these the prototype filters are all the same, and for the other they are the same at each level of the tree. The best method for spectral factorization of high-order polynomials, needed for the filter designs, is selected. Lattice structures preserving perfect reconstruction with finite word lengths are used in computer simulations to study quantization effects

Keywords

band-pass filters; filtering theory; matrix decomposition; multi-access systems; polynomials; quantisation (signal); trees (mathematics); wavelet transforms; computer simulations; decimation operators; filter bank trees; filter designs; finite word lengths; function projections coordinates; high-order polynomials; implementation; lattice structures; multiple access communications; perfect reconstruction; prototype filters; quantization effects; spectral factorization; subspaces; wavelet packet trees; Equations; Filter bank; Frequency synthesizers; Lattices; Mirrors; OFDM; Prototypes; Quantization; Wavelet analysis; Wavelet packets;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on

Conference_Location

Montreal, Que.

Print_ISBN

0-7803-3925-8

Type

conf

DOI

10.1109/ICC.1997.605191

Filename

605191