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

Method of synchronizing the pseudo-random binary sequence in a descrambler

Assignee: British Telecommunications PLC
•
Filing: 1991-04-10
•
Granted: 1994-02-01
•
Expires: 2011-04-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a data communication system a signal is coded with n-bit codewords, wherein n is an integer. The codewords are converted to a serial bit-stream and scrambled using a PRBS (Pseudo-Random Binary Sequence) from a PRBS generator (4). The PRBS sequence has a length n x m where m is an integer. At a receiver the serial data is descrambled using a corresponding binary sequence from a PRBS generator (5) matched to that in the transmitter. The descrambling data is decoded in a decoder (6) in synchronism with the binary sequence in the generator (5), thereby maintaining word alignment between the transmitter and the receiver.

Inventors

  • 👤 Andrew R. J. Cook
  • 👤 David W. Faulkner

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 18:48
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/02; H04L25/03; H04L25/03828; H04L25/03866; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0602; H04J3/0605; H04J3/0611

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 196 words
A method of communicating data from a transmitter to a receiver comprising coding an input signal with n-bit codewords, where n is an integer, converting the n-bit codewords to a serial bit-stream, generating with a pseudo-random binary sequence generator in the transmitter a fixed length n x m bit pseudo-random binary sequence, where m is an integer, generating a word synchronization signal in response to a predetermined point in each repetition of the pseudo-random binary sequence in said transmitter pseudo-random binary sequence generator, synchronizing the coding of the input signal in accordance with the word synchronization signal, scrambling the serial bit-stream with the pseudo-random binary sequence, transmitting the scrambled data to the receiver, generating with a pseudo-random binary sequence generator in the receiver a corresponding binary sequence, generating a corresponding word alignment signal in response to the predetermined point in each repetition of the corresponding binary sequence, descrambling the data at the receiver with the corresponding binary sequence, synchronizing the corresponding binary sequence to the scrambling sequence in the transmitter, and assembling the descrambled data into n-bit words in accordance with said corresponding word alignment signal, thereby maintaining word alignment between the transmitter and the receiver.
Claim 2
Independent Claim 196 words
A method of communicating data from a transmitter to a receiver comprising coding an input signal with n-bit codewords, where n is an integer, converting the n-bit codewords to a serial bit-stream, generating with a pseudo-random binary sequence generator in the transmitter a fixed length n x m bit pseudo-random binary sequence, where m is an integer, generating a word synchronization signal in response to a predetermined point in each repetition of the pseudo-random binary sequence in said transmitter pseudo-random binary sequence generator, synchronizing the coding of the input signal in accordance with the word synchronization signal, scrambling the serial bit-stream with the pseudo-random binary sequence, transmitting the scrambled data to the receiver, generating with a pseudo-random binary sequence generator in the receiver a corresponding binary sequence, generating a corresponding word alignment signal in response to the predetermined point in each repetition of the corresponding binary sequence, descrambling the data at the receiver with the corresponding binary sequence, synchronizing the corresponding binary sequence to the scrambling sequence in the transmitter, and assembling the descrambled data into n-bit words in accordance with said corresponding word alignment signal, thereby maintaining word alignment between the transmitter and the receiver.
Claim 3
Dependent Claim 60 words
A method according to claim 1, in which the receiver pseudo-random binary sequence generator is driven by a controllable oscillator means, and the synchronization of said corresponding binary sequence is obtained by detecting at the receiver a predetermined element in the received data, and locking the frequency of the oscillator means in response to the detection of the predetermined element.
Claim 4
Dependent Claim 18 words
A method according to claim 1, in which the generated pseudo-random binary sequence is a maximum length sequence.
Claim 5
Independent Claim 204 words
A system for communicating data comprising a transmitter including a coder arranged to code an input signal with n-bit codewords, where n is an integer, and to convert the n-bit codewords to a serial bit-stream, and scrambling means including a pseudo-random binary sequence generator and arranged to scramble the serial bit-stream with a fixed length n x m bit pseudo-random binary sequence, where m is an integer to output the scrambled data and to provide a word synchronization signal in response to a predetermined point in each repetition of the pseudo-random binary sequence, the coder being arranged to synchronize the coding of the input signal in accordance with the word synchronization signal; and a receiver arranged to receive the scrambled data and including descrambling means including a pseudo-random binary sequence generator and arranged to descramble the data with a corresponding binary sequence and to provide a corresponding word synchronization signal in response to the predetermined point in each repetition of the corresponding binary sequence, means to synchronize the descrambling means with the scrambling means, and decoder means arranged to assemble the descrambled data into n-bit words in accordance with said corresponding word alignment signal, thereby maintaining word alignment between the transmitter and the receiver.
Claim 6
Independent Claim 204 words
A system for communicating data comprising a transmitter including a coder arranged to code an input signal with n-bit codewords, where n is an integer, and to convert the n-bit codewords to a serial bit-stream, and scrambling means including a pseudo-random binary sequence generator and arranged to scramble the serial bit-stream with a fixed length n x m bit pseudo-random binary sequence, where m is an integer to output the scrambled data and to provide a word synchronization signal in response to a predetermined point in each repetition of the pseudo-random binary sequence, the coder being arranged to synchronize the coding of the input signal in accordance with the word synchronization signal; and a receiver arranged to receive the scrambled data and including descrambling means including a pseudo-random binary sequence generator and arranged to descramble the data with a corresponding binary sequence and to provide a corresponding word synchronization signal in response to the predetermined point in each repetition of the corresponding binary sequence, means to synchronize the descrambling means with the scrambling means, and decoder means arranged to assemble the descrambled data into n-bit words in accordance with said corresponding word alignment signal, thereby maintaining word alignment between the transmitter and the receiver.
Claim 7
Dependent Claim 66 words
A system according to claim 4, in which the receiver pseudo-random binary sequence generator is driven by a controllable oscillator means, and the receiver further comprises monitor means arranged to detect at the receiver a predetermined element in the received data and the oscillator means is responsive to the output of the monitor means to lock its frequency in response to detection of the predetermined element.
Claim 8
Dependent Claim 24 words
A system according to claim 4 or claim 5, in which the pseudo-random binary sequence generators are arranged to generate a maximum length sequence.

References Cited (Backward Citations)

US4383322A Cited
EP0094254A2 Cited
EP0107175A1 Cited
US4606042A Cited
DE3312400A1 Cited
US5128998A Cited
US5068872A Cited
US5060266A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-01-31 1997-08-02 1998-02-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-01-31 2001-08-02 2002-02-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-01-31 2005-08-02 2006-02-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag