Communication methods and apparatus based on orthogonal hadamard-based sequences having selected correlation properties

• US 6,526,091 B1
• Filed: 08/17/1998
• Issued: 02/25/2003
• Est. Priority Date: 08/17/1998
• Status: Expired due to Term

• Current Assignee: Unwired Planet LLC (JP Morgan Chase & Co)
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Nyström, Johan, Popovic, Branislav
• Primary Examiner(s): Le, Amanda T.
• Application Number:
  US09/135,247
• Time in Patent Office: 1,653 Days
• Field of Search: 375/140, 375/141, 375/142, 375/146, 375/147, 375/150, 375/145, 375/149, 370/208-210, 370/342
• US Class Current: 375/142
• CPC Class Codes: H04J 13/0044 OVSF [orthogonal variable spreading factor]
• CPC Class Codes: H04J 13/16 Code allocation

Abstract

Methods and apparatus for synchronization of a transmitter and a receiver are based on orthogonal sequences having optimized correlation properties. The transmitter may generate signed versions of S-Hadamard sequences that are obtained by position-wise scrambling a set of Walsh-Hadamard sequences with a special sequence having complex elements of constant magnitude. The receiver estimates a time location and sequence identity of a received version of the synchronization signal.

Claims

1. A method of determining a scrambling code group for a received signal in a digital communication system, in which signals are scrambled by respective scrambling codes, the scrambling codes are assigned to respective scrambling code groups, identities of the scrambling code groups are encoded in the signals by respective code-word-wise cyclically distinct sequences of signed code words, the method comprising the steps of:

correlating the received signal to each of a plurality of the code words, wherein the code words are S-Hadamard sequences;

coherently combining the correlations in accordance with cyclic shifts of each of a plurality of sequences of signs; and

determining a maximal coherently combined correlation to identify the scrambling code group for the received signal.

2. The method of claim 1, wherein each sequence of signed code words corresponds to a frame of the received signal, and determining the maximal coherently combined correlation identifies a start of the frame.

3. A method of determining a scrambling code group for a received signal in a digital communication system, in which signals are scrambled by respective scrambling codes, the scrambling codes are assigned to respective scrambling code groups, identities of the scrambling code groups are encoded in the signals by respective code-word-wise cyclically distinct sequences of code words, the method comprising the steps of:

correlating the received signal to cyclic shifts of each of a plurality of sequences of code words, wherein the code words are S-Hadamard sequences;

combining the correlations for each of the plurality of sequences of code words; and

determining a maximal combined correlation to identify the scrambling code group for the received signal.

4. The method of claim 3, wherein each sequence of code words corresponds to a frame of the received signal, and determining the maximal combined correlation identifies a start of the frame.

5. The method of claim 3, wherein the correlations are coherently combined.

6. The method of claim 3, wherein the correlations are non-coherently combined.

7. A digital radio transmission system having at least one transmitter and at least one receiver, comprising:

means in the transmitter for generating a synchronization signal that includes signed versions of S-Hadamard sequences, wherein the S-Hadamard sequences correspond to members of a first set of Walsh-Hadamard sequences position-wise scrambled with a special sequence having complex elements of constant magnitude;

means in the receiver for estimating a time location and sequence identity of a received version of the synchronization signal.

8. The system of claim 7, wherein the estimating means descrambles the received version based on the special sequence and correlates the descrambled received version to members of the first set of Walsh-Hadamard sequences for identifying the sequence identity.

9. The system of claim 8, wherein the estimating means correlates using a Fast Walsh Transform.

10. The system of claim 7, wherein the estimating means correlates the received version to the S-Hadamard sequences for identifying the sequence identity.

11. The system of claim 7, wherein the estimating means descrambles the received version based on the special sequence, forms consecutive partial decorrelations of the descrambled received version with a subsequence of a member of the first set of Walsh-Hadamard sequences, and correlates the consecutive partial decorrelations to members of a second set of Walsh-Hadamard sequences, and the members of the second set have lengths less than lengths of the members of the first set.

