Patent US5231667A successfully refreshed from Google Patents.
US5231667A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Scrambling/descrambling circuit
Assignee: Sony Corp
•
Filing: 1991-12-04
•
Granted: 1993-07-27
•
Expires: 2011-12-04
Abstract
Abstract A scrambling/descrambling circuit that may be manufactured as a CMOS arrangement in LSI format and free of constraints on the degree of the generating polynomial involved. Scrambled (or descrambled) "m" bits of data output by registers are multiplied by multiplication circuits by a factor of the generating element α m of the generating polynomial. The multiplied data are input back to the registers. The scrambled "m" bits of data are supplied to "m" exclusive-OR gates for exclusive-OR operation with input data.
Inventors
- 👤 Yuichi Kojima
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 01:22
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; G; G06; G06F; G06F7/00; G06F7/58; G06F7/582; G06F7/584; H04L25/02; H04L25/03; H04L25/03828; H04L25/03866; H04L25/03872; G06F2207/00; G06F2207/58; G06F2207/581; G06F2207/582
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
164 words
A scrambling circuit for scrambling in parallel "m" bits using a maximum length series of degree "n", said circuit comprising: "m" exclusive-OR gates having first respective inputs thereof connected to receive "m" bits of input data to be scrambled, one bit corresponding to one gate input; "p" multiplication circuits for multiplying data fed thereto by α m in a Galois group given by a generating polynomial of said maximum length series of said degree "n", where α is the generating element of the polynomial; and "n×p" registers for latching "n×p" bits of data output by said "p" multiplication circuits and for outputting the latched "n×p" bits of data respectively back as inputs to said "p" multiplication circuits, wherein the value "n×p" is not smaller than the value "m", and the "m" bits of said latched data are output respectively to the other inputs of said exclusive-OR gates, one bit corresponding to one gate input, outputs of said "m" exclusive-OR gates comprising scrambled input data.
Claim 2
Dependent Claim
164 words
A scrambling circuit for scrambling in parallel "m" bits using a maximum length series of degree "n", said circuit comprising: "m" exclusive-OR gates having first respective inputs thereof connected to receive "m" bits of input data to be scrambled, one bit corresponding to one gate input; "p" multiplication circuits for multiplying data fed thereto by α m in a Galois group given by a generating polynomial of said maximum length series of said degree "n", where α is the generating element of the polynomial; and "n×p" registers for latching "n×p" bits of data output by said "p" multiplication circuits and for outputting the latched "n×p" bits of data respectively back as inputs to said "p" multiplication circuits, wherein the value "n×p" is not smaller than the value "m", and the "m" bits of said latched data are output respectively to the other inputs of said exclusive-OR gates, one bit corresponding to one gate input, outputs of said "m" exclusive-OR gates comprising scrambled input data.
Claim 3
Dependent Claim
25 words
A scrambling circuit according to claim 1, wherein said input data are "m" bit parallel data and wherein said exclusive-OR gates output scrambled parallel data.
Claim 4
Dependent Claim
22 words
A scrambling circuit according to claim 1, wherein said scrambling circuit is constituted at least by a CMOS arrangement in LSI format.
Claim 5
Dependent Claim
164 words
A descrambling circuit for descrambling in parallel "m" bits using a maximum length series of degree "n", said circuit comprising: "m" exclusive-OR gates having first inputs thereof respectively connected to receive "m" bits of input data to be descrambled, one bit corresponding to one gate input; "p" multiplication circuits for multiplying data fed thereto by α m in a Galois group given by a generating polynomial of said maximum length series of said degree "n", where α is the generating element of the polynomial; and "n×p" registers for latching "n×p" bits of data output by said "p" multiplication circuits and for outputting the latched "n×p" bits of data respectively back as inputs to said "p" multiplication circuits, wherein the value "n×p" is not smaller than the value "m", and the "m" bits of said latched data are output respectively to the other inputs of said exclusive-OR gates, one bit corresponding to one gate input, outputs of said "m" exclusive-OR gates comprising descrambled input data.
Claim 6
Dependent Claim
164 words
A descrambling circuit for descrambling in parallel "m" bits using a maximum length series of degree "n", said circuit comprising: "m" exclusive-OR gates having first inputs thereof respectively connected to receive "m" bits of input data to be descrambled, one bit corresponding to one gate input; "p" multiplication circuits for multiplying data fed thereto by α m in a Galois group given by a generating polynomial of said maximum length series of said degree "n", where α is the generating element of the polynomial; and "n×p" registers for latching "n×p" bits of data output by said "p" multiplication circuits and for outputting the latched "n×p" bits of data respectively back as inputs to said "p" multiplication circuits, wherein the value "n×p" is not smaller than the value "m", and the "m" bits of said latched data are output respectively to the other inputs of said exclusive-OR gates, one bit corresponding to one gate input, outputs of said "m" exclusive-OR gates comprising descrambled input data.
Claim 7
Dependent Claim
25 words
A descrambling circuit according to claim 4, wherein said input data are scrambled parallel data and wherein said exclusive-OR gates output "m" bit parallel data.
Claim 8
Dependent Claim
22 words
A descrambling circuit according to claim 5, wherein said descrambling circuit is constituted at least by a CMOS arrangement in LSI format.
Claim 9
Dependent Claim
216 words
A data transmission system comprising a transmitting section for scrambling data, means for modulating and transmitting the scrambled data, means for receiving and demodulating the transmitted data, and a receiving section for descrambling the demodulated data; said transmitting section containing a scrambling circuit and said receiving section containing a descrambling circuit; said scrambling and said descrambling circuits respectively scrambling and descrambling "m" bits in parallel using a maximum length series of degree "n", and wherein each of said scrambling and descrambling circuits comprises: "m" exclusive-OR gates each having one input thereof connected to receive respective "m" bits of input data, one bit corresponding to one gate input; "p" multiplication circuits for multiplying data fed thereto by α m in a Galois group given by a generating polynomial of said maximum length series of said degree "n", where α is the generating element of the polynomial; and "n×p" registers for latching "n×p" bits of data output by said "p" multiplication circuits and for outputting the latched "n×p" bits of data respectively back as inputs to said "p" multiplication circuits, wherein the value "n×p" is not smaller than the value "m", and the "m" bits of said latched data are output to the respective other inputs of said "m" exclusive-OR gates, one bit corresponding to one gate input.
Claim 10
Dependent Claim
216 words
A data transmission system comprising a transmitting section for scrambling data, means for modulating and transmitting the scrambled data, means for receiving and demodulating the transmitted data, and a receiving section for descrambling the demodulated data; said transmitting section containing a scrambling circuit and said receiving section containing a descrambling circuit; said scrambling and said descrambling circuits respectively scrambling and descrambling "m" bits in parallel using a maximum length series of degree "n", and wherein each of said scrambling and descrambling circuits comprises: "m" exclusive-OR gates each having one input thereof connected to receive respective "m" bits of input data, one bit corresponding to one gate input; "p" multiplication circuits for multiplying data fed thereto by α m in a Galois group given by a generating polynomial of said maximum length series of said degree "n", where α is the generating element of the polynomial; and "n×p" registers for latching "n×p" bits of data output by said "p" multiplication circuits and for outputting the latched "n×p" bits of data respectively back as inputs to said "p" multiplication circuits, wherein the value "n×p" is not smaller than the value "m", and the "m" bits of said latched data are output to the respective other inputs of said "m" exclusive-OR gates, one bit corresponding to one gate input.
Claim 11
Dependent Claim
27 words
A data transmission system according to claim 7, wherein said receiving section includes a reproduction circuit for reproducing a bit clock signal contained in said demodulated data.
Claim 12
Dependent Claim
15 words
A data transmission system according to claim 8, wherein said system transmits satellite broadcasting data.
References Cited (Backward Citations)
US3784743A
Cited
US4165444A
Cited
US4797921A
Cited
US4815130A
Cited
EP0265180A2
Cited
EP0331115A2
Cited
US4965881A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-07-26 | 1997-01-25 | 1997-07-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-07-26 | 2001-01-25 | 2001-07-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-07-26 | 2005-01-25 | 2005-07-27 | $7700.00 | Window Closed / Lapsed |