Patent JPS641799A successfully refreshed from Google Patents.
EP0612175A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Line coding for split channel transmission
Assignee: HP Inc
•
Filing: 1994-01-24
•
Granted: —
•
Expires: 2014-01-24
Abstract
Abstract Data to be communicated over a plurality of channels are 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
EP
Data Source
google_patents
Last Synchronized
2026-11-07 17:58
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: 14
Claim 1
Independent Claim
146 words
A method for communicating encoded data over a channel, using a code having two groups of data values, each data value in a first group having one or more code words all of weight n , and each data value in a second group having a plurality of code words each of which is of weight n + x or n + y and having at least one code word of each weight, code words of weight n + x and n + y being selected alternately upon each occurrence of any data value in said second group, wherein communication of data over said 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 in place of said delimiter.
Claim 2
Dependent Claim
12 words
The method of claim 1, wherein x has a value of -1.
Claim 3
Dependent Claim
15 words
The method of claim 1 or claim 2, wherein y has a value of 1.
Claim 4
Independent Claim
48 words
The method of any one of the preceding claims, 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 5
Independent Claim
30 words
The method of any one of the preceding claims, wherein said data values are 5-bit data words which are encoded using the code words in the table of Figure 3.
Claim 6
Independent Claim
18 words
The method of any one of the preceding claims, wherein said predetermined delimiter values are 111111000000 and 000000111111.
Claim 7
Independent Claim
70 words
The method of any one of the preceding claims, wherein data are 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 8
Dependent Claim
157 words
Apparatus for communicating encoded data over a channel, using a code having two groups of data values, each data value in a first group having one or more code words all of weight n, and each data value in a second group having a plurality of code words each of which is of weight n + x or n + y and having at least one code word of each weight, comprising: means for encoding data values in said first group; means for selecting code words of weight n + x and n + y alternately upon each occurrence of any data value in said second group; 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 9
Dependent Claim
12 words
The apparatus of claim 8, wherein x has a value of -1.
Claim 10
Dependent Claim
15 words
The apparatus of claim 8 or claim 9, wherein y has a value of 1.
Claim 11
Independent Claim
49 words
The apparatus of any one of claims 8 to 10, 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 12
Independent Claim
34 words
The apparatus of any one of claims 8 to 11, wherein said data values are 5-bit data words and including means for encoding said data values in accordance with the table of Figure 3.
Claim 13
Independent Claim
19 words
The apparatus of any one of claims 8 to 12, wherein said predetermined delimiter values are 111111000000 and 000000111111.
Claim 14
Independent Claim
73 words
The apparatus of any one of claims 8 to 13, wherein data are 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.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.