Method and apparatus for searching a gated pilot

• US 6,813,478 B2
• Filed: 05/01/2001
• Issued: 11/02/2004
• Est. Priority Date: 02/12/2001
• Status: Expired due to Term

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Black, Peter J., Glazko, Serguei A., Challa, Raghu
• Primary Examiner(s): Hudspeth, David
• Assistant Examiner(s): SMITH, SHEILA B
• Application Number:
  US09/846,963
• Publication Number:
  US 20020160719A1
• Time in Patent Office: 1,281 Days
• Field of Search: 455/67.14, 455/434, 455/515, 455/67.4, 370/491, 370/500, 370/335, 370/342
• US Class Current: 455/67.14
• CPC Class Codes: H04B 1/70758 Multimode search, i.e. using multiple search strategies
• CPC Class Codes: H04B 2201/70701 featuring pilot assisted reception

Abstract

Techniques to search for a gated pilot reference in a wireless communication system. In one method, an overall code space in which the pilot may be found is partitioned into a number of groups of code sets, with each code set representative of all possible chip offsets of a specific PN sequence. The groups are ordered based on the likelihood of detecting the pilot in each of the groups. The groups of code sets are then used to search for the pilot, one group at a time, starting with the group most likely to result in successful pilot acquisition and ending with the group least likely to result in successful pilot acquisition. The search is terminated upon successful acquisition. The pilot search may be performed using detect, dwell, and pull-in substages. The detect substage for one group may be performed in parallel with the pull-in substage for another group.

Claims

1. A method of acquiring a gated pilot signal in an expanded PN space split into a plurality of N non-overlapping groups of specific pilot offsets, wherein the N groups are defined such that when PN_INC=max, a search of only a first of the N groups is necessary for acquisition of the gated pilot signal, while when PN_INC<

max, a search of N or fewer groups is necessary for acquisition of the gated pilot signal, the method comprising;

if PN_INC=max, searching only the first group to identify the gated pilot signal;

if PN_INC<

max, searching at least the first group to identify the gated pilot signal, but fewer than N groups; and

identifying the gated pilot signal from the searched groups,

wherein the first group contains all possible specific pilot offsets for PN_INC=max.

2. The method of claim 1, wherein N is four and max is fours and wherein a second group contains all possible specific pilot offsets for PN_INC=2 not contained with the first group.

3. The method of claim 2, wherein each of the specific pilot offsets in the first group is either 0 or a multiple of 4.

4. The method of claim 3, wherein each of the specific pilot offsets in a second group is a multiple of 2, but not of 4.

5. The method of claim 1, wherein the searched groups are searched in parallel.

6. The method of claim 1, wherein the searched groups are searched sequentially.

7. The method of claim 1, wherein the expanded PN space is an integer multiple of 32,768 chips, where the integer multiple is greater than one.

8. The method of claim 1, wherein the gated pilot signal conforms to IS-856 standard.

9. The method of claim 1, further comprising:

if the gated pilot signal is not identified after searching at least the first group, searching a last group of the N groups.

10. A method for acquiring a gated pilot reference in a wireless communication system, comprising:

partitioning an overall code space in which the pilot reference may be found into a plurality of groups of codes, a first group of codes comprising code sets corresponding to all possible specific pilot offsets for PN_INC=max;

ordering the plurality of groups based on likelihood of detecting the pilot reference in each of the groups;

searching for the pilot reference in accordance with the ordered groups; and

terminating the searching upon acquisition of the pilot reference.

11. The method of claim 10, wherein each code corresponds to a particular chip offset of a pseudo-noise (PN) sequence used to generate the pilot reference.

12. The method of claim 11, wherein the overall code space is partitioned into four groups.

13. The method of claim 12, wherein each of the specific pilot offsets in the first group is either 0 or a multiple of 4.

14. The method of claim 13, wherein each of the specific pilot offsets in a second group is a multiple of 2, but not of 4.

15. The method of claim 11, wherein each group includes a plurality of code sets and each code set is representative of a specific PN sequence with a particular offset.

16. The method of claim 15, wherein the plurality of groups include a first group of code sets most likely to be used to generate the pilot reference and a last group of code sets least likely to be used to generate the pilot reference.

17. The method of claim 10, wherein the searching for the pilot reference is performed for each group and includes

detecting for the pilot reference in a set of samples based on the codes in the group to provide one or more candidate peaks, and

processing each candidate peak to determine acquisition of the pilot reference.

18. The method of claim 17, wherein the searching for the pilot reference further includes pipelining the detecting and processing for different groups to shorten pilot acquisition time.

19. The method of claim 10, wherein the searching for the pilot reference is performed for each group and includes:

detecting for the pilot reference in a set of samples based on the codes in the group to provide a plurality of detected peaks,

dwelling on the plurality of detected peaks to provide one or more candidate peaks, and

