• DocumentCode
    1694389
  • Title

    On arithmetic cosine transform algorithm

  • Author

    Qian Huisheng ; Li Ping ; Zhou Feng

  • Author_Institution
    Hangzhou Inst. of Electr. Eng., Zhejiang Univ. of Technol.
  • Volume
    1
  • fYear
    1996
  • Firstpage
    143
  • Abstract
    A new Fourier technique for digital signal processing by use of the number-theoretic method of the Mobius inversion of series called the arithmetic Fourier transform (AFT) was developed previously. This approach only needs O(N) multiplications and is quite suitable for VLSI implementation. It is noted that the computation of the discret cosine transform (DCT) by using this approach called the arithmetic cosine transform (ACT) is quite simple. The number of multiplications needed is N, and the architecture of the computation is rather simple. Finally, a computer simulation is given
  • Keywords
    VLSI; digital arithmetic; discrete cosine transforms; inverse problems; number theory; signal processing; Fourier technique; Mobius inversion; VLSI implementation; arithmetic Fourier transform; arithmetic cosine transform algorithm; digital signal processing; multiplications; number theoretic method; series; Algorithm design and analysis; Arithmetic; Computer architecture; Discrete cosine transforms; Fourier transforms; Frequency; Signal analysis; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing, 1996., 3rd International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    0-7803-2912-0
  • Type

    conf

  • DOI
    10.1109/ICSIGP.1996.567066
  • Filename
    567066