Codebooks are crucial to vector quantizations (VQs)

which determine their performance. LBG algorithm is often used to generate codebooks

where choice of original codebooks is a key technique

and the splitting algorithm is generally considered effective. In this paper

the greedy tree growing algorithm is introduced to design original codebooks

and two better algorithms are derived. Compared to the classical splitting algorithm

the total run time with the proposed algerithm is reduced

and the codebook performance is improved.