期刊文献+

用于片上系统的二叉树快速遍历算法 被引量:2

Fast algorithms for traversal of binary trees available for SoC
下载PDF
导出
摘要 基于对满二叉树结点序号的研究,得到了满二叉树的层次结构、顺序序列与后序序列三者之间在数学上的对应关系,演绎出了满二叉树的层次结构及其顺序序列与后序序列之间互相转换的快速算法。算法可在常数时间内完成单个结点的查询、在线性时间内完成整个序列的遍历。算法编码简洁,仅包含加、减、乘法与位运算,无递归调用无堆栈开销,几乎没有分支与跳转,不仅适合常规程序设计,而且适合于片上系统的专业开发。文中还指出了算法在机电设计方面的应用点。 A mathematical corresponding relationship among a full binary tree, its sequential storage and its postorder-traversal storage are obtained by study of the node-indices of the binary tree. Based on the relationship, the algorithm is introduced that can fast convert a full binary tree and its sequential storage into its postorder-traversal storage, or vice versa. The algorithms can answer a query in constant time and perform a traversal in linear time. Being non-recursive and stack-free, having almost no branches or jumps and containing merely addition, subtraction, multiplication and bitwise operations, the algorithms are very concise and available for both conventional programming and professional developments such as systems-on-chip, embedded systems and so on. A guidance is presented for the algorithms to be used in design of mechatronic systems.
作者 王兴波
机构地区 佛山大学机电系
出处 《计算机工程与设计》 CSCD 北大核心 2013年第3期873-877,共5页 Computer Engineering and Design
基金 广东省工业攻关基金项目(2012B010600018) 佛山市科技发展专项基金项目(2011AA100021 2011GY006 2011B1023) 佛山市产学研专项基金项目(2010C012)
关键词 二叉树 非递归 后序遍历 片上系统 机电系统 binary tree non-recursive postorder traversal system-on-chip mechatronic systems
  • 相关文献

参考文献12

  • 1Wankar R. Reconfigurable architecturs and algorithms: A re- search survey [J]. International Journal of Computer Science and Applications, 2009, 6 (1): 108-123.
  • 2黄立波.片上集群体系结构关键技术研究[D].长沙:国防科学技术大学,2010.
  • 3唐柳,黄樟钦,侯义斌,方凤才.可重构多核片上系统体系结构综述[J].计算机工程与应用,2012,48(20):39-45. 被引量:3
  • 4盛磊,葛照君.二叉树算法在DS18B20地址搜索中的运用[J].计算机系统应用,2010,19(2):143-146. 被引量:8
  • 5王兴波.CNC插补的一种并行流水计算方法[P].中国发明专利:201010593543.0,2011/05/25.
  • 6王兴波.支持可重构计算的满二叉树中序存储策略及快速遍历算法[J].佛山科学技术学院学报(自然科学版),2011,29(1):47-52. 被引量:2
  • 7Vinu V Das. A new non-recursive algorithm for reconstructing a binary tree from its traversals [J]. International Journal of Algorithms, Computing and Mathematics, 2009, 2 ( 1 ): 29-32.
  • 8Nitin Arora, Vivek Kumar Tamta, Suresh Kumar. Modified non-recursive algorithm for reconstructing a binary tree [J].International Journal of Computer Applications, 2012, 43 (10): 25-28.
  • 9Manoj C Lohani, Upendra S Aswal. Reconstruction of a binary search tree from its preorder tree traversal with the unique non- recursive approach [J]. Oriental Journal of Computer Science Technology, 2011, 4 (1): 217-219.
  • 10王兴波.二叉树演绎于结点序号内蕴性质的快速算法[J].计算机工程与应用,2011,47(9):16-20. 被引量:5

二级参考文献107

  • 1陈燕晖,邢晶,罗宇.一种消除递归的新方法[J].计算机工程与应用,2006,42(4):73-75. 被引量:7
  • 2DS18820中文资料.pdf.http://www.willar.com/down_view.asp?id=314.
  • 3DS 18B20.pdf. http://www.xie-gang.com/DS 18B20. pdf.
  • 4WANG Xingbo, SHEN Yue. Fast Computation of Cubic Bernstein Polynomials n Shape Optimization[J]. Global Optimization, 2009 ( 1 ) : 149-155.
  • 5WANG Xingbo,CHEN Gang, ZENG Liancheng. A Rapid and Precise Interpolator for CNC Smooth Curve Inter- polation[C]//IEEE CADID. Beijing :IEEE Conference Publishing Service, 2009:879-883.
  • 65icter专家.基于NURBS插补的开放式可重构智能运动控制系统研发[EB/OL].[2008-10-15].http://www.5icte.com/cms/ti/view.jspa?id=249919.
  • 7HAUCK S,DEHON A. Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation[M] San Fransisco : Morgan Kaufmann, 2007.
  • 8WANKAR R. Reconfigurable Architecturs and Algorithms: A Research Survey [J]. International Journal of Co- mputer Science and Applications, 2009,6 (1) : 108-123.
  • 9徐土良,葛兵.实用数据结构(C++描述)[M].2版.北京:清华大学出版社,2006.
  • 10WANG Xingbo, ZHOU Jun. Analytic Criterion and Algorithm for the Lowest Common Ancestor of Two Eighboring Nodes in a Complete Binary Tree [C]//2011 3rcl International Conference on Computer and Automation Engineering Proceedings. Chengdu :IEEE Conference Publishing Service,2011.

共引文献16

同被引文献15

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部