Multiple access coding using bent sequences for mobile radio communications

• US 5,550,809 A
• Filed: 08/16/1994
• Issued: 08/27/1996
• Est. Priority Date: 04/10/1992
• Status: Expired due to Term

• Current Assignee: Ericsson GE Mobile Communications Inc (Telefonaktiebolaget LM Ericsson)
• Original Assignee: Ericsson GE Mobile Communications Inc (Telefonaktiebolaget LM Ericsson)
• Inventors: Bottomley, Gregory E., Dent, Paul W.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): TON, DANG T
• Application Number:
  US08/291,693
• Time in Patent Office: 742 Days
• Field of Search: 370/18, 370/100.1, 370/20, 370/21, 370/19, 370/22, 370/23, 370/50, 370/95.1, 370/95.2, 370/95.3, 370/85.7, 375/200, 375/205, 375/238, 375/242, 375/353, 375/367, 375/343, 375/286, 380/34, 380/46, 380/47, 380/28, 341/178, 341/81, 455/38.1
• US Class Current: 370/342
• CPC Class Codes: H04B 1/707 using direct sequence modulation
• CPC Class Codes: H04J 13/00 Code division multiplex systems for frequency hopping H04B1/713
• CPC Class Codes: H04J 13/004 Orthogonal
• CPC Class Codes: H04J 13/0048 Walsh
• CPC Class Codes: H04J 13/12 Generation of orthogonal codes
• CPC Class Codes: H04J 13/16 Code allocation
• CPC Class Codes: H04L 1/0057 Block codes H04L1/0061, H04L1/0064 take precedence
• CPC Class Codes: H04L 2209/04 Masking or blinding
• CPC Class Codes: H04L 2209/34 Encoding or coding, e.g. Huffman coding or error correction

Abstract

Information symbols spread using orthogonal or bi-orthogonal codewords are assigned a unique scramble mask that is taken from a set of scramble masks having selected correlation properties. The set of scramble masks is selected such that the correlation between the modulo-2 sum of two scramble masks with any codeword is a constant magnitude, independent of the codeword and the individual masks being compared. In one embodiment, when any two masks are summed using modulo-2 arithmetic, the Walsh transformation of that sum results in a maximally flat Walsh spectrum. For cellular radio telephone systems using subtractive CDMA demodulation techniques, a two-tier ciphering system ensures security at the cellular system level by using a pseudorandomly generated code key to select one of the scramble masks common to all of the mobile stations in a particular cell. Also, privacy at the individual mobile subscriber level is ensured by using a pseudorandomly generated ciphering key to encipher individual information signals before the scrambling operation.

Claims

1. In a system for communicating a sequence of information symbols, a transmitter comprising:

means for spreading each information symbol with a respective spreading sequence, thereby forming a sequence of spread symbols, wherein the spreading sequences are selected from a set of spreading sequences that are mutually orthogonal or bi-orthogonal;

means for scrambling each spread symbol with a common scramble mask, thereby producing a sequence of scrambled symbols, wherein the common scramble mask is selected from a set of scramble masks having optimal or semi-optimal correlation properties; and

means for transmitting the sequence of scrambled symbols over a communication channel.

2. The transmitter of claim 1, wherein a modulo-2 sum of any two scramble masks is a sequence that is substantially equally correlated in magnitude to each of the spreading sequences.

3. The transmitter of claim 1, wherein a modulo-2 sum of any two scramble masks is a sequence that is substantially equally correlated in magnitude to each spreading sequence in a subset of the spreading sequences and that has substantially zero correlation with the remaining spreading sequences.

4. The transmitter of claim 1, wherein the optimal correlation properties include the property that a modulo-2 sum of any two scramble masks is a bent sequence.

5. The transmitter of claim 1, wherein the semi-optimal correlation properties include the property that a modulo-2 sum of any one two scramble masks is a partially bent sequence.

6. The transmitter of claim 1, wherein the spreading sequences are permutations of Walsh-Hadamard codewords.

7. The transmitter of claim 1, wherein the transmitting means includes means for further scrambling the scrambled symbols, thereby producing a sequence of further scrambled symbols, and means for transmitting the further scrambled symbols over the communication channel.

8. The transmitter of claim 1, wherein the spreading means spreads each information symbol of a plurality of sequences of information symbols with a respective spreading sequence, thereby forming a plurality of sequences of spread symbols;

the scrambling means scrambles each spread symbol in each sequence of spread symbols with a respective common scramble mask, thereby producing a plurality of sequences of scrambled symbols;

