US4965883A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for transmitting and receiving characters using a balanced weight error correcting code
Assignee: Hewlett Packard Development Co LP
•
Filing: 1988-08-24
•
Granted: 1990-10-23
•
Expires: 2008-08-24
Abstract
Abstract A method and apparatus for transmitting data blocks, each data block representing one of a plurality of characters, between a transmitting station and a receiving station of a distributed processing system. The characters are encoded in the transmitting station according to a code set so that each transmitted data block has an equal number binary ones and zeroes and a distance of at least four. The code is self-clocking and allows one bit error correction and AC coupling.
Inventors
- 👤 Alan Kirby
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 22:08
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145
Claims Analysis
Total Claims: 49
Claim 1
Independent Claim
118 words
A distributed processing system for transmitting data blocks from a transmitting station to a receiving station, each data block representing one of a plurality of code words encoding one of a plurality of characters, the distributed processing system comprising: encoding means in the transmitting station for converting each of the plurality of characters to a predetermined corresponding one of a plurality of balanced weight fixed distance code words; transmitting means for transmitting said code words as data blocks; receiving means for receiving said transmitted data blocks; and decoding means in the receiving station for converting each of the received data blocks to the ones of said characters corresponding to the code words represented by said received data blocks.
Claim 2
Dependent Claim
118 words
A distributed processing system for transmitting data blocks from a transmitting station to a receiving station, each data block representing one of a plurality of code words encoding one of a plurality of characters, the distributed processing system comprising: encoding means in the transmitting station for converting each of the plurality of characters to a predetermined corresponding one of a plurality of balanced weight fixed distance code words; transmitting means for transmitting said code words as data blocks; receiving means for receiving said transmitted data blocks; and decoding means in the receiving station for converting each of the received data blocks to the ones of said characters corresponding to the code words represented by said received data blocks.
Claim 3
Dependent Claim
33 words
The distributed processing system of claim 1 wherein said balanced weight fixed-distance code words contain an equal number of ones and zeroes and have a distance from each other of at least four.
Claim 4
Dependent Claim
49 words
The distributed processing system of claim 1, wherein the transmitting station includes a memory containing said balanced weight fixed-distance code words and wherein said encoding means further includes: encode circuitry for converting each of said characters to a corresponding one of said code words according to said predetermined correspondence.
Claim 5
Dependent Claim
176 words
The distributed processing system of claim 1, wherein said receiving station has a memory containing a plurality of target code words corresponding to said balanced weight fixed-distance code words, wherein said predetermined correspondence also exists between the plurality of characters and the target code words, wherein the received data blocks and the target code words consist of data bits, and wherein said decoding means further includes: detecting means for outputting one of a plurality of first match signals identifying a target code word identical to a received data block, for outputting one of said first plurality of first match signals identifying a target code word differing from a received data block by exactly one bit, and for outputting one of a plurality of second match signals when a target code word differs from a received data block by exactly one bit; and converting means coupled to said detecting means for outputting one of the plurality of characters according to said predetermined correspondence between said character and said target code word identified by said first match signal.
Claim 6
Dependent Claim
71 words
The distributed processing system of claim 4, wherein said detecting means of said receiving station includes a plurality of elements, each element including: an exclusive-OR portion for comparing respective bits of one target code word in the memory and one of the received data blocks; and a detecting logic portion coupled to said exclusive-OR portion for outputting said first and second match signals responsive to an output of said exclusive-OR portion.
Claim 7
Dependent Claim
54 words
The distributed processing system of claim 4, wherein said detecting means of said receiving station includes means for outputting an uncorrectable error signal when none of said target code words is identical to a received data block and none of said target code words differs from a received data block by exactly one bit.
Claim 8
Dependent Claim
61 words
The distributed processing system of claim 4, wherein said converting means of said receiving station includes a plurality of elements, each element including: a memory for storing one of said plurality of characters; and means for outputting said one stored character when a first match signal identifying a corresponding one of said target code words is output by said detecting means.
Claim 9
Dependent Claim
50 words
The distributed processing system of claim 1, wherein said encoding means includes means for converting each of the plurality of characters to a fourteen bit code word and wherein said decoding means includes means for converting a fourteen-bit received data block to a corresponding one of the plurality of characters.
Claim 10
Dependent Claim
50 words
The distributed processing system of claim 1, wherein said encoding means includes means for converting each of 260 characters to a predetermined one of said code words and wherein said decoding means includes means for converting each of said received data blocks into a predetermined one of said 260 characters.
Claim 11
Dependent Claim
50 words
The distributed processing system of claim 1, wherein said encoding means includes means for converting each of 257 characters to a predetermined one of said code words and wherein said decoding means includes means for converting each of said received data blocks into a predetermined one of said 257 characters.
Claim 12
Dependent Claim
43 words
The distributed processing system of claim 1, wherein said encoding means includes means for converting control code characters and data characters to code words and wherein said decoding means includes means for converting received data blocks to control code characters and data characters.
Claim 13
Dependent Claim
46 words
The distributed processing system of claim 1, wherein said encoding means includes means for transmitting a resynchronization data block preceding a first one of said data blocks and wherein said decoding means includes means for converting a received data block preceded by said resynchronization data block.
Claim 14
Dependent Claim
27 words
The distributed processing system of claim 1 further including: a clock recovery element in the receiving station for recovering a clock signal from said received data blocks.
Claim 15
Dependent Claim
74 words
A receiving station in a distributed processing system, wherein data blocks representing code words encoding ones of a plurality of characters are received by the receiving station, the receiving station comprising: receiving means for receiving said data blocks; and decoding means for converting each of the received data blocks to a predetermined one of said characters according to a balanced weight fixed-distance code having a predetermined correspondence between the characters and the code words.
Claim 16
Dependent Claim
74 words
A receiving station in a distributed processing system, wherein data blocks representing code words encoding ones of a plurality of characters are received by the receiving station, the receiving station comprising: receiving means for receiving said data blocks; and decoding means for converting each of the received data blocks to a predetermined one of said characters according to a balanced weight fixed-distance code having a predetermined correspondence between the characters and the code words.
Claim 17
Dependent Claim
33 words
The receiving station of claim 14, wherein said code words of said balanced weight fixed-distance code contain an equal number of binary ones and zeroes and have a distance of at least four.
Claim 18
Dependent Claim
172 words
The receiving station of claim 14 having a memory containing a plurality of target code words corresponding to code words of the balanced weight fixed-distance code, wherein said predetermined correspondence also exists between the plurality of characters and the target code words, wherein the received data blocks and the target code words consist of data bits, and wherein said decoding means further includes: detecting means for outputting one of a plurality of first match signals identifying a target code word identical to a received data block, for outputting one of said plurality of first match signals identifying a target code word differing from a received data block by exactly one bit, and for outputting one of a plurality of second match signals when a target code word differs from a received data block by exactly one bit; and converting means coupled to said detecting means for outputting one of the plurality of characters according to said predetermined correspondence between said character and said target code word identified by said first match signal.
Claim 19
Dependent Claim
66 words
The receiving station of claim 16, wherein said detecting means includes a plurality of elements, each element including: an exclusive-OR portion for comparing respective bits of one target code word in the memory and one of the received data blocks; and a detecting logic portion coupled to said exclusive-OR portion for outputting said first and second match signals responsive to the output of said exclusive-OR portion.
Claim 20
Dependent Claim
49 words
The receiving station of claim 16, wherein said detecting means includes means for outputting an uncorrectable error signal when none of said target code words is identical to a received data block and none of said target code words differs from a received data block by exactly one bit.
Claim 21
Dependent Claim
57 words
The receiving station of claim 16, wherein said converting means further includes a plurality of elements, each element including: a memory for storing one of said plurality of characters; and means for outputting said one stored character when a first match signal identifying a corresponding one of said target code words is output by said detecting means.
Claim 22
Dependent Claim
25 words
The receiving station of claim 14, wherein said decoding means includes means for converting fourteen-bit data blocks to corresponding ones of the plurality of characters.
Claim 23
Dependent Claim
24 words
The receiving station of claim 14, wherein said decoding means includes means for converting said received data blocks to corresponding ones of 260 characters.
Claim 24
Dependent Claim
24 words
The receiving station of claim 14, wherein said decoding means includes means for converting said received data blocks to corresponding ones of 257 characters.
Claim 25
Dependent Claim
28 words
The receiving station of claim 14, wherein said decoding means includes means for converting said received data blocks to corresponding ones of control code characters and data characters.
Claim 26
Dependent Claim
44 words
The receiving station of claim 14, wherein a first data block is preceded by a resynchronization data block, and wherein said decoding means includes means for converting a received data block preceded by said resynchronization data block to one of the plurality of characters.
Claim 27
Dependent Claim
22 words
The receiving station of claim 14, further including: a clock recovery element for recovering a clock signal from said received data blocks.
Claim 28
Dependent Claim
55 words
A transmitting station in a distributed processing system transmitting data blocks representing code words encoding a plurality of characters, comprising: encoding means for converting each of the plurality of characters to a predetermined corresponding one of a plurality of balanced weight fixed-distance code words; and transmitting means for transmitting said code words as data blocks.
Claim 29
Dependent Claim
55 words
A transmitting station in a distributed processing system transmitting data blocks representing code words encoding a plurality of characters, comprising: encoding means for converting each of the plurality of characters to a predetermined corresponding one of a plurality of balanced weight fixed-distance code words; and transmitting means for transmitting said code words as data blocks.
Claim 30
Dependent Claim
32 words
The transmitting station of claim 26, wherein said code words of said balanced weight fixed-distance code contain an equal number of ones and zeroes and have a distance of at least four.
Claim 31
Dependent Claim
44 words
The transmitting station of claim 26 having a memory containing said balanced weight fixed-distance code words and wherein said encoding means further includes: encode circuitry for converting each of said characters to a corresponding one of said code words according to said predetermined correspondence.
Claim 32
Dependent Claim
26 words
The transmitting station of claim 26, wherein said encoding means includes means for converting each of the plurality of characters to a corresponding fourteen-bit code word.
Claim 33
Dependent Claim
23 words
The transmitting station of claim 26, wherein said encoding means includes means for converting each of 257 characters to a corresponding code word.
Claim 34
Dependent Claim
23 words
The transmitting station of claim 26, wherein said encoding means includes means for converting each of 260 characters to a corresponding code word.
Claim 35
Dependent Claim
24 words
The transmitting station of claim 26, wherein said encoding means includes means for converting control code characters and data characters to corresponding code words.
Claim 36
Dependent Claim
26 words
The transmitting station of claim 26, wherein said encoding means includes means for transmitting a resynchronization data block preceding a first one of said data blocks.
Claim 37
Independent Claim
141 words
A method for transferring a plurality of characters between a transmitting station and a receiving station, the method comprising the steps of: encoding, by the transmitting station, each data character in a predetermined corresponding code word of a balanced weight fixed-distance code; transmitting, by the transmitting station, data blocks representing said code words to the receiving station; receiving, by the receiving station, said transmitted data blocks; decoding, by the receiving station, ones of said received data blocks according to the balanced weight fixed-distance code, yielding a plurality of said characters; recognizing, by the receiving station, received data blocks that differ by one bit from corresponding code words in the balanced weight fixed-distance code as incorrectly received; and decoding, by the receiving station, said recognized data blocks according to said corresponding code words in the balanced weight fixed-distance code, yielding said characters.
Claim 38
Independent Claim
141 words
A method for transferring a plurality of characters between a transmitting station and a receiving station, the method comprising the steps of: encoding, by the transmitting station, each data character in a predetermined corresponding code word of a balanced weight fixed-distance code; transmitting, by the transmitting station, data blocks representing said code words to the receiving station; receiving, by the receiving station, said transmitted data blocks; decoding, by the receiving station, ones of said received data blocks according to the balanced weight fixed-distance code, yielding a plurality of said characters; recognizing, by the receiving station, received data blocks that differ by one bit from corresponding code words in the balanced weight fixed-distance code as incorrectly received; and decoding, by the receiving station, said recognized data blocks according to said corresponding code words in the balanced weight fixed-distance code, yielding said characters.
Claim 39
Dependent Claim
28 words
The method of claim 34, wherein said encoding step further comprises the step of encoding each character in a code word having a distance of at least four.
Claim 40
Dependent Claim
40 words
The method of claim 34, wherein said encoding step further includes the step of encoding each data character in a fourteen-bit code word, and wherein said decoding step further includes the step of decoding ones of said fourteen-bit data blocks.
Claim 41
Independent Claim
67 words
A method for encoding characters sent by a transmitting station to a receiving station, said method comprising the steps, performed by the transmitting station, of: converting each character to a predetermined corresponding fourteen-bit code word of a balanced weight fixed-distance code, wherein each of said code words has a distance of at least four; and transmitting fourteen-bit data blocks representing said code words to the receiving station.
Claim 42
Independent Claim
67 words
A method for encoding characters sent by a transmitting station to a receiving station, said method comprising the steps, performed by the transmitting station, of: converting each character to a predetermined corresponding fourteen-bit code word of a balanced weight fixed-distance code, wherein each of said code words has a distance of at least four; and transmitting fourteen-bit data blocks representing said code words to the receiving station.
Claim 43
Independent Claim
105 words
A method for decoding data blocks received by a receiving station, said method comprising the steps, performed by said receiving station, of: receiving fourteen-bit data blocks encoding code words of a balanced weight fixed-distance code having a distance of at least four; decoding ones of said received fourteen-bit data blocks according to a matching code word in said balanced weight fixed-distance code, yielding a plurality of said data characters; recognizing received fourteen-bit data blocks that differ by one bit from corresponding code words in said balanced weight fixed-distance code as incorrectly received; and decoding said recognized fourteen-bit data blocks according to said corresponding code words.
Claim 44
Independent Claim
105 words
A method for decoding data blocks received by a receiving station, said method comprising the steps, performed by said receiving station, of: receiving fourteen-bit data blocks encoding code words of a balanced weight fixed-distance code having a distance of at least four; decoding ones of said received fourteen-bit data blocks according to a matching code word in said balanced weight fixed-distance code, yielding a plurality of said data characters; recognizing received fourteen-bit data blocks that differ by one bit from corresponding code words in said balanced weight fixed-distance code as incorrectly received; and decoding said recognized fourteen-bit data blocks according to said corresponding code words.
Claim 45
Independent Claim
110 words
A method, performed by a data processing system having a memory, for identifying a plurality of balanced weight fixed-distance code words encoding a plurality of characters, said method comprising the steps of: listing in the memory of said data processor a plurality of fixed length blocks of data bits having an equal number of binary ones and zeroes; identifying, in the memory of said data processing system, those of said blocks having a distance of four from each other; halting said step of identifying when the number of identified blocks equals the number of said characters; and assigning each of said characters to a different one of said identified blocks.
Claim 46
Independent Claim
110 words
A method, performed by a data processing system having a memory, for identifying a plurality of balanced weight fixed-distance code words encoding a plurality of characters, said method comprising the steps of: listing in the memory of said data processor a plurality of fixed length blocks of data bits having an equal number of binary ones and zeroes; identifying, in the memory of said data processing system, those of said blocks having a distance of four from each other; halting said step of identifying when the number of identified blocks equals the number of said characters; and assigning each of said characters to a different one of said identified blocks.
Claim 47
Dependent Claim
34 words
The method of claim 39, wherein each of said block has fourteen data bits and wherein said step of listing includes a step of listing each of said fourteen-bit blocks having seven binary ones.
Claim 48
Dependent Claim
35 words
The method of claim 39, wherein said step of listing includes the step of sorting said blocks according to those of said blocks having a distance of at least four from each of said blocks.
Claim 49
Dependent Claim
89 words
The method of claim 39, wherein said step of identifying includes the steps of: selecting one of said blocks; selecting those of said blocks having a distance of four from said selected one of said blocks and each other; when the number of selected blocks having a distance of four is less than a predetermined number, selecting a different one of said blocks; and repeating said step of selecting those of said blocks having a distance of four from said selected different one of said blocks and each other.
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) | 1993-10-22 | 1994-04-23 | 1994-10-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-10-22 | 1998-04-23 | 1998-10-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-10-22 | 2002-04-23 | 2002-10-23 | $7700.00 | Window Closed / Lapsed |