Method of shifting redundancy version for the transmission of a transport block over multiple slots
Where large transport blocks are rate-matched and transmitted on each PUSCH segment using different redundancy versions (RVs), RV cycling with a small number of PUSCH segments might not cover the whole codeword, and/or rate-matching a large TBS across many PUSCH segments into the resource of a single PUSCH segment may lead to an effective coding rate of the self-decodable redundancy versions that is too high. To avoid these issues, the starting position of one or more RVs may be shifted by setting the starting position of a current RV to be the same as an ending position of a previous position, or by scaling the starting position by a value. Alternatively, these issues may be avoided by setting a new starting position for an RV based on the gap from the end of a previous RV to the start of a current RV.
1. An apparatus comprising:
at least one processor; and
at least one non-transitory memory and computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to:
determine a starting position of at least one redundancy version of a transport block in a circular buffer based, at least partially, on a position of another redundancy version of the transport block in the circular buffer; and
transmit one or more of the other redundancy version and/or the at least one redundancy version using the determined starting position of the at least one redundancy version of the transport block,
wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to determine the starting position of the at least one redundancy version by determining the starting position of the at least one redundancy version based, at least partially, on at least one scalar, and
wherein the starting position of the at least one redundancy version is denoted as k 0 and defined as:
k 0 =mod( k′ 0 +G+β,N cb ),
where mod (A, B) is a modulo function which returns a remainder of a division of A by B, k′ 0 is a starting position of the other redundancy version, G is a size of the other redundancy version, β is a scalar of the at least one scalar, and N cb is a size of the circular buffer.
2. The apparatus of claim 1 , wherein determining the starting position of the at least one redundancy version comprises the at least one memory and the computer program code being configured to, with the at least one processor, cause the apparatus to:
set the starting position of the at least one redundancy version to be the same as an ending position of the other redundancy version.
3. The apparatus of claim 1 , wherein determining the starting position of the at least one redundancy version comprises the at least one memory and the computer program code being configured to, with the at least one processor, cause the apparatus to:
determine a remainder of:
a division of a starting position of the other redundancy version plus a length of the other redundancy version, and
the size of the circular buffer,
wherein the determined starting position comprises the determined remainder.
4. The apparatus of claim 1 , wherein a number of redundancy versions of the transport block is equal to a number of physical uplink shared channel segments used for the transport block over multiple segment transmission.
5. The apparatus of claim 1 , wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to:
determine a first value and a second value; and
determine the scalar of the at least one scalar, wherein determining the scalar comprises multiplying the first value by a closest integer number smaller than the circular buffer size divided by the second value.
6. The apparatus of claim 5 , wherein determining the first value and the second value comprises the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to at least one of:
receive a radio resource control configuration of at least one of the first value or the second value,
determine at least one of the first value or the second value based on a specification, or
receive an indication of at least one of the first value or the second value in a downlink control information field.
7. The apparatus of claim 1 , wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to determine the at least one scalar based, at least partially, on an indication of a vector, wherein the vector comprises information for determining a number of scalars of the at least one scalar that is less than a number of redundancy versions of the at least one redundancy version, and wherein the determined number of the at least one scalar are cycles across the redundancy versions of the at least one redundancy version.
8. An apparatus comprising:
at least one processor; and
at least one non-transitory memory and computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to:
determine whether a user equipment should use a first method to determine a starting position of at least one redundancy version of a transport block in a circular buffer or a second method to determine the starting position of the at least one redundancy version of the transport block in the circular buffer, wherein the second method comprises determining the starting position of the at least one redundancy version based, at least partially, on one of:
a position of another redundancy version of the transport block in the circular buffer, or
a scaling factor; and
transmit, from the apparatus, an indication to determine the starting position of at least the at least one redundancy version based on at least one of the first method or the second method,
wherein the second method further comprises determining the starting position of the at least one redundancy version based, at least partially, on at least one scalar, and
wherein the starting position of the at least one redundancy version is denoted as k 0 and defined as:
k 0 =mod( k′ 0 +G+β,N cb ),
where mod (A, B) is a modulo function which returns a remainder of a division of A by B, k′ 0 is a starting position of the other redundancy version, G is a size of the other redundancy version, β is a scalar of the at least one scalar, and N cb is a size of the circular buffer.
9. The apparatus of claim 8 , wherein the second method comprises setting the starting position of the at least one redundancy version to be the same as an ending position of the other redundancy version.
10. The apparatus of claim 8 , wherein
the second method comprises determining a remainder of:
a division of a starting position of the other redundancy version plus a length of the other redundancy version, and
a size of the circular buffer.
11. A method comprising:
determining a starting position of at least one redundancy version of a transport block in a circular buffer based, at least partially, on a position of another redundancy version of the transport block in the circular buffer; and
transmitting one or more of the other redundancy version and/or the at least one redundancy version using the determined starting position of the at least one redundancy version of the transport block,
wherein determining the starting position of the at least one redundancy version comprises determining the starting position of the at least one redundancy version based, at least partially, on at least one scalar, and
wherein the starting position of the at least one redundancy version is denoted as k 0 and defined as:
k 0 =mod( k′ 0 +G+β,N cb ),
where mod (A, B) is a modulo function which returns a remainder of a division of A by B, k′ 0 is a starting position of the other redundancy version, G is a size of the other redundancy version, β is a scalar of the at least one scalar, and N cb is a size of the circular buffer.
12. The method of claim 11 , wherein the determining of the starting position of the at least one redundancy version comprises:
setting the starting position of the at least one redundancy version to be the same as an ending position of the other redundancy version.
13. The method of claim 11 , wherein the determining of the starting position of the at least one redundancy version comprises:
determining a remainder of:
a division of a starting position of the other redundancy version plus a length of the other redundancy version, and
the size of the circular buffer,
wherein the determined starting position comprises the determined remainder.
14. The method of claim 11 , wherein a number of redundancy versions of the transport block is equal to a number of physical uplink shared channel segments used for the transport block over multiple segment transmission.
15. A non-transitory computer-readable medium comprising program instructions stored thereon which, when executed with at least one processor, cause the at least one processor to:
determine a starting position of at least one redundancy version of a transport block in a circular buffer based, at least partially, on a position of another redundancy version of the transport block in the circular buffer; and
transmit one or more of the other redundancy version and/or the at least one redundancy version using the determined starting position of the at least one redundancy version of the transport block,
wherein the program instructions which, when executed by the at least one processor, cause the at least one processor to determine the starting position of the at least one redundancy version comprise program instructions which, when executed by the at least one processor, cause the at least one processor to determine the starting position of the at least one redundancy version based, at least partially, on at least one scalar, and
wherein the starting position of the at least one redundancy version is denoted as k 0 and defined as:
k 0 =mod( k′ 0 +G+β,N cb ),
where mod (A, B) is a modulo function which returns a remainder of a division of A by B, k′ 0 is a starting position of the other redundancy version, G is a size of the other redundancy version, β is a scalar of the at least one scalar, and N cb is a size of the circular buffer.