Fast 3-D algorithm for the 3-D IDCT

Author

Alshibami, O. ; Boussakta, S. ; Darnell, M.

Author_Institution

Inst. of Integrated Inf. Syst., Leeds Univ., UK

fYear

2003

fDate

27-29 Aug. 2003

Firstpage

825

Lastpage

828

Abstract

We introduce a fast three-dimensional algorithm for the calculation of the three-dimensional inverse discrete cosine transform (3-D IDCT). The derivation of the algorithm is presented and its arithmetic complexity is analysed and compared to that of the familiar row-column-frame (RCF) method. The proposed algorithm is found to reduce the number of multiplications by about 41%, whilst keeping the number of additions the same. Also, based on computer run-time, it is found to reduce the time involved in calculating the 3-D IDCT significantly. This makes the developed algorithm more suitable for 3-D image and video compression decoders involving the 3-D IDCTs.

Keywords

computational complexity; data compression; discrete cosine transforms; image coding; video coding; 3D image compression; 3D video compression; algorithm derivation; arithmetic complexity; decoders; fast three-dimensional algorithm; row-column-frame method; three-dimensional inverse discrete cosine transform; Algorithm design and analysis; Arithmetic; Decoding; Discrete cosine transforms; Discrete transforms; Image coding; Information systems; Karhunen-Loeve transforms; Runtime; Video compression;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Print_ISBN

0-7803-7840-7

Type

conf

DOI

10.1109/PDCAT.2003.1236424

Filename

1236424