Date of Award

Spring 5-15-2015

Author's School

Graduate School of Arts and Sciences

Author's Department

Mathematics

Degree Name

Doctor of Philosophy (PhD)

Degree Type

Dissertation

Abstract

Our goal is exploring and better understanding factorizations of polyphase matrices for finite impulse response (FIR) filters. In particular, we focus on nearest neighbor factorizations discussed by Wickerhauser and Zhu that allow for efficient implementation of the discrete wavelet transform (DWT) for the algorithms of Daubechies and Sweldens and Mallat. Nearest neighbor lifting is a specific form of the general lifting scheme that improves the lifting algorithm by optimizing the number of efficient memory accesses. Nearest neighbor lifting factorizations are typically generated by implementing the Euclidean algorithm for Laurent polynomials, which introduces multiple choices of factorizations of a polyphase matrix associated with a filter, and are the main focus of this work.

Language

English (en)

Chair and Committee

Victor Wickerhauser

Committee Members

Victor Wickerhauser, Guido Weiss, Edward Willson, Robert Pless, Peter Luthy

Comments

Permanent URL: https://doi.org/10.7936/K7ZG6QD3

Download

Included in

Mathematics Commons

Share

COinS