Fast 3-D Algorithm for the 3-D IDCT
In this paper, a fast three-dimensional algorithm for the calculation of the three-dimensional inverse discrete cosine transform (3-D IDCT) is introduced. 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.
O.Alshibami S.Boussakta M.Darnell
Institute of Integrated Information Systems School of Electronic and Electrical Engineering, University of Leeds, Leeds,LS2 9JT, United Kingdom
国际会议
成都
英文
825-828
2003-08-27（万方平台首次上网日期，不代表论文的发表时间）