the transmitter further includes means for combining the plurality of sequences of scrambled symbols, thereby forming a sequence of combined scrambled symbols; and

the transmitting means transmits the sequence of combined scrambled symbols over the communication channel.

9. The transmitter of claim 8, wherein the plurality of sequences of information symbols correspond to all information signals transmitted to a cell in a cellular communication system.

10. The transmitter of claim 8, wherein the plurality of sequences of information symbols correspond to a subset of all information signals transmitted to a cell in a cellular communication system.

11. The transmitter of claim 1, wherein the spreading means and the scrambling means are combined into a means for spreading and scrambling each information symbol with a respective effective spreading sequence, thereby forming a sequence of scrambled spread symbols;

the effective spreading sequences are selected from a set of effective spreading sequences, pairs of the effective spreading sequences either being mutually orthogonal or hi-orthogonal or having optimal or semi-optimal correlation properties; and

the transmitting means transmits the scrambled spread symbols over the communication channel.

12. The transmitter of claim 11, wherein the spreading and scrambling means spreads each information symbol of a plurality of sequences of information symbols with a respective effective spreading sequence, thereby forming a plurality of sequences of scrambled spread symbols;

the transmitter further includes means for combining the plurality of sequences of scrambled spread symbols, thereby forming a sequence of combined scrambled spread symbols; and

the transmitting means transmits the sequence of combined scrambled spread symbols over the communication channel.

13. The transmitter of claim 1, wherein the spreading means spreads each information symbol of a plurality of sequences of information symbols with a respective spreading sequence, thereby forming a plurality of sequences of spread symbols;

the transmitter further includes means for combining the plurality of sequences of spread symbols, thereby forming a sequence of combined spread symbols;

the scrambling means scrambles each combined spread symbol in the sequence of combined spread symbols with a common scramble mask, thereby producing a sequence of scrambled combined spread symbols; and

the transmitting means transmits the sequence of scrambled combined spread symbols over the communication channel.

14. The transmitter of claim 1, further comprising:

means for converting the sequence of information symbols into a sequence of blocks of binary digits;

means for generating first pseudorandom numbers, each first pseudorandom number associated with a respective block, and for generating a second pseudorandom number;

means for combining the first pseudorandom numbers with the respective blocks, thereby generating a sequence of enciphered symbols; and

means for offsetting the second pseudorandom number, thereby forming a scramble mask index;

wherein the spreading means spreads each enciphered symbol with a respective spreading sequence, thereby forming the sequence of spread symbols;

the scrambling means scrambles each spread symbol with the common scramble mask, thereby producing the sequence of scrambled symbols; and

the scramble mask is selected based on the scramble mask index.

15. The transmitter of claim 14, wherein the second pseudorandom number depends on a multi-bit digital control signal and on the block corresponding to the spread symbol scrambled with the scramble mask selected based on the scramble mask index formed by offsetting the second pseudorandom number.

16. The transmitter of claim 14, wherein the combining means and the scrambling means are modulo-2 adders.

17. The transmitter of claim 14, wherein a modulo-2 sum of any two of the scramble masks is a sequence that is substantially equally correlated in magnitude to each of the spreading sequences.

18. The transmitter of claim 14, wherein a modulo-2 sum of any two of the scramble masks is a sequence that is substantially equally correlated in magnitude to each spreading sequence in a subset of the spreading sequences and that has substantially zero correlation with the remaining spreading sequences.

19. In a system for communicating sequences of information symbols, a receiver comprising:

means for receiving a composite signal including a plurality of spectrally overlapping sequences of spread, scrambled information symbols;

means for descrambling the composite signal with a scramble mask selected from a set of scramble masks having optimal or semi-optimal correlation properties, thereby producing a sequence of descrambled symbols;

means for despreading the sequence of descrambled symbols using spreading sequences, including means for correlating at least one shift of each descrambled symbol with at least one of the spreading sequences, thereby producing at least one correlation value for each descrambled symbol, wherein the spreading sequences are mutually orthogonal or bi-orthogonal; and

means for processing the correlation values to detect at least one sequence of information symbols.

20. The receiver of claim 19, wherein the processing means includes a coherent RAKE combiner.

21. The receiver of claim 19, wherein the processing means includes a non-coherent RAKE combiner.

22. The receiver of claim 19, wherein the descrambling means produces a plurality of sequences of descrambled symbols, each sequence of descrambled symbols corresponding to a respective sequence of information symbols;

the despreading means produces at least one correlation value from each descrambled symbol by correlating at least one shift of each descrambled symbol with at least one respective spreading sequence; and

