Frequency-shift-invariant orthonormal wavelet packet representations

Brian S. Krongold, Kannan Ramchandran, Douglas L. Jones

Research output: Contribution to journalArticlepeer-review

Abstract

It is commonly known that the dyadic structure of wavelet expansions results in both time- and frequency-translation sensitivity of an input signal. We develop the first efficient method to reduce frequency-alignment sensitivity by introducing a wavelet packet decomposition that is invariant to frequency shifts of a signal. A frequency-shifted wavelet packet library is presented, and an efficient best-basis algorithm is developed to determine the best signal representation among all frequency shifts of a signal. The algorithm computes all frequency-shifted coefficients in O(N2) operations, followed by an efficient depth-first tree search of the same complexity.

Original languageEnglish (US)
Pages (from-to)2579-2582
Number of pages4
JournalIEEE Transactions on Signal Processing
Volume47
Issue number9
DOIs
StatePublished - 1999

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Frequency-shift-invariant orthonormal wavelet packet representations'. Together they form a unique fingerprint.

Cite this