processing each candidate peak to determine acquisition of the pilot reference.

20. The method of claim 19, wherein the detecting and dwelling are performed on different sets of samples.

21. The method of claim 19, wherein the detecting and dwelling are performed using different sets of parameter values.

22. The method of claim 19, wherein each group is partitioned into a plurality of segments, and wherein the detecting is performed on each of the plurality of segments and one or more detected peaks are provided for each segment.

23. The method of claim 10, wherein the searching is performed using a plurality of stages, wherein each stage is associated with a respective set of parameter values used for the searching.

24. The method of claim 23, wherein the searching is performed for the plurality of groups for one stage at a time.

25. The method of claim 23, wherein the searching is performed for a first set of one or more groups for the plurality of stages followed by a second set of one or more groups for the plurality of stages.

26. The method of claim 23, wherein the searching is performed using two stages.

27. The method of claims 10, wherein the communication system is a CDMA system.

28. The method of claim 27, wherein the CDMA system conforms to IS-856 standard.

36. The receiver unit of claim 26, wherein each of the PN sequences in the first group has a specific pilot offset of either 0 or a multiple of 4.

37. The receiver unit of claim 36, wherein each of the PN sequences in a second group has a specific pilot offset of a multiple of 2, but not of 4.

29. A method for acquiring a gated pilot reference in a wireless communication system, comprising:

partitioning an overall code space in which the pilot reference may be found into a plurality of groups of non-overlapping code sets, wherein each code set is representative of a specific PN sequence with a particular offset;

ordering the plurality of groups based on likelihood of detecting the pilot reference in each of the groups, with a first group being most likely to be used to generate the pilot reference and a last group being least likely to be used to generate the pilot reference;

searching for the pilot reference based on the plurality of groups, one group at a time, starting with the first group and ending with the last group; and

terminating the searching upon acquisition of the pilot reference,

wherein the first group contains all possible specific pilot offsets for PN_INC=max.

30. The method of claim 29, wherein each of the specific pilot offsets in the first group is either 0 or a multiple of 4.

31. The method of claim 30, wherein each of the specific pilot offsets in a second group is a multiple of 2, but not of 4.

32. A receiver unit in a wireless communication system, comprising:

a searcher element configurable to receive and correlate a first set of samples in accordance with a plurality of groups of PN sequences to provide correlated values used to detect a gated pilot reference, wherein We plurality of groups comprise an overall code space in which the pilot reference may be found, wherein a first group contains all possible specific pilot offsets for PN_INC=max, and are ordered based on likelihood of detecting the pilot reference in each of the groups, and wherein the plurality of groups are used to searched for the pilot reference based on their order and searching terminates upon acquisition of the pilot reference.

33. The receiver unit of claim 32, further comprising:

a demodulation element configurable to receive and process a second set of samples based on a candidate peak, found via processing of the correlated values, to provide an indication of the acquisition of the pilot reference.

34. The receiver unit of claim 33, further comprising:

a controller configured to direct operation of the searcher element and the demodulation element.

35. The receiver unit of claim 34, wherein the controller is further configured to provide to the searcher element a set of values for parameters used to correlate the first set of samples with the groups of PN sequences.

38. An article of manufacture comprising:

a computer usable medium having computer readable program code means embodied therein for causing a gated pilot reference to be acquired in a wireless communication system, the computer readable program code means in said article of manufacture comprising;

computer readable program code means for partitioning an overall code space in which the pilot reference may be found into a plurality of groups of codes, a first group of codes comprising code sets corresponding to all possible specific pilot offsets for PN_INC=max;

computer readable program code means for ordering the plurality of groups based on likelihood of detecting the pilot reference in each of the groups;

computer readable program code means for searching for the pilot reference in accordance with the ordered groups; and

computer readable program code means for terminating the searching upon acquisition of the pilot reference.

39. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for acquiring a gated pilot reference, said method steps comprising:

partitioning an overall code space in which the pilot reference may be found into a plurality of groups of codes, a first groan of codes comprising code sets corresponding to all possible specific pilot offsets for PN_INC=max;

ordering the plurality of groups based on likelihood of detecting the pilot reference in each of the groups;

searching for the pilot reference in accordance with the ordered groups; and

terminating the searching upon acquisition of the pilot reference.

40. A device comprising:

a searcher element configurable to receive and correlate a first set of samples in accordance with a plurality of groups of PN sequences to provide correlated values used to detect a gated pilot reference, wherein the plurality of groups comprise an overall code space in which the pilot reference may be found, wherein a first group contains all possible specific pilot offsets for PN_INC=max, and are ordered based on likelihood of detecting the pilot reference in each of the groups, and wherein the plurality of groups are used to searched for the pilot reference based on their order and searching terminates upon acquisition of the pilot reference.