通信学报 ›› 2006, Vol. 27 ›› Issue (3): 28-31.doi: 1000-436X(2006)03-0028-04

• 学术论文 • 上一篇    下一篇

基于N进制编码的克隆重组方法应用于快速优化ADPCM的多参数

张刚,谢克明,郭红波,赵哲峰   

  1. 太原理工大学 信息工程学院，山西 太原 030024
  • 出版日期:2006-03-25 发布日期:2017-06-22
  • 基金资助:
    国家自然科学基金资助项目;山西省自然科学基金资助项目

Clone crossover scheme based on N-coding and application of quick optimizing of ADPCM's multi-parameters

HANGGang Z,IEKe-ming X,UOHong-bo G,HAOZhe-feng Z   

  1. College of Information Engineering, Taiyuan University of Technology, Taiyuan 030024, China
  • Online:2006-03-25 Published:2017-06-22
  • Supported by:
    The National Natural Science Foundation of China;The Natural Science Foundation of Shanxi Province

在线阅读

1

PDF下载

271

被引次数

2

摘要：

选择 ADPCM 的步长修正因子 M 涉及复杂目标函数的多变量优化，是一个海量计算问题。克隆—思维进化算法（CMEA）继承了进化算法（MEA）中趋同操作的择强汰弱思想，同时引入克隆算子将相对较弱个体的强势因素保留到下一代。提出一种新的基于N进制编码的克隆重组方法用于优化具有复杂目标函数的ADPCM的8个步长修正因子，实验结果表明从第5次迭代后，CMEA的信噪比（SNR）一直高于MEA算法；在前5次迭代中，CMEA平均每次迭代改善1.03dB，高出MEA算法0.4dB。此外MEA的计算量约为CMEA的1.67倍，CMEA比MEA算法抗早熟。

关键词: 复杂目标函数, 多变量优化, 克隆—思维进化, N进制编码

Abstract:

Choice of ADPCM's step-size updating factors M had a sea capacity of computing which optimizes multi-variables with complex cost function. The MEA's similartaxis operator was come into by the clone mind evolution algorithm (CMEA), which introduced the clone operator to leave the strong component of the weak individuals to next iterativeness. A novel clone crossover scheme was provided based on N-coding which was used to optimize ADPCM's 8 step-size updating factors with complex cost function. The experiment result showed that the CMEA's SNR was aver-agely reformed about 1.03dB every generation in previous 5 iterativeness, which was exceed MEA's by 0.4dB and over-ran the MEA's from fifth generation. Furthermore, the MEA's quantity of computing is equal to CMEA's by 1.67 and the latter is of anti-prematurity.

Key words: complex cost function, multi-variables optimize, clone mind evolution, N-coding

No Suggested Reading articles found!