US4649419A — Pseudo-random binary sequency generator

Claim 1

Independent Claim 190 words

A psuedo-random binary address generator for supplying addresses of cutting points of a composite video signal encoded by rotation of two segments situated on either side of each cutting point, comprising three feedback shift registers for generating polynomials which are irreducible and primitive, whereby bit sequences a, b, c which they deliver are of a maximum length, said registers having different numbers of cells n a , n b , n c , said registers having outputs a i , b j and c k , said addresses of the cutting points comprising the sum of N coefficients S expressed as ##EQU10## where N is greater than 3, at least the four of said coefficients having the greatest weight, S N -1, S N -2, S N -3 and S N -4 being derived by logic equations which consist of modulo 2 addition of said three outputs a i , b j and c k , denoted (a i ⊕b j ⊕c k ), and the ranks i, j and k being selected to be different by the degree n a , n b and n c of the registers.

Claim 2

Dependent Claim 190 words

A psuedo-random binary address generator for supplying addresses of cutting points of a composite video signal encoded by rotation of two segments situated on either side of each cutting point, comprising three feedback shift registers for generating polynomials which are irreducible and primitive, whereby bit sequences a, b, c which they deliver are of a maximum length, said registers having different numbers of cells n a , n b , n c , said registers having outputs a i , b j and c k , said addresses of the cutting points comprising the sum of N coefficients S expressed as ##EQU10## where N is greater than 3, at least the four of said coefficients having the greatest weight, S N -1, S N -2, S N -3 and S N -4 being derived by logic equations which consist of modulo 2 addition of said three outputs a i , b j and c k , denoted (a i ⊕b j ⊕c k ), and the ranks i, j and k being selected to be different by the degree n a , n b and n c of the registers.

Claim 3

Dependent Claim 177 words

A pseudo-random binary address generator to deliver cutting point addresses of a composite video signal for digitally coding these video signals by rotation of the two segments situated on either side of each cutting point, comprising three feedback shift registers, each generating polynomials which are irreducible and primitive, whereby bit sequences a, b, c of a maximum length are produced, said registers having a different number of cells n a , n b , n c , said three registers having outputs a i , b j and c k , and in which the addresses of the cutting points are constituted by the sum of N coefficients S 0 to . . . S N-1 , where at least S N -1, S N -2, S N -3 and S N -4 are formed by the modulo 2 addition of said three outputs a i ⊕b j ⊕c k , where the ranks i, j and k are selected to be different by the degrees n a , n b , n c of said registers.

Claim 4

Dependent Claim 177 words

A pseudo-random binary address generator to deliver cutting point addresses of a composite video signal for digitally coding these video signals by rotation of the two segments situated on either side of each cutting point, comprising three feedback shift registers, each generating polynomials which are irreducible and primitive, whereby bit sequences a, b, c of a maximum length are produced, said registers having a different number of cells n a , n b , n c , said three registers having outputs a i , b j and c k , and in which the addresses of the cutting points are constituted by the sum of N coefficients S 0 to . . . S N-1 , where at least S N -1, S N -2, S N -3 and S N -4 are formed by the modulo 2 addition of said three outputs a i ⊕b j ⊕c k , where the ranks i, j and k are selected to be different by the degrees n a , n b , n c of said registers.

Claim 5

Dependent Claim 58 words

An address generator as claimed in claim 1 or 2, characterized in that the numbers of the cells n a , n b , n c are chosen so that the lengths (2 n .sbsp.a -1), (2 n .sbsp.b -1) and (2 n .sbsp.c -1) of the sequences delivered by the registers produce a maximum length pseudo-random sequence.

Claim 6

Dependent Claim 93 words

An adder generator as claimed in claim 3, in which the logic equation of at least two of the coefficients of greatest weight comprises a logic addition of the type a i" , ⊕b j" , ⊕c k" , the outputs a i a i , b j b j , c k c k , used for the two first coefficients and the outputs a i" b j" c k" used for the subsequent coefficients are chosen to be different by the degrees n a , n b , n c .

Claim 7

Dependent Claim 198 words

A psuedo-random generator as claimed in claim 3 wherein the logic equations of the two coefficients of greatest weight comprise the logic addition of a product b j (a i ⊕b j' ⊕c k ) and a product b j (a i' ⊕b j' ⊕c k' ) or b j (a i' ⊕b j' ⊕c k' ) for one of these coefficients and, for the other coefficients, the logic addition of a product c k" (a i" ⊕b j" ⊕c k"' ) and a product c k" (a i"' ⊕b j"' ⊕c k"' ) or c k" (a i"' ⊕b j"' ⊕c k"' ), and in which the logic equations of at least two of the coefficients of greatest weight that follow comprise a logic addition of the type (a i"" ⊕b j"" ⊕c k"" ), the outputs a i a i' a i" a i"' b j b j' b j" b j"' c k c k' c k" c k"' , used for the two first coefficients and the outputs a i"" b j"" c k"" used for the coefficients that follow being different by the degrees n a , n b , n c .

