US12490245B2ActiveUtilityPatentIndex 62
Physical shared channel splitting at slot boundaries
Est. expiryAug 10, 2038(~12.1 yrs left)· nominal 20-yr term from priority
H04W 72/21H04L 5/0048H04W 72/23H04W 72/0446H04L 5/0051H04L 5/0091H04W 72/232H04L 5/0044
62
PatentIndex Score
0
Cited by
37
References
20
Claims
Abstract
A method, system and apparatus are disclosed. A network node configured to communicate with a wireless device (WD) is provided. The network node includes processing circuitry configured to cause the network node to: indicate a splitting of an initial physical shared channel allocation that crosses a slot boundary into at least a first physical shared channel allocation in a first slot and a second physical shared channel allocation in a second slot; and communicate with the wireless device, WD, according to the at least the first physical shared channel allocation and the second physical shared channel allocation.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A method implemented in a wireless device, WD, configured to communicate with a network node, the method comprising:
receiving an indication of a splitting of an initial physical uplink shared channel, PUSCH, allocation that crosses a slot boundary into at least a first PUSCH allocation in a first slot and a second PUSCH allocation in a second slot; communicating with the network node according to the at least first PUSCH allocation and the at least second PUSCH allocation; and determining a reference signal position of at least one reference signal corresponding to at least one of the at least first PUSCH allocation and the at least second PUSCH allocation, the reference signal position being based at least in part on:
a length of the first PUSCH allocation;
a length of the second PUSCH allocation; and
a Demodulation Reference Signal, DMRS, mapping type.
2 . The method of claim 1 , wherein receiving the indication further comprises receiving an indication of a starting symbol, S, and a length, L, and wherein S plus L is permitted to be larger than 14.
3 . A method implemented in a network node configured to communicate with a wireless device, WD, the method comprising:
indicating a splitting of an initial physical uplink shared channel, PUSCH, allocation that crosses a slot boundary into at least a first PUSCH allocation in a first slot and a second PUSCH allocation in a second slot; communicating with the WD according to the at least first PUSCH allocation and according to the at least second PUSCH allocation; and determining a reference signal position of at least one reference signal corresponding to at least one of the at least first PUSCH allocation and the at least second PUSCH allocation, the reference signal position being based at least in part on:
a length of the first PUSCH allocation;
a length of the second PUSCH allocation; and
a Demodulation Reference Signal, DMRS, mapping type.
4 . The method of claim 3 , wherein indicating further comprises indicating a starting symbol, S, and a length, L, and wherein S plus L is permitted to be larger than 14.
5 . A wireless device, WD, configured to communicate with a network node, the WD comprising processing circuitry, the processing circuitry configured to cause the WD to:
receive an indication of a splitting of an initial physical uplink shared channel, PUSCH, allocation that crosses a slot boundary into at least a first PUSCH allocation in a first slot and a second PUSCH allocation in a second slot; communicate with the network node according to the at least first PUSCH allocation and according to the at least second PUSCH allocation; and determine a reference signal position of at least one reference signal corresponding to at least one of the at least first PUSCH allocation and the at least second PUSCH allocation, the reference signal position being based at least in part on:
a length of the first PUSCH allocation;
a length of the second PUSCH allocation; and
a Demodulation Reference Signal, DMRS, mapping type.
6 . The WD of claim 5 , further configured to receive an indication of a starting symbol, S, and a length, L, and wherein S plus L is permitted to be larger than 14.
7 . The method of claim 1 , wherein data to be communicated according to the first PUSCH allocation and data to be communicated according to the second PUSCH allocation correspond to the same transport block, TB.
8 . The method of claim 1 , wherein information bits of data communicated according to the first PUSCH allocation and of data communicated according to the second PUSCH allocation are encoded independently, wherein different redundancy versions are used for the data communicated according to the first PUSCH allocation and the data communicated according to the second PUSCH allocation.
9 . The method of claim 8 , wherein:
when the data communicated according to the first PUSCH allocation have a redundancy version of 0, the data communicated according to the second PUSCH allocation have a redundancy version of 2; when the data communicated according to the first PUSCH allocation have a redundancy version of 2, the data communicated according to the second PUSCH allocation have a redundancy version of 3; when the data communicated according to the first PUSCH allocation have a redundancy version of 3, the data communicated according to the second PUSCH allocation have a redundancy version of 1; and when the data communicated according to the first PUSCH allocation have a redundancy version of 1, the data communicated according to the second PUSCH allocation have a redundancy version of 0.
10 . The method of claim 3 , wherein data to be communicated according to the first PUSCH allocation and data to be communicated according to the second PUSCH allocation correspond to the same transport block, TB.
11 . The method of claim 3 , wherein information bits of data communicated according to the first PUSCH allocation and of data communicated according to the second PUSCH allocation are encoded independently, wherein different redundancy versions are used for the data communicated according to the first PUSCH allocation and the data communicated according to the second PUSCH allocation.
12 . The method of claim 11 , wherein:
when the data communicated according to the first PUSCH allocation have a redundancy version of 0, the data communicated according to the second PUSCH allocation have a redundancy version of 2; when the data communicated according to the first PUSCH allocation have a redundancy version of 2, the data communicated according to the second PUSCH allocation have a redundancy version of 3; when the data communicated according to the first PUSCH allocation have a redundancy version of 3, the data communicated according to the second PUSCH allocation have a redundancy version of 1; and when the data communicated according to the first PUSCH allocation have a redundancy version of 1, the data communicated according to the second PUSCH allocation have a redundancy version of 0.
13 . The WD of claim 5 , wherein data to be communicated according to the first PUSCH allocation and data to be communicated according to the second PUSCH allocation correspond to the same transport block, TB.
14 . The WD of claim 5 , wherein information bits of data communicated according to the first PUSCH allocation and of data communicated according to the second PUSCH allocation are encoded independently, wherein different redundancy versions are used for the data communicated according to the first PUSCH allocation and the data communicated according to the second PUSCH allocation.
15 . The WD of claim 14 , wherein:
when the data communicated according to the first PUSCH allocation have a redundancy version of 0, the data communicated according to the second PUSCH allocation have a redundancy version of 2; when the data communicated according to the first PUSCH allocation have a redundancy version of 2, the data communicated according to the second PUSCH allocation have a redundancy version of 3; when the data communicated according to the first PUSCH allocation have a redundancy version of 3, the data communicated according to the second PUSCH allocation have a redundancy version of 1; and when the data communicated according to the first PUSCH allocation have a redundancy version of 1, the data communicated according to the second PUSCH allocation have a redundancy version of 0.
16 . A network node configured to communicate with a wireless device, WD, the network node comprising processing circuitry, the processing circuitry configured to cause the network node to:
indicate a splitting of an initial physical uplink shared channel, PUSCH, allocation that crosses a slot boundary into at least a first PUSCH allocation in a first slot and a second PUSCH allocation in a second slot; and communicate with the wireless device, WD, according to the at least first PUSCH allocation and the at least second PUSCH allocation; and determine a reference signal position of at least one reference signal corresponding to at least one of the at least first PUSCH allocation and the at least second PUSCH allocation, the reference signal position being based at least in part on:
a length of the first PUSCH allocation;
a length of the second PUSCH allocation; and
a Demodulation Reference Signal, DMRS, mapping type.
17 . The network node of claim 16 , wherein the processing circuitry is further configured to indicate by being configured to cause the network node to indicate a starting symbol, S, and a length, L, wherein S plus L is permitted to be larger than 14.
18 . The network node of claim 16 , wherein data to be communicated according to the first PUSCH allocation and data to be communicated according to the second PUSCH allocation correspond to the same transport block, TB.
19 . The network node of claim 16 , wherein information bits of data communicated according to the first PUSCH allocation and of data communicated according to the second PUSCH allocation are encoded independently, wherein different redundancy versions are used for the data communicated according to the first PUSCH allocation and the data communicated according to the second PUSCH allocation.
20 . The network node of claim 19 , wherein:
when the data communicated according to the first PUSCH allocation have a redundancy version of 0 the data communicated according to the second PUSCH allocation have a redundancy version of 2; when the data communicated according to the first PUSCH allocation have a redundancy version of 2 the data communicated according to the second PUSCH allocation have a redundancy version of 3; when the data communicated according to the first PUSCH allocation have a redundancy version of 3 the data communicated according to the second PUSCH allocation have a redundancy version of 1; and when the data communicated according to the first PUSCH allocation have a redundancy version of 1 the data communicated according to the second PUSCH allocation have a redundancy version of 0.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.