Share Email Print

Proceedings Paper

Optimal warping function design for discrete time-warped Fourier transforms
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We have recently introduced the class of generalized scale transforms and its subclass of warped Fourier transforms. Members in each class are defined by continuous time warping functions. While the two transforms admit a mathematically elegant analysis of warp-shift invariant systems it is still unclear how to design warping functions that deliver optimal representations for a given class of signals or systems. In many cases we can obtain an optimal choice for the warping function via a closed form analysis of the system that generates the signal of interest. In cases in which a closed form analysis is not possible we have to rely on a warp function estimation method. The approach we are taking in this paper is founded in information theory. We consider the observed signal as a random process. A power estimate of the warped Fourier transform parameterized by an underlying warping function is obtained from a finite number of realizations. We treat the power estimate as a probability density in warp-frequency and minimize its differential entropy over the space of admissible warping functions. We use an iterative numerical method for the minimization process. A proper formulation of a discrete time warped Fourier transform is employed as a foundation for the numerical analysis. Applications of the proposed algorithm can be found in detection, system identification, and data-compression.

Paper Details

Date Published: 13 November 2000
PDF: 9 pages
Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); doi: 10.1117/12.406529
Show Author Affiliations
Robert M. Nickel, Univ. of Michigan (United States)
William J. Williams, Univ. of Michigan (United States)

Published in SPIE Proceedings Vol. 4116:
Advanced Signal Processing Algorithms, Architectures, and Implementations X
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top