A low-power high-radix serial-parallel multiplier

被引:0
作者
Crookes, Danny [1 ]
Jiang, Richard M. [1 ]
机构
[1] Queens Univ Belfast, Sch Elect Engn Elect & Comp Sci, Belfast BT7 1NN, Antrim, North Ireland
来源
2007 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1-3 | 2007年
关键词
CONVERSION;
D O I
10.1109/ECCTD.2007.4529632
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we introduce a novel high-radix binary signed digit (BSD) serial-parallel multiplier suitable for low-power high-speed multiplication. The proposed N-bit x N-bit radix-16 serial-parallel multiplier can reduce the number of accumulation cycles of partial products to as much as N/4, and eliminate most of the invertion operations which consume power in a conventional multiplier in generating the partial products. Unlike other high-radix methods, the pre-multiplication in the new algorithm employs a BSD method which requires no extra adder, and thus removes the extra delay for additions which hinders other high-radix algorithms.
引用
收藏
页码:460 / 463
页数:4
相关论文
共 10 条
  • [1] Technology scaling effects on multipliers
    Al-Twaijry, HA
    Flynn, MJ
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (11) : 1201 - 1215
  • [2] AVIZIENIS A, 1961, IRE T ELECT COMPUT, V10, P380
  • [3] A SIGNED BINARY MULTIPLICATION TECHNIQUE
    BOOTH, AD
    [J]. QUARTERLY JOURNAL OF MECHANICS AND APPLIED MATHEMATICS, 1951, 4 (02) : 236 - 240
  • [4] Using signed digit arithmetic for low-power multiplication
    Crookes, D.
    Jiang, M.
    [J]. ELECTRONICS LETTERS, 2007, 43 (11) : 613 - 614
  • [5] ERCEGOVAC MD, 1987, IEEE T COMPUT, V36, P895, DOI 10.1109/TC.1987.1676986
  • [6] Hennessy JL., 2003, COMPUTER ARCHITECTUR
  • [7] Kim Y, 2001, IEEE J SOLID-ST CIRC, V36, P1538, DOI 10.1109/4.953482
  • [8] LIU YJ, 2004, DESIGN LOW POWER ASY
  • [9] Wood C. P., 1992, Geothermics, V21, P25, DOI 10.1016/0375-6505(92)90066-I
  • [10] High-speed booth encoded parallel multiplier design
    Yeh, WC
    Jen, CW
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (07) : 692 - 701