Method and apparatus for facilitating transmissions in a wireless communication system
There is provided methods and associated base station and user equipment, for facilitating transmissions in a wireless communication system. The mapping between an index and its corresponding HARQ ID or HARQ ID & NDI pair can be done using one or more equations relating the two entities. The equations can be defined in two configurations, one for encoding HARQ ID or HARQ ID & NDI pair and a second for decoding the encoded HARQ ID or HARQ ID & NDI pair to determine the HARQ ID or HARQ ID and NDI.
1. A method for facilitating transmissions in a wireless communication system, the method comprising:
receiving by a user equipment (UE), an index indicative of one or more hybrid automatic repeat request identifiers (HARQ IDs) for use during transmissions, the index defined using a constant, C, and a sum of binomial coefficient function;
determining, by the UE, the one or more HARQ IDs from the index; and
transmitting, by the UE, a transmission using the one or more HARQ IDs;
wherein the index is defined by:
Index′= C +sum(nchoosek(HARQ_Max−HARQ( n−i ), Mi )
where: n=the number of HARQ processes to be scheduled;
i=0 to n−1;
HARQ_Max=the maximum number of HARQ processes;
HARQ(i)=the HARQ ID of the i′th HARQ process scheduled and has values in the range {0, HARQ_Max−1};
Mi=n−i;
C=a scalar constant;
nchoosek(n,k.)=the binomial coefficient function;
wherein if (n−k)<0, nchoosek(n−k) returns 0.
2. The method according to claim 1 , wherein the sum is a combinatoric sum including at least a sum of binomial functions of HARQ IDs.
3. The method according to claim 1 , wherein the sum is a combinatoric sum including at least a sum of binomial functions of a number of HARQ processes conveyed by the index.
4. The method according to claim 1 , wherein the sum is a combinatoric sum including at least a sum of binomial functions of a maximum number of HARQ processes conveyed by the index.
5. The method according to claim 1 , wherein C depends on a number of HARQ processes being scheduled.
6. The method according to claim 1 , wherein the index and a new data indication (NDI) are jointly encoded into a second index.
7. The method according to claim 6 , wherein a position of the index and NDI fields within the second index depend on a number of HARQ processes being scheduled.
8. The method according to claim 1 , wherein the index is defined by:
Index′= C +sum( J i *HARQ( i ))+sum( K i *nchoosek(HARQ_Max− L i −HARQ( i ), M i ))
where: n is the number of HARQ processes to be scheduled;
i is 1 to n;
HARQ_Max is the maximum number of HARQ processes;
HARQ(i) is the HARQ ID of the i′th HARQ process scheduled and has values in the range {0, HARQ_Max−1};
J, K, L, M=vectors of constants of size n;
C=a scalar constant;
nchoosek(.)=the binomial coefficient function.
9. A user equipment (UE) comprising:
a processor; and
machine readable memory storing machine executable instructions which when executed by the processor configure the base station to:
receive an index indicative of one or more hybrid automatic repeat identifiers (HARQ IDs) for use during transmissions, the index defined using a constant, C, and a sum of a binomial coefficient function;
determine the one or more HARQ IDs from the index; and
transmit a transmission using the one or more HARQ IDs;
wherein the index is defined by:
Index′= C +sum(nchoosek(HARQ_Max−HARQ( n−i ), Mi )
where: n=the number of HARQ processes to be scheduled;
i=0 to n−1;
HARQ_Max=the maximum number of HARQ processes;
HARQ(i)=the HARQ ID of the i′th HARQ process scheduled and has values in the range {0, HARQ_Max−1};
Mi=n−i;
C=a scalar constant;
nchoosek(n,k.)=the binomial coefficient function;
wherein if (n−k)<0, nchoosek(n−k) returns 0.
10. The UE according to claim 9 , wherein the sum is a combinatoric sum including at least a sum of binomial functions of HARQ IDs.
11. The UE according to claim 9 , wherein the sum is a combinatoric sum including at least a sum of binomial functions of a number of HARQ processes conveyed by the index.
12. The UE according to claim 1 , wherein the sum is a combinatoric sum including at least a sum of binomial functions of a maximum number of HARQ processes conveyed by the index.
13. The UE according to claim 9 , wherein C depends on a number of HARQ processes being scheduled.
14. The UE according to claim 9 , wherein the index and a new data indication (NDI) are jointly encoded into a second index.
15. The UE according to claim 14 , wherein a position of the index and NDI fields within the second index depend on a number of HARQ processes being scheduled.
16. The UE according to claim 9 , wherein the index is defined by:
Index′= C +sum( J i *HARQ( i ))+sum( K i *nchoosek(HARQ_Max− L i −HARQ( i ), M i ))
where: n is the number of HARQ processes to be scheduled;
i is 1 to n;
HARQ_Max is the maximum number of HARQ processes;
HARQ(i) is the HARQ ID of the i′th HARQ process scheduled and has values in the range {0, HARQ_Max−1};
J, K, L, M=vectors of constants of size n;
C=a scalar constant;
nchoosek(.)=the binomial coefficient function.