一种快速、有效的LBG初始码书生成算法

摘要

With consideration of LBG algorithm depending on initial codebook,a new LBG initial codebook generation algorithm was developed,on the basis of Greedy Tree Growing Algorithm (GTGA) and Most Dispersed Codewords in Initialization (MDCI) algorithm. A fundamental codebook was generated by GTGA first, and then an initial codebook was produced from the fundamental codebook by MDCI algorithm. The computation of this new algorithm is lower than usual Split algorithm,and the run time decreases too. Compared with these two basic algorithms,both the Distortion and Average Spectral Distortion are reduced.%针对LBG算法依赖初始码书的问题,以贪婪树增长算法与码书间距最大化算法为基础,提出了一种新的LBG初始码书生成算法.该算法用贪婪树增长算法生成基础码书,再采用码书间距最大化算法从基础码书中生成初始码书.该算法相对于常用的分裂法降低了计算复杂度,节约了运算时间.与两种基本算法相比,它降低了量化的失真度与平均谱包络失真.