12. The system of claim 11, wherein the estimating means correlates the consecutive partial decorrelations to members of the second set using a Fast Walsh Transform.

13. The system of claim 7, wherein the estimating means forms consecutive partial decorrelations of the received version with a plurality of short sequences and correlates the consecutive partial decorrelations with members of a second set of Walsh-Hadamard sequences, and the short sequences and the members of the second set have lengths less than lengths of the members of the first set, and the short sequences correspond to position-wise multiplication of the special sequence and a subsequence of a member of the first set.

14. The system of claim 13, wherein the estimating means correlates the consecutive partial decorrelations with members of the second set using a Fast Walsh Transform.

15. The system of claim 7, wherein the special sequence is an orthogonal Gold code sequence.

16. The system of claim 7, wherein the special sequence is one of a pair of complementary code word sequences.

17. A method of determining a time location of a received signal and identifying a Walsh-Hadamard sequence encoded as a S-Hadamard sequence included in the received signal, wherein the S-Hadamard sequence is a product of the Walsh-Hadamard sequence and a special sequence having complex elements of constant magnitude and the Walsh-Hadamard sequence is a member of a first set of Walsh-Hadamard sequences, comprising the steps of:

forming a position-wise product of the received signal and the special sequence; and

correlating the product with each of a plurality of Walsh-Hadamard sequences for identifying the Walsh-Hadamard sequence encoded in the received signal.

18. The method of claim 17, wherein the position-wise product is correlated with members of the first set based on a Fast Walsh Transform.

19. The method of claim 17, wherein the position-wise product is correlated by forming consecutive partial decorrelations of the position-wise product with a subsequence of a member of the first set of Walsh-Hadamard sequences and correlating the consecutive partial decorrelations to members of a second set of Walsh-Hadamard sequences, and the members of the second set have lengths less than lengths of the members of the first set.

20. The method of claim 19, wherein the consecutive partial decorrelations are correlated to members of the second set using a Fast Walsh Transform.

21. The method of claim 17, wherein the position-wise product is correlated by forming consecutive partial decorrelations of the position-wise product with a plurality of short sequences and correlating the consecutive partial decorrelations with members of a second set of Walsh-Hadamard sequences, and the short sequences and the members of the second set have lengths less than lengths of the members of the first set, and the short sequences correspond to position-wise multiplication of the special sequence and a subsequence of a member of the first set.

22. The method of claim 21, wherein the consecutive partial decorrelations are correlated with members of the second set using a Fast Walsh Transform.

23. The method of claim 17, wherein the special sequence is an orthogonal Gold code sequence.

24. The method of claim 17, wherein the special sequence is one of a pair of complementary code word sequences.

25. A method of communicating an identity of a scrambling code group for a transmitted signal in a digital communication system, in which signals are scrambled by respective scrambling codes and the scrambling codes are assigned to respective scrambling code groups, comprising the steps of:

providing at least one S-Hadamard sequence; and

encoding the identity of the scrambling code group in the transmitted signal as a code-word-wise cyclically distinct sequence of signed S-Hadamard sequences.

26. The method of claim 25, wherein the sequence of signed S-Hadamard sequences corresponds to a frame of the transmitted signal.

27. A method of communicating an identity of a scrambling code group for a transmitted signal in a digital communication system, in which signals are scrambled by respective scrambling codes and the scrambling codes are assigned to respective scrambling code groups, comprising the steps of:

providing a plurality of S-Hadamard code words; and

encoding the identity of the scrambling code group in the transmitted signal as a code-word-wise cyclically distinct sequence of the S-Hadamard code words.

28. The method of claim 27, wherein the sequence of S-Hadamard code words corresponds to a frame of the transmitted signal.

29. A signal generator in a radio transmitter, comprising:

a special sequence generator that produces a special sequence having complex elements of constant magnitude;

an S-Hadamard sequence generator that receives the special sequence and that produces at least one S-Hadamard sequence based on the special sequence, wherein S-Hadamard sequences correspond to respective members of a set of Walsh-Hadamard sequences position-wise scrambled with the special sequence;

