A fast codeword search algorithm based on partial distance search (PDS
) and zero-tree data structure is presented. Before the fast search, t
he zero-trees of the wavelet coefficients of codewords and sourcewords
are first identified. The PDS is then preformed only over the wavelet
coefficients which are not inside the zero-trees. The algorithm is we
ll-suited to applications where degradation in average distortion is a
llowed to achieve very low arithmetic complexity.