计算机工程

• 开发研究与工程应用 • 上一篇    下一篇

快速有符号整数除法算法及其低成本实现

高锦炜,莫鹏飞,杨 军,陈志坚   

  1. (浙江大学超大规模集成电路设计研究所,杭州310027)
  • 收稿日期:2014-05-14 出版日期:2015-04-15 发布日期:2015-04-15
  • 作者简介:高锦炜(1989 - ),男,硕士研究生,主研方向:计算机体系结构;莫鹏飞,工程师、硕士;杨 军,博士;陈志坚,讲师。

Alogrithm of Fast Signed Integer Divison and Its Low-cost Implementation

GAO Jinwei,MO Pengfei,YANG Jun,CHEN Zhijian   

  1. (Institute of VLSI Design,Zhejiang University,Hangzhou 310027,China)
  • Received:2014-05-14 Online:2015-04-15 Published:2015-04-15

摘要: 微处理器中完成一条有符号除法指令需要6 个~38 个周期。跳过符号处理直接用补码参与运算,可以节省符号处理的3 个周期,从而提高除法器性能。为此,提出补码不恢复除法,将其运用于整数除法并给出算法证明,研究商的修正问题并给出解决方案。实验结果表明,该除法器在TSMC 130 nm 工艺下的面积为12 687 μm2,完成一条有32 位符号整数除法只需要2 个~34 个周期,相当于仅以多16% 面积的硬件代价提升35% 的有符号除法性能。

关键词: 有符号除法, 整数除法, 补码, 商的修正, 低成本, 除法电路

Abstract: Signed integer division instruction takes 6 ~ 38 cycles to complete in general micro-processors. By using the original operands for division without abs and negation process,3 cycles of latency can be reduced which will effectively improve the division performance of processor. This paper focuses on complement no-restoring division and its application, as well as proof on integer division. This paper does a research in quotient correction and its reasonable solution and also implements the division device. Experimental result shows that the device is only 12 687 μm2 in TSMC 130 nm process and can complete a 32 bit signed integer division in only 2 ~34 cycles,which means a performance improvement of 35% at a cost of only extra 16% area.

Key words: signed division, integer division, complement, quotient correction, low cost, division circuit

中图分类号: