A Fast Algebraic Codebook Search Method for DSVD Applications

摘要

This paper proposes a fast algebraic codebook search for DSVD applications. In this method, the codebook search is simplified by reducing the number of possible position combinations using a mean-based track threshold multiplied by heuristically determined optimum threshold factor. And, to guar- antee a complexity requirement of DSVD, the maximum number of searching position combinations is limited to 320.