Skip to main content
SpringerLink
Log in

Negative Save Sign Extension for Multi-term Adders and Multipliers

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

This paper outlines a new sign extension technique for use in carry save adder trees that reduces the computational complexity. The “Negative Save” technique presented is a modification to the Baugh–Wooley sign extension technique developed for array multipliers. Applying this sign extension technique to both parallel adder and multiplier partial product structures reduces the hardware required. The speed of the resulting structures is also improved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. S. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Trans. Electron. Comput., vol. EC-13, 1964, pp. 14–17.

    Article  Google Scholar 

  2. L. Dadda, “Some Schemes for Parallel Multipliers,” Alta Freq., vol. 34, 1965, pp. 349–356.

    Google Scholar 

  3. A. D. Booth, “A Signed Binary Multiplication Technique,” Q. J. Mech. Appl. Math., vol. 4(Pt. 2), 1951, pp. 236–240.

    Article  MATH  MathSciNet  Google Scholar 

  4. O. L. MacSorley, “High-speed Arithmetic in Binary Computers,” Proc. IRE, vol. 49,1961, pp. 67–91.

    Article  MathSciNet  Google Scholar 

  5. G. W. Bewick, Fast Multiplication: Algorithms and Implementation, Doctoral Dissertation, Stanford University, 1994, pp. 138–143.

  6. R. C. Baugh and B. A. Wooley, “A Two’s Complement Parallel Array Multiplication Algorithm,” IEEE Trans. Comput., vol. C-22, 1973, pp. 143–145.

    Article  Google Scholar 

  7. P. E. Blankenship, “Comments on A Two’s Complement Parallel Array Multiplication Algorithm,” IEEE Trans. Comput., vol. C-23, 1974, p. 1327.

    Article  Google Scholar 

  8. D. Kroft, “Comments on A Two’s Complement Parallel Array Multiplication Algorithm,” IEEE Trans. Comput., vol. C-23, 1974, pp. 1327–1328.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, 78712, USA

    Robert T. Grisamore & Earl E. Swartzlander Jr.

Authors
  1. Robert T. Grisamore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Earl E. Swartzlander Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert T. Grisamore.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grisamore, R.T., Swartzlander, E.E. Negative Save Sign Extension for Multi-term Adders and Multipliers. J Sign Process Syst Sign Image Video Technol 52, 1–11 (2008). https://doi.org/10.1007/s11265-007-0084-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-007-0084-3

Keywords

Search

Navigation