The proposed algorithm has a competitive performance to the floating-point DCT with only 36 adds or shifts in most cases.

• 在绝大多数情况下,在保持和浮点DCT相同性能的条件下,一维8点整数无乘近似DCT算法仅需要36次加减法或移位运算。