Pseudorandom binary sequence block shifter

• US 6,141,669 A
• Filed: 05/06/1998
• Issued: 10/31/2000
• Est. Priority Date: 05/06/1998
• Status: Expired due to Term

• Current Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Original Assignee: Nortel Networks Corporation
• Inventors: Carleton, Gregory
• Primary Examiner(s): Mai, Tan V.
• Application Number:
  US09/073,453
• Time in Patent Office: 909 Days
• Field of Search: 708/250-256, 708/492, 380/46, 380/50, 375/208
• US Class Current: 708/252
• CPC Class Codes: H03K 3/84 Generating pulses having a predetermined statistical distribution of a parameter, e.g. random pulse generators
• CPC Class Codes: H04B 1/707 using direct sequence modulation

Abstract

A method and apparatus for determining the state, at any time in the past, relative to a present state, of a linear feedback shift register comprises determining a an inverse transition matrix which, if multiplied by the current state in modulo-2 arithmetic, yields the state one step into the past; and multiplying in modulo-2 arithmetic the present state of the linear feedback shift register by the inverse transition matrix N times to obtain the state N steps into the past.

Claims

1. A method of restoring a linear feedback shift register to a state that it had N clock pulses prior to a present state, N being an integer greater than or equal to 1, comprising:

determining a first inverse transition matrix for the linear feedback shift register such that modulo-2 multiplication of a current binary vector contained in the linear feedback shift register by the first inverse transition matrix produces a binary vector that was contained in the linear feedback shift register prior to the clock pulse which advanced the linear feedback shift register to its current binary vector;

determining a second inverse transition matrix which is the first inverse transition matrix raised to a power J where J is an integer, and

if J is equal to N, multiplying in modulo-2 arithmetic the second inverse transition matrix by the current binary vector to produce the binary vector that was contained in the linear feedback shift register N clock pulses prior to the present state; and

loading the binary vector into the linear feedback shift register.

2. The method of claim 1 wherein if J is not equal to N:

multiplying in modulo-2 arithmetic the second inverse transition matrix by the current binary vector to produce the binary vector that was contained in the linear feedback shift register J clock pulses prior to the present state;

reducing the value of N by the value of J;

repeating the multiplying and reducing steps if the reduced N is greater than 0;

loading the binary vector into the linear feedback shift register; and

shifting the linear feedback shift register forward ABS(N) times if the reduced N is less than 0, where ABS(N) is the absolute value of the reduced N.

3. The method of claim 2 wherein the linear feedback shift register has M stages where N is greater than or equal to M, and

J is an integer multiple of M.

4. The method of claim 2 wherein:

said second inverse transition matrix has been predetermined and stored.

5. The method of claim 2 wherein:

said second inverse transition matrix is selected from a plurality of third inverse transition matrices which have been predetermined and stored, each being the first inverse transition matrix raised to a different integer power.

6. The method of claim 1 wherein the linear feedback shift register has M stages and J is equal to I*M where I is an integer and N is greater than 2^M -1, and the method further comprises converting N to its modulo(2^M) value prior to the multiplying step.

7. The method of claim 1 wherein the linear feedback shift register leads a second linear feedback shift register by N clock pulses, whereby restoring the linear feedback shift register to the state that it had N clock pulses prior to the present state synchronizes the linear feedback shift register with the second linear feedback shift register.

8. The method of claim 7 to be practiced in a CDMA system wherein the linear feedback shift register is in a base station and the second linear feedback shift register is in a mobile station.

9. The method of claim 7 to be practiced in a CDMA system wherein the linear feedback shift register is in a mobile station and the second linear feedback shift register is in a base station.

10. Apparatus for restoring a linear feedback shift register to a state that it had N clock pulses prior to a present state, N being an integer greater than or equal to 1, comprising:

means for determining a first inverse transition matrix for the linear feedback shift register such that modulo-2 multiplication of a current binary vector contained in the linear feedback shift register by the first inverse transition matrix produces a binary vector that was contained in the linear feedback shift register prior to the clock pulse which advanced the linear feedback shift register to its current binary vector;

means for determining a second inverse transition matrix which is the first inverse transition matrix raised to a power J where J is an integer;

means for determining whether J is equal to N;

means for multiplying, if J is equal to N, in modulo-2 arithmetic the second inverse transition matrix by the current binary vector to produce the binary vector that was contained in the linear feedback shift register N clock pulses prior to the present state; and

means for loading, if J is equal to N, the binary vector into the linear feedback shift register.

11. The apparatus of claim 10, further comprising:

means for multiplying, if J is not equal to N, in modulo-2 arithmetic the second inverse transition matrix by the current binary vector to produce the binary vector that was contained in the linear feedback shift register J clock pulses prior to the present state; and

means for reducing the value of N by the value of J;

means for repeating the multiplying and reducing operations if the reduced N is greater than 0;

means for loading the binary vector into the linear feedback shift register if the reduced N is equal to or less than 0; and

means for shifting the linear feedback shift register forward ABS(N) times if the reduced N is less than 0, where ABS(N) is the absolute value of the reduced N.

12. The apparatus of claim 11 further comprising:

means for predetermining and storing the second inverse transition matrix.

13. The apparatus of claim 12 further comprising:

means for predetermining and storing a plurality of third inverse transition matrices, each being the first inverse transition matrix raised to a different integer power; and

means for selecting the second inverse transition matrix from among the plurality of third inverse transition matrices.

14. The apparatus of claim 10 wherein the linear feedback shift register has M stages and J is equal to I*M where I is an integer and N is greater than 2^M -1, and

further comprising means for converting N to its modulo(2^M) value prior to the multiplying operation.

15. The apparatus of claim 10 wherein the linear feedback shift register has M stages where N is greater than or equal to M, and

J is an integer multiple of M.

16. The apparatus of claim 10 wherein the linear feedback shift register leads a second linear feedback shift register by N clock pulses, whereby restoring the linear feedback shift register to the state that it had N clock pulses prior to the present state synchronizes the linear feedback shift register with the second linear feedback shift register.

17. The apparatus of claim 16 in a CDMA system wherein the linear feedback shift register is in a base station and the second linear feedback shift register is in a mobile station.

18. The apparatus of claim 16 in a CDMA system wherein the linear feedback shift register is in a mobile station and the second linear feedback shift register is in a base station.

19. Apparatus for restoring a linear feedback shift register to a state that it had N clock pulses prior to a present state, N being an integer greater than or equal to 1, comprising:

a logic device for determining a first inverse transition matrix for the linear feedback shift register such that modulo-2 multiplication of a current binary vector contained in the linear feedback shift register by the first inverse transition matrix produces a binary vector that was contained in the linear feedback shift register prior to the clock pulse which advanced the linear feedback shift register to its current binary vector;

the logic device being further adapted to determine a second inverse transition matrix which is the first inverse transition matrix raised to a power J where J is an integer;

the logic device being further adapted to determine whether J is equal to N;

the logic device being further adapted to multiply, if J is equal to N, in modulo-2 arithmetic the second inverse transition matrix by the current binary vector to produce the binary vector that was contained in the linear feedback shift register N clock pulses prior to the present state; and

a loading circuit for loading, if J is equal to N, the binary vector into the linear feedback shift register.

20. The apparatus of claim 19 wherein:

the logic device is further adapted to multiply, if J is not equal to N, in modulo-2 arithmetic the second inverse transition matrix by the current binary vector to produce the binary vector that was contained in the linear feedback shift register J clock pulses prior to the present state;

the logic device is further adapted to reduce the value of N by the value of J after each multiplication;

the logic device is further adapted to repeat the multiplying and reducing operations if the reduced N is greater than 0; and

the apparatus further includes a loading circuit to load the binary vector into the linear feedback shift register if the reduced N is equal to or less than 0;

the apparatus further includes a shifter for shifting the linear feedback shift register forward ABS(N) times after loading it if the reduced N is less than 0, where ABS(N) is the absolute value of the reduced N.

21. The apparatus of claim 20 wherein:

the logic device is further adapted to predetermine and store the second inverse transition matrix.

22. The apparatus of claim 20 wherein:

the logic device is further adapted to predetermine and store a plurality of third inverse transition matrices, each being the first inverse transition matrix raised to a different integer power; and

the logic device is further adapted to select the second inverse transition matrix from among the stored third inverse transition matrices.

23. The apparatus of claim 19 wherein the linear feedback shift register has M stages and J is equal to I*M where I is an integer and N is greater than 2^M -1, and the logic device is further adapted to convert N to its modulo(2^M) value prior to the multiplying operation.

24. The apparatus of claim 19 wherein the linear feedback shift register has M stages where N is greater than or equal to M, and

J is an integer multiple of M.

25. The apparatus of claim 19 wherein the linear feedback shift register leads a second linear feedback shift register by N clock pulses, whereby restoring the linear feedback shift register to the state that it had N clock pulses prior to the present state synchronizes the linear feedback shift register with the second linear feedback shift register.

26. The apparatus of claim 25 in a CDMA system wherein the linear feedback shift register is in a base station and the second linear feedback shift register is in a mobile station.

27. The apparatus of claim 25 in a CDMA system wherein the linear feedback shift register is in a mobile station and the second linear feedback shift register is in a base station.

28. The apparatus of claim 19 further comprising memory means for storing instructions, and wherein

the logic device is responsive to at least one instruction stored by said memory means.