北京航空航天大学学报 ›› 2008, Vol. 34 ›› Issue (8): 940-943.

• 论文 • 上一篇    下一篇

二进制数开任意正整数次方运算 的硬件方法

赖大彧,刘荣科   

  1. 北京航空航天大学 电子信息工程学院, 北京 100191
  • 收稿日期:2007-07-04 出版日期:2008-08-31 发布日期:2010-09-17
  • 作者简介:赖大彧(1983-),男,四川自贡人,硕士生,nirvanno@gmail.com.

Novel method of extraction for binary based on hardware

Lai Dayu, Liu Rongke   

  1. School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China
  • Received:2007-07-04 Online:2008-08-31 Published:2010-09-17

摘要: 一种适合于硬件的、普适的、开任意次方的方法,从左至右进行计算,首先得到开方结果的高位,最后得到低位.应用到FPGA(Field Programmable Gate Array)中,与查表结合,对不同的开方次数,模块修改非常方便,普适性较高.该方法消耗的时间与开方的次数呈线性关系.在对一个12bit数开三次方时,消耗的时间不足传统循环搜索法的50%,所消耗的存储空间不足传统的查表法的2%,并且存储空间上的优势在被开方位数越大的时候越明显.更重要的是,该方法所用的模块只需修改数据位宽和循环次数两处地方就可以提高到任意的精度.

Abstract: A method of any order extraction, works from left to right, which is based on hardware and calculates out the most significant bit(MSB) of the result first and the least significant bit(LSB) last. While applied in field programmable gate array(FPGA), the method can combine with looking up table(LUT). Using this method, the occupying time is linear to the extraction order. While doing a 3 order extraction for a 12 bit data, the occupying time of this method is 50% less than the traditional searching method, and the occupying memory is only 2% that of traditional method of LUT. As the order of extraction grows, the superiority will be more obvious. More important, the module only need to be modified in 2 point, the precision can be improved as wanted.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发