• DocumentCode
    1446575
  • Title

    Fast algorithm for over-complete wavelets

  • Author

    Law, N.F. ; Siu, W.C.

  • Author_Institution
    Dept. of Electron. & Inf. Eng., Hong Kong Polytech. Univ., Hung Hom, China
  • Volume
    37
  • Issue
    4
  • fYear
    2001
  • fDate
    2/15/2001 12:00:00 AM
  • Firstpage
    259
  • Lastpage
    261
  • 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
  • Keywords
    computational complexity; redundancy; signal representation; signal sampling; wavelet transforms; bandpass output; computational complexity; forward transform; inverse transform; lowpass output; over-complete wavelets; redundancy;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20010183
  • Filename
    907557
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1446575