System Synchronization in TD-SCDMA and TDD-LTE Systems

• US 20120163250A1
• Filed: 12/23/2010
• Published: 06/28/2012
• Est. Priority Date: 12/23/2010
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Chin, Tom, Shi, Guangming, Lee, Kuo-Chun
• Granted Patent: US 9,001,778 B2
• Time in Patent Office: Days
• US Class Current: 370/280
• CPC Class Codes: H04W 36/0005 Control or signalling for completing the hand-off
• CPC Class Codes: H04W 36/16 Performing reselection for specific purposes
• CPC Class Codes: H04W 56/001 Synchronization between nodes
• CPC Class Codes: H04W 72/04 Wireless resource allocation

Abstract

Certain aspects of the present disclosure propose techniques for synchronizing TD-SCDMA and TDD-LTE systems. Certain aspects provide a method that generally includes obtaining, from a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT, and performing network acquisition operations with the BS of the second RAT using the timing and the SFN.

Claims

1. A method for wireless communications, comprising:

obtaining, by a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

transmitting the timing and the SFN to a user equipment (UE).

2. The method of claim 1, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

3. The method of claim 2, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

4. The method of claim 1, wherein the SFN is transmitted with system information.

5. The method of claim 1, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

6. The method of claim 5, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

7. The method of claim 5, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

8. The method of claim 1, further comprising transmitting, to the UE, information regarding one or more procedures dependent on the SFN.

9. The method of claim 8, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

10. An apparatus for wireless communications, comprising:

means for obtaining, by a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

means for transmitting the timing and the SFN to a user equipment (UE).

11. The apparatus of claim 10, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

12. The apparatus of claim 11, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

13. The apparatus of claim 10, wherein the SFN is transmitted with system information.

14. The apparatus of claim 10, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

15. The apparatus of claim 14, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

16. The apparatus of claim 14, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

17. The apparatus of claim 10, further comprising means for transmitting, to the UE, information regarding one or more procedures dependent on the SFN.

18. The apparatus of claim 17, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

19. An apparatus for wireless communications, comprising:

at least one processor adapted to;

obtain, by a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

transmit the timing and the SFN to a user equipment (UE); and

a memory coupled to the at least one processor.

20. The apparatus of claim 19, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

21. The apparatus of claim 20, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

22. The apparatus of claim 19, wherein the SFN is transmitted with system information.

23. The apparatus of claim 19, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

24. The apparatus of claim 23, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

25. The apparatus of claim 23, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

26. The apparatus of claim 19, wherein the at least one processor is adapted to transmit, to the UE, information regarding one or more procedures dependent on the SFN.

27. The apparatus of claim 26, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

28. A computer-program product, comprising:

a computer-readable medium comprising code for;

obtaining, by a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

transmitting the timing and the SFN to a user equipment (UE).

29. The computer-program product of claim 28, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

30. The computer-program product of claim 29, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

31. The computer-program product of claim 28, wherein the SFN is transmitted with system information.

32. The computer-program product of claim 28, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

33. The computer-program product of claim 32, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

34. The computer-program product of claim 32, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

35. The computer-program product of claim 28, the computer-readable medium further comprising code for transmitting, to the UE, information regarding one or more procedures dependent on the SFN.

36. The computer-program product of claim 35, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

37. A method for wireless communications, comprising:

obtaining, from a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

performing network acquisition operations with the BS of the second RAT using the timing and the SFN.

38. The method of claim 37, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

39. The method of claim 38, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

40. The method of claim 37, wherein the SFN is received with system information.

41. The method of claim 37, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

42. The method of claim 41, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

43. The method of claim 41, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

44. The method of claim 37, further comprising receiving information regarding one or more procedures dependent on the SFN.

45. The method of claim 44, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

46. An apparatus for wireless communications, comprising:

means for obtaining, from a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

means for performing network acquisition operations with the BS of the second RAT using the timing and the SFN.

47. The apparatus of claim 46, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

48. The apparatus of claim 47, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

49. The apparatus of claim 46, wherein the SFN is received with system information.

50. The apparatus of claim 46, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

51. The apparatus of claim 50, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

52. The apparatus of claim 50, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

53. The apparatus of claim 46, further comprising means for receiving information regarding one or more procedures dependent on the SFN.

54. The apparatus of claim 53, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

55. An apparatus for wireless communications, comprising:

at least one processor adapted to;

obtain, from a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

perform network acquisition operations with the BS of the second RAT using the timing and the SFN; and

a memory coupled to the at least one processor.

56. The apparatus of claim 55, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

57. The apparatus of claim 56, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

58. The apparatus of claim 55, wherein the SFN is received with system information.

59. The apparatus of claim 55, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

60. The apparatus of claim 59, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

61. The apparatus of claim 59, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

62. The apparatus of claim 55, wherein the at least one processor is adapted to receive information regarding one or more procedures dependent on the SFN.

63. The apparatus of claim 62, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.

64. A computer-program product, comprising:

a computer-readable medium comprising code for;

obtaining, from a base station (BS) of a first radio access technology (RAT), timing and a system frame number (SFN) for a BS of a second RAT; and

performing network acquisition operations with the BS of the second RAT using the timing and the SFN.

65. The computer-program product of claim 64, wherein at least one of the first RAT or the second RAT comprises Time Division Duplex Long Term Evolution (TDD-LTE).

66. The computer-program product of claim 65, wherein at least one of the first RAT or the second RAT comprises Time Division Synchronous Code Division Multiple Access (TD-SCDMA).

67. The computer-program product of claim 64, wherein the SFN is received with system information.

68. The computer-program product of claim 64, wherein the SFN for the BS of the second RAT is synchronous with an SFN for the BS of the first RAT.

69. The computer-program product of claim 68, wherein the SFN for the BS of the first RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the second RAT.

70. The computer-program product of claim 68, wherein the SFN for the BS of the second RAT is equal to ten least significant bits (LSBs) of the SFN for the BS of the first RAT.

71. The computer-program product of claim 64, the computer-readable medium further comprising code for receiving information regarding one or more procedures dependent on the SFN.

72. The computer-program product of claim 71, wherein the information comprises semi-persistent scheduling (SPS) information for the second RAT.