Fast algorithm for the 3D DCT

Author

Alshibami, O. ; Boussakta, S.

Author_Institution

Sch. of Electron. & Electr. Eng., Leeds Univ., UK

Volume

3

fYear

2001

fDate

2001

Firstpage

1945

Abstract

The three-dimensional discrete cosine transform (3D DCT) has been used in many 3D applications such as video coding and compression. Many fast algorithms have been developed for the calculation of the 1D DCT. These algorithms are then used for the calculation of the 3D DCT using the row-column approach. However, 3D algorithms involve fewer arithmetic operations and can be faster. The 3D decimation-in-frequency vector-radix algorithm (3D DIF VR), for the 3D DCT-II, is developed and its arithmetic complexity analysed and compared to similar algorithms. In comparison with the familiar row-column approach, the 3D vector-radix reduces the number of multiplications significantly while keeping the number of additions the same and hence can be used for fast 3D image and video coding and compression

Keywords

computational complexity; data compression; digital arithmetic; discrete cosine transforms; video coding; 3D DCT; arithmetic complexity; decimation-in-frequency; fast algorithm; image coding; image compression; row-column approach; three-dimensional discrete cosine transform; vector-radix algorithm; video coding; video compression; Algorithm design and analysis; Arithmetic; Discrete cosine transforms; Discrete transforms; Frequency; Image coding; Information systems; Signal processing algorithms; Video coding; Virtual reality;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on

Conference_Location

Salt Lake City, UT

ISSN

1520-6149

Print_ISBN

0-7803-7041-4

Type

conf

DOI

10.1109/ICASSP.2001.941327

Filename

941327