Patent US4761635A successfully refreshed from Google Patents.
US4761635A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of coding digital information organized in frames using a CMI code, a device for implementing this method and application to servitude information for a high capacity digital network
Assignee: Societe Anonyme de Telecommunications SAT
•
Filing: 1986-11-19
•
Granted: 1988-08-02
•
Expires: 2006-11-19
Abstract
Abstract A method is provided for coding in the CMI code digital information organized in frames, wherein each frame locking word V, chosen equal to 1, is placed in the last position in the frame. The CMI code is violated at the position of said word V and, for keeping the statistics of the coding law, it is arranged for this violation to be alternately 00 and 11, from one frame to another. For this, immediately before the word V is inserted a binary filling word B, chosen by taking into account the number of binary "1"s before filling. If the number of binary "1"s before filling is even, the binary element B is coded like the violation of the frame locking word V and, in the opposite case, B is coded 01.
Inventors
- 👤 Jean-Pierre Arnaune
- 👤 Nazario Dominguez
- 👤 Jean Walraet
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 15:06
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; H04L25/491; H04L25/4912
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
81 words
A method of coding digital information in a CMI code, comprising the steps of: organizing said digital information in frames, each said frame having inserted therein a frame locking word comprising a binary "1" positioned at the end of said frame whereby the CMI code as a result of said insertion of said locking word is violated; and inserting a binary filling element into said frame immediately before said frame locking word so that statistics of said CMI code are maintained.
Claim 2
Independent Claim
81 words
A method of coding digital information in a CMI code, comprising the steps of: organizing said digital information in frames, each said frame having inserted therein a frame locking word comprising a binary "1" positioned at the end of said frame whereby the CMI code as a result of said insertion of said locking word is violated; and inserting a binary filling element into said frame immediately before said frame locking word so that statistics of said CMI code are maintained.
Claim 3
Dependent Claim
84 words
The method of claim 1, further comprising the steps of coding said locking word alternately as "11" and "00" from one frame to the next; coding said binary filling element as binary "0" when the number of binary "1"s in said frame is an odd number before the insertion of said frame locking word; and coding said binary filling element as binary "1" when the number of binary "1"s in said frame is an even number before the insertion of said frame locking word.
Claim 4
Independent Claim
187 words
A method of coding digital servitude information such as supervision, signalling, order channels, alarms, or remote monitoring of a high capacity digital network in the CMI code, said coding of said digital servitude information comprising the steps of: multiplexing said digital servitude information; organizing said multiplexed digital information in frames, each said frame having inserted therein a frame locking word comprising a binary "1" positioned at the end of said frame whereby the CMI code as a result of said insertion of said locking word is violated; inserting a binary filling element into said frame immediately before said frame locking word so that statistics of said CMI code are maintained; said method further comprising the steps of coding said locking word alternately as "11" and "00" from one frame to the next; coding said binary filling element as binary "0" when the number of binary "1"s in said frame is odd before the insertion of said frame locking word; and coding said binary filling element as binary "1" when the number of binary "1"s in said frame is even before the insertion of said frame locking word.
Claim 5
Independent Claim
187 words
A method of coding digital servitude information such as supervision, signalling, order channels, alarms, or remote monitoring of a high capacity digital network in the CMI code, said coding of said digital servitude information comprising the steps of: multiplexing said digital servitude information; organizing said multiplexed digital information in frames, each said frame having inserted therein a frame locking word comprising a binary "1" positioned at the end of said frame whereby the CMI code as a result of said insertion of said locking word is violated; inserting a binary filling element into said frame immediately before said frame locking word so that statistics of said CMI code are maintained; said method further comprising the steps of coding said locking word alternately as "11" and "00" from one frame to the next; coding said binary filling element as binary "0" when the number of binary "1"s in said frame is odd before the insertion of said frame locking word; and coding said binary filling element as binary "1" when the number of binary "1"s in said frame is even before the insertion of said frame locking word.
Claim 6
Dependent Claim
22 words
The method of coding digital servitude information of claim 3, further comprising the step of laser modulating said multiplexed digital servitude information.
Claim 7
Dependent Claim
84 words
Appatatus adapted for coding digital information in a CMI code, comprising: means for organizing said digital information in frames, each said frame having a frame locking word inserted therein at the end of said frame; means for generating said locking word according to said CMI code; means for inserting said locking word; and means for inserting a binary filling element into said frame immediately before said frame locking word according to statistics of said CMI code to maintain the integrity of said CMI code.
Claim 8
Dependent Claim
84 words
Appatatus adapted for coding digital information in a CMI code, comprising: means for organizing said digital information in frames, each said frame having a frame locking word inserted therein at the end of said frame; means for generating said locking word according to said CMI code; means for inserting said locking word; and means for inserting a binary filling element into said frame immediately before said frame locking word according to statistics of said CMI code to maintain the integrity of said CMI code.
Claim 9
Dependent Claim
83 words
The apparatus of claim 5, further comprising means for coding said locking word altenately as "11" and "00" from one frame to the next; means for coding said binary filling element as binary "0" when the number of binary "1"s in said frame is odd before the insertion of said frame locking word; and means for coding said binary filling element as binary "1" when the number of binary "1"s in said frame is even before the insertion of said frame locking word.
Claim 10
Dependent Claim
43 words
The apparatus of claim 6, wherein said means for coding said binary filling element comprises: parity detection means; and exclusive OR gate means for receiving the output of said parity detection means and an output of said means for coding said locking word.
Claim 11
Dependent Claim
28 words
The apparatus of claim 7, wherein said parity detection means comprises JK type flip-flop means, said JK type flip-flop means comprising J and K input terminals connected together.
Claim 12
Dependent Claim
90 words
The apparatus of claim 7, further comprising: clock circuit means outputting a clock signal for coding binary 0's; first means for phase locking said output of said parity detection means, and for outputting a signal for coding binary 1's; second means for phase locking said digital information; and multiplexer means for generating a multiplexed signal, said multiplexer means having operation controlling inputs receiving the output of said second phase locking means and receiving said frame locking word; and said multiplexer means generating a multiplexed signal coded in said CMI code.
References Cited (Backward Citations)
US4520480A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-08-02 | 1992-02-01 | 1992-08-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-08-02 | 1996-02-01 | 1996-08-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-08-02 | 2000-02-01 | 2000-08-02 | $7700.00 | Window Closed / Lapsed |