Claim 8

Dependent Claim 37 words

A pseudo-random generator as claimed in claim 5, wherein the maximum possible number of addresses 2 N is chosen equal to the first power of two less than the length of the line which comprises M samples.

Claim 9

Dependent Claim 170 words

An address generator as claimed in claim 1, wherein of the strongest of said weight coefficients comprises logic addition of two logic products, one of them being effected between an output a i or a i of the longest register and a modulo 2 addition of the type (a i , ⊕b j , ⊕c k ) and the other between the complementary output a i or a i of said longest register and a modulo 2 addition of the type (a i , ⊕b j , ⊕c k ) or of the type (a i , ⊕b j , ⊕c k ), and in which the logic equation of at least three of the other following coefficients of greatest weight comprise a logic addition of the type (a i" , ⊕b j" , ⊕c k" ), the outputs used for the first coefficients and those used for the subsequent coefficients being chosen different as far as permitted by the degrees n a , n b and n c .

Claim 10

Dependent Claim 98 words

A psuedo-random generator as claimed in claim 7, characterized in that the maximum possible number of addresses 2 N is chosen equal to the first power of two greater than the number of samples M of the line, and in which the addresses 2 p between 2 N -2 p and 2 N -1 are reduced by a quantity 2 q , p being chosen so that 2 N -2 p are less than M, and q being chosen equal to or greater than p but such that 2 q is less than 2 N -2 p .

Claim 11

Dependent Claim 77 words

A pseudo-random generator as claimed in claim 8, wherein the 2 r addresses comprised between 0 and 2 r -1 are increased by a quantity 2 s , r being chosen in such a way that 2 r is greater than the length L of a reference segment of the signal which is not to be rotated and s being chosen at least equal to r but such that 2 s is less than M-2 r .

Claim 12

Dependent Claim 56 words

A pseudo-random generator as claimed in claim 7, wherein at regular intervals which are multiples of the frame period, a synchronization pulse from an internal clock reloads three initial words in the shift registers, said three initial words of respective lengths n a , n b , n c constituting the decoding key for the system.

Claim 13

Dependent Claim 115 words

A pseudo-random generator as claimed in claim 10, wherein said three initial words placed end to end constitute the n d =n a +n b +n c bits of the key, said key being stored in a fourth shift register of n d stages having output to input feedback, said three registers being loaded by opening the loop or loops of said registers and connecting the inputs of the three registers to three taps on the fourth register separated respectively by a number of stages equal to n b and n c , and by effecting n d clock pulses, and by subsequently disconnecting the three registers from the fourth register and reconnecting said loops.

Claim 14

Dependent Claim 67 words

A pseudo-random generator as claimed in claim 11, wherein when a new key arrives the feedback loop of the fourth register is open and its input is connected to receive the key, and n d clock pulses are supplied for transferring the n d bits of the key to the fourth register, said fourth register being subsequently disconnected from receiving the key and its loop is reconnected.

Claim 15

Dependent Claim 96 words

A pseudo-random generator as claimed in claim 1 wherein the signal to be encoded is of the time-division multiplexing type of f analog components of length M g , each beginning with a reference period of length L g which is not to be rotated, independent rotations are applied to different components of the signal after each cutting in which the f addresses of the cutting points are calculated from the outputs a i b j c k of the three registers, and in which the logic equations chosen for determining the f addresses are independent.

Claim 16

Dependent Claim 70 words

A pseudo-random generator as claimed in claim 2, wherein the three registers each have two outputs denoted a 0 , a 1 , b 0 , b 1 , c 0 and c 1 and in which the S coefficients are formed as: a.sub.1 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.1 (a.sub.0 ⊕b.sub.1 ⊕c.sub.1) or a.sub.1 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.1 (a.sub.0 ⊕b.sub.1 ⊕c.sub.1), the values of the six outputs being measured at the same instant.

Claim 17

Dependent Claim 77 words

A pseudo-random generator as claimed in claim 2, wherein the first register has three outputs denoted a 0 , a 1 and a 2 , in which the second and third registers each have two outputs denoted b 0 , b 1 , c 0 and c 1 and in which the logic equation is of the form: a.sub.2 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.2 (a.sub.1 ⊕b.sub.1 ⊕c.sub.1) the values of the seven outputs being measured at the same instant.

Claim 18

Dependent Claim 95 words

A pseudo-random generator as claimed in claim 2, wherein the three registers each have three outputs denoted a 0 , a 1 , a 2 , b 0 , b 1 , b 2 , c 0 , c 1 and c 2 and in which the logic equation comprises the logic addition of the three logic products effected between two modulo 2 additions of different outputs: (a.sub.0 ⊕b.sub.0 ⊕c.sub.0) (a.sub.1 ⊕b.sub.1 ⊕c.sub.1)+(a.sub.1 ⊕b.sub.1 ⊕c.sub.1) (a.sub.2 ⊕b.sub.2 ⊕c.sub.2)+(a.sub.2 ⊕b.sub.2 ⊕c.sub.2) (a.sub.0 ⊕b.sub.0 ⊕c.sub.0) the values of the nine outputs being measured at the same instant.

Claim 19

Dependent Claim 105 words

A pseudo-random generator as claimed in claim 2 wherein the three registers have only one output, in which the clock frequency F of the registers is equal to or greater than 2M times the video signal line frequency, and in which the logic equation is a function of three outputs a 0 , b 0 , c 0 at the instant t 0 and of three outputs a 1 , b 1 , c 1 at the instant t 0 +1/F or t 0 -1/F and is of the form: a.sub.1 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.1 (a.sub.0 ⊕b.sub.1 ⊕c.sub.1) or a.sub.1 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.1 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0).

