US4276607A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiplier circuit which detects and skips over trailing zeros
Assignee: Unisys Corp
•
Filing: 1979-04-09
•
Granted: 1981-06-30
•
Expires: 1999-04-09
Abstract
Abstract This invention is directed at an apparatus and method for detecting zero operand information and which also serves to detect trailing zeros. This circuit has application in computer circuitry, systems or the like wherein elongated information trains represented by multiple words of multiple bits are multiplied by equally long information trains. In many cases, the trains comprise a plurality of trailing zeros which, in accordance with the operation of this circuit, can be detected whereby the multiplication operation can be significantly speeded by avoiding unnecessary multiplication by zeros without loss of accuracy.
Inventors
- 👤 Wilson T. Wong
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 21:55
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
136 words
A multiplier circuit comprising, register means for storing the bits of a number to be multiplied, decoder means connected to receive bits from said register means to produce an output signal representative of said number to be multiplied, detector means for operating on said number to be multiplied to detect the presence of a non-zero bit in said number, control register means connected to said decoder means for indicating the presence of a non-zero bit in said number to be multiplied when said control register means is enabled by a signal from said detector means as the result of detecting a non-zero bit, and shift counter-means connected to said control register means for controlling the number of shifts to be performed during the multiplication process as a function of a signal from said control register means.
Claim 2
Dependent Claim
136 words
A multiplier circuit comprising, register means for storing the bits of a number to be multiplied, decoder means connected to receive bits from said register means to produce an output signal representative of said number to be multiplied, detector means for operating on said number to be multiplied to detect the presence of a non-zero bit in said number, control register means connected to said decoder means for indicating the presence of a non-zero bit in said number to be multiplied when said control register means is enabled by a signal from said detector means as the result of detecting a non-zero bit, and shift counter-means connected to said control register means for controlling the number of shifts to be performed during the multiplication process as a function of a signal from said control register means.
Claim 3
Dependent Claim
32 words
The multiplier circuit recited in claim 1 wherein, said register means comprises a plurality of register sections connected together such that portions of said number are respectively stored in said register sections.
Claim 4
Dependent Claim
25 words
The multiplier circuit recited in claim 2 wherein, said register sections are parallel connected so that two bits are produced substantially simultaneously by a section.
Claim 5
Dependent Claim
42 words
The multiplier circuit recited in claim 2 wherein, said detector means is connected to receive bits concurrently with one of said register sections thereby to identify a non-zero bit in terms of the portion of the number stored in a register section.
Claim 6
Dependent Claim
31 words
The multiplier circuit recited in claim 2 wherein said register means is connected to receive the least significant bits first, and said detector means operates on said least significant bits first.
Claim 7
Dependent Claim
40 words
The multiplier circuit recited in claim 1 including, work number means for identifying a portion of said number, said word number means connected to said control register means to identify the portion of the number which includes a non-zero bit.
Claim 8
Dependent Claim
28 words
The multiplier circuit recited in claim 6 including, second multiplexer means connected to said register means for controlling the application and storage of bits in said register means.
Claim 9
Dependent Claim
22 words
The multiplier circuit recited in claim 7 wherein, said second multiplexer means is connected to receive signals from said work number means.
Claim 10
Dependent Claim
45 words
The multiplier circuit recited in claim 1 wherein, said decoder means includes multiplexer means connected to receive bits from said register means and to produce an output signal representative of the received bits as a function of the signal supplied thereto by said control register.
Claim 11
Dependent Claim
29 words
The multiplier circuit recited in claim 9 wherein, said shift counter means and said multiplexer means connected to be controlled by the same signals from said control register means.
Claim 12
Dependent Claim
36 words
The multiplier circuit recited in claim 9 wherein, said multiplexer means is connected to receive at least one odd bit from said register means and to receive at least one even bit from said register means.
Claim 13
Dependent Claim
26 words
The multiplier circuit recited in claim 11 wherein, said odd bit and said even bit are produced by said register means at substantially the same time.
Claim 14
Dependent Claim
40 words
The multiplier circuit recited in claim 1 including, an end of shift multiplexer connected to said shift counter means for indicating that the appropriate number of bit shifts have occurred so that all previously skipped trailing zeros are accounted for.
Claim 15
Dependent Claim
33 words
The multiplier circuit recited in claim 1 wherein said control register means produces an output signal representative of the lowest order portion of the number to be multiplied which contains a non-zero bit.
Claim 16
Dependent Claim
32 words
The multiplier circuit recited in claim 1 including, data source means connected to said detector means and said register means such that the bits of said number are applied thereto substantially concurrently.
Claim 17
Dependent Claim
85 words
The multiplier circuit recited in claim 1 wherein, said detector means includes a first plurality of logic gate devices for receiving and operating upon the individual bits of said number to be multiplied, and a second plurality of logic gate devices for receiving and operating upon the signal produced by said first plurality of logic gate devices in conjunction with specified control signals in order to produce an output signal from said detector means representative of a non-zero condition in said work to be multiplied.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-06-29 | 1984-12-29 | 1985-06-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-06-29 | 1988-12-29 | 1989-06-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-06-29 | 1992-12-29 | 1993-06-30 | $7700.00 | Window Closed / Lapsed |