ASSIGNMENT 4

Spread Spectrum Engineering

1. Use the polynomials in Table B1.1 of the primary text to generate 3 rd, 4th, and 5th
order linear recursive sequences.

2. Show for the 4th order sequence that all 15 possible 4 bit combinations are
generated, but in apparently random order.

3. Show that ones and zeros occur approximately 50% of the time. Why is there one
more 1 than 0 in each of the sequences generated using shift registers?

4. Use a fourth order polynomial to generate a maximal length PRN using a shift
register.

5. Correlate the sequence with all fifteen of its shifts.

6. Reverse the taps on the shift register to create a new fourth order polynomial.

7. Correlate this sequence with the shift register sequence from 4 above.

8. What is the difference between the polynomial used in the PRN of problem 4 and
that used in problem 6? (Hint, x^3 + x^2 +1 becomes x^3 + x + 1 for one particular
third order example.)

9. Use a fourth order polynomial that isn’t in Table B1.1 to calculate 2 or more
subsequences (by using different initial fills) to generate the multiple subsequences
required to generate all 15 combinations of 4-bit register fills.

10. Comment on the problem of using these non-maximal length sequences for a
practical spread spectrum system.

11. Use the fifth order polynomial from Table B1.1 to reduce x n, from n = 0 to n = 2N – 1,
modulo the polynomial, which from the table is 1 + X 2 + X5

12. Show that 15 mod 12 = 3.

13. Compute x5 mod (1 + x + x3)