Claim 20

Dependent Claim 126 words

A pseudo-random generator as claimed in claim 2, wherein the first register has two outputs and the second and third registers one output, the clock frequency F of the registers being equal to or greater than 2M times the video signal line frequency, and in which the logic equation is a function of the values a 0 , b 0 , c 0 of three outputs at the instant t 0 , of the values a 1 , b 1 , c 1 of these three same outputs at the instant t 0 +1/F and of the value a 2 of the second output of the first register at the instant t 0 +1/F and is of the form: a.sub.2 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.2 (a.sub.1 ⊕b.sub.1 ⊕c.sub.1).

Claim 21

Dependent Claim 109 words

A pseudo-random generator as claimed in claim 2, wherein the three registers have only one output, in which the clock frequency F of the registers is equal to or greater than 3M times the video signal line frequency, and in which the logic equation is a function of three outputs a 0 , b 0 , c 0 at the instant t 0 , of three outputs a 1 , b 1 , c 1 at the instant t 0 +1/F and of one output a 2 at the instant t 0 +2/F for t 0 -1/F and is of the form: a.sub.2 (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)+a.sub.2 (a.sub.1 ⊕b.sub.1 ⊕c.sub.1).

Claim 22

Dependent Claim 116 words

A pseudo-random generator as claimed in claim 2, wherein the three registers have only one output, in which the clock frequency F of the registers is equal to or greater than 3M times the video signal line frequency, and in which the coefficients are a function of three outputs a 0 , b 0 , c 0 at the instant t 0 , of three outputs a 1 , b 1 , c 1 at the instant t 0 +1/F and of three outputs a 2 , b 2 , c 2 at the instant t 0 +2/F and is of the form: (a.sub.0 ⊕b.sub.0 ⊕c.sub.0)(a.sub.1 ⊕b.sub.1 ⊕c.sub.1)+(a.sub.1 ⊕b.sub.1 ⊕c.sub.1)(a.sub.2 ⊕b.sub.2 ⊕c.sub.2)+(a.sub.2 ⊕b.sub.2 ⊕c.sub.2)(a.sub.0 ⊕b.sub.0 ⊕c.sub.0).

Claim 23

Dependent Claim 24 words

A pseudo-random generator as claimed in claim 20, characterized in that the number M of the address coefficients is equal to a power 2.

Claim 24

Dependent Claim 28 words

A pseudo-random generator as claimed in claim 20, wherein the numbers of cells n a , n b and n c are chosen to be an odd number.

Claim 25

Dependent Claim 36 words

A pseudo-random generator as claimed in claim 20, wherein the number M is divisible by 5, and the numbers of cells n a , n b , n c are chosen to be non-divisible by 4.

Claim 26

Dependent Claim 36 words

A pseudo-random generator as claimed in claim 20, wherein the number M is divisible by 7, and the numbers of cells n a , n b , n c are chosen to be non-divisible by 3.

Claim 27

Dependent Claim 66 words

A pseudo-random generator as claimed in claim 20, wherein the clock frequency is chosen equal to the product of the video signal line frequency by a number which is first with (2 a -1), 2 n .sbsp.b -1) and (2 n .sbsp.c -1) or by a simple fraction whose numerator is first with (2 n .sbsp.a -1), 2 n .sbsp. -1) and (2 n .sbsp.c -1).

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1990-03-09	1990-09-08	1991-03-10	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1994-03-09	1994-09-08	1995-03-10	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1998-03-09	1998-09-08	1999-03-10	$7700.00	Window Closed / Lapsed

Pseudo-random binary sequency generator

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag