Patent · US Expired

Method and apparatus for multiplying two numbers using signed arithmetic

US5422805A · kind A · utility

37Cited by
7References
13Claims
0Family size

Assignee

Inventors

Key dates

Filing dateOct 21, 1992
Grant dateJun 6, 1995
Priority date
Expiry dateOct 21, 2012

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F7/49921
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A signed arithmetic data processing system (20) detects a multiply (MUL) or a multiply-and-accumulate (MAC) instruction in which a multiplier and a multiplicand each assume their respective maximum negative values. If one or both of the operands is not equal to its maximum negative value, the multiplication proceeds normally, such as in a modified Booth's multiplier/MAC (33). However, if both operands are equal to their respective maximum negative values, the data processing system (20) substitutes a maximum positive constant for the output of the multiplier/MAC (33). This substitution allows the result to be expressed with one fewer bits. The resulting error is very small and becomes insignificant in most digital signal processing algorithms, especially those based on fractional, saturation arithmetic. Alternatively, an extra bit of precision may be achieved for a given hardware size.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.