Patent US4785464A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4785464A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and device for regenerating the integrity of the bit rate in a plesiosynchronous system

Assignee: LMT Radio Professionnelle
•
Filing: 1987-01-07
•
Granted: 1988-11-15
•
Expires: 2007-01-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The network of the invention comprises, in the transmitter, a "marker" generator which inserts bits of a cyclical sequence into the binary data flow and, in the receiver, a marker processing circuit by which it is possible to identify the start of the marker cycle in order to re-justify the useful data signal in accordance with the detection of this start of a cycle.

Inventors

  • 👤 Andre Judeinstein
  • 👤 Pierre Lagoutte

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 19:28
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605; H04J3/0608

Claims Analysis

Total Claims: 19
Claim 1
Independent Claim 125 words
A method for the end-to-end regeneration of binary integrity in a link set up through a plesiosynchronous network, comprising the steps of: transmitting frames consisting of several time intervals from a transmitter over said link; multiplexing useful data bits with at least one cyclical signal marker bit in synchronism with said data bits to form said frames being transmitted; receiving said frames from said link at a receiver; demultiplexing said received frames to separate said useful data bits and said cyclical signal marker bits; unambiguously identifying the start of a cycle of said cyclical signal bit and detecting errors from the identification of said cyclical signal marker bits; and regenerating the bits transmitted utilizing errors detected from the identification of the cyclical signal marker bits.
Claim 2
Independent Claim 125 words
A method for the end-to-end regeneration of binary integrity in a link set up through a plesiosynchronous network, comprising the steps of: transmitting frames consisting of several time intervals from a transmitter over said link; multiplexing useful data bits with at least one cyclical signal marker bit in synchronism with said data bits to form said frames being transmitted; receiving said frames from said link at a receiver; demultiplexing said received frames to separate said useful data bits and said cyclical signal marker bits; unambiguously identifying the start of a cycle of said cyclical signal bit and detecting errors from the identification of said cyclical signal marker bits; and regenerating the bits transmitted utilizing errors detected from the identification of the cyclical signal marker bits.
Claim 3
Dependent Claim 19 words
Method according to the claim 1, wherein the marker bit is multiplexed at fixed positions of the time interval.
Claim 4
Dependent Claim 22 words
Method according to the claim 1, wherein the marker bit is multiplexed at positions which change in time according to determined parameters.
Claim 5
Dependent Claim 25 words
Method according to the claim 1, wherein the marker bit is multiplexed at positions which change in time according to parameters which can be determined.
Claim 6
Dependent Claim 15 words
Method according to any one of claims 1-4, wherein the marker bit is a "dibit".
Claim 7
Dependent Claim 30 words
Method according to the claim 5, wherein the only values used for the "dibit" are "1" and "2", the reception of a "0" or a "3" reflecting a transmission error.
Claim 8
Dependent Claim 30 words
Method according to the claim 5, wherein the only values used for the dibit are "0" and "3", the reception of a "1" or a "2" reflecting a transmission error.
Claim 9
Dependent Claim 21 words
Method according to the claim 6, wherein the marker sequence is made up of a fixed number of "1"s and "2"s.
Claim 10
Dependent Claim 21 words
Method according to the claim 7, wherein the marker sequence is made up of a fixed number of "0"s and "3"s.
Claim 11
Dependent Claim 31 words
Method according to one of the claims 5, wherein the marker bit has a cycle comprising a long succession of identical dibits cut by a determined sequence of some different dibits.
Claim 12
Dependent Claim 50 words
The method according to claim 1, further comprising the step of determining the distance of Hamming between the received signal and a reference signal in identifying a marker bit when this distance is less than a predetermined value, said value being that which can result from a shift in sequence.
Claim 13
Independent Claim 122 words
A device for the regeneration of binary integrity in a link set up through a plesiosynchronous network which transmits frames of several time intervals comprising: a source transmitter for transmitting over said link; a bit cyclical signal generator for producing marker signals having a bit cycle; a multiplexer connected to said bit cyclical signal generator in said source transmitter for multiplexing said marker signals with data bits; an addressee receiver including a demultiplexer for receiving signals from said source transmitter or said link; said demultiplexer for separating said data bits and said marker signal; a marker processing device connected to the demultiplexer for identifying the start of said bit cycle and regenerating said data bits according to the detection of said start.
Claim 14
Independent Claim 122 words
A device for the regeneration of binary integrity in a link set up through a plesiosynchronous network which transmits frames of several time intervals comprising: a source transmitter for transmitting over said link; a bit cyclical signal generator for producing marker signals having a bit cycle; a multiplexer connected to said bit cyclical signal generator in said source transmitter for multiplexing said marker signals with data bits; an addressee receiver including a demultiplexer for receiving signals from said source transmitter or said link; said demultiplexer for separating said data bits and said marker signal; a marker processing device connected to the demultiplexer for identifying the start of said bit cycle and regenerating said data bits according to the detection of said start.
Claim 15
Dependent Claim 129 words
Device according to the claim 12, wherein the marker processing device comprises a buffer memory which receives the useful information bits from the demultiplexer, a marker detector receiving the marker information bits from the demultiplexer, the output of this detector being linked to the zeroizing input of a first writing counter and to the input of a "page-skipping" logic circuit set between the output of the first counter and the input of a second "page" writing counter, a reading counter, these three counters being linked through a multiplexer to the addressing input of the buffer memory, and a clock signals generator synchronized with the frames received and linked to the clock inputs of the three counters referred to above and to the read/write control input of the buffer memory.
Claim 16
Dependent Claim 85 words
Device according to the claim 13, wherein the "page-skipping" logic circuit comprises a first AND gate linked to the output of the first counter, the output of this gate being linked to an input of a second AND gate, another input of which is linked to the output of the marker detector, the output of the second AND gate being linked to the second counter and wherein the first AND gate is linked to the most significant wires of the output of the first counter.
Claim 17
Dependent Claim 55 words
Device according to any one of the claims 12, 13 and 14, wherein the marker detector is based on the determination of the distance of Hamming between the sequence received and a reference sequence, the marker being identified when this distance is less than the smallest value which can result from a shift in sequence.
Claim 18
Dependent Claim 60 words
Device according to any one of the claims 12, 13 and 14 to 15, comprising an initialization signal input linked to the zeroizing inputs of the three counters referred to above, the link to the zeroizing input of the first counter being made through an OR gate, another input of which is linked to the output of the marker detector.
Claim 19
Dependent Claim 27 words
Device according to the claim 16, wherein the most significant output of the second counter is linked via a logic inverter to the input of the multiplexer.

References Cited (Backward Citations)

US4004090A Cited
US4175692A Cited
US4208650A Cited
US4288874A Cited
US4247935A Cited
US4306305A Cited
US4697265A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-11-15 1992-05-16 1992-11-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-11-15 1996-05-16 1996-11-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-11-15 2000-05-16 2000-11-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag