• DocumentCode
    1388220
  • Title

    Pruning the fast discrete cosine transform

  • Author

    Wang, Zhongde

  • Author_Institution
    Dept. of Electr. Telecommun., Bejiing Univ. of Posts & Telecommun., China
  • Volume
    39
  • Issue
    5
  • fYear
    1991
  • fDate
    5/1/1991 12:00:00 AM
  • Firstpage
    640
  • Lastpage
    643
  • Abstract
    The matrix representation of the simple structured algorithm for the discrete cosine transform (DCT), which was first introduced by Y. Morikawa et al. (1985) based on the successive order reduction of the Tchebycheff polynomial, and retrieved by a simpler approach by Z. Wang (1988), is reviewed. A fast pruning algorithm for the DCT is then developed
  • Keywords
    transforms; DCT; Tchebycheff polynomial; fast discrete cosine transform; fast pruning algorithm; matrix representation; structured algorithm; successive order reduction; Communications Society; Computer applications; Discrete cosine transforms; Helium; Image coding; Polynomials; Quantization; Roundoff errors; Signal processing algorithms; Telecommunication computing;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.87153
  • Filename
    87153
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1388220