基于Goldschmidt算法高性能双精度浮点除法器设计.docVIP

基于Goldschmidt算法高性能双精度浮点除法器设计 　　摘要：针对双精度浮点除法通常运算过程复杂、延时较大这一问题，提出一种基于Goldschmidt算法设计支持IEEE754标准的高性能双精度浮点除法器方法。首先，分析Goldschmidt算法运算除法的过程以及迭代运算产生的误差；然后，提出了控制误差的方法；其次，采用了较节约面积的双查找表法确定迭代初值，迭代单元采用并行乘法器结构以提高迭代速度；最后，合理划分流水站，控制迭代过程使浮点除法可以流水执行，从而进一步提高除法器运算速率。实验结果表明，在40nm工艺下，双精度浮点除法器采用14位迭代初值流水结构，其综合cell面积为84902.2618μm2，运行频率可达2.2GHz；相比采用8位迭代初值流水结构运算速度提高了32.73%，面积增加了5.05%；计算一条双精度浮点除法的延迟为12个时钟周期，流水执行时，单条除法平均延迟为3个时钟周期，与其他处理器中基于SRT算法实现的双精度浮点除法器相比，数据吞吐率提高了3～7倍；与其他处理器中基于Goldschmidt算法实现的双精度浮点除法器相比，数据吞吐率提高了2～3倍。 　　关键词：浮点除法器；Goldschmidt算法；倒数查找表；高性能除法器；数字信号处理器 　　中图分类号： TP301.6； TP342.2 文献标志码：A 　　Abstract： Focusing on the issue that division is complex and needs a large delay to compute， a kind of method for designing the unit of highperformance double precision floating point divider based on Goldschmidts algorithm was proposed and it supported IEEE754 standard. Firstly， it was analyzed that how to compute division using Goldschmidts algorithm and the error produced during iterative operation. Then， the method for controlling error was proposed. Secondly， bipartite reciprocal tables were adopted to calculate initial value of iteration with area saving， and parallel multipliers were adopted in the iterative unit for accelerating. Lastly， the executed station was divided reasonably and it made floating point divider supporting pipeline execution with state machine controlling. So， the speed of divider was improved. The experimental results show that the double precision floating point divider adopted 14bit iterative initial value pipeline structure， its synthesis cell area is 84902.2618μm2， the running frequency is up to 2.2GHz with 40nm technology. Compared with 8bit iterative initial value pipeline structure， computing speed is increased by 32.73% and area is increased by 5.05%. The delay of a double precision floating division instruction is 12 cycles， and it is decreased to 3 cycles in pipeline execution. Compared with the divider based on SRT algorithm implemented in other proces