US4586152A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for counting an infinite length with a counter of finite length
Assignee: Hitachi Ltd
•
Filing: 1983-04-08
•
Granted: 1986-04-29
•
Expires: 2003-04-08
Abstract
Abstract An endless counting apparatus comprises a first memory for storing a code of a first predetermined number of bits sufficient to represent the maximum value of each coded input expressed according to the binary notation, a second memory for storing an endless-making code of a second predetermined number of bits of higher order than and contiguous to the less and least significant bits stored in the first memory, and a control circuit for adding or subtracting the value of the coded input to or from the contents of the first and second memories depending on the input value to be counted and applying the result of addition or subtraction to the first and second memories. A method for endless counting by such an apparatus comprises clearing the most significant bit of the endless making code stored in the second memory when the code stored in the second memory has attained a value which causes an overflow due to a carry from the contents of the first memory if the carry occurs, and setting the most significant bit of the endless-making code stored in the second memory when the code stored in the second memory has attained a value which causes an underflow due to a borrow from the contents of the first memory if the borrow occurs.
Inventors
- 👤 Hiroshi Hayashida
- 👤 Kunio Miyashita
- 👤 Tadashi Takahashi
- 👤 Shigeki Morinaga
- 👤 Kosho Ishizaki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 21:04
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/18; G05B19/19; G05B19/27; G05B19/29; G05B19/291; G05B19/293; B; B41; B41J; B41J11/00; B41J11/36; B41J11/42; G05B2219/00; G05B2219/30; G05B2219/34; G05B2219/34053; G05B2219/34215
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
226 words
A method for endless counting by an apparatus comprising a first memory for storing a code of a first predetermined number of bits sufficient to represent the maximum value of each coded input expressed according to binary notation, a second memory for storing an endless-making code of a second predetermined number of bits of higher order than and contiguous to the less and least significant bits stored in said first memory, and arithmetic means for adding or subtracting the value of the coded input to or from the contents of said first and second memories depending on the input value to be counted and applying the result of addition or subtraction to said first and second memories, said method comprising the steps of: clearing the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an overflow in response to a carry from the contents of said first memory during an adding operation by said arithmetic means; and setting the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an underflow in response to a borrow from the contents of said first memory during a subtracting operation by said arithmetic means.
Claim 2
Independent Claim
226 words
A method for endless counting by an apparatus comprising a first memory for storing a code of a first predetermined number of bits sufficient to represent the maximum value of each coded input expressed according to binary notation, a second memory for storing an endless-making code of a second predetermined number of bits of higher order than and contiguous to the less and least significant bits stored in said first memory, and arithmetic means for adding or subtracting the value of the coded input to or from the contents of said first and second memories depending on the input value to be counted and applying the result of addition or subtraction to said first and second memories, said method comprising the steps of: clearing the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an overflow in response to a carry from the contents of said first memory during an adding operation by said arithmetic means; and setting the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an underflow in response to a borrow from the contents of said first memory during a subtracting operation by said arithmetic means.
Claim 3
Dependent Claim
51 words
An endless counting method as claimed in claim 1, wherein said first and second memories store information of the present position of a movable body to be subjected to positioning control, and said coded input is position information for moving the movable body from the present position to the desired position.
Claim 4
Dependent Claim
29 words
An endless counting method as claimed in claim 2, wherein said first and second memories are disposed in the same word region of a single memory by bit division.
Claim 5
Dependent Claim
29 words
An endless counting method as claimed in claim 1, wherein said first and second memories are disposed in the same word region of a single memory by bit division.
Claim 6
Dependent Claim
22 words
An endless counting method as claimed in claim 1, wherein the number of bits of said endless-making code is three or more.
Claim 7
Independent Claim
241 words
An apparatus for endless counting by addition and subtraction of data comprising: a first memory for storing a code of a first predetermined number of bits sufficient to represent the maximum value of each coded input expressed according to the binary notation; a second memory for storing an endless-making code of a second predetermined number of bits of higher order than and contiguous to the less and least significant bits stored in said first memory; computing means for adding or subtracting the value of the coded input to or from the contents of said first and second memories depending on the input value to be counted and generating the result of computation; means for applying the result of computation generated from said computing means to said first and second memories; first circuit means for cleaning the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an overflow in response to a carry from the contents of said first memory during an adding operation by said computing means; and second circuit means for setting the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an underflow in response to a borrow from the contents of said first memory during a subtraction operation by said computing means.
Claim 8
Independent Claim
241 words
An apparatus for endless counting by addition and subtraction of data comprising: a first memory for storing a code of a first predetermined number of bits sufficient to represent the maximum value of each coded input expressed according to the binary notation; a second memory for storing an endless-making code of a second predetermined number of bits of higher order than and contiguous to the less and least significant bits stored in said first memory; computing means for adding or subtracting the value of the coded input to or from the contents of said first and second memories depending on the input value to be counted and generating the result of computation; means for applying the result of computation generated from said computing means to said first and second memories; first circuit means for cleaning the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an overflow in response to a carry from the contents of said first memory during an adding operation by said computing means; and second circuit means for setting the most significant bit of the endless-making code stored in said second memory when the code stored in said second memory has attained a value which will cause an underflow in response to a borrow from the contents of said first memory during a subtraction operation by said computing means.
Claim 9
Dependent Claim
51 words
An endless counting apparatus as claimed in claim 6, wherein said first and second memories store information of the present position of a movable body to be subjected to positioning control, and said coded input is position information for moving the movable body from the present position to the desired position.
Claim 10
Dependent Claim
27 words
An endless counting apparatus as claimed in claim 7, wherein said first and second memories are disposed in a single memory by bit division of a word.
Claim 11
Dependent Claim
27 words
An endless counting apparatus as claimed in claim 6, wherein said first and second memories are disposed in a single memory by bit division of a word.
Claim 12
Dependent Claim
22 words
An endless counting apparatus as claimed in claim 6, wherein the number of bits of said endless-making code is three or more.
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) | 1989-04-28 | 1989-10-28 | 1990-04-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-04-28 | 1993-10-28 | 1994-04-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-04-28 | 1997-10-28 | 1998-04-29 | $7700.00 | Window Closed / Lapsed |