• DocumentCode
    1545595
  • Title

    Fast M-band orthogonal wavelet transform algorithm when base length equals 2M

  • Author

    Kwon, Sang-keun ; Oh, Young-seok ; Seo, Dong Shin

  • Author_Institution
    Dept. of Commun. Eng., Kumoh Nat. Univ. of Technol., Kyungbuk, South Korea
  • Volume
    33
  • Issue
    6
  • fYear
    1997
  • fDate
    3/13/1997 12:00:00 AM
  • Firstpage
    470
  • Lastpage
    472
  • Abstract
    The fast implementation algorithm of M-band orthogonal wavelet filter bank (OWFB) with length L equal to 2M is proposed by using the lossless matrix factorisation method. The computational complexity of the proposed algorithm becomes lower than that of the direct filtering method (DFM):(M2+M+1) multiplications and M2+2M-1) additions against 2M2 and (2M2-M), respectively
  • Keywords
    computational complexity; matrix algebra; quadrature mirror filters; wavelet transforms; M-band orthogonal wavelet transform; base length; computational complexity; lossless matrix factorisation method; orthogonal wavelet filter bank;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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