Scaled AAN for Fixed-Point Multiplier-Free IDCT

被引：0

作者：

P. P. Zhu

J. G. Liu

S. K. Dai

G. Y. Wang

机构：

[1] Huazhong University of Science and Technology,State Key Lab for Multi

[2] Huaqiao University,Spectral Information Processing Technologies, Institute for Pattern Recognition and Artificial Intelligence

来源：

EURASIP Journal on Advances in Signal Processing | / 2009卷

关键词：

Information Technology; Quantum Information; Discrete Cosine Transform; Mobile Communication; Efficient Algorithm;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

An efficient algorithm derived from AAN algorithm (proposed by Arai, Agui, and Nakajima in 1988) for computing the Inverse Discrete Cosine Transform (IDCT) is presented. We replace the multiplications in conventional AAN algorithm with additions and shifts to realize the fixed-point and multiplier-free computation of IDCT and adopt coefficient and compensation matrices to improve the precision of the algorithm. Our 1D IDCT can be implemented by 46 additions and 20 shifts. Due to the absence of the multiplications, this modified algorithm takes less time than the conventional AAN algorithm. The algorithm has low drift in decoding due to the higher computational precision, which fully complies with IEEE 1180 and ISO/IEC 23002-1 specifications. The implementation of the novel fast algorithm for 32-bit hardware is discussed, and the implementations for 24-bit and 16-bit hardware are also introduced, which are more suitable for mobile communication devices.

引用