US5034741A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Variable length bit patterns for data representation
Assignee: RTX Corp
•
Filing: 1990-03-22
•
Granted: 1991-07-23
•
Expires: 2010-03-22
Abstract
Abstract Representational efficiency is realized by employing a set (6) of variable length bit patterns (7-14) having a first and last bit equal to a particular binary value and havin only singularly occurring bits equal to said value. The patterns (7-14) can be unambiguously concatenated to form a data stream (15). A communication system (16) can achieve improved throughout by employing said patterns (16).
Inventors
- 👤 Eugene I. Barzach
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 19:37
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/40
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
69 words
In a method of using a set of bit patterns to represent a set of data elements, a step of mapping each unique one of said data elements into a unique one of said bit patterns wherein each of said patterns has a first and last bit equal to a particular binary value and wherein each of said patterns has only singularly occurring bits equal to said binary value.
Claim 2
Dependent Claim
69 words
In a method of using a set of bit patterns to represent a set of data elements, a step of mapping each unique one of said data elements into a unique one of said bit patterns wherein each of said patterns has a first and last bit equal to a particular binary value and wherein each of said patterns has only singularly occurring bits equal to said binary value.
Claim 3
Dependent Claim
13 words
A method, according to claim 1, where said particular binary value is zero.
Claim 4
Dependent Claim
13 words
A method, according to claim 1, where said particular binary value is one.
Claim 5
Dependent Claim
29 words
A method, according to claim 2, wherein the most frequently occurring elements within said set of data elements are mapped to bit patterns having the least number of bits.
Claim 6
Dependent Claim
29 words
A method, according to claim 3, wherein the most frequently occurring elements within said set of data elements are mapped to bit patterns having the least number of bits.
Claim 7
Dependent Claim
90 words
A communication system, comprising: a first data mapper for translating input data into a set of bit patterns having a first and a last bit equal to a particular binary value and having only singularly occurring bits equal to said value and for concatenating said bit patterns into a bit stream; a transmitter, for transmitting said bit stream; a receiver, for receiving said bit stream; and a second data mapper for dividing said stream into a plurality of variable length bit patterns and for translating said patterns into output data.
Claim 8
Dependent Claim
90 words
A communication system, comprising: a first data mapper for translating input data into a set of bit patterns having a first and a last bit equal to a particular binary value and having only singularly occurring bits equal to said value and for concatenating said bit patterns into a bit stream; a transmitter, for transmitting said bit stream; a receiver, for receiving said bit stream; and a second data mapper for dividing said stream into a plurality of variable length bit patterns and for translating said patterns into output data.
Claim 9
Dependent Claim
14 words
A communication system, according to claim 6, wherein said particular binary value is zero.
Claim 10
Dependent Claim
14 words
A communication system, according to claim 6, wherein said particular binary value is one.
Claim 11
Dependent Claim
33 words
A communication system, according to claim 7, wherein said input data is in the ASCII format 10. A communication system, according to claim 8, wherein said output data is in the ASCII format.
Claim 12
Dependent Claim
16 words
A communication system, according to claim 8, wherein said output data is in the ASCII format.
References Cited (Backward Citations)
US3016527A
Cited
US3051940A
Cited
US3675212A
Cited
US3675211A
Cited
US3701111A
Cited
US3716851A
Cited
US3717851A
Cited
US3689899A
Cited
US4247891A
Cited
US4358852A
Cited
US4396906A
Cited
US4463344A
Cited
US4597057A
Cited
JPS6069943A
Cited
US4598326A
Cited
US4618846A
Cited
US4899149A
Cited
US4675652A
Cited
US4882583A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-22 | 1995-01-21 | 1995-07-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-22 | 1999-01-21 | 1999-07-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-22 | 2003-01-21 | 2003-07-23 | $7700.00 | Window Closed / Lapsed |