• DocumentCode
    2780260
  • Title

    Area×delay (A·T) efficient multiplier based on an intermediate hybrid signed-digit (HSD-1) representation

  • Author

    Lue, Jeng-Jong J. ; Phatak, Dhananjay S.

  • Author_Institution
    Summit Syst. Inc., New York, NY, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    216
  • Lastpage
    224
  • Abstract
    Intermediate Signed Digit (SD) representation can facilitate fast and compact VLSI implementations of partial product accumulation trees. It achieves a reduction ratio of 2:1 at every level and also leads to more regular layouts. Its disadvantage is that the number of bit lines that need to be routed can be high. This can lead to a significant area overhead especially at smaller feature sizes where the wire/interconnect area and delay can be dominant. A Hybrid Signed Digit (HSD) representation lets some of the digits be unsigned bits, thereby reducing the number of bit lines. By arbitrarily varying the positions of and distances between consecutive signed digits, this representation can trade off latency for area and offers a continuum of choices between the two´s complement representation on the one hand and fully Signed Digit (FSD or simply SD) representation on the other. We illustrate an A·T (area×delay) efficient multiplier based on the HSD-1 representation which is one of the many possible HSD formats, wherein every alternate digit is signed and the rest are unsigned (ordinary) bits. It is seen that multipliers based on HSD-1 format require more transistors than those based on FSD format. However, they require fewer bit lines to be routed, which substantially reduces the interconnect area; thereby leading to a reduction in the total VLSI area and a lower A·T product. The design reaffirms that the interconnect area can be significant, especially at small feature sizes
  • Keywords
    VLSI; digital arithmetic; multiplying circuits; HSD formats; HSD-1 representation; Intermediate Signed Digit representation; VLSI area; alternate digit; bit lines; compact VLSI implementations; consecutive signed digits; efficient multiplier; feature sizes; fully Signed Digit; interconnect area; intermediate hybrid signed-digit representation; partial product accumulation trees; reduction ratio; regular layouts; twos complement representation; unsigned bits; wire/interconnect area; Arithmetic; Counting circuits; Delay; Prototypes; Routing; Tree data structures; Very large scale integration; Wire;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic, 1999. Proceedings. 14th IEEE Symposium on
  • Conference_Location
    Adelaide, SA
  • ISSN
    1063-6889
  • Print_ISBN
    0-7695-0116-8
  • Type

    conf

  • DOI
    10.1109/ARITH.1999.762847
  • Filename
    762847