The discrete cosine transform (DCT) is now the established technique f
or image and video coding. In most image coding schemes, a large numbe
r of high-frequency transform coefficients can be neglected and need n
ot be calculated. Therefore, significant savings in computation can be
obtained by applying pruning in the fast algorithms, In this work, we
analyze pruning in Chan and Ho's fast DCT algorithm and evaluate the
saving of operations.