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 条
  • [31] A Self-Timed Ring based PUF
    Gimenez, Gregoire
    Cherkaoui, Abdelkarim
    Fesquet, Laurent
    2020 26TH IEEE INTERNATIONAL SYMPOSIUM ON ASYNCHRONOUS CIRCUITS AND SYSTEMS ASYNC 2020, 2020, : 69 - 77
  • [32] Fast residue arithmetic multipliers based on signed-digit number system
    Wei, SG
    Shimizu, K
    ICECS 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS I-III, CONFERENCE PROCEEDINGS, 2001, : 263 - 266
  • [33] An area-efficient iterative modified-booth multiplier based on self-timed clocking
    Shin, MC
    Kang, SH
    Park, IC
    2001 INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, ICCD 2001, PROCEEDINGS, 2001, : 511 - 512
  • [34] Design of canonical signed digit multiplier using spurious power suppression technique adder
    K. P J.
    Miranda P.S.
    Shri K.A.
    Journal of Engineering and Applied Science, 2023, 70 (01):
  • [35] OPTICAL MODIFIED SIGNED-DIGIT ADDITION BASED ON BINARY LOGICAL OPERATIONS
    WONG, KW
    CHENG, LM
    OPTICS AND LASER TECHNOLOGY, 1994, 26 (04): : 213 - 217
  • [36] Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical-Signed-Digit Recoding Technique
    Wu, Chia-Long
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 428 - 438
  • [37] FPGA implementation of a canonical signed digit multiplier-less based FFT processor for wireless communication applications
    Benhamid, Mahinud
    Othman, Masuri
    2006 IEEE INTERNATIONAL CONFERENCE ON SEMICONDUCTOR ELECTRONICS, PROCEEDINGS, 2006, : 641 - +
  • [38] Design of 2-D IIR filters with canonical signed-digit coefficients using genetic algorithm
    Liang, L
    Ahmadi, M
    Sid-Ahmed, M
    Proceedings of the 46th IEEE International Midwest Symposium on Circuits & Systems, Vols 1-3, 2003, : 633 - 635
  • [39] Differential Evolution Based Design of Multiplier-less FIR Filter using Canonical Signed Digit Representation
    Chandra, Abhijit
    Chattopadhyay, Sudipta
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, DEVICES AND INTELLIGENT SYSTEMS (CODLS), 2012, : 425 - 428
  • [40] Optimization of FIR digital filters over the canonical signed-digit coefficient space using genetic algorithms
    Fuller, ATG
    Nowrouzian, B
    Ashrafzadeh, F
    1998 MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, PROCEEDINGS, 1999, : 456 - 459