Method and device for repetitive transmission of uplink control information for network cooperative communication
US-2023087223-A1 · Mar 23, 2023 · US
US12328739B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12328739-B2 |
| Application number | US-202217851076-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 28, 2022 |
| Priority date | Jul 21, 2020 |
| Publication date | Jun 10, 2025 |
| Grant date | Jun 10, 2025 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Presented are systems and methods for improving fast beam diversity. A wireless communication device may receive N scheduling grants to schedule a plurality of repetitive transmissions of a same data block from a wireless communication node, wherein N is greater than or equal to 2. At least two of the repetitive transmissions may overlap at a time instance. The wireless communication device may communicate only one of the at least two repetitive transmissions that overlap at the time instance to the wireless communication node.
Opening claim text (preview).
What is claimed is: 1. A method, comprising: receiving, by a wireless communication device from a wireless communication node, N scheduling grants to schedule a plurality of repetitive transmissions of a same data block, wherein at least two of the repetitive transmissions overlap at a time instance, and N is greater than or equal to 2, wherein the N scheduling grants are associated with at least one identifier corresponding to at least one control resource set (CORESET), wherein the plurality of repetitive transmissions comprises N groups of repetitive transmissions, and each of the repetitive transmissions is located in one of a plurality of time domain units, and a first of the N groups includes repetitive transmissions in at least a first time domain unit, a (N+1)th time domain unit if the (N+1)th time domain unit exists, and a (2N+1)th time domain unit of the plurality of time domain units if the (2N+1)th time domain unit exists, and a second of the N groups includes repetitive transmissions in at least a second time domain unit, a (N+2)th time domain unit if the (N+2)th time domain unit exists, and a (2N+2)th time domain unit of the plurality of time domain units if the (2N+2)th time domain unit exists; and communicating, between the wireless communication device and the wireless communication node, only one of the at least two repetitive transmissions that overlap at the time instance. 2. The method of claim 1 , wherein each of the plurality of time domain units has a duration of X time slots, where X is greater than or equal to 1. 3. The method of claim 1 , wherein each of the plurality of time domain units has a duration of X occasions of repetitive transmissions in time domain, where X is greater than or equal to 1. 4. The method of claim 1 , wherein an n-th group of the N groups corresponds to an n-th scheduling grant of the N scheduling grants, and in the n-th group of the N groups, only repetitive transmissions scheduled by the n-th scheduling grant are communicated between the wireless communication device and the wireless communication node. 5. The method of claim 1 , wherein an n-th scheduling grant and a (n+1)-th scheduling grant of the N scheduling grants are associated with at least one of: different corresponding CORESET pool identifiers, different corresponding CORESET identifiers, a different time location for each of the n-th scheduling grant and the (n+1)-th scheduling grant, or a different time location for a first or last repetitive transmission scheduled by each of the n-th scheduling grant and the (n+1)-th scheduling grant. 6. The method of claim 5 , wherein the n-th scheduling grant is configured with a CORESET pool identifier or CORESET identifier of smaller value than that of the (n+1)-th scheduling grant. 7. The method of claim 5 , wherein at least one of: the n-th scheduling grant occurs before the (n+1)-th scheduling grant, the n-th scheduling grant occurs after the (n+1)-th scheduling grant, a first symbol of the n-th scheduling grant occurs before a first symbol of the (n+1)-th scheduling grant, a first symbol of the n-th scheduling grant occurs after a first symbol of the (n+1)-th scheduling grant, a last symbol of the n-th scheduling grant occurs before a last symbol of the (n+1)-th scheduling grant, a last symbol of the n-th scheduling grant occurs after a last symbol of the (n+1)-th scheduling grant, a first symbol of repetitive transmissions scheduled by the n-th scheduling grant occurs before a first symbol of repetitive transmissions scheduled by the (n+1)-th scheduling grant, a first symbol of repetitive transmissions scheduled by the n-th scheduling grant occurs after a first symbol of repetitive transmissions scheduled by the (n+1)-th scheduling grant, a last symbol of repetitive transmissions scheduled by the n-th scheduling grant occurs before a last symbol of repetitive transmissions scheduled by the (n+1)-th scheduling grant, or a last symbol of repetitive transmissions scheduled by the n-th scheduling grant occurs after a last symbol of repetitive transmissions scheduled by the (n+1)-th scheduling grant. 8. The method of claim 5 , comprising: communicating, between the wireless communication device and the wireless communication node, only one of the at least two repetitive transmissions that overlap, that is scheduled by a first or Nth one of the N scheduling grants. 9. The method of claim 1 , wherein the at least two of the repetitive transmissions overlap at least in time domain within one bandwidth part (BWP), and each of the at least two of the repetitive transmissions is scheduled by a different one of the M scheduling grants. 10. The method of claim 9 , wherein the at least two of the repetitive transmissions overlap in a same resource element. 11. A wireless communication device comprising: at least one processor configured to: receive, via a transceiver from a wireless communication node, N scheduling grants to schedule a plurality of repetitive transmissions of a same data block, wherein at least two of the repetitive transmissions overlap at a time instance, and N is greater than or equal to 2, wherein the N scheduling grants are associated with at least one identifier corresponding to at least one control resource set (CORESET), wherein the plurality of repetitive transmissions comprises N groups of repetitive transmissions, and each of the repetitive transmissions is located in one of a plurality of time domain units, and a first of the N groups includes repetitive transmissions in at least a first time domain unit, a (N+1)th time domain unit if the (N+1)th time domain unit exists, and a (2N+1)th time domain unit of the plurality of time domain units if the (2N+1)th time domain unit exists, and a second of the N groups includes repetitive transmissions in at least a second time domain unit, a (N+2)th time domain unit if the (N+2)th time domain unit exists, and a (2N+2)th time domain unit of the plurality of time domain units if the (2N+2)th time domain unit exists; and communicate, via the transceiver between the wireless communication device and the wireless communication node, only one of the at least two repetitive transmissions that overlap at the time instance. 12. The wireless communication device of claim 11 , wherein each of the plurality of time domain units has a duration of X time slots, where X is greater than or equal to 1. 13. The wireless communication device of claim 11 , wherein each of the plurality of time domain units has a duration of X occasions of repetitive transmissions in time domain, where X is greater than or equal to 1. 14. The wireless communication device of claim 11 , wherein an n-th group of the N groups corresponds to an n-th scheduling grant of the N scheduling grants, and in the n-th group of the N groups, only repetitive transmissions scheduled by the n-th scheduling grant are communicated between the wireless communication device and the wireless communication node. 15. The wireless communication device of claim 11 , wherein an n-th scheduling grant and a (n+1)-th scheduling grant of the N scheduling grants are associated with at least one of: different corresponding CORESET pool identifiers, different corresponding CORESET identifiers, a different time location for each of the n-th scheduling grant and the (n+1)-th scheduling grant, or a different time location for a first or last repetitive transmission scheduled by each of the n-th scheduling grant and the (n+1)-th scheduling grant. 16. The wireless communication device of claim 15 , wherein the n-th schedulin
by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)} · CPC title
Allocation of signalling, i.e. of overhead other than pilot signals · CPC title
Variable allocation of band or rate · CPC title
Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems · CPC title
using two or more beams, i.e. beam diversity · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.