skip to main content
article
Free Access

Two's-complement multiplication

Published:01 March 1979Publication History
Skip Abstract Section

Abstract

Two's complement multiplication, defined in terms of adds, subtracts, and shifts, is derived from a novel expression relating a two's-complement number and its integer interpretation. Although the derived algorithm is considered well known, the derivation itself is believed to be original and easily grasped. Implementation of the algorithm in terms of computer arithmetic is shown to be safe from overflow except for the case when the multiplier is 10...0 (max. negative). In this case, the resulting product will have the proper magnitude but the wrong algebraic sign. The implementation can, however, be modified to handle this special case properly.

References

  1. QM-1 Hardware Level User's Manual, Second Edition, Revision 4, Nanodata Corporation, Williamsville, New York (March 1976).Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGMICRO Newsletter
    ACM SIGMICRO Newsletter  Volume 10, Issue 1
    March 1979
    26 pages
    ISSN:1050-916X
    DOI:10.1145/1217236
    Issue’s Table of Contents

    Copyright © 1979 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 March 1979

    Check for updates

    Qualifiers

    • article
  • Article Metrics

    • Downloads (Last 12 months)47
    • Downloads (Last 6 weeks)3

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!