作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (01): 233-235. doi: 10.3969/j.issn.1000-3428.2012.01.076

• 工程应用技术与实现 • 上一篇    下一篇

基于Radix-4 Booth编码的乘法器优化设计

陈海民1,李 峥1,谢铁顿2   

  1. (1. 解放军信息工程大学电子技术学院,郑州 450004;2. 河南财经政法大学成功学院,河南 巩义 451200)
  • 收稿日期:2011-05-26 出版日期:2012-01-05 发布日期:2012-01-05
  • 作者简介:陈海民(1986-),男,硕士研究生,主研方向:密码工程,微处理器设计;李 峥,副教授、博士;谢铁顿,教授
  • 基金资助:
    国家自然科学基金资助项目(61072047);郑州市创新型科技人才队伍建设工程基金资助项目(096SYJH21099);现代通信国家重点实验室基金资助项目(9140C1106021006)

Optimal Design of Multiplier Based on Radix-4 Booth Encoding

CHEN Hai-min 1, LI Zheng 1, XIE Tie-dun 2   

  1. (1. Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004, China; 2. Chenggong College, Henan University of Economics and Law, Gongyi 451200, China)
  • Received:2011-05-26 Online:2012-01-05 Published:2012-01-05

摘要: 传统Radix-4 Booth编码在负值部分积生成过程中会产生大量求补操作,影响乘法器的工作效率。为此,提出一种重组部分积的乘法器优化设计。通过增加一个“或”门运算以及重组硬连线,避免求补过程中的加法运算,并且未产生多余的部分积。在32位乘法器上的验证结果表明,该设计能有效减小关键路径延迟和芯片面积消耗。

关键词: Radix-4 Booth编码, 乘法器, 部分积, 关键路径延迟, 芯片面积消耗

Abstract: The traditional Radix-4 Booth encoding will produce the complement computing operation emerged in the process of negative partial product generation, which influences the word efficiency for multiplier. Aiming at this problem, this paper puts forward a multiplier optimal design of recombining partial products. By adding an “or” gate operation and simple hard-wired recombinant, it avoids addition operation in the complement computing process, and does not generate redundant partial product. The validated result on 32-bit multiplier shows that the design can effectively reduce the critical path delay and chip area consumption.

Key words: Radix-4 Booth encoding, multiplier, partial product, key path delay, chip area consumption

中图分类号: