• DocumentCode
    1080387
  • Title

    Relationship between two algorithms for discrete cosine transform

  • Author

    Wang, Zhen ; Jullien, G.A.

  • Author_Institution
    VLSI Res. Group, Windsor Univ., Ont., Canada
  • Volume
    27
  • Issue
    13
  • fYear
    1991
  • fDate
    6/20/1991 12:00:00 AM
  • Firstpage
    1114
  • Lastpage
    1115
  • Abstract
    Two contributions are made to the implementation of fast discrete cosine transform algorithms. The first uses Hadamard ordering to improve the regularity of the Lee fast cosine transform (FCT) algorithm for the discrete cosine transform (DCT). The second derives a close relationship between the Lee FCT and the recursive algorithm for the DCT.
  • Keywords
    signal processing; transforms; Hadamard ordering; Lee fast cosine transform; discrete cosine transform; fast DCT algorithms; recursive algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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