Spread-spectrum telephony with accelerated code acquisition

• US 6,754,251 B1
• Filed: 03/01/2000
• Issued: 06/22/2004
• Est. Priority Date: 03/09/1998
• Status: Expired due to Term

• Current Assignee: Intel Corporation
• Original Assignee: Texas Instruments, Inc.
• Inventors: Sriram, Sundararajan, Hosur, Srinath
• Primary Examiner(s): Chin, Stephen
• Assistant Examiner(s): Ha, Dac V.
• Application Number:
  US09/516,348
• Time in Patent Office: 1,574 Days
• Field of Search: 375/130, 375/140-143, 375/145, 375/148-150, 375/152, 375/262, 375/265, 375/324, 375/325, 375/343, 375/364-368, 370/335, 370/441, 370/342, 370/479, 370/509-511, 370/513-515, 370/389, 370/395, 370/390, 370/392
• US Class Current: 375/145
• CPC Class Codes: H04B 1/70735 Code identification H04B1/7083 takes precedence
• CPC Class Codes: H04B 1/7077 Multi-step acquisition, e.g. multi-dwell, coarse-fine or validation
• CPC Class Codes: H04B 2201/70701 featuring pilot assisted reception

Abstract

The present application discloses an improved mobile communications architecture, in which each base station broadcasts not only data which has been spread by that station'"'"'s long code word, but also (intermittently) code identification data which has not been spread. The code identification data is a block code which includes multiple symbols, so that multiple intermittent transmissions are required to complete the transmission of the code identification data. This transmission lets the mobile station shorten the search for the base station'"'"'s long code word in two ways: the code identification data gives at least some information about the long code itself; and the phase of the block code gives at least some information about the phase of the long code word.

Claims

1. A method of spread spectrum communication, comprising the steps of:

transmitting a signal which at least intermittently includes a data channel spread by a first long code, a first perch channel which is transmitted intermittently and has not been spread by said first long code, and a second perch channel which is transmitted intermittently and has not been spread by said first long; and

wherein multiple transmissions of said first and second perch channels, in combination, provide at least partial identification of said first long code;

wherein said second perch channel comprises symbols of comma free error correcting codes comprising a set of code words from an error correcting code such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words in the set.

2. The method of claim 1 wherein said second perch channel comprises symbols of comma free codes.

3. The method of claim 1 wherein said second perch channel comprises symbols of Reed-Solomon codes.

4. The method of claim 1 wherein said first and second perch channels are used to provide synchronization information about said long code.

5. The method of claim 1 wherein said first perch channel is used to determine, at least partially, the received offset of said first long code.

6. The method of claim 1 wherein said first perch channel contains symbols common between anticipated base stations.

7. The method of claim 1 wherein said first perch channel contains symbols common between anticipated base stations which are transmitted repetitively.

8. The method of claim 1 wherein said second perch channel is made of short code symbols that in combination form a linear block code with a maximum minimum distance.

9. The method of claim 1 wherein said linear block code is an (n,k) code with a minimum distance of n−

k+1, where n and k are integers.

10. A method of spread spectrum communication, comprising the steps of:

transmitting a signal which includes first data which has been spread by a first long code, and which also includes, intermittently, a first perch channel comprising a shared code which does not identify said first long code and a second perch channel consisting of successive portions of a comma-free block code which provides at least partial identification of said first long code, wherein said first and second perch channels are not spread by said first long code;

wherein said symbols of comma free block code comprise a set of code words such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words in the set.

11. The method of claim 10 wherein said block code is a comma free error correcting code.

12. The method of claim 10 wherein said shared code on the first perch channel is used to provide synchronization information for said block code transmitted on the second perch channel.

13. The method of claim 10 wherein first and second perch channels are used to transmit said first code and said block code, respectively.

14. The method of claim 10 wherein said block code is a linear code with a maximum minimum distance.

15. A method for operating a mobile station, comprising the steps of:

detecting, when possible, a block code that identifies a base station specific scrambling or long code, in the transmission of a new base station with which communication is desired to be established;

deriving at least some information about the possible identity of a long code from said block of symbols in combination; and

deriving at least some information about the phase of said long code from the phase of said block code;

wherein said block code is a comma free error correcting code, comprising a set of code words from an error correcting code such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words in the set.

16. The method of claim 15 wherein a shared code is transmitted along with a said block code.

17. The method of claim 16 wherein said shared code is transmitted repetitively.

18. The method of claim 16 wherein first and second perch channels are used to transmit said shared code and said block code, respectively.

19. The method of claim 15 wherein said block code is a linear code with a maximum minimum distance.

20. The method of claim 15 wherein said detecting occurs in the transmission of a previously acquired base station.

21. The method of claim 15 wherein a plurality of mobile stations are operated.

22. A method of communication, comprising the steps of:

providing a plurality of base stations executing a method of spread spectrum communication, comprising the action of transmitting a signal which at least intermittently includes both first data which has been spread by a first base station specific long code, and also second data which is transmitted intermittently, and has not been spread by said first long code; and