an identity generator that produces a scrambling code group identity;

a selector that selects an S-Hadamard sequence produced by the S-Hadamard sequence generator based on the scrambling code group identity;

a combiner that combines the S-Hadamard sequence selected by the selector with an information signal, forming a combined signal.

30. The signal generator of claim 29, wherein the special sequence generator includes a memory from which the special sequence is retrieved.

31. The signal generator of claim 29, wherein the S-Hadamard sequence generator includes a processor that recursively generates Walsh-Hadamard sequences and a multiplier that forms products of the special sequence and Walsh-Hadamard sequences generated by the processor.

32. The signal generator of claim 29, wherein the S-Hadamard sequence generator includes a memory in which Walsh-Hadamard sequences are stored and a multiplier that forms products of the special sequence and Walsh-Hadamard sequences retrieved from the memory.

33. The signal generator of claim 29, wherein the identity generator includes a memory from which the scrambling code group identity is retrieved.

34. An apparatus for use in determining a scrambling code group for a received signal in a digital communication system, in which signals are scrambled by respective scrambling codes, the scrambling codes are assigned to respective scrambling code groups, identities of the scrambling code groups are encoded in the signals by respective code words, the apparatus comprising:

an S-Hadamard code word generator that produces at least one S-Hadamard code word based on a special sequence, wherein S-Hadamard code words correspond to respective members of a set of Walsh-Hadamard sequences position-wise scrambled with the special sequence; and

a decorrelator, wherein the decorrelator forms at least one correlation of the received signal with at least one S-Hadamard code word produced by the S-Hadamard code word generator.

35. The apparatus of claim 34, wherein the S-Hadamard code word generator includes a memory from which the at least one S-Hadamard code word is retrieved.

36. The apparatus of claim 34, wherein the decorrelator includes:

a primary decorrelator that forms consecutive correlations of the received signal with a plurality of shorter sequences that correspond to position-wise multiplications of the special sequence and a subsequence of a member of the set of Walsh-Hadamard sequences; and

a secondary decorrelator that forms correlations of the consecutive correlations formed by the primary decorrelator with members of a set of Walsh-Hadamard sequences that includes the subsequence.

37. The apparatus of claim 36, wherein the secondary decorrelator is a Fast Walsh Transform processor.

38. The apparatus of claim 36, further comprising a multiplier that forms a product of the received signal and the special sequence, producing a descrambled received signal, and wherein the primary decorrelator forms consecutive correlations of the descrambled received signal with a subsequence of a member of the set of Walsh-Hadamard sequences.

39. The apparatus of claim 38, wherein the primary and secondary decorrelators are a Fast Walsh Transform processor.

40. An apparatus for use in determining a scrambling code group for a received signal in a digital communication system, in which signals are scrambled by respective scrambling codes, the scrambling codes are assigned to respective scrambling code groups, identities of the scrambling code groups are encoded in the signals by respective code words, the apparatus comprising:

a special sequence generator that produces a special sequence having complex elements of constant magnitude;

a multiplier that forms a product of the received signal and the special sequence, producing a descrambled received signal;

a Walsh-Hadamard sequence generator that produces at least one Walsh-Hadamard sequence; and

a decorrelator, wherein the decorrelator forms at least one correlation of the descrambled received signal with at least one Walsh-Hadamard sequence produced by the Walsh-Hadamard sequence generator.

41. The apparatus of claim 40, wherein the special sequence generator includes a memory from which the special sequence is retrieved.

42. The apparatus of claim 40, wherein the Walsh-Hadamard sequence generator includes a processor that recursively generates Walsh-Hadamard sequences.

43. The apparatus of claim 40, wherein the Walsh-Hadamard sequence generator includes a memory from which at least one Walsh-Hadamard sequence is retrieved.

44. The apparatus of claim 40, wherein the Walsh-Hadamard sequence generator and the decorrelator are a Fast Walsh Transform processor.