• DocumentCode
    856597
  • Title

    Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

  • Author

    Ma, Wann-Jiun ; Yang, Dong

  • Author_Institution
    South China Inst. of Technol., Guangzhou
  • Volume
    24
  • Issue
    9
  • fYear
    1988
  • fDate
    4/28/1988 12:00:00 AM
  • Firstpage
    559
  • Lastpage
    561
  • Abstract
    Shows that the two-dimensional discrete Fourier transform DFT (2 n; 2) can be transformed into a series of distinct second versions of the discrete cosine transform DCT. As a result of the minimal number of real multiplications over the field Q to compute the length 2n second version DCT, the authors derive the minimum number of real multiplications over the field Q necessary to compute a two-dimensional discrete Fourier transform for 2 n×2n real input data
  • Keywords
    fast Fourier transforms; Multiplicative complexity; discrete cosine transform; minimal number; real multiplications; two-dimensional discrete Fourier transform;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • Filename
    19569
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=856597