• DocumentCode
    3240750
  • Title

    An AT2 lower bound for wavelet transforms in VLSI

  • Author

    Vishwanath, Mohan ; Owens, Robert M.

  • Author_Institution
    Dept. of Comput. Sci., Pennylvania State Univ., University Park, PA, USA
  • Volume
    5
  • fYear
    1992
  • fDate
    23-26 Mar 1992
  • Firstpage
    649
  • Abstract
    The lower bounds on the area and time complexity of computing the wavelet transforms in VLSI are derived. The discrete wavelet transform (DWT) is shown to have a lower bound that matches the lower bound for the DFT, while it is seen that the discrete short time Fourier transform (DSTFT) is, in general, more difficult to compute. It is shown that for the DWT, AT2=Ω(N2 log2(N)) and for the DSTFT, AT2=Ω(N2M2 log2(Nw+N))
  • Keywords
    VLSI; fast Fourier transforms; signal processing; wavelet transforms; DSTFT; DWT; VLSI; area complexity; discrete short time Fourier transform; discrete wavelet transform; lower bounds; time complexity; wavelet transforms; Circuits; Computational modeling; Computer science; Discrete Fourier transforms; Discrete wavelet transforms; Fourier transforms; Frequency; Very large scale integration; Wavelet transforms; Wire;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on
  • Conference_Location
    San Francisco, CA
  • ISSN
    1520-6149
  • Print_ISBN
    0-7803-0532-9
  • Type

    conf

  • DOI
    10.1109/ICASSP.1992.226512
  • Filename
    226512
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3240750