Abstract The problem of fast search for raman spectrum has attracted much attention recently. By far the most simpleand widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectrain a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most seriousproblems is the high computational complexity of searching for the closet codeword. To overcome this problem, The fastcodeword search algorithm based on the mean pyramids of codewords is currently used in image coding applications. Inthis paper, we present three new methods for the fast algorithm to search for the closet codeword. the proposed algorithmuses two significant features of a vector, mean values and variance, to reject many unlikely codewords and save a great deal of computation time. The Experiment results show about 42.8-55.2% performance improvement for the 1DMPS+PDS.The results obtained confirm the effectiveness of the proposed algorithm.