On the computation of the 3-D DCT

Author

Mekky, T. ; Boussakta, S. ; Darnell, M.

Author_Institution

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

Volume

3

fYear

2003

fDate

14-17 Dec. 2003

Firstpage

1141

Abstract

The three-dimensional cosine transform (3-D DCT) is used for 3-D image compression and related applications. Its calculation involves a very large number of arithmetic operations and hence fast algorithms are needed for its computation. In this paper, the row-column-frame (RCF) and the 3-D vector radix (3-D VR) algorithms, which are usually used for the calculation of the 3-D DCT and its inverse, are investigated and compared based on their arithmetic operations and computer-run times. Both comparisons show that the 3-D VR algorithm is clearly faster and more efficient than the RCF approach.

Keywords

computational complexity; discrete cosine transforms; divide and conquer methods; transform coding; video coding; 3-D DCT; 3-D vector radix algorithm; arithmetic operations; bit reverse; butterflies calculation; data reordering; divide and conquer; fast algorithms; image compression; inverse transform; recursive sums; row-column-frame algorithm; scaling; Digital arithmetic; Discrete cosine transforms; Heart; Image coding; Information systems; MPEG standards; Motion compensation; Transform coding; Video compression; Virtual reality;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003 10th IEEE International Conference on

Print_ISBN

0-7803-8163-7

Type

conf

DOI

10.1109/ICECS.2003.1301713

Filename

1301713