Higher-order spectra computation using wavelet transform

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

It has been a desire of a design engineer to combine various tools of analysis and apply them on one problem at hand. In this paper, we propose an algorithm that combines two signal processing analysis tools: higher-order spectral analysis and wavelets. The computation of polyspectra using conventional approaches involves the use of FFT algorithm. It has been shown that discrete Fourier transform (DFT) can be implemented by a fast algorithm using wavelets. By using this algorithm, polyspectra computational complexity for a certain class of signals reduces to lesser number of computations. In actual implementation, the wavelets in use have to be carefully chosen to balance the benefit of pruning of insignificant data and the price of the transform. Clearly, the optimal choice depends on the class of the data we would encounter. In this paper, we, first, present an introduction of higher-order spectral analysis. Then we discuss wavelet-based fast implementation of DFT and its importance from higher-order spectral analysis viewpoint. Finally, we develop wavelet-based algorithm for computation of polyspectra followed by conclusions.

Original languageEnglish
Pages (from-to)124-132
Number of pages9
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume4044
Publication statusPublished - Jan 1 2000
Externally publishedYes
EventHybrid Image and Signal Processing VII - Orlando, FL, USA
Duration: Apr 25 2000Apr 25 2000

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Higher-order spectra computation using wavelet transform'. Together they form a unique fingerprint.

Cite this