期刊文献+

54位高速冗余二进制乘法器的设计 被引量:2

High-Speed 54×54-b Redundant Binary Multiplier Design
下载PDF
导出
摘要 冗余二进制(RB)数是一种有符号数的表示方法,利用冗余二进制算法的进位无关特性和规整的结构,可以设计高速RB并行乘法器.系统地研究了RB乘法器的算法和结构,给出了基于修正Booth算法,RB部分积压缩树和RB-NB转换器的54b乘法器的设计过程,并利用并行前缀/进位选择混合加法器对RB-NB转换器进行优化设计.采用Verilog HDL对乘法器进行描述,并在ModelSim平台上进行仿真验证,在SMIC 0.18mm标准工艺库下,通过Synopsys公司综合工具Design Compiler进行综合,得到54bRB乘法器的延时可达到3.97ns,面积是409 293mm2. Redundant binary representation is one of the signed-digit number systems. High modularity and the carry-free feature of RB arithmetic can be used to design high-speed parallel multipliers. In this paper, the algorithm and structure of RB multiplier is systematically studied. The 54-bit RB multiplier is designed by the modified Booth algorithm, RB partial product accumulator and RB-NB converter. The hybrid parallel-prefix/carry- select adder is used to design optimized RB-NB converter. The multiplier has been realized by Verilog HDL and simulated in the ModelSim platform. Under SMIC 0. 18 mm standard process library, the synthesis results of this design by Design Compiler show that the delay can be reduced to 3. 97 ns and the area is 409 293 mm2.
出处 《微电子学与计算机》 CSCD 北大核心 2014年第4期140-143,共4页 Microelectronics & Computer
关键词 冗余二进制乘法器 布斯编码 部分积 并行前缀加法器 Redundant Binary multiplier Booth encoding partial products Parallel prefix adder
  • 相关文献

参考文献14

  • 1Avizienis A. Signed-digit number representations for fast parallel arithmetic[J-]. IRE Trans Electron Com- puters, 1961(10) : 389-400.
  • 2Takagi N, Yasuura H, Yajima S. High-speed VLSI multiplication algorithm with a redundant binary addi tion tree [J]. IEEE Trans Comput, 1985, 34 (9):789-796.
  • 3Edamatsu H, Taniguchi T, Nishiyama T, et al. A 33 MFLOPS floating point processor using redundant bi- nary Representation[-C3// IEEE Int. Solid-State Cir- cuits Conf (ISSCC) Dig Tech Papers. San Francisco, CA: IEEE, 1988 : 152-153.
  • 4Makino H, Nakase Y, Suzuki H, et al. An 88-ns 54 X 54-bit multiplier with high speed redundant binary architecture[-J]. IEEE J Solid-State Circuits, 1996,31 (6) : 773-783.
  • 5Kim Y, Song B S, Grosspietsch J,et al. A carry-free 54b: 54b multiplier using equivalent bit conversion al- gorithm[-J3. IEEE J Solid-State Circuits, 2001, 36 (10) : 1538-1545.
  • 6He Y, Chang C H. A power-delay efficient hybrid ear- ry-lookahead carry-select based redundant binary to two's complement converterEJ3. IEEE Trans Circuits Syst I Reg Papers, 2008,55 (2) : 336-346.
  • 7Wang G, Tull M P. A new redundant binary number to 2's-complement number converterEC-]// Region 5 Conference: Annual Technical and Leadership Work- shop. [-s. 1. : : IEEE, 2004 : 141-143.
  • 8MacSorley O L. High-speed arithmetic in binary com- puters[J-]. IRE Proc,1961(49) :67-91.
  • 9Yeh W C, Jen C W. High-speed booth encoded paral- lel multiplier design[-J:. IEEE Trans Comput, 2000, 49(7) : 692-701.
  • 10Sklansy J. Conditional sum addition logic [J]. IRE Trans Electron Computers, 1960, EC-9(6) : 226-231.

二级参考文献6

  • 1崔晓平,王成华.二级进位跳跃加法器的优化方块分配[J].北京航空航天大学学报,2007,33(4):495-499. 被引量:3
  • 2Sklansy J. Conditional sum addition logic[J].IRE TransElectron Computers,1960,(06):226-231.
  • 3Kogge P M,Stone H S. A parallel algorithm forefficient solution of a general class of recurrence equations[J].IEEE Trans Com-puters,1973,(08):786-793.
  • 4Brent R P,Kung H T. A regular layout for parallel adders[J].IEEE Franactions Com-puters,1982,(03):260-264.
  • 5Dimitrakopoulos G,Nikolos D. High-Speed ParallelPrefix VLSI Ling Adders[J].IEEE T-ransactio Computers,2005,(02):225-231.doi:10.1109/TC.2005.26.
  • 6Burgess N. Accelerated carry-skip adders with low hardware cost[A].IEEE,2001.852-856.

共引文献2

同被引文献1

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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