Patent US4500871A successfully refreshed from Google Patents.
US4500871A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for coding binary data and a device decoding coded data
Assignee: Thales SA
•
Filing: 1983-04-07
•
Granted: 1985-02-19
•
Expires: 2003-04-07
Abstract
Abstract A method for coding binary data to be transmitted and a device for decoding coded data dispense with the need to transmit a direct-current component and make it possible to reconstitute clock signals from coded data without any addition of a particular channel. With this objective, the input signal constituted by a sequence of groups of eight binary data is converted to a coded signal constituted by a sequence of words of sixteen binary data associated respectively with the groups and having a data repetition frequency which is double the repetition frequency of the input signal data. The words are also chosen so as to ensure that each datum of the coded signal is followed or preceded by a datum having the same logic state. Furthermore, a sequence of particular words is inserted at the beginning of the message in order to permit easy recovery of clock signals at the time of decoding.
Inventors
- 👤 Max Ratigalas
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 16:43
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426
Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
208 words
A method for preparing an input signal for transmission, said input signal having a sequence of groups selected from a set of all possible groups, each of said groups having n binary digits having a repetition frequency F, said method comprising the steps of: generating for each of said groups in said set a unique binary word each of said words being defined by n bits having a "0" state and n bits having a "1" state and having a repetition frequency 2F, each of the bits of said words being adjacent to a bit having the same state except end bits of said words which can be adjacent a bit in said word of opposite state; generating the complement of at least some of said words; and forming a transmission signal by replacing the n bits of each of said groups in said input signal with the 2n bits of one of the word and the complement of the word uniquely corresponding to said group which ensures that both the last bit of the word previously generated and the first bit of the word presently generated are adjacent bits of the same state when both said previously generated word and said presently generated word are considered together.
Claim 2
Independent Claim
208 words
A method for preparing an input signal for transmission, said input signal having a sequence of groups selected from a set of all possible groups, each of said groups having n binary digits having a repetition frequency F, said method comprising the steps of: generating for each of said groups in said set a unique binary word each of said words being defined by n bits having a "0" state and n bits having a "1" state and having a repetition frequency 2F, each of the bits of said words being adjacent to a bit having the same state except end bits of said words which can be adjacent a bit in said word of opposite state; generating the complement of at least some of said words; and forming a transmission signal by replacing the n bits of each of said groups in said input signal with the 2n bits of one of the word and the complement of the word uniquely corresponding to said group which ensures that both the last bit of the word previously generated and the first bit of the word presently generated are adjacent bits of the same state when both said previously generated word and said presently generated word are considered together.
Claim 3
Dependent Claim
105 words
A method according to claim 1 further comprising the step of generating a synchronization message at the beginning of the transmission signal in order to permit recovery of the clock signals when the transmission signal is received, said messsage having a sequence of binary words R followed by the word R, R being the complement word of R and R having a sequence of p groups of q=(2n/p) bits, p and q being positive whole numbers, at a repetition frequency of 2F, all of the bits of a group having the same state and being followed by a group of bits having an opposite state.
References Cited (Backward Citations)
US3300774A
Cited
US3537100A
Cited
US3631471A
Cited
US3653036A
Cited
US4072987A
Cited
FR2358786A1
Cited
US4216460A
Cited
US4146909A
Cited
US4261019A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-02-19 | 1988-08-20 | 1989-02-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-02-19 | 1992-08-20 | 1993-02-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-02-19 | 1996-08-20 | 1997-02-19 | $7700.00 | Window Closed / Lapsed |