Patent US5056113A successfully refreshed from Google Patents.
US5056113A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data communication system
Assignee: Megasoft Inc
•
Filing: 1989-09-21
•
Granted: 1991-10-08
•
Expires: 2009-09-21
Abstract
Abstract A data communication system between computers comprises communication paths composed of m transmission lines between the computers. Data and data to be transferred is coded based on a coding table. Each code comprises a series or string of figures. Each figure has a numeric value not over the m-th power of 2. Also, those adjacent figures in each code string have necessarily different values. Coded data is transmitted figure by figure through m transmission lines. Since values of each figure in a code necessarily differ, a timing signal is not required.
Inventors
- 👤 Mamoru Takai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 09:25
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
132 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one of the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding strings of code figures to recover the original data.
Claim 2
Independent Claim
132 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one of the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding strings of code figures to recover the original data.
Claim 3
Dependent Claim
65 words
A method of communicating data as in claim 1 further comprising: upon decoding each value of original data, sending a specified acknowledging number from the receiver back to the sender, wherein the specified acknowledging number has a value not greater than 2 to the power m; and when the sender receives the acknowledging number the sender encodes and transmits a subsequent value of original data.
Claim 4
Dependent Claim
26 words
A method of communicating data as in claim 1 wherein the code string for each possible value of original data begins with a predetermined heading value.
Claim 5
Dependent Claim
35 words
A method of communicating data as in claim 1 further comprising: said receiver transmitting a specific numeric value not greater than 2 to the power m back to the sender to indicate readiness to receive.
Claim 6
Dependent Claim
50 words
A method of communicating data as in claim 3 further comprising: said receiver transmitting a specific numeric value not greater than 2 to the power m back to the sender to indicate readiness to receive, wherein the specific value indicating readiness to receive is different from said predetermined heading value.
Claim 7
Independent Claim
247 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding the strings of code figures to recover the original data; upon decoding each value of original data, sending a specified acknowledging number from the receiver back to the sender, wherein the specified acknowledging number has a value not greater than 2 to the power m; and when the sender receives the acknowledging number the sender encodes and transmits a subsequent value of original data; wherein the code string for each possible value of original data begins with a predetermined heading value; and wherein the code string for each possible value of original data ends with a predetermined ending value and said predetermined ending value, said predetermined heading value and the acknowledging number each have a different value not greater than 2 to the power m.
Claim 8
Independent Claim
247 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding the strings of code figures to recover the original data; upon decoding each value of original data, sending a specified acknowledging number from the receiver back to the sender, wherein the specified acknowledging number has a value not greater than 2 to the power m; and when the sender receives the acknowledging number the sender encodes and transmits a subsequent value of original data; wherein the code string for each possible value of original data begins with a predetermined heading value; and wherein the code string for each possible value of original data ends with a predetermined ending value and said predetermined ending value, said predetermined heading value and the acknowledging number each have a different value not greater than 2 to the power m.
Claim 9
Dependent Claim
138 words
A data communications system comprising: a sending device comprising a code table stored in memory, means for encoding each value of original data into a numeric code string using said coding table and means for transmitting encoded data; a receiving device comprising a corresponding code table stored in memory, means for receiving encoded data and means for using the code table in the receiving device to decode received code strings to recover original data; a data communication path connected between said means for transmitting and said means for receiving, said communication path including m parallel data transmission lines; wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values.
Claim 10
Dependent Claim
138 words
A data communications system comprising: a sending device comprising a code table stored in memory, means for encoding each value of original data into a numeric code string using said coding table and means for transmitting encoded data; a receiving device comprising a corresponding code table stored in memory, means for receiving encoded data and means for using the code table in the receiving device to decode received code strings to recover original data; a data communication path connected between said means for transmitting and said means for receiving, said communication path including m parallel data transmission lines; wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values.
Claim 11
Dependent Claim
25 words
A data communications system as in claim 7 wherein the code string for each possible value of original data begins with a predetermined heading value.
Claim 12
Dependent Claim
92 words
A data communications system as in claim 7 further comprising: means in said receiving device for transmitting a specific numeric value not greater than 2 to the power m back to the sender to indicate readiness to receive; means in the sending device for receiving the specific numeric value indicating that the receiving device is ready to receive; and a second data communication path connected between said means for transmitting a specific numeric value and said means for receiving said specific numeric value, said communication path including m parallel data transmission lines.
Claim 13
Dependent Claim
108 words
A system for data communication as in claim 8 further comprising: means in said receiving device for transmitting a specific numeric value not greater than 2 to the power m back to the sender to indicate readiness to receive; means in the sending device for receiving the specific numeric value indicating that the receiving device is ready to receive; and a second data communication path connected between said means for transmitting a specific numeric value and said means for receiving said specific numeric value, said communication path including m parallel data transmission lines; wherein the specific value indicating readiness to receive is different from said predetermined heading value.
Claim 14
Independent Claim
57 words
A method of transmitting data over m parallel data lines, comprising: encoding values of original data into strings of code figures, wherein the maximum allowable value of any code figure is 2 to the power m, and in each string adjacent figures have different numeric values; and transmitting the code strings over the m parallel data lines.
Claim 15
Independent Claim
57 words
A method of transmitting data over m parallel data lines, comprising: encoding values of original data into strings of code figures, wherein the maximum allowable value of any code figure is 2 to the power m, and in each string adjacent figures have different numeric values; and transmitting the code strings over the m parallel data lines.
Claim 16
Dependent Claim
28 words
A method of transmitting data as in claim 11 wherein the original data is in the form of 8 bit bytes and the value of m is 2.
Claim 17
Independent Claim
149 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, wherein the code string for each possible value of original data ends with a predetermined ending value and each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one of the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding strings of code figures to recover the original data.
Claim 18
Independent Claim
149 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, wherein the code string for each possible value of original data ends with a predetermined ending value and each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one of the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding strings of code figures to recover the original data.
Claim 19
Dependent Claim
38 words
A method of communicating data as in claim 13 wherein the code string for each possible value of original data begins with a predetermined heading value and said predetermined heading value is different from said predetermined ending value.
Claim 20
Dependent Claim
57 words
A method of communicating data as in claim 14 further comprising: said receiver transmitting a specific numeric value not greater than 2 to the power of m back to the sender to indicate readiness to receiver, wherein the specific value indicating readiness to receive is different from both said predetermined heading value and said predetermined ending value.
Claim 21
Independent Claim
146 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, values of original data which occur frequently being encoded into assigned short code strings, wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one of the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding strings of code figures to recover the original data.
Claim 22
Independent Claim
146 words
A method of communicating data between a sending device and a receiving device via a plurality of m parallel data lines, said method comprising: encoding each value of original data into a string of numeric code figures, values of original data which occur frequently being encoded into assigned short code strings, wherein each figure in each code string has a value not greater than 2 to the power m such that when expressed in binary, each figure comprises m bits, and adjacent figures in each code string have different numeric values; transmitting each figure of encoded data from the sender to the receiver by simultaneously transmitting one of the m bits of each figure on each of the m parallel data lines; receiving the transmitted data on the m parallel data lines at the receiver; and decoding strings of code figures to recover the original data.
Claim 23
Dependent Claim
24 words
A method of communicating data as in claim 16 wherein no longer code string begins with figures corresponding to a valid short code string.
Claim 24
Dependent Claim
155 words
A data communicating system comprising: a sending device comprising a code table stored in memory, means for encoding each value of original data into a numeric code string using said coding table and means for transmitting encoded data; a receiving device comprising a corresponding code table stored in memory, means for receiving encoded data and means for using the code table in the receiving device to decode received code strings to recover original data; a data communication path connected between said means for transmitting and said means for receiving, said communication path including m parallel data transmission lines; wherein each figure in each code string has a value not greater than 2 to the power of m such that when expressed in binary, each figure comprises m bits, adjacent figures in each code string have different numeric values, and the code string for each possible value of original data ends with a predetermined ending value.
Claim 25
Dependent Claim
155 words
A data communicating system comprising: a sending device comprising a code table stored in memory, means for encoding each value of original data into a numeric code string using said coding table and means for transmitting encoded data; a receiving device comprising a corresponding code table stored in memory, means for receiving encoded data and means for using the code table in the receiving device to decode received code strings to recover original data; a data communication path connected between said means for transmitting and said means for receiving, said communication path including m parallel data transmission lines; wherein each figure in each code string has a value not greater than 2 to the power of m such that when expressed in binary, each figure comprises m bits, adjacent figures in each code string have different numeric values, and the code string for each possible value of original data ends with a predetermined ending value.
Claim 26
Dependent Claim
37 words
A data communications system as in claim 18 wherein the code string for each possible value of original data begins with a predetermined heading value and said predetermined heading value is different from said predetermined ending value.
Claim 27
Dependent Claim
116 words
A data communicating system as in claim 19 further comprising: means in said receiving device for transmitting a specific numeric value not greater than 2 to the power of m back to the sender to indicate readiness to receive; means in the sending device for receiving the specific numeric value indicating that the receiving device is ready to receive; and a second data communication path connected between said means for transmitting a specific numeric value and said means for receiving said specific numeric value, said second data communication path including m parallel data transmission lines; wherein the specific value indicating readiness to receive is different from both said predetermined heading value and said predetermined ending value.
References Cited (Backward Citations)
US4121259A
Cited
US4360840A
Cited
US4622685A
Cited
US4736394A
Cited
US4626829A
Cited
US4805194A
Cited
US4791653A
Cited
US4884287A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-10-07 | 1995-04-08 | 1995-10-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-10-07 | 1999-04-08 | 1999-10-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-10-07 | 2003-04-08 | 2003-10-08 | $7700.00 | Window Closed / Lapsed |