Self-timed multiplier based on canonical signed-digit recoding

被引:5
|
作者
Ruiz, GA [1 ]
Manzano, MA [1 ]
机构
[1] Fac Sci Santander, Dept Elect & Computadores, Santander 39005, Spain
来源
关键词
D O I
10.1049/ip-cds:20010524
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A data-dependent self-timed multiplier structure in dynamic logic and DCVS logic based on canonical signed-digit (CSD) recoding is presented. This coding increases the number of null partial products up to 33%, compared with the 25% of the traditional modified Booth recoding. The carry-save structure is a data-dependent parallel array, which uses this characteristic to reduce the number of addition operations, and thus increase the speed of the multiplier by 20% compared with other classical implementations. Thus. the adders of a null partial product become pass cells postponing the addition operation to the next stage. The layouts of a 16 x 16-bit and a 32 x 32-bit signed CSD multiplier have been devised. These present a rectangular-shaped structure and regular layout suitable for implementation in VLSI. Simulation results highlight that these CSD multipliers have a similar throughput to other pipeline asynchronous multipliers, but with a significant reduction of latency. The delay computation time is less than for published synchronous multipliers. However, the cost in terms of area and power is high.
引用
收藏
页码:235 / 241
页数:7
相关论文
共 50 条
  • [1] SELF-TIMED DIVIDER USING THE REDUNDANT SIGNED-DIGIT NUMBER SYSTEM
    CHOI, KY
    LEE, KJ
    KANG, JW
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1995, 79 (02) : 183 - 192
  • [2] Efficient signed-digit-to-canonical-signed-digit recoding circuits
    Tanaka, Yuuki
    MICROELECTRONICS JOURNAL, 2016, 57 : 21 - 25
  • [3] Optimal left-to-right binary signed-digit recoding
    Joye, M
    Yen, SM
    IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (07) : 740 - 748
  • [4] Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
    Yang, WC
    Guan, DJ
    Laih, CS
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 167 (01) : 108 - 117
  • [5] Fast modular multiplication using booth recoding based on signed-digit number arithmetic
    Wei, SG
    Chen, SC
    Shimizu, K
    APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, 2002, : 31 - 36
  • [6] Recoding algorithms For the modified signed-digit numbers for parallel digital computing
    Cherri, AK
    Habib, MK
    COMPUTERS & ELECTRICAL ENGINEERING, 1998, 24 (05) : 279 - 294
  • [7] Recoding Algorithms for Minimal Signed-Digit Numbers in Residue Number System
    Zhang, Yunlei
    Tanaka, Yuuki
    Wei, Shugang
    2013 IEEE INTERNATIONAL CONFERENCE OF IEEE REGION 10 (TENCON), 2013,
  • [8] Optoelectronic symbolic substitution based canonical modified signed-digit arithmetic
    Cherri, AK
    Alam, MS
    Awwal, AAS
    OPTICS AND LASER TECHNOLOGY, 1997, 29 (03): : 151 - 157
  • [9] Recoding algorithms for the modified signed-digit numbers for parallel digital computing
    Dept. of Elec. and Comp. Engineering, Kuwait University, College of Engineering and Petroleum, P.O. Box 5969, Safat 13060, Kuwait
    Comput Electr Eng, 5 (279-294):
  • [10] Self-timed Booth's multiplier
    Pang, TCJ
    Choy, CS
    Chan, CF
    Cham, WK
    1996 2ND INTERNATIONAL CONFERENCE ON ASIC, PROCEEDINGS, 1996, : 280 - 283