Spread spectrum spectral density techniques

Claims

We claim:

1. A method, comprising the steps of

receiving a plurality of data bits;

generating a pseudo-random chip sequence and an inverse of said pseudo-random chip sequence;

pseudo-randomly selecting one or the other of said pseudo-random chip sequence or its inverse;

generating a new chip sequence in response to said selection; and

modulating each one of said plurality of data bits with said new chip sequence.

2. A method as in claim 1, wherein said step of pseudo-randomly selecting comprises the steps of

generating a second pseudo-random chip sequence, said second pseudo-random chip sequence comprising one chip for each data bit; and

generating said new chip sequence in response to a boolean operation performed on said original pseudo-random chip sequence and said second pseudo-random chip sequence.

3. A method, comprising the steps of

receiving a plurality of data bits;

receiving a pseudo-random chip sequence; and

generating a spread-spectrum signal in response to said plurality of data bits and said pseudo-random chip sequence, said spread-spectrum signal having a smoother spectral energy density than that of a spread-spectrum signal generated by direct-sequence modulation of said plurality of data bits with said pseudo-random chip sequence.

4. A method as in claim 3, wherein said pseudo-random chip sequence is a 63-chip maximal length code.

5. A method, comprising the steps of

receiving a plurality of data bits;

receiving a pseudo-random chip sequence; and

generating a spread-spectrum signal in response to said plurality of data bits and a transformation of said pseudo-random chip sequence, said spread-spectrum signal having a smoother spectral energy density than that of a spread-spectrum signal generated by direct-sequence modulation of said plurality of data bits with said pseudo-random chip sequence.

6. A method as in claim 5, wherein said pseudo-random chip sequence is a 63-chip maximal length code.

7. A method as in claim 5, wherein said transformation of said pseudo-random chip sequence is an inverse of said pseudo-random chip sequence.

8. A method, comprising the steps of

receiving a plurality of data bits;

generating a first pseudo-random chip sequence at a rate of more than one chip per bit;

generating a second pseudo-random chip sequence at a rate of no more than one chip per bit;

generating a signal in response to said first and second pseudo-random chip sequences; and

spread-spectrum modulating said plurality of data bits with said signal.

9. A method as in claim 8, wherein said step of generating a signal comprises XOR-ing said first and second pseudo-random chip sequences.

10. A method as in claim 8, wherein said first pseudo-random chip sequence is a 63-bit maximal length code.

11. A method as in claim 8, wherein said second pseudo-random chip sequence has a rate of exactly one chip per bit.

12. A code generator for use in a spread spectrum communication system comprising:

a first pseudo-noise generator having as an output a first chip sequence,

a second pseudo-noise generator having as an output a second chip sequence,

an XOR gate, said XOR gate having as inputs said first chip sequence and said second chip sequence, and having as an output either said first chip sequence or an inverse of said first chip sequence in response to said second chip sequence.

13. The code generator of claim 12 further comprising a modulator comprising a first and second input, said output of said XOR gate coupled to said first input, and a data signal coupled to said second input.

14. The code generator of claim 13 wherein said data signal comprises a series of data bits clocked at a predefined rate, and said second chip sequence comprises a series of chips, wherein said second chip sequence is clocked at said predefined rate.

15. The code generator of claim 13 wherein a signal output from said modulator is coupled to a transmitter, and said transmitter transmits said modulator signal over a communication channel.

16. A method of generating a spread spectrum signal comprising the steps of

receiving a plurality of data bits;

generating a first pseudo-random chip sequence,

generating at selected intervals either a second pseudo-random chip sequence or an inverse of said second pseudo-random chip sequence in response to said first pseudo-random chip sequence, and forming a modulation signal thereby;

modulating each one of said plurality of data bits with said modulation signal.

17. A method as in claim 16, wherein said selected intervals correspond to boundaries of said data bits.

18. A spread spectrum code generator comprising:

a first pseudo-noise generator capable of outputting a first chip sequence,

a second pseudo-noise generator capable of outputting a second chip sequence,

means for selecting either said first chip sequence or an inverse of said first chip sequence in response to said second chip sequence, and generating an output signal thereby.

19. A spread spectrum code generator as in claim 18, wherein said means for selecting comprises and XOR gate having as inputs said first chip sequence and said second chip sequence.

20. A spread spectrum code generator as in claim 18 wherein said output signal is modulated with a data signal comprising data bits clocked at a predefined rate, and said second chip sequence has a chip rate equal to said predefined rate.