• DocumentCode
    1528368
  • Title

    On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences

  • Author

    Murthy, N. Rama ; Swamy, M.N.S.

  • Author_Institution
    Fac. of Eng. & Comput. Sci., Concordia Univ., Montreal, Que., Canada
  • Volume
    37
  • Issue
    5
  • fYear
    1990
  • fDate
    5/1/1990 12:00:00 AM
  • Firstpage
    625
  • Lastpage
    627
  • Abstract
    An algorithm based on O2DFT (odd-time odd-frequency discrete Fourier transform) is presented for the computation of the EDCT-2 of purely real sequences. Comparison of this algorithm with two others available in the literature shows that it is computationally superior for EDCT-2 evaluation of real sequences (N>8). Its computational advantage is based on its lesser real multiplication requirements
  • Keywords
    fast Fourier transforms; series (mathematics); EDCT-2; O2DFT; computational advantage; even discrete cosine transform-2; odd-time odd-frequency discrete Fourier transform; real multiplication requirements; real sequences; Circuits and systems; Computer science; Councils; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Electrons; Interpolation; Multidimensional systems; Signal processing algorithms;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.55000
  • Filename
    55000
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1528368