In this paper a new radix-3 fast algorithm for the length -3/sup m/ discrete cosine transform (DCT) is proposed, to further extend the applicability of the fast cosine transform (FCT) algorithm. First, the basic 3-point DCT is considered. Then, the formulae of the new radix-3 FCT algorithm are derived. Next, a block diagram of the radix-3 FCT algorithm is shown and the signal flowgraph for length-3/sup 2/ FCT is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires less number of arithmetic operations and allows in-place computation. The simple and regular structure makes it easy to be implemented. One can compute effectively the length-2/sup 1/.3/sup m/ DCT using this length-3/sup m/ algorithm together with the existing length-2/sup 1/ algorithm by prime factor decomposition. The proposed new radix-3 FCT algorithm is expected to find wide practical applications.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    New radix-3 fast algorithm for the discrete cosine transform


    Contributors:
    Yiquan Wu (author) / Zhaoda Zhu (author)


    Publication date :

    1993-01-01


    Size :

    212411 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Fast Algorithm of a Multidimensional Hypercomplex Discrete Fourier Transform with Radix-3 Decomposition

    Aliev, M. V. / Chicheva, M. A. | British Library Online Contents | 2005



    The Recursive Discrete Cosine Transform

    Hou, H. / AIAA | British Library Conference Proceedings | 1993