Optimal warping function design for discrete time-warped Fourier transforms

Robert M. Nickel; William J. Williams

doi:10.1117/12.406529

13 November 2000 Optimal warping function design for discrete time-warped Fourier transforms

Proceedings Volume 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X; (2000) https://doi.org/10.1117/12.406529
Event: International Symposium on Optical Science and Technology, 2000, San Diego, CA, United States

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.

Citation Download Citation

Robert M. Nickel and William J. Williams "Optimal warping function design for discrete time-warped Fourier transforms", Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); https://doi.org/10.1117/12.406529

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Fourier transforms

Transform theory

Signal processing

Numerical analysis

Solids

Optimization (mathematics)

Signal generators

Show All Keywords

Keywords/Phrases

Search In:

Publication Years