• DocumentCode
    1521640
  • Title

    Prime factor algorithm for multidimensional discrete cosine transform

  • Author

    Bi, Guoan ; Zeng, Yonghong ; Chen, Yan Qiu

  • Author_Institution
    Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
  • Volume
    49
  • Issue
    9
  • fYear
    2001
  • fDate
    9/1/2001 12:00:00 AM
  • Firstpage
    2156
  • Lastpage
    2161
  • Abstract
    A prime factor fast algorithm is proposed for the computation of the multidimensional forward and inverse discrete cosine transform (DCT). By using an example of a two-dimensional (2-D) DCT, it shows that an r-dimensional DCT can be obtained from a 2r dimensional DCT with a post-processing stage, efficient method for input/output mapping is reported to substantially reduce the computational overhead associated with the prime factor algorithm
  • Keywords
    computational complexity; discrete cosine transforms; signal processing; 2D DCT; DSP; computational complexity; computational overhead reduction; digital signal processing; image processing; input/output mapping; multidimensional discrete cosine transform; multidimensional forward DCT; multidimensional inverse DCT; post-processing stage; prime factor fast algorithm; Arithmetic; Bismuth; Computational complexity; Digital signal processing; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Multidimensional systems; Signal processing algorithms; Two dimensional displays;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.942642
  • Filename
    942642