providing a plurality of receivers executing a method for operating a mobile station, comprising the steps of;

detecting, when possible, a block code that identifies at least in part said long code, in the transmission of a new base station with which communication is desired to be established; and

deriving at least some information about the possible identity of said long code from said block of symbols in combination; and

deriving at least some information about the phase of said long code from the phase of said block code; and

wherein said second data successively defines portions of a block code which provides at least partial identification of said first code.

23. The method of claim 22 wherein said second data are comma free error correcting codes, comprising a set of code words from an error correcting code such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words in the set.

24. The method of claim 22 wherein said second data are comma free codes.

25. The method of claim 22 wherein said long code and said second data are derived from Reed-Solomon codes.

26. The method of claim 22 wherein said second data is used to provide synchronization information with said first data.

27. The method of claim 22 wherein said second data is used to determine the offset of said first long code.

28. The method of claim 22 wherein said long code contains a shared code.

29. The method of claim 22 wherein said second data contains a shared code which is transmitted repetitively.

30. The method of claim 22 wherein first and second perch channels are used to transmit said shared code and said second data, respectively.

31. The method of claim 22 wherein said second data is a linear code with a maximum minimum distance.

32. The method of claim 22 wherein said second data is an (n,k) linear code with a minimum distance of n−

k+1, where n and k are integers.

33. The method of claim 22 wherein said detecting occurs in the transmission of a previously acquired base station.

34. A spread spectrum communication system, comprising:

a base station which transmits a signal, comprising;

first data which has been spread by a first long code;

second data which is transmitted intermittently, and has not been spread by said first long code; and

a block code which provides at least partial identification of said first long code and information about the phase of said first long code and is defined, at least in part by said second data; and

a receiver which receives said signal and said block code;

wherein said block code is a comma free code comprising a set of code words from an error correcting code such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words that comprise the block code.

35. The system of claim 34 wherein said second data is used to determine the offset of said first long code.

36. The system of claim 34 wherein first and second perch channels are used to transmit said second data and the block code, respectively.

37. The system of claim 34 wherein said second data contains a shared code.

38. The system of claim 34 wherein said block code is a linear code with a maximum minimum distance.

39. The system of claim 34 wherein said detecting occurs in the transmission of a previously acquired base station.

40. A spread spectrum communication system, comprising:

a base station which transmits a signal, comprising;

first data which has been spread by a first long code;

successive portions of a comma-free block code which provide at least partial identification of said first long code and information about the phase of said long code, which is not spread by said first long code; and

a shared code which does not even partially identify said first long code and which is not spread by said first long code; and

a receiver which receives said signal.

41. The system of claim 40 wherein said block code is a comma free error correcting code comprising a set of code words from an error correcting code such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words that comprise the block code.

42. The system of claim 40 wherein said block code is used to provide synchronization information with said first data.

43. The system of claim 40 wherein first and second perch channels are used to transmit said shared code and said block code, respectively.

44. The system of claim 40 wherein said long code is a linear code with a maximum minimum distance.

45. The system of claim 40 wherein a plurality of base stations and receivers are operated.

46. A spread spectrum communication system, comprising:

a base station transmitting a scrambling code and a code-identifying block code that is not spread by said scrambling code; and

a receiver which detects, when possible, a said code-identifying block code that is not spread by the base station specific scrambling code, in the transmission of a signal from said base station with which communication is desired to be established; and

which derives at least some information about the possible identity of the scrambling code used by said base station from said block of symbols in combination; and

derives at least some information about the phase of said scrambling code from the phase of said block code.

47. The system of claim 46 wherein said block code is a set of code words from an error correcting code such that each code word has unique cyclic shifts, and the cyclic shifts of each code word are distinct from cyclic shifts of other code words that comprise the block code.

48. The system of claim 46 wherein said block code is used to provide synchronization information with said scrambling code.

49. The system of claim 46 wherein a shared code is transmitted along with the block code.

50. The system of claim 46 wherein first and second perch channels are used to transmit said shared code and block code, respectively.

51. The system of claim 46 wherein a shared code common to all base stations is transmitted repetitively along with the block code.

52. The system of claim 46 wherein said block code is a linear code with a maximum minimum distance.

53. The system of claim 46 wherein said block code is detected at the receiver using a Maximum Likelihood technique that matches the received signal against all possible transmitted code words and their cyclic shifts, and uses soft-decision decoding for selecting the most probable transmitted code word and its received cyclic shift.

54. The system of claim 46 wherein said block code is detected coherently at the receiver using channel estimates from the said common shared code.

55. The system of claim 46 wherein said block code is detected non-coherently at the receiver, without any channel estimation.

56. The system of claim 46 wherein said detecting occurs in the transmission of a previously acquired base station.

57. The system of claim 46 wherein a plurality of base stations and receivers are operated.