the processing means processes the correlation values to detect the plurality of sequences of information symbols.

23. The receiver of claim 19, wherein the descrambling means and the despreading means are combined into means for descrambling and despreading the composite signal with an effective spreading sequence selected from a set of effective spreading sequences, thereby producing the correlation values;

and

pairs of the effective spreading sequences either have optimal or semi-optimal correlation properties or are mutually orthogonal or hi-orthogonal.

24. The receiver of claim 23, wherein the descrambling and despreading means descrambles and despreads the composite signal with at least one effective spreading sequence selected from a set of effective spreading sequences, thereby producing correlation values for a plurality of sequences of information symbols;

each selected effective spreading sequence corresponds to a respective sequence of information symbols; and

pairs of the effective spreading sequences either have optimal or semi-optimal correlation properties or are mutually orthogonal or bi-orthogonal.

25. The receiver of claim 19, wherein the composite signal includes a plurality of spectrally overlapping sequences of enciphered, spread, scrambled information symbols;

the receiver further comprises means for generating a scramble mask address and for selecting, based on the scramble mask address, a scramble mask from the set of scramble masks having optimal or semi-optimal correlation properties;

the descrambling means descrambles the composite signal with the selected scramble mask, thereby producing the sequence of descrambled symbols;

the processing means processes the correlation values to detect at least one sequence of enciphered information symbols; and

the receiver further comprises means for deciphering the at least one sequence of enciphered information symbols detected by the processing means using a pseudorandom number associated with the respective information symbols.

26. A method of transmitting a sequence of information symbols comprising the steps of:

spreading each information symbol with a respective spreading sequence, thereby forming a sequence of spread symbols, wherein the spreading sequences are selected from a set of spreading sequences that are mutually orthogonal or bi-orthogonal;

scrambling each spread symbol with a common scramble mask, thereby producing a sequence of scrambled symbols, wherein the common scramble mask is selected from a set of scramble masks having optimal or semioptimal correlation properties; and

transmitting the sequence of scrambled symbols over a communication channel.

27. The method of claim 26, wherein a modulo-2 sum of any two scramble masks is a sequence that is substantially equally correlated in magnitude to each of the spreading sequences.

28. The method of claim 26, wherein a modulo-2 sum of any two scramble masks is a sequence that is substantially equally correlated in magnitude to each spreading sequence in a subset of the spreading sequences and that has substantially zero correlation with the remaining spreading sequences.

29. The method of claim 26, wherein the optimal correlation properties include the property that a modulo-2 sum of any two scramble masks is a bent sequence.

30. The method of claim 26, wherein the semi-optimal correlation properties include the property that a modulo-2 sum of any one two scramble masks is a partially bent sequence.

31. The method of claim 26, wherein the spreading sequences are permutations of Walsh-Hadamard codewords.

32. The method of claim 26, wherein the transmitting step includes the steps of further scrambling the scrambled symbols, thereby producing a sequence of further scrambled symbols, and transmitting the sequence of further scrambled symbols over the communication channel.

33. The method of claim 26, wherein each information symbol of a plurality of sequences of information symbols is spread with a respective spreading sequence, thereby forming a plurality of sequences of spread symbols;

each spread symbol in each sequence of spread symbols is scrambled with a respective common scramble mask, thereby producing a plurality of sequences of scrambled symbols;

the method further includes the step of combining the plurality of sequences of scrambled symbols, thereby forming a sequence of combined scrambled symbols; and

the sequence of combined scrambled symbols is transmitted over the communication channel.

34. The method of claim 33, wherein the plurality of sequences of information symbols correspond to all information signals transmitted to a cell in a cellular communication system.

35. The method of claim 33, wherein the plurality of sequences of information symbols correspond to a subset of all information signals transmitted to a cell in a cellular communication system.

36. The method of claim 26, wherein the spreading step and the scrambling step are combined into a step of spreading and scrambling each information symbol with a respective effective spreading sequence, thereby forming a sequence of scrambled spread symbols;

the effective spreading sequences are selected from a set of effective spreading sequences, wherein pairs of the effective spreading sequences either are mutually orthogonal or bi-orthogonal or have optimal or semi-optimal correlation properties; and

the scrambled spread symbols are transmitted over the communication channel.

37. The method of claim 36, wherein the spreading and scrambling step spreads each information symbol of a plurality of sequences of information symbols with a respective effective spreading sequence, thereby forming a plurality of sequences of scrambled spread symbols;

the method further includes the step of combining the plurality of sequences of scrambled spread symbols, thereby forming a sequence of combined scrambled spread symbols; and

the sequence of combined scrambled spread symbols is transmitted over the communication channel.

38. The method of claim 26, wherein the spreading step spreads each information symbol of a plurality of sequences of information symbols with a respective spreading sequence, thereby forming a plurality of sequences of spread symbols;

the method further includes the step of combining the plurality of sequences of spread symbols, thereby forming a sequence of combined spread symbols;

each combined spread symbol in the sequence of combined spread symbols is scrambled with a common scramble mask, thereby producing a sequence of scrambled combined spread symbols; and

the sequence of scrambled combined spread symbols is transmitted over the communication channel.

39. The method of claim 26, further comprising the steps of:

converting the sequence of information symbols into a sequence of blocks of binary digits;

generating first pseudorandom numbers and a second pseudorandom number, each first pseudorandom number being associated with a respective block;

combining the first pseudorandom numbers with the respective blocks, thereby generating a sequence of enciphered symbols; and

offsetting the second pseudorandom number, thereby forming a scramble mask index;

wherein each enciphered symbol is spread with a respective spreading sequence, thereby forming the sequence of spread symbols;

each spread symbol is scrambled with the common scramble mask, thereby producing the sequence of scrambled symbols; and

the scramble mask is selected based on the scramble mask index.

40. The method of claim 39, wherein the second pseudorandom number depends on a multi-bit digital control signal and on the block corresponding to the spread symbol scrambled with the scramble mask selected based on the scramble mask index formed by offsetting the second pseudorandom number.

41. The method of claim 39, wherein each of the combining step and the scrambling step are a step of modulo-2 addition.

42. The method of claim 39, wherein a modulo-2 sum of any two of the scramble masks is a sequence that is substantially equally correlated in magnitude to each of the spreading sequences.

43. The method of claim 39, wherein a modulo-2 sum of any two of the scramble masks is a sequence that is substantially equally correlated in magnitude to each spreading sequence in a subset of the spreading sequences and that has substantially zero correlation with the remaining spreading sequences.

44. A method of detecting information symbols comprising the steps of:

receiving a composite signal including a plurality of spectrally overlapping sequences of spread, scrambled information symbols;

descrambling the composite signal with a scramble mask selected from a set of scramble masks having optimal or semi-optimal correlation properties, thereby producing a sequence of descrambled symbols;

despreading the descrambled symbols using spreading sequences, including the steps of correlating at least one shift of each descrambled symbol with at least one of the spreading sequences, thereby producing at least one correlation value for each descrambled symbol, wherein the spreading sequences are mutually orthogonal or bi-orthogonal; and

processing the correlation values to detect at least one sequence of information symbols.

45. The method of claim 44, wherein the processing step includes a coherent RAKE combining step.

46. The method of claim 44, wherein the processing step includes a non-coherent RAKE combining step.

47. The method of claim 44, wherein the descrambling step produces a plurality of sequences of descrambled symbols, each sequence of descrambled symbols corresponding to a respective sequence of information symbols;

the despreading step produces at least one correlation value from each descrambled symbol by correlating at least one shift of each descrambled symbol with at least one respective spreading sequence; and

the correlation values are processed to detect the plurality of sequences of information symbols.

48. The method of claim 44, wherein the descrambling step and the despreading step are combined into a step of descrambling and despreading the composite signal with an effective spreading sequence selected from a set of effective spreading sequences, thereby producing the correlation values;

and

pairs of the effective spreading sequences either have optimal or semi-optimal correlation properties or are mutually orthogonal or bi-orthogonal.

49. The method of claim 48, wherein the descrambling and despreading step descrambles and despreads the composite signal with at least one effective spreading sequence selected from a set of effective spreading sequences, thereby producing correlation values for a plurality of sequences of information symbols;

each selected effective spreading sequence corresponds to a respective sequence of information symbols; and

pairs of the effective spreading sequences either have optimal or semi-optimal correlation properties or are mutually orthogonal or bi-orthogonal.

50. The method of claim 44, wherein the composite signal includes a plurality of spectrally overlapping sequences of enciphered, spread, scrambled information symbols;

the method further comprises the steps of generating a scramble mask address; and

selecting, based on the scramble mask address, a scramble mask from the set of scramble masks having optimal or semi-optimal correlation properties;

the composite signal is descrambled with the selected scramble mask, thereby producing the sequence of descrambled symbols;

the correlation values are processed to detect at least one sequence of enciphered information symbols; and

the method further comprises the step of deciphering at least one detected sequence of enciphered information symbols using a pseudorandom number associated with the respective information symbols.