In this paper, in order to reduce the computational complexity of codebook, we propose a fast search algorithm, which takes advantage of the information generated in the process of the self-organizing map (SOM). In an attempt to demonstrate the influence of the ordering of codebook on the performance of the partial distance search (PDS), we present the results of computation saving for three cases of ordering of codebooks.