Patent US4305136A successfully refreshed from Google Patents.
US4305136A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of symptom compression
Assignee: Bull HN Information Systems Italia SpA
•
Filing: 1979-11-14
•
Granted: 1981-12-08
•
Expires: 1999-11-14
Abstract
Abstract A method of symptom compression involves a symptom compression device receiving binary coded information including bits signifying symptoms present in the course of each operating cycle at selected points in an integrated logical network, microprocessor or the like. The device includes a first register, a second shift register, an EXCLUSIVE OR logic network, and a display. The binary coded information is received on parallel inputs of the first register and applied from parallel outputs of the first register to a set of inputs of the EXCLUSIVE OR network, a second set of inputs which is connected to at least some parallel outputs from the second shift register. A set of outputs from the EXCLUSIVE OR network is connected to parallel inputs of the second shift register. In each cycle, the bits in the second shift register, which accumulate information representative of symptoms, are shifted in one direction and are recirculated. The display is connected to the parallel outputs from the second shift register. In a second embodiment, a third shift register receives the output from the EXCLUSIVE OR network. A multiplexor selectively applies signals from the outputs of the second or third shift register to the second set of inputs. The bits in the third shift register, which also accumulate information as to symptoms, are shifted in the opposite direction. A second display is connected to the outputs of the third shift register.
Inventors
- 👤 Alfonso Albani
- 👤 Ermanno Maccario
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 22:02
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/22; G06F11/26; G06F11/273; G06F11/277
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
244 words
A method of compressing symptoms for compacting in an output pattern, the symptoms occurring in different cycles during cyclical operation of a network of binary coded information, comprising the steps of: accumulating first binary coded information including bits signifying symptoms present in the course of each operating cycle at selected points in said network; storing second binary coded information representative of a first set of accumulations of said symptoms in storage means; effecting at each cycle of said network a first EXCLUSIVE OR operation, bit by bit, with respect to at least part of said first binary coded information present in the course of each operating cycle at said selected points of said network and at least part of said second binary coded information, representative of said first set of accumulations of said symptoms; effecting at each cycle a first one bit shift operation on the code resulting from said first EXCLUSIVE OR operation; and replacing at each cycle in said storage means said second binary coded information, representative of said first set of accumulations of said symptoms, with the shifted code, representative of accumulations of said symptoms resulting from said first EXCLUSIVE OR operation and said first one bit shift operation, whereby symptoms contained in said first coded information at each cycle are accumulated and compressed in said second binary coded information as a result of repeating said first EXCLUSIVE OR operation and said first one bit shift operation at each said cycle.
Claim 2
Independent Claim
244 words
A method of compressing symptoms for compacting in an output pattern, the symptoms occurring in different cycles during cyclical operation of a network of binary coded information, comprising the steps of: accumulating first binary coded information including bits signifying symptoms present in the course of each operating cycle at selected points in said network; storing second binary coded information representative of a first set of accumulations of said symptoms in storage means; effecting at each cycle of said network a first EXCLUSIVE OR operation, bit by bit, with respect to at least part of said first binary coded information present in the course of each operating cycle at said selected points of said network and at least part of said second binary coded information, representative of said first set of accumulations of said symptoms; effecting at each cycle a first one bit shift operation on the code resulting from said first EXCLUSIVE OR operation; and replacing at each cycle in said storage means said second binary coded information, representative of said first set of accumulations of said symptoms, with the shifted code, representative of accumulations of said symptoms resulting from said first EXCLUSIVE OR operation and said first one bit shift operation, whereby symptoms contained in said first coded information at each cycle are accumulated and compressed in said second binary coded information as a result of repeating said first EXCLUSIVE OR operation and said first one bit shift operation at each said cycle.
Claim 3
Dependent Claim
55 words
A method of compressing symptoms as claimed in claim 1, further comprising the steps of counting the cycles performed during said cyclical operation of said network and stopping the repetition of said first EXCLUSIVE OR operation and said one bit shift operation steps for further cycles when a predetermined number of cycles has been counted.
Claim 4
Dependent Claim
31 words
A method of compressing symptoms as claimed in claim 1, further comprising the step of recirculating at each cycle the one bit overflow resulting from said first one bit shift operation.
Claim 5
Dependent Claim
220 words
A method of compressing symptoms as claimed in claim 1, further comprising the steps of: storing third binary coded information representative of a second set of accumulations of said symptoms in a second storage means; effecting at each cycle a second EXCLUSIVE OR operation bit by bit, with respect to at least part of said first binary coded information present in the course of each operating cycle at selected points of said network and at least part of said third binary coded information, representative of said second set of accumulations of said symptoms; effecting at each cycle a second one bit shift operation on the code resulting from said second EXCLUSIVE OR operation, said second one bit shift operation being in a direction opposite to the direction of said first one bit shift operation; and replacing at each cycle in said second storage means said third binary coded information representative of said second set of accumulations of said symptoms with the shifted code, resulting from said second EXCLUSIVE OR operation and said second one bit shift operation, whereby symptoms contained in said first binary coded information at each cycle are accumulated and compressed in said third binary coded information as a result of repeating the second EXCLUSIVE OR operation and the second one bit shift operation at each said cycle.
Claim 6
Dependent Claim
33 words
A method of compressing symptoms as claimed in claim 4, further comprising the step of recirculating at each cycle the one bit overflow resulting from said first and second one bit shift operations.
References Cited (Backward Citations)
US3024444A
Cited
US3370274A
Cited
US3598979A
Cited
US3771136A
Cited
US3742459A
Cited
US3772654A
Cited
US3780277A
Cited
US3989894A
Cited
US3875344A
Cited
US4021782A
Cited
US4198682A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-12-07 | 1985-06-08 | 1985-12-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-12-07 | 1989-06-08 | 1989-12-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-12-07 | 1993-06-08 | 1993-12-08 | $7700.00 | Window Closed / Lapsed |