|
|||||
|
|
| 用Huffman树实现的多坐标联动插补算法 | |
| 引用本文： | 李志勇,赵万生,张勇.用Huffman树实现的多坐标联动插补算法[J].中国机械工程,2003,14(13):1097-1099,1146. |
| 作者姓名： | 李志勇 赵万生 张勇 |
| 作者单位： | 1. 哈尔滨工业大学,哈尔滨市,150001 2. 哈尔滨工业大学深圳研究生院 3. 哈尔滨工业大学特种研究所 |
| 基金项目： | 总装备部国防预研项目(41 318.3.2 .5) |
| 摘 要： | 将多轴联动插补指令的各坐标相对移动值作为树中节点的权值，用Huffman算法建立插补树，每次插补计算时使用逐点比较法搜索一遍插补树。基于动态Huffman编码树的坐标分组是最优的，在插补运算中具有最快的速度。以联动轴数作为输入考察插补速度，算法时间复杂度是对数阶的．该算法用于电火花机床加工航空和火箭发动机带叶冠整体涡轮叶片。 |
| 关 键 词： | 插补 Huffman树 电火花加工 涡轮 |
| 文章编号： | 1004-132X(2003)13-1097-03 |
A Multi-coordinate Linkage Interpolation Method with Huffman Code Tree |
|
| Li Zhiyong.A Multi-coordinate Linkage Interpolation Method with Huffman Code Tree[J].China Mechanical Engineering,2003,14(13):1097-1099,1146. | |
| Authors: | Li Zhiyong |
| Abstract: | An interpolation tree is created based on Huffman algorithm by considering relative displacements of each coordinate of the multi-axis linkage NC instructions as the weight of tree nodes. Searching the Huffman tree with a point-by-point comparative algorithm is performed at every interpolating computation. Because of the optimum coordinate grouping based on dynamic Huffman coding tree, greatest speed is attained in the interpolating computation. The algorithm running time is a logarithmic function of the number of linkage axes. This algorithm is applied in machining turbine rimed blade bisk of aerospace and rocket engines with EDM. |
| Keywords: | interpolation Huffman code tree EDM blade bisk |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |