FILTERING SEMI-PERSISTENT SCHEDULING FALSE ALARMS

• US 20090257385A1
• Filed: 03/09/2009
• Published: 10/15/2009
• Est. Priority Date: 03/19/2008
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Montojo, Juan, Meylan, Arnaud
• Granted Patent: US 8,665,804 B2
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04L 1/0045 Arrangements at the receiver end
• CPC Class Codes: H04L 1/0061 Error detection codes
• CPC Class Codes: H04L 1/0072 Error control for data other than payload data, e.g. control data
• CPC Class Codes: H04W 28/04 Error control
• CPC Class Codes: H04W 72/04 Wireless resource allocation
• CPC Class Codes: H04W 72/23 in the downlink direction of a wireless link, i.e. towards a terminal

Abstract

A scheduled data communication system of an access node and terminal supports recurring communications of small data amounts such as Voice over IP (VoIP). In order to make error checking more robust in a random access response (RAR), such as for semi-persistent scheduling (SPS) for VoIP, a portion of a grant or assignment payload has a constraint imposed that can be verified as a condition precedent to determining a valid grant or assignment rather than only relying upon a validity check field, such as a cyclic redundancy check (CRC). Thereby, incorrect validation of a grant or assignment is avoided for dynamic scheduling or for semi-persistent scheduling, the latter causing a persistent error.

Claims

1. A method for receiving a scheduling indication, comprising:

detecting a grant or assignment on a control channel;

verifying a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

transmitting or receiving in accordance with the payload on the control channel in response to a determination that the constraint on the portion of a payload is verified.

2. The method of claim 1, further comprising taking no action if the constraint is not met even if cyclic redundancy check is met.

3. The method of claim 1, wherein the grant or assignment is for semi-persistent scheduling.

4. The method of claim 1, further comprising verifying the constraint on the portion of the payload by detecting an uplink grant flag, a new data indicator set to a pre-defined value, an aperiodic channel quality indicator set to a pre-defined value, a resource allocation allocated to less than a pre-defined fraction of bandwidth, and a restricted modulation and coding scheme that does not use highest modulations.

5. The method of claim 1, further comprising verifying the constraint on the portion of the payload by detecting an uplink grant flag.

6. The method of claim 1, further comprising verifying the constraint on the portion of the payload by detecting a new data indicator set to a pre-defined value.

7. The method of claim 1, further comprising verifying the constraint on the portion of the payload by detecting an aperiodic channel quality indicator set to a pre-defined value.

8. The method of claim 1, further comprising verifying the constraint on the portion of the payload by detecting a resource allocation allocated to less than a pre-defined fraction of bandwidth.

9. The method of claim 1, further comprising verifying the constraint on the portion of the payload by detecting a restricted modulation and coding scheme that does not use highest modulations.

10. The method of claim 1, further comprising detecting a compact downlink assignment for semi-persistent scheduling.

11. The method of claim 10, further comprising verifying the constraint on the portion of the payload by detecting a distributed transmission flag set to not indicated,

12. The method of claim 10, further comprising verifying the constraint on the portion of the payload by detecting a resource allocation allocated less than a pre-defined fraction of bandwidth.

13. The method of claim 10, further comprising verifying the constraint on the portion of the payload by detecting a restricted modulation and coding scheme that does not use a highest modulation.

14. The method of claim 10, further comprising verifying the constraint on the portion of the payload by detecting a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

15. The method of claim 10, further comprising verifying the constraint on the portion of the payload by detecting distributed transmission flag set to not indicated, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

16. The method of claim 1, further comprising detecting a downlink assignment for single input multiple output (SIMO) semi-persistent scheduling.

17. The method of claim 16, further comprising verifying the constraint on the portion of the payload by detecting a distributed transmission flag indicating not distributed.

18. The method of claim 16, further comprising verifying the constraint on the portion of the payload by detecting a resource allocation allocated less than a pre-defined fraction of bandwidth.

19. The method of claim 16, further comprising verifying the constraint on the portion of the payload by detecting a restricted modulation and coding scheme that does not use a highest modulation.

20. The method of claim 16, further comprising verifying the constraint on the portion of the payload by detecting a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

21. The method of claim 16, further comprising verifying the constraint on the portion of the payload by detecting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

22. The method of claim 21, further comprising determining invalidity of the portion of the payload by detecting an indication for MIMO semi-persistent scheduling.

23. The method of claim 21, further comprising verifying the constraint on the portion of the payload by detecting a distributed transmission flag indicating not distributed.

24. The method of claim 21, further comprising verifying the constraint on the portion of the payload by detecting a resource allocation allocated less than a pre-defined fraction of bandwidth.

25. The method of claim 21, further comprising verifying the constraint on the portion of the payload by detecting a restricted modulation and coding scheme for each of two transport blocks that does not use a highest modulation.

26. The method of claim 21, further comprising verifying the constraint on the portion of the payload by detecting a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

27. The method of claim 21, further comprising verifying the constraint on the portion of the payload by detecting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme for each of two transport blocks that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

28. At least one processor for receiving a scheduling indication, comprising:

a first module for detecting a grant or assignment on a control channel;

a second module for verifying a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

a third module for transmitting or receiving in accordance with the payload on the control channel in response to a determination that the constraint on the portion of a payload is verified.

29. A computer program product for receiving a scheduling indication, comprising:

a computer-readable storage medium comprising,

a first set of codes for causing a computer to detect a grant or assignment on a control channel;

a second set of codes for causing the computer to verify a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

a third set of codes for causing the computer to transmit or receiving in accordance with the payload on the control channel in response to a determination that the constraint on the portion of a payload is verified.

30. An apparatus for receiving a scheduling indication, comprising:

means for detecting a grant or assignment on a control channel;

means for verifying a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

means for transmitting or receiving in accordance with the payload on the control channel in response to a determination that the constraint on the portion of a payload is verified.

31. An apparatus for receiving a scheduling indication, comprising:

a receiver for detecting a grant or assignment on a control channel;

a computing platform for verifying a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

a transmitter and the receiver for transmitting or receiving in accordance with the payload on the control channel in response to a determination that the constraint on the portion of a payload is verified.

32. The apparatus of claim 31, further comprising the computing platform for taking no action if the constraint is not met even if cyclic redundancy check is met.

33. The apparatus of claim 31, further comprising the receiver for detecting a semi-persistent scheduling grant or assignment.

34. The apparatus of claim 31, further comprising the computing platform for verifying the constraint on the portion of the payload by detecting an uplink grant flag, a new data indicator set to a pre-defined value, an aperiodic channel quality indicator set to a pre-defined value, a resource allocation allocated to less than a pre-defined fraction of bandwidth, or a restricted modulation and coding scheme that does not use highest modulations.

35. The apparatus of claim 31, further comprising the receiver for detecting a compact downlink assignment for semi-persistent scheduling.

36. The apparatus of claim 31, further comprising the computing platform for verifying the constraint on the portion of the payload by detecting a format indication for compact downlink SPS, distributed transmission flag set to not indicated, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

37. The apparatus of claim 31, further comprising the receiver for detecting a downlink assignment for single input multiple output (SIMO) semi-persistent scheduling.

38. The apparatus of claim 37, further comprising the computing platform for verifying the constraint on the portion of the payload by detecting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

39. The apparatus of claim 31, further comprising the receiver for detecting a downlink assignment for multiple input multiple output (MIMO) semi-persistent scheduling.

40. The apparatus of claim 39, further comprising the computing platform for determining invalidity of the portion of the payload by detecting an indication for MIMO semi-persistent scheduling.

41. The apparatus of claim 39, further comprising the computing platform for verifying the constraint on the portion of the payload by detecting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme for each of two transport blocks that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

42. A method for transmitting a scheduling indication, comprising:

encoding a control channel payload for indicating a grant or assignment;

imposing a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

transmitting a grant or assignment comprising the payload on a control channel.

43. The method of claim 42, further comprising imposing the constraint so that no action is to be taken if cyclic redundancy check is met.

44. The method of claim 42, wherein the grant or assignment is for semi-persistent scheduling.

45. The method of claim 42, further comprising imposing the constraint on the portion of the payload by setting an uplink grant flag, a new data indicator set to a pre-defined value, an aperiodic channel quality indicator set to a pre-defined value, a resource allocation allocated to less than a pre-defined fraction of bandwidth, or a restricted modulation and coding scheme that does not use highest modulations.

46. The method of claim 42, further comprising setting a compact downlink assignment for semi-persistent scheduling.

47. The method of claim 42, further comprising imposing the constraint on the portion of the payload by setting a format indication for compact downlink SPS, distributed transmission flag set to not indicated, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

48. The method of claim 42, further comprising setting a downlink assignment for single input multiple output (SIMO) semi-persistent scheduling.

49. The method of claim 48, further comprising imposing the constraint on the portion of the payload by setting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

50. The method of claim 42, further comprising setting a downlink assignment for multiple input multiple output (MIMO) semi-persistent scheduling.

51. The method of claim 50, further comprising imposing the constraint on the portion of the payload by setting an indication for MIMO semi-persistent scheduling.

52. The method of claim 50, further comprising imposing the constraint on the portion of the payload by setting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme for each of two transport blocks that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

53. At least one processor for transmitting a scheduling indication, comprising:

a first module for encoding a control channel payload for indicating a grant or assignment;

a second module for imposing a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

a third module for transmitting a grant or assignment comprising the payload on a control channel.

54. A computer program product for transmitting a scheduling indication, comprising:

a computer-readable storage medium comprising,

a first set of codes for causing a computer to encode a control channel payload for indicating a grant or assignment;

a second set of codes for causing the computer to impose a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

a third set of codes for causing the computer to transmit a grant or assignment comprising the payload on a control channel.

55. An apparatus for transmitting a scheduling indication, comprising:

means for encoding a control channel payload for indicating a grant or assignment;

means for imposing a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

means for transmitting a grant or assignment comprising the payload on a control channel.

56. An apparatus for transmitting a scheduling indication, comprising:

a computing platform for encoding a control channel payload for indicating a grant or assignment;

the computing platform for imposing a constraint on a portion of a payload carried on the control channel indicative of valid grant or assignment as a condition for determining payload validity; and

a transmitter for transmitting a grant or assignment comprising the payload on a control channel.

57. The apparatus of claim 56, further comprising the computing platform for imposing the constraint so that no action is to be taken if cyclic redundancy check is met.

58. The apparatus of claim 56, wherein the grant or assignment is for semi-persistent scheduling.

59. The apparatus of claim 56, further comprising the computing platform for imposing the constraint on the portion of the payload by setting an uplink grant flag, a new data indicator set to a pre-defined value, an aperiodic channel quality indicator set to a pre-defined value, a resource allocation allocated to less than a pre-defined fraction of bandwidth, or a restricted modulation and coding scheme that does not use highest modulations.

60. The apparatus of claim 56, further comprising the computing platform for setting a compact downlink assignment for semi-persistent scheduling.

61. The apparatus of claim 56, further comprising the computing platform for imposing the constraint on the portion of the payload by setting a format indication for compact downlink SPS, distributed transmission flag set to not indicated, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

62. The apparatus of claim 56, further comprising the computing platform for setting a downlink assignment for single input multiple output (SIMO) semi-persistent scheduling.

63. The apparatus of claim 62, further comprising the computing platform for imposing the constraint on the portion of the payload by setting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.

64. The apparatus of claim 56, further comprising the computing platform for setting a downlink assignment for multiple input multiple output (MIMO) semi-persistent scheduling.

65. The apparatus of claim 64, further comprising the computing platform for imposing the constraint on the portion of the payload by setting an indication for MIMO semi-persistent scheduling.

66. The apparatus of claim 64, further comprising the computing platform for imposing the constraint on the portion of the payload by setting a distributed transmission flag indicating not distributed, a resource allocation allocated less than a pre-defined fraction of bandwidth, a restricted modulation and coding scheme for each of two transport blocks that does not use a highest modulation, and a retransmission sequence number indicating a first Hybrid Automatic Repeat-reQuest (HARQ) transmission.