• DocumentCode
    1537117
  • Title

    Multiplicative complexity of length-2m two-dimensional discrete cosine transform

  • Author

    Ma, W.

  • Author_Institution
    Dept. of Radio Eng., South China Univ., Guangzhou, China
  • Volume
    27
  • Issue
    11
  • fYear
    1991
  • fDate
    5/23/1991 12:00:00 AM
  • Firstpage
    966
  • Lastpage
    968
  • Abstract
    The minimal number of real multiplications necessary to compute a length-2m two-dimensional discrete cosine transform is determined. The method of derivation shows that the polynomial transform computation and the Chebyshev transform computation of a 2D DCT have the same multiplicative complexity.
  • Keywords
    Chebyshev approximation; computational complexity; polynomials; signal processing; transforms; 2D DCT; Chebyshev transform computation; multiplicative complexity; polynomial transform computation; real multiplications; two-dimensional discrete cosine transform;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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