US4817047A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Processing circuit capable of raising throughput of accumulation
Assignee: NEC Corp
•
Filing: 1986-07-09
•
Granted: 1989-03-28
•
Expires: 2006-07-09
Abstract
Abstract A digital signal processing circuit reduces the occurrence of overflow conditions during successive arithmetic operations. The product output of a multiplication circuit is shifted by a barrel shifter to round off a predetermined number of least significant bits, thereby reducing the occurrence of an overflow condition when the successive product outputs of the multiplication circuit are summed by an arithmetic logic unit (ALU) to produce a summed output. The summed output is then shifted toward the most significant bit by a predetermined number before an output signal is generated. An overflow detection and correction circuit is provided in the event of an overflow condition occurring either to the ALU or the barrel shifter.
Inventors
- 👤 Takao Nishitani
- 👤 Ichiro Kuroda
- 👤 Hideo Tanaka
- 👤 Kyosuke Sugishita
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 07:09
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/544; G06F7/5443; G06F17/00; G06F17/10; G06F7/499; G06F7/49905; G06F7/4991; G06F7/49921
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
359 words
A processing circuit comprising: multiplication means for successively multiplying a first input data signal by a second input data signal to produce product signals, each product signal being representative of a result of said successive multiplication, each of said first and second input data signals being represented by a fixed-point representation of a single precision bit length and arranged from a most significant bit to a least significant bit and summing means coupled to said multiplication means for successively summing up said product signals a first predetermined number of times to produce an accumulation signal, each of said product signals is represented by the fixed-point representation of a double precision bit length and arranged from a most significant bit to a least significant bit, said summing means comprising: selecting means responsive to a selection signal for selecting one of said product signals and said accumulation signal; shifting means coupled to said selecting means for shifting said product signals towards the least significant bit of said product signals by a second predetermined number of bits to produce a succession of shifted product signals each of which has the double precision bit length and for shifting said accumulation signal towards the most significant bit of said accumulation signal by a third predetermined number of bits to produce a shifted accumulation signal; accumulating means coupled to said shifting means for successively accumulating said first predetermined number of times the shifted product signals to produce said accumulation signal representative of a result of accumulation, said accumulation signal having the double precision bit length and being arranged from a most significant bit to a least significant bit; overflow monitoring means coupled to said accumulating means and said shifting means for monitoring an occurrence of an overflow in said shifted accumulation signal to process said shifted accumulation signal and thereby to produce a processed signal which is representative of a result of monitoring and has the double precision bit length; and output means for producing a sum signal as an output of said processing circuit based on said processed signal, said sum signal being represented by the fixed-point representation of the single precision bit length.
Claim 2
Dependent Claim
359 words
A processing circuit comprising: multiplication means for successively multiplying a first input data signal by a second input data signal to produce product signals, each product signal being representative of a result of said successive multiplication, each of said first and second input data signals being represented by a fixed-point representation of a single precision bit length and arranged from a most significant bit to a least significant bit and summing means coupled to said multiplication means for successively summing up said product signals a first predetermined number of times to produce an accumulation signal, each of said product signals is represented by the fixed-point representation of a double precision bit length and arranged from a most significant bit to a least significant bit, said summing means comprising: selecting means responsive to a selection signal for selecting one of said product signals and said accumulation signal; shifting means coupled to said selecting means for shifting said product signals towards the least significant bit of said product signals by a second predetermined number of bits to produce a succession of shifted product signals each of which has the double precision bit length and for shifting said accumulation signal towards the most significant bit of said accumulation signal by a third predetermined number of bits to produce a shifted accumulation signal; accumulating means coupled to said shifting means for successively accumulating said first predetermined number of times the shifted product signals to produce said accumulation signal representative of a result of accumulation, said accumulation signal having the double precision bit length and being arranged from a most significant bit to a least significant bit; overflow monitoring means coupled to said accumulating means and said shifting means for monitoring an occurrence of an overflow in said shifted accumulation signal to process said shifted accumulation signal and thereby to produce a processed signal which is representative of a result of monitoring and has the double precision bit length; and output means for producing a sum signal as an output of said processing circuit based on said processed signal, said sum signal being represented by the fixed-point representation of the single precision bit length.
Claim 3
Dependent Claim
101 words
A processing circuit as claimed in claim 1, wherein said overflow monitoring means comprises: overflow detecting means coupled to said shifting means for detecting occurrence of said overflow in said shifted accumulation signal to produce an overflow signal on the occurrence of said overflow; and substituting means coupled to said overflow detecting means for substituting a preselected signal for said shifted accumulation signal to produce said preselected signal as said processed signal when said overflow signal is received by said overflow detecting means and for producing said shifted accumulation signal as said processed signal when said overflow signal is not received.
Claim 4
Dependent Claim
32 words
A processing circuit as claimed in claim 1, wherein said second predetermined number is a minimum integer L which is not smaller than: log.sub.2 M where M represents said first predetermined number.
Claim 5
Dependent Claim
80 words
A processing circuit as claimed in claim 3, wherein one of said first and said second input data signals represents a first value which is not smaller than -2 K and is smaller than 2 K , where K is a natural number, while the other of said first and said second input data signals stands for a second value which is not smaller than -1 and is smaller than +1, and said third predetermined number is equal to: K+L.
Claim 6
Dependent Claim
39 words
A processing circuit as claimed in claim 1, wherein said second predetermined number is an integer L' which is smaller than a minimum integer L which is not smaller than: log.sub.2 M, where M represents said first predetermined number.
Claim 7
Dependent Claim
80 words
A processing circuit as claimed in claim 5, wherein one of said first and said second input data signals represents a first value which is not smaller than -2 k and is smaller than 2 k , where K is a natural number, while the other of said first and said second input data signals stands for a second value which is not smaller than -1 and is smaller than +1, and said third predetermined number is equal to: K+L'.
References Cited (Backward Citations)
US4075688A
Cited
US4511990A
Cited
EP0136834A2
Cited
EP0161089A2
Cited
WO1986002181A1
Cited
JPH0654070A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-03-27 | 1992-09-26 | 1993-03-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-03-27 | 1996-09-26 | 1997-03-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-03-27 | 2000-09-26 | 2001-03-28 | $7700.00 | Window Closed / Lapsed |