• DocumentCode
    3679095
  • Title

    Modulo 2n ± 1 Fused Add-Multiply Units

  • Author

    Constantinos Efstathiou;Kostas Tsoumanis;Kiamal Pekmestzi;Ioannis Voyiatzis

  • Author_Institution
    Dept. of Electr. Eng., Technol. Inst. of Athens, Athens, Greece
  • fYear
    2015
  • fDate
    7/1/2015 12:00:00 AM
  • Firstpage
    91
  • Lastpage
    96
  • Abstract
    Complex arithmetic operations are widely used in Digital Signal Processing (DSP) applications. Targeting to increase performance, in this work, we focus on optimizing the design of the modulo 2n ± 1 Add-Multiply (AM) operation. The proposed modulo 2n ± 1 fused AM units incorporate an initial row of Half Adders which carry out the requested addition of two specified operands resulting to an intermediate Delayed Carry representation of their sum. The Delayed Carry represented vectors are then multiplied by the specified multiplicand and the partial products are driven to OR logic gates in pairs. Using the appropriate Carry-Save (CS) Adder trees, the resulting n-bit operands are reduced to a pair of CS vectors, which are finally added by a modulo 2n -- 1 or a modulo 2n + 1 adder. Compared to the conventional designs of first instantiating a modulo 2n ± 1 adder and then, driving its output to a modulo 2n ± 1 multiplier, the proposed fused AM designs yield considerable reductions in terms of critical delay, area complexity and power consumption.
  • Keywords
    "Adders","Delays","Logic gates","Power demand","Complexity theory","Digital signal processing","Clocks"
  • Publisher
    ieee
  • Conference_Titel
    VLSI (ISVLSI), 2015 IEEE Computer Society Annual Symposium on
  • Type

    conf

  • DOI
    10.1109/ISVLSI.2015.12
  • Filename
    7309544