US5396503A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for communicating data
Assignee: HP Inc
•
Filing: 1993-02-19
•
Granted: 1995-03-07
•
Expires: 2013-02-19
Abstract
Abstract Data to be communicated over a plurality of channels is divided into blocks (A1,B1,C1,D1,A2,B2, . . . ), and each successive block is transmitted along a different channel (A,B,C,D) on a cyclic basis. A 5-to-6 bit coding scheme is used with some data values having one possible encoding, with three binary ones, and the remainder having two possible encodings, one with two binary ones and the other with four binary ones. To maintain d.c. balance on each channel, two-ones and four-ones encodings are used alternately for successive occurrences on a channel of any data value having dual encodings. To assist detection of single-bit errors affecting the encoded data, a delimiter having one of two possible values is sent after the final block on each channel; this delimiter value is chosen in accordance with which encoding would have been selected if another dual-encoding data value had occurred on that channel.
Inventors
- 👤 Patricia A. Thaler
- 👤 Jonathan Jedwab
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 08:09
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/22; H04L25/00; H04L25/02; H04L25/14; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
247 words
A method for communicating encoded data over a channel using a code having two groups of data values, the method comprising the steps of: (a) encoding each data value in a first group of data values into a corresponding code word of weight n; (b) encoding each data value in a second group of data values into one of a corresponding plurality of code words, a first of the corresponding plurality of code words being of weight n+x and a second of the corresponding plurality of code words being of weight n+y, wherein x does not equal y; (c) transmitting code words for data values in the second group over the channel so that when a most recently transmitted code word for a data value in the second group had a weight of n+x, a next to be transmitted code word for a data value in the second group will have a weight of n+y, and so that when the most recently transmitted code word for a data value in the second group had a weight of n+y, the next to be transmitted code word for a data value in the second group will have a weight of n+x; and, (d) terminating communication of data over said channel with a delimiter selected from at least two predetermined delimiters in accordance with the weight which would be selected for a code word corresponding to a data value in said second group and occurring in place of said delimiter.
Claim 2
Independent Claim
247 words
A method for communicating encoded data over a channel using a code having two groups of data values, the method comprising the steps of: (a) encoding each data value in a first group of data values into a corresponding code word of weight n; (b) encoding each data value in a second group of data values into one of a corresponding plurality of code words, a first of the corresponding plurality of code words being of weight n+x and a second of the corresponding plurality of code words being of weight n+y, wherein x does not equal y; (c) transmitting code words for data values in the second group over the channel so that when a most recently transmitted code word for a data value in the second group had a weight of n+x, a next to be transmitted code word for a data value in the second group will have a weight of n+y, and so that when the most recently transmitted code word for a data value in the second group had a weight of n+y, the next to be transmitted code word for a data value in the second group will have a weight of n+x; and, (d) terminating communication of data over said channel with a delimiter selected from at least two predetermined delimiters in accordance with the weight which would be selected for a code word corresponding to a data value in said second group and occurring in place of said delimiter.
Claim 3
Dependent Claim
12 words
The method of claim 1, wherein x has a value of -1.
Claim 4
Dependent Claim
12 words
The method of claim 1, wherein y has a value of 1.
Claim 5
Dependent Claim
39 words
The method of claim 1, wherein each data value in said first group has one code word, and each data value in said second group has one code word of weight n+x and one code word of weight n+y.
Claim 6
Dependent Claim
26 words
The method of claim 1, wherein said data values are 5-bit data words which are encoded using the code words in the table of FIG. 3.
Claim 7
Dependent Claim
14 words
The method of claim 1, wherein said predetermined delimiter values are 111111000000 and 000000111111.
Claim 8
Dependent Claim
66 words
The method of claim 1, wherein data is transmitted over a plurality of channels, wherein communication of data over each respective channel is terminated with a delimiter selected from at least two predetermined delimiters in accordance with the weight which would be selected for a code word corresponding to a data value in said second group and occurring on that channel in place of said delimiter.
Claim 9
Dependent Claim
45 words
A method as in claim 1 wherein in step (a) each data value in the first group is encoded into its own unique corresponding code word of weight n so that each code word of weight n corresponds to, at most, one encoded data value.
Claim 10
Dependent Claim
260 words
Apparatus for communicating encoded data over a channel, using a code having two groups of data values, comprising: means for encoding data values in a first group so that each data value in the first group is encoded to a corresponding code word of weight n; means for encoding data values in a second group so that each data value in the second group is encoded into one of a corresponding plurality of code words, a first of the corresponding plurality of code words being of weight n+x and a second of the corresponding plurality of code words being of weight n+y, wherein x does not equal y; means for transmitting code words for data values in the second group over the channel so that when a most recently transmitted code word for a data value in the second group had a weight of n+x, a next to be transmitted code word for a data value in the second group will have a weight of n+y, and so that when the most recently transmitted code word for a data value in the second group had a weight of n+y, the next to be transmitted code word for a data value in the second group will have a weight of n+x; and means for terminating communication of a packet over said channel with a delimiter selected from at least two predetermined delimiters in accordance with the weight which would be selected for a code word corresponding to a data value in said second group and occurring in place of said delimiter.
Claim 11
Dependent Claim
260 words
Apparatus for communicating encoded data over a channel, using a code having two groups of data values, comprising: means for encoding data values in a first group so that each data value in the first group is encoded to a corresponding code word of weight n; means for encoding data values in a second group so that each data value in the second group is encoded into one of a corresponding plurality of code words, a first of the corresponding plurality of code words being of weight n+x and a second of the corresponding plurality of code words being of weight n+y, wherein x does not equal y; means for transmitting code words for data values in the second group over the channel so that when a most recently transmitted code word for a data value in the second group had a weight of n+x, a next to be transmitted code word for a data value in the second group will have a weight of n+y, and so that when the most recently transmitted code word for a data value in the second group had a weight of n+y, the next to be transmitted code word for a data value in the second group will have a weight of n+x; and means for terminating communication of a packet over said channel with a delimiter selected from at least two predetermined delimiters in accordance with the weight which would be selected for a code word corresponding to a data value in said second group and occurring in place of said delimiter.
Claim 12
Dependent Claim
12 words
The apparatus of claim 9, wherein x has a value of -1.
Claim 13
Dependent Claim
12 words
The apparatus of claim 9, wherein y has a value of 1.
Claim 14
Dependent Claim
39 words
The apparatus of claim 9, wherein each data value in said first group has one code word, and each data value in said second group has one code word of weight n+x and one code word of weight n+y.
Claim 15
Dependent Claim
28 words
The apparatus of claim 9, wherein said data values are 5-bit words and including means for encoding said data values in accordance with the table of FIG. 3.
Claim 16
Dependent Claim
14 words
The apparatus of claim 9, wherein said predetermined delimiter values are 111111000000 and 000000111111.
Claim 17
Dependent Claim
68 words
The apparatus of claim 9, wherein data is transmitted over a plurality of channels, and including means for terminating communication of data over each respective channel with a delimiter selected from at least two predetermined delimiters in accordance with the weight which would be selected for a code word corresponding to a data value in said second group and occurring on that channel in place of said delimiter.
Claim 18
Dependent Claim
51 words
An apparatus as in claim 9 wherein the means for encoding data values in the first group encodes each data value in the first group into its own unique corresponding code word of weight n so that each code word of weight n corresponds to, at most, one encoded data value.
References Cited (Backward Citations)
GB1540617A
Cited
GB1250908A
Cited
US4117277A
Cited
US4123710A
Cited
US4270203A
Cited
US4383316A
Cited
US4611326A
Cited
US4775987A
Cited
US4594707A
Cited
US5121391A
Cited
US4805194A
Cited
GB2191662A
Cited
US4980897A
Cited
US4933930A
Cited
US5255287A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-03-06 | 1998-09-05 | 1999-03-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-03-06 | 2002-09-05 | 2003-03-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-03-06 | 2006-09-05 | 2007-03-07 | $7700.00 | Window Closed / Lapsed |