期刊文献+

基于冗余符号数的定点乘法器的设计 被引量:2

Design of a Fixed-Point Multiplier Based on Redundant Signed Digit
下载PDF
导出
摘要 为提高定点乘法器速度,减少乘法器面积,基于Radix-16冗余并行乘法器,将奇数倍部分积用冗余差分形式表示;将部分积的修正位与部分积进行压缩,减少了部分积数量;通过优化控制信号产生电路、Booth解码电路和二进制转换电路的结构,进一步减少了乘法器延时和面积.TSMC 180nm工艺下的Design Complier综合结果表明,改进后冗余乘法器的面积相对减少8%,延时相对减少11%. In order to improve the speed and reduce the area of fixed-point multipliers,odd multiple of partial products is represented with the redundant differential based on the Radix-16 redundant parallel multiplier. Then, the correction words of partial products and the partial products are compressed to reduce the number of partial products. Through optimizing the structures of the control signal generator,the Booth decoder and the binary converter,the time delay and the area of the multiplier are further reduced. Finally,the modified multiplier is synthesized by Design Complier with the TSMC 180nm library,with an area decrement of 8% and a delay reduction of 11% being obtained.
出处 《华南理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2014年第3期27-34,共8页 Journal of South China University of Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(61274085)
关键词 乘法器 冗余 逻辑设计 解码 计算方法 multiplier redundancy logic design encoding computational method
  • 相关文献

参考文献21

  • 1Jeon D, Seok M, Chakrabarti C, et al. A super-pipelined energy efficient subthreshold 240 MS/s FFT Core in 65 nm CMOS [ J]. IEEE Journal of Solid-State Circuits,2012, 47( 1 ) :23-34.
  • 2Mukherjee R, Keyur S,Sandeep E,et al. FPGA based im- plementation of quantization and its inverse for H. 264 co- dec [C] //Proceedings of 2013 IEEE Conference on In- formation & Communication Technologies ( ICT2013 ). JeJu Island : IEEE,2013:986-989.
  • 3Gothandaraman A, Peterson G D, Warren G L, et al. A pipelined and parallel architecture for quantum Monte Carlo simulations on FPGAs [ J]. VLSI Design, 2010, 2010:946486/1-8.
  • 4Reddy S K,Sahoo S K, Chakraborty S. A high speed,high radix 32-bit redundant parallel multiplier [ C] //Proceed-ings of International Conference on Emerging Trends in Electrical and Computer Technology ( ICETECT ) 201 1. Tamil N adu : IEEE,2011:917- 921.
  • 5Kumar Kattamuri R S N, Sahoo S K. Computation sharing multiplier using redundant binary arithmetic [ C] //Proceed- ings of IEEE Asia Pacific Conference on Circuits and Sys- tems ( APCCAS ). Kuala Lumpur: IEEE,2010 : 108-111.
  • 6Gonze1ez A F, Mazumder P. Redundant arithmetic, algo- rithms and implementations [ J ]. Integration, the VLSI Journal,2000,30 ( 1 ) : 13-53.
  • 7Yuan M-L. The design and verification of high-speed re- dundant Booth multiplier [ D ]. Taipei: Department of Electronic Engineering, National Taiwan University of Sci- ence and Technology,2010.
  • 8Jose B A, Radhakrishnan D. Redundant binary partial product generators for compact accumulation in Booth multipliers [ J ]. Microelectronics Journal ,2009,40 ( 11 ) : 1606-1612.
  • 9Juang T B, Hsiao S F. Low-error carry-free fixed-width multipliers with low-cost compensation circuits [ J]. IEEE Transactions on Circuits and Systems II:Express Briefs, 2005,52 ( 6 ) : 299-303.
  • 10Timarchi S, Navi K. Arithmetic circuits of redundant SUT-RNS [ J ]. IEEE Transactions on Instrumentation and Measurement,2009,58 (9) :2959-2968.

二级参考文献7

  • 1Rivest R L, Shamir A, Adelman L. A method for obtaining digital signatures and public-key cryptosystems [J]. Communications of the ACM, 1978, 21: 120 - 126.
  • 2Koblitz N. Elliptic curve cryptosystems [J]. Mathematics of Computation, 1987, 48:203 - 209.
  • 3Montgomery R L. Modular multiplication without trial division [J]. Mathematics of Computation, 1985, 44: 519- 521.
  • 4Rubinfeld L. A proof of the modified Booth's algorithm for multiplication [J]. IEEE Transuctions on Computers, 1975: 1014 - 1015.
  • 5Wallace C S. A suggestion for parallel multipliers [J]. IEEE Transactions on Electronics Computers, 1964, EC-13:14 - 17.
  • 6Seidel P M, McFearin L, Matula D W. Binary multiplication radix-32 and radix-256 [C] // Proceeding of 15th IEEE International Symposium on Computer Arithmetic, Colorado, USA; IEEE Press, 2001:23-32.
  • 7A1-Khaleel O, Papachristou C, Wolff F, et al. A large scale adaptable multiplier for cryptographic applications [C] // First NASA/ESA Conference on Adaptive Hardware and Systems, Istanbul, Turkey: IEEE Press, 2006 : 477 - 484.

共引文献2

同被引文献19

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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