Patent US4599723A successfully refreshed from Google Patents.
US4599723A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of encoding data for serial transmission
Assignee: Westinghouse Air Brake Co
•
Filing: 1984-02-14
•
Granted: 1986-07-08
•
Expires: 2004-02-14
Abstract
Abstract A technique for redundantly encoding data for synchronous or asynchronous serial transmission or recording and the correlative technique for decoding the serial bit stream are disclosed. The encoding technique involves making the second data string of a data string pair the complement of the first data string and formatting to the format H 1 Data H 2 Data where H 1 and H 2 are headers wherein at least one bit is the same in corresponding bit positions of the headers. Decoding involves first detecting the headers and then checking to confirm that the data fields are complements. Also disclosed is a technique for extracting bits from the data stream.
Inventors
- 👤 Henry H. Eck
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 15:29
CPC Classifications
H; H04; H04L; H04L7/00; H04L7/0054; H04L7/0066; H04L1/00; H04L1/08; H04L25/00; H04L25/02; H04L25/06; H04L25/068
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
109 words
A method of encoding data for serial transmission or recording comprising the steps of accepting a data string composed of binary "1's" and "0's" for transmission or recording, complementing said data string, providing each of said data string and its complement with a header, wherein at least one bit is the same in corresponding bit positions of the headers, said headers being used to identify and synchronize transmitted or recorded data by comparing said corresponding bit positions in the headers, and framing the data to be transmitted or recorded by ordering said data string with its header and the complement of said data string with its header in series.
Claim 2
Independent Claim
109 words
A method of encoding data for serial transmission or recording comprising the steps of accepting a data string composed of binary "1's" and "0's" for transmission or recording, complementing said data string, providing each of said data string and its complement with a header, wherein at least one bit is the same in corresponding bit positions of the headers, said headers being used to identify and synchronize transmitted or recorded data by comparing said corresponding bit positions in the headers, and framing the data to be transmitted or recorded by ordering said data string with its header and the complement of said data string with its header in series.
Claim 3
Dependent Claim
36 words
The method according to claim 1 wherein the two headers have at least two bits, at least one bit being the same and at least one bit being different in corresponding bit positions of the headers.
Claim 4
Independent Claim
164 words
A method of decoding a serial bit stram encoded to the format H 1 Data H 2 Data where H 1 and H 2 are headers wherein at least one bit is the same in corresponding bit positions of the headers and Data is a data string and Data is its complement, said method comprising the steps of shifting said serial bit stram into a buffer, checking the bits in the buffer to detect the presence of the headers H 1 and H 2 and synchronize the data string by detecting the presence of identical bits in said corresponding bit positions of the headers, if the headers H 1 and H 2 are detected, checking the data fields to confirm that the data strings are complements, and if the data fields are complements, providing an indication that data is available, otherwise resume shifting said serial bit stram into the buffer and checking for the presence of the headers H 1 and H 2 .
Claim 5
Independent Claim
164 words
A method of decoding a serial bit stram encoded to the format H 1 Data H 2 Data where H 1 and H 2 are headers wherein at least one bit is the same in corresponding bit positions of the headers and Data is a data string and Data is its complement, said method comprising the steps of shifting said serial bit stram into a buffer, checking the bits in the buffer to detect the presence of the headers H 1 and H 2 and synchronize the data string by detecting the presence of identical bits in said corresponding bit positions of the headers, if the headers H 1 and H 2 are detected, checking the data fields to confirm that the data strings are complements, and if the data fields are complements, providing an indication that data is available, otherwise resume shifting said serial bit stram into the buffer and checking for the presence of the headers H 1 and H 2 .
Claim 6
Dependent Claim
36 words
The method according to claim 3 wherein the two headers have at least two bits, at least one bit being the same and at least one bit being different in corresponding bit positions of the headers.
Claim 7
Dependent Claim
92 words
The method according to claim 3 further comprising extracting the bits individually from the serial bit stream prior to shifting into the buffer, the step of extracting comprising the steps of sampling the bit stream at a rate n times the bit rate, where n is a positive integer, framing sequences of n samples, ensuring that the center samples correspond to the center of the transmitted bit, using all or part of the samples to determine if the bit is a "1" or a "0", and sending the bit to the buffer.
Claim 8
Dependent Claim
37 words
The method according to claim 5 wherein n=1 and the serial bit stream is accompanied by a synchronous clock, said clock being used to sample the bit stream at or near the center of a bit time.
Claim 9
Dependent Claim
43 words
The method according to claim 5 wherein n>1, said method further comprising the steps of detecting transitions in previous frames, and moving the current frame forward or backward in the series of samples if the transitions occur near the center of the frame.
Claim 10
Dependent Claim
40 words
The method according to claim 7 wherein n=8 and the frame is moved backward if a transition occurs between the fifth and seventh samples, and the frame is moved forward if a transition occurs between the second and fourth samples.
Claim 11
Dependent Claim
23 words
The method according to claim 7 wherein the step of moving produces a forward or backward movement of more than a single sample.
Claim 12
Dependent Claim
34 words
The method according to claim 7 wherein the bit stream is sampled at a rate greater than n times the bit rate and the step of moving is made only in the backward direction.
Claim 13
Dependent Claim
34 words
The method according to claim 7 wherein the bit stream is sampled at a rate less than n times the bit rate and the step of moving is made only in the forward direction.
Claim 14
Dependent Claim
25 words
The method according to claim 5 wherein the determination as to whether a bit is a binary "1" or "0" is made by majority vote.
Claim 15
Dependent Claim
42 words
The method according to claim 5 further comprising the steps of detecting bit transitions, and increasing or decreasing the time between samples of at least a limited number of subsequent samples if the bit transitions occur near the center of the frame.
Claim 16
Dependent Claim
23 words
The method according to claim 13 wherein the step of increasing or decreasing the time between samples is performed for all subsequent samples.
Claim 17
Independent Claim
188 words
A method of transmitting and receiving a serial data stream comprising the steps of accepting a data string composed of binary "1's" and "0's" for transmission, complementing said data string, providing each of said data string and its complement with a header, wherein at least one bit is the same in corresponding bit positions of the headers, framing the data to be transmitted by ordering said data string with its header and the complement of said data string with its header in series, serially transmitting the framed data to a receiver, receiving the transmitted data at said receiver, shifting the received data into a buffer, checking the bits in the buffer to detect the presence of the headers by detecting the presence of identical bits in said corresponding bit positions of the headers, if the headers are detected, synchronizing the receiver with the received data and checking the received data to confirm that the data strings are complements, and if the data strings are complements, providing an indication that data is available, otherwise resume shifting received data into the buffer and checking for the presence of the headers.
Claim 18
Independent Claim
188 words
A method of transmitting and receiving a serial data stream comprising the steps of accepting a data string composed of binary "1's" and "0's" for transmission, complementing said data string, providing each of said data string and its complement with a header, wherein at least one bit is the same in corresponding bit positions of the headers, framing the data to be transmitted by ordering said data string with its header and the complement of said data string with its header in series, serially transmitting the framed data to a receiver, receiving the transmitted data at said receiver, shifting the received data into a buffer, checking the bits in the buffer to detect the presence of the headers by detecting the presence of identical bits in said corresponding bit positions of the headers, if the headers are detected, synchronizing the receiver with the received data and checking the received data to confirm that the data strings are complements, and if the data strings are complements, providing an indication that data is available, otherwise resume shifting received data into the buffer and checking for the presence of the headers.
Claim 19
Dependent Claim
36 words
The method according to claim 15 wherein the two headers have at least two bits, at least one bit being the same and at least one bit being different in corresponding bit postions of the headers.
References Cited (Backward Citations)
US3199077A
Cited
US3449717A
Cited
US4045771A
Cited
US4377863A
Cited
US4369516A
Cited
US4389636A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-07-07 | 1990-01-06 | 1990-07-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-07-07 | 1994-01-06 | 1994-07-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-07-07 | 1998-01-06 | 1998-07-08 | $7700.00 | Window Closed / Lapsed |