基于排序分离平均算法的码书设计改进算法

摘要

The sorted separated means algorithm is based. To gel a better codebook, it improved on the case of empty cells. It put the input vector which had the longest distance to the current codebook into the empty cells after the initial codebook is got. The algorithm improves the LBG algorithm and the sorted separated means algorithm. The codebook generated by the proposed algorithm is closer to global optimal. The validity is proved by the simulation result.%为了获得性能更佳的码书,以排序的分离平均算法为基础,在获得初始码书后,对于在LBG迭代中可能出现的空胞腔采用填充与当前码书距离最远输入矢量的方式作为改进,有效地改善了传统LBG算法容易陷入局部最优以及排序分离平均算法的空胞腔问题.改进算法生成的码书更加接近全局最优.仿真实验证明了该算法的有效性.