US4606056A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of encoding and serially transmitting self-clocking data and control characters
Assignee: Unisys Corp
•
Filing: 1985-02-04
•
Granted: 1986-08-12
•
Expires: 2005-02-04
Abstract
Abstract A method of sending self-clocking data characters and control characters in a sequence from a first communications node to a second node includes the steps of: encoding each data character as respective code pairs of the form 0XX . . . X1 and 1XX . . . X0 where the X's are the zero and one bits of the data character; encoding each control character as respective code pairs of the form 0XX . . . X0 and 1XX . . . X1 where again the X's are the zero and one bits of the control character; and transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence.
Inventors
- 👤 Ronald S. Perloff
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 08:35
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
132 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communication node to a second node, including the steps of: loading the characters of said sequence into a parallel-serial shift register; inserting a one bit before and a one bit behind each loaded control character which is immediately preceded by a zero bit of a previously loaded character, and a zero bit before and a zero bit behind each remaining control character; inserting a one bit before and a zero bit behind each loaded data character which is immediately preceded by a zero bit of a previously loaded character, and a zero bit before and a one bit behind each remaining data character; and serially transmitting each loaded character with its inserted bits.
Claim 2
Independent Claim
132 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communication node to a second node, including the steps of: loading the characters of said sequence into a parallel-serial shift register; inserting a one bit before and a one bit behind each loaded control character which is immediately preceded by a zero bit of a previously loaded character, and a zero bit before and a zero bit behind each remaining control character; inserting a one bit before and a zero bit behind each loaded data character which is immediately preceded by a zero bit of a previously loaded character, and a zero bit before and a one bit behind each remaining data character; and serially transmitting each loaded character with its inserted bits.
Claim 3
Dependent Claim
33 words
A method according to claim 1 wherein said characters are sequentially loaded one at a time into said shift register, and said inserting steps are performed on each character as it is loaded.
Claim 4
Independent Claim
189 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 0XX . . . X1 and 1XX . . . X0 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 0XX . . . X0 and 1XX . . . X1 where again the X's are zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 0XX . . . X0 and 1XX . . . X1 regardless of the location of such codes in said sequence.
Claim 5
Independent Claim
189 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 0XX . . . X1 and 1XX . . . X0 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 0XX . . . X0 and 1XX . . . X1 where again the X's are zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 0XX . . . X0 and 1XX . . . X1 regardless of the location of such codes in said sequence.
Claim 6
Dependent Claim
23 words
A method according to claim 3 wherein the number of X's in the code of each code pair is between two and thirty-two.
Claim 7
Dependent Claim
36 words
A method according to claim 3 and further including the substep of sequentially encoding said characters such that while one character of said sequence is being transmitted, the next character in said sequence is being encoded.
Claim 8
Independent Claim
190 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 1XX . . . X1 and 1XX . . . X0 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 0XX . . . X0 and 0XX . . . X1 where again the X's are the zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 0XX . . . X0 and 0XX . . . X1 regardless of the location of such codes in the sequence.
Claim 9
Independent Claim
190 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 1XX . . . X1 and 1XX . . . X0 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 0XX . . . X0 and 0XX . . . X1 where again the X's are the zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 0XX . . . X0 and 0XX . . . X1 regardless of the location of such codes in the sequence.
Claim 10
Dependent Claim
23 words
A method according to claim 6 wherein the number of X's in the code of each code pair is between two and thirty-two.
Claim 11
Dependent Claim
36 words
A method according to claim 6 and further including the substep of sequentially encoding said characters such that while one character of said sequence is being transmitted, the next character in said sequence is being encoded.
Claim 12
Independent Claim
189 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 0XX . . . X0 and 1XX . . . X1 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 0XX . . . X1 and 1XX . . . X0 where again the X's are zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 0XX . . . X1 and 1XX . . . X0 regardless of the location of such codes in said sequence.
Claim 13
Independent Claim
189 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 0XX . . . X0 and 1XX . . . X1 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 0XX . . . X1 and 1XX . . . X0 where again the X's are zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 0XX . . . X1 and 1XX . . . X0 regardless of the location of such codes in said sequence.
Claim 14
Independent Claim
190 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 0XX . . . X0 and 0XX . . . X1 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 1XX . . . X1 and 1XX . . . X0 where again the X's are the zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 1XX . . . X1 and 1XX . . . X0 regardless of the location of such codes in the sequence.
Claim 15
Independent Claim
190 words
A method of sending a plurality of self-clocking data characters and control characters in a sequence from a first communications node to a second node, including the steps of: encoding said data characters as respective code pairs of the form 0XX . . . X0 and 0XX . . . X1 where the X's are the zero and one bits of the unencoded character; encoding said control characters as respective code pairs of the form 1XX . . . X1 and 1XX . . . X0 where again the X's are the zero and one bits of the unencoded character; transmitting, for each character in said sequence, the particular code in that character's code pair whose first code bit is the opposite of the last code bit of the immediately preceding character in the sequence; establishing an initial mode of operation in said second node to receive said codes; and changing operating modes from said initial mode in response to the receipt of only those codes of the form 1XX . . . X1 and 1XX . . . X0 regardless of the location of such codes in the sequence.
References Cited (Backward Citations)
DE2643933A1
Cited
US4208650A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-08-11 | 1990-02-10 | 1990-08-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-08-11 | 1994-02-10 | 1994-08-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-08-11 | 1998-02-10 | 1998-08-12 | $7700.00 | Window Closed / Lapsed |