Fast algorithm for over-complete wavelets

Ngai Fong Law, W. C. Siu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)

Abstract

The computational complexity of the over-complete wavelet representation is studied. It is found that the inverse transform is nearly three times more costly in computation than the forward transform. By exploiting the redundancy between the lowpass and the bandpass outputs, the computation is greatly simplified, resulting in an efficient inverse.
Original languageEnglish
Pages (from-to)259-261
Number of pages3
JournalElectronics Letters
Volume37
Issue number4
DOIs
Publication statusPublished - 15 Feb 2001

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fast algorithm for over-complete wavelets'. Together they form a unique fingerprint.

Cite this