• DocumentCode
    1537105
  • Title

    Multiplicative complexity of discrete cosine and sine transform

  • Author

    Ma, Wann-Jiun

  • Author_Institution
    Dept. of Radio Eng., South China Univ. of Technol., Guangzhou, China
  • Volume
    27
  • Issue
    11
  • fYear
    1991
  • fDate
    5/23/1991 12:00:00 AM
  • Firstpage
    962
  • Lastpage
    964
  • Abstract
    By use of the closure operation for an odd integer set, the minimal number of real multiplications needed to compute length-2m four-type discrete cosine and sine transforms over the field Q of rational numbers has been demonstrated.
  • Keywords
    computational complexity; matrix algebra; signal processing; transforms; DCT; DST; closure operation; discrete cosine transform; discrete sine transform; multiplicative complexity; odd integer set; real multiplications;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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