An Optimized Design for Fused Add-Multiply Operation

被引:0
|
作者
Nepolean, M. [1 ]
Sivasubramanian, K. [1 ]
机构
[1] Dept Elect & Commun Engn, Tiruchengode, India
关键词
Fused Add-multiply operation; modified booth circuits; recoding methods; and VLSI design;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Many digital Signal processing (DSP) applications requires complex arithmetic operation which is carried by multiplier and adder units. Multiplication operation can be done as a successive addition which introduces delay in the processing. In which implementation of this technique with delay constraints leads to more challenging. Because the internal modules generate delay in propagation of processed output of adder unit. With a solution to this problem, the optimized method of multiplier and adder units are fused in a single module with modified booth encoding called Fused add multiply (FAM) is designed. It reduces the delay of the summing operation and produce a direct recoded value of the sum A+B (F= A+B), called SUM to MODIFIED BOOTH RECODER (S-MB). The recoding operation is explored by incorporating them in FAM design. With these recoded bits, the multiplicand generates minimum number of partial products in which it reduces the time Complexity for addition operation. The Products are feed to carry save adder and to Carry look ahead adder to obtain the final resulted output. By these techniques the design yields optimized reduction in critical delay, hardware complexity and power consumption Compared to the existing multiplier design.
引用
收藏
页数:5
相关论文
共 50 条
  • [21] Floating-point fused multiply-add architectures
    Quinnell, Eric
    Swartzlander, Earl E., Jr.
    Lemonds, Carl
    CONFERENCE RECORD OF THE FORTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1-5, 2007, : 331 - +
  • [22] IMPLEMENTATION OF EFFICIENT FFT ALGORITHMS ON FUSED MULTIPLY ADD ARCHITECTURES
    LINZER, EN
    FEIG, E
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (01) : 93 - 107
  • [23] Speed-Independent Fused Multiply Add and Subtract Unit
    Stepchenkov, Yuri
    Zakharov, Victor
    Rogdestvenski, Yuri
    Diachenko, Yuri
    Morozov, Nickolaj
    Stepchenkov, Dmitri
    PROCEEDINGS OF 2016 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), 2016,
  • [24] Formally Verified Argument Reduction with a Fused Multiply-Add
    Boldo, Sylvie
    Daumas, Marc
    Li, Ren-Cang
    IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (08) : 1139 - 1145
  • [25] Automatic formal verification of fused-multiply-add FPUs
    Jacobi, C
    Weber, K
    Paruthi, V
    Baumgartner, J
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2005, : 1298 - 1303
  • [26] A Correctly Rounded Mixed-Radix Fused-Multiply-Add
    Jeangoudoux, Clothilde
    Lauter, Christoph
    2018 IEEE 25TH SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH), 2018, : 21 - 28
  • [27] Mechanical derivation of fused multiply-add algorithms for linear transforms
    Voronenko, Yevgen
    Pueschel, Markus
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (09) : 4458 - 4473
  • [28] Fused Multiply-Add for Variable Precision Floating-Point
    Nannarelli, Alberto
    32ND IEEE INTERNATIONAL SYSTEM ON CHIP CONFERENCE (IEEE SOCC 2019), 2019, : 342 - 347
  • [29] A Decimal Floating-Point Fused-Multiply-Add Unit
    Samy, Rodina
    Fahmy, Hossam A. H.
    Raafat, Ramy
    Mohamed, Amira
    ElDeeb, Tarek
    Farouk, Yasmin
    53RD IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, 2010, : 529 - 532
  • [30] Floating-point fused multiply-add with reduced latency
    Lang, T
    Bruguera, JD
    ICCD'2002: IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 2002, : 145 - 150