• DocumentCode
    1133087
  • Title

    A Storage Efficient Way to Implement the Discrete Cosine Transform

  • Author

    Haralick, Robert M.

  • Author_Institution
    Remote Sensing Laboratory, University of Kansas
  • Issue
    7
  • fYear
    1976
  • fDate
    7/1/1976 12:00:00 AM
  • Firstpage
    764
  • Lastpage
    765
  • Abstract
    Ahmed has shown that a discrete cosine transform can be implemented by doing one double length fast Fourier transform (FFT). In this correspondence, we show that the amount of work can be cut to doing two single length FFT´s.
  • Keywords
    Data compression, fast Fourier transform (FFT), fast transform.; Computer languages; Discrete Fourier transforms; Discrete cosine transforms; Documentation; Fast Fourier transforms; Fourier transforms; Image coding; Karhunen-Loeve transforms; Markov processes; Production; Data compression, fast Fourier transform (FFT), fast transform.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1976.1674687
  • Filename
    1674687
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1133087