FFT-based computation of shift invariant analytic wavelet transform

H. Olkkonen, Juuso Olkkonen, P. Pesola

    Research output: Contribution to journalArticleScientificpeer-review

    4 Citations (Scopus)

    Abstract

    This letter introduces an analytic wavelet transform based on linear phase quadrature mirror filters (QMFs).
    The computation of the analytic signal and the reconstruction of the signal is carried by the fast Fourier transform (FFT)-based algorithm. The transform yields energy preserving and shift invariant decimated analytic wavelet coefficients, which are free of aliasing effects.
    The present method can be implemented in the microprocessor and VLSI environment using a commercial FFT chip
    Original languageEnglish
    Pages (from-to)177-180
    JournalIEEE Signal Processing Letters
    Volume14
    Issue number3
    DOIs
    Publication statusPublished - 2007
    MoE publication typeA1 Journal article-refereed

    Keywords

    • fast Fourier transform
    • linear phase filters
    • quadrature mirror filters
    • signal reconstruction
    • wavelet transforms
    • FFT-based computation
    • QMF
    • VLSI
    • decimated analytic wavelet
    • linear phase quadrature mirror filter
    • microprocessor
    • shift invariant
    • wavelet transform

    Fingerprint

    Dive into the research topics of 'FFT-based computation of shift invariant analytic wavelet transform'. Together they form a unique fingerprint.

    Cite this