In this paper we propose a simple fast-search VQ of the LSF’s to be used on top of the split VQ, that is, in each of the sub-vector domains. The main trait of the proposed method is that no suboptimal codebooks are used and there is no further reduction in performance. In each sub-vector domain, a full-size optimally trained codebook, typically of size 1024, is searched using a fastsearch algor...