IP Library Granted Patent US 12,028,758
Granted Patent B2
US 12,028,758 · App. 17/557,062 · Granted Jul 2, 2024

Method and device in nodes used for wireless communication

Inventors: Zheng Liu (Shanghai, CN); Xiaobo Zhang (Shanghai, CN)
Assignee: SHANGHAI LANGBO COMMUNICATION TECHNOLOGY COMPANY LIMITED
H04W36/0061H04L1/1614H04L1/1812H04L5/0055H04W72/23
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,028,758
App. No.
17/557,062
Granted
Jul 2, 2024
Kind
B2
Abstract

The present disclosure provides a method and device in a node used for wireless communications. A node receives a first information block, receives a first PDCCH, the first PDCCH belongs to a first search space set; transmits W bit sets, the first information block is used to determine the W bit sets; the first search space set is associated with a first control resource set, the first control resource set belongs to a first control resource pool; the first control resource pool is used to determine a first bit set out of the W bit sets, the first bit set comprises X bit subsets; the X bit subsets are respectively for X cell groups, and the first PDCCH is used for a first serving cell; the first PDCCH is used to determine a first identifier. The present disclosure guarantees the successful transmission of HARQ.

Claims (37)

1. A first node for wireless communications, comprising:

a first receiver, receiving a first information block;

a second receiver, receiving a first PDCCH, a control channel candidate occupied by the first PDCCH belonging to a first search space set; and

a first transmitter, transmitting W bit sets, the first information block being used to determine the W bit sets, each of the W bit sets comprising at least one HARQ-ACK bit, W being a positive integer greater than 1;

wherein the first search space set is associated with a first control resource set, the first control resource set belongs to a first control resource pool, and the first control resource pool comprises at least one control resource set; the first control resource pool is used to determine a first bit set out of the W bit sets, the first bit set comprises X bit subsets, X being a positive integer greater than 1; the X bit subsets are respectively for X cell groups, and any of the X cell groups comprises at least one serving cell; the first PDCCH is used for a first serving cell, and the first serving cell belongs to one or a plurality of cell groups among the X cell groups; the first PDCCH is used to determine a first identifier, and at least one of the first search space set or the first identifier is used to determine a cell group to which the first serving cell belongs out of the X cell groups.

2. The first node according to claim 1 , wherein the W bit sets are respectively carried by W signals, and time-domain resources occupied by any two of the W signals are orthogonal; the W signals are respectively triggered by PDCCHs comprised in W control resource pools, and indexes of any two of the W control resource pools are unequal; one of the W signals carrying the first bit set is a target signal, and the first control resource pool is one of the W control resource pools comprising a PDCCH triggering the target signal.

3. The first node according to claim 1 , wherein the X cell groups are indexed in order, and at least one of the first search space set or the first identifier is used to determine an index of a cell group to which the first serving cell belongs; the X bit subsets are concatenated to generate the first bit set, and an order of indexes of the X cell groups is used to determine a concatenation order of the X bit subsets.

4. The first node according to claim 1 , wherein the first receiver receives a second information block, wherein the second information block is used to determine a first time-domain resource set, and the first time-domain resource set comprises more than one time-domain resource blocks; the first PDCCH is used to determine a target time-domain resource block, the target time-domain resource block belongs to a second time-domain resource set, and the second time-domain resource set comprises more than one time-domain resource blocks; whether there exist fully or partially overlapped time-domain resource blocks between the first time-domain resource set and the second time-domain resource set is used to determine the X cell groups.

5. The first node according to claim 1 , wherein a first bit subset is one of the X bit subsets, the first bit subset comprises a first bit block, the first bit block comprises at least one bit, and any bit comprised in the first bit block belongs to the first bit subset; the first bit block corresponds to a first time-domain occasion, the first time-domain occasion is a time-domain occasion comprised in a first occasion set, the first occasion set comprises at least one time-domain occasion, and a position of the first time-domain occasion in the first occasion set is used to determine the first bit block in the first bit subset.

6. The first node according to claim 5 , wherein the first occasion set is one of M occasion sets, and any of the M occasion sets comprises at least one time-domain occasion, M being a positive integer; when M is greater than 1, at least one of the first search space set or the first identifier is used to determine the first occasion set out of the M occasion sets.

7. The first node according to claim 1 , wherein the second receiver receives a first signal, and the first transmitter transmits a third information block; wherein the first PDCCH is used to determine time-frequency resources occupied by the first signal; the first identifier is used for a scrambling sequence of the first signal, the first signal belongs to the first serving cell, and one of the X bit subsets is used to indicate whether the first signal is correctly received; and the third information block is used to indicate that the first node supports X being greater than 1.

8. A second node for wireless communications, comprising:

a second transmitter, transmitting a first information;

a third transmitter, transmitting a first PDCCH, a control channel candidate occupied by the first PDCCH belonging to a first search space set; and

a third receiver, receiving W bit sets, the first information block being used to indicate the W bit sets, each of the W bit sets comprising at least one HARQ-ACK bit, W being a positive integer greater than 1;

wherein the first search space set is associated with a first control resource set, the first control resource set belongs to a first control resource pool, and the first control resource pool comprises at least one control resource set; the first control resource pool is used to determine a first bit set out of the W bit sets, the first bit set comprises X bit subsets, X being a positive integer greater than 1; the X bit subsets are respectively for X cell groups, and any of the X cell groups comprises at least one serving cell; the first PDCCH is used for a first serving cell, and the first serving cell belongs to one or a plurality of cell groups among the X cell groups; the first PDCCH is used to determine a first identifier, and at least one of the first search space set or the first identifier is used to determine a cell group to which the first serving cell belongs out of the X cell groups.

9. The second node according to claim 8 , wherein the W bit sets are respectively carried by W signals, and time-domain resources occupied by any two of the W signals are orthogonal; the W signals are respectively triggered by PDCCHs comprised in W control resource pools, and indexes of any two of the W control resource pools are unequal; one of the W signals carrying the first bit set is a target signal, and the first control resource pool is one of the W control resource pools comprising a PDCCH triggering the target signal.

10. The second node according to claim 8 , wherein the X cell groups are indexed in order, and at least one of the first search space set or the first identifier is used to determine an index of a cell group to which the first serving cell belongs; the X bit subsets are concatenated to generate the first bit set, and an order of indexes of the X cell groups is used to determine a concatenation order of the X bit subsets.

11. The second node according to claim 8 , wherein the second transmitter transmits a second information block; wherein the second information block is used to indicate a first time-domain resource block, and the first time-domain resource set comprises more than one time-domain resource blocks; the first PDCCH is used to determine a target time-domain resource block, the target time-domain resource block belongs to a second time-domain resource set, and the second time-domain resource set comprises more than one time-domain resource blocks; whether there exist fully or partially overlapped time-domain resource blocks between the first time-domain resource set and the second time-domain resource set is used to determine the X cell groups.

12. The second node according to claim 8 , wherein a first bit subset is one of the X bit subsets, the first bit subset comprises a first bit block, the first bit block comprises at least one bit, and any bit comprised in the first bit block belongs to the first bit subset; the first bit block corresponds to a first time-domain occasion, the first time-domain occasion is a time-domain occasion comprised in a first occasion set, the first occasion set comprises at least one time-domain occasion, and a position of the first time-domain occasion in the first occasion set is used to determine the first bit block in the first bit subset; the first occasion set is one of M occasion sets, and any of the M occasion sets comprises at least one time-domain occasion, M being a positive integer; when M is greater than 1, at least one of the first search space set or the first identifier is used to determine the first occasion set out of the M occasion sets.

13. The second node according to claim 8 , wherein the third transmitter transmits a first signal; the third receiver receives a third information block; wherein the first PDCCH is used to determine time-frequency resources occupied by the first signal; the first identifier is used for a scrambling sequence of the first signal, the first signal belongs to the first serving cell, and one of the X bit subsets is used to indicate whether the first signal is correctly received; and the third information block is used to indicate that a transmitting device of the third information block supports X being greater than 1.

14. A method in a first node for wireless communications, comprising:

receiving a first information block;

receiving a first PDCCH, a control channel candidate occupied by the first PDCCH belonging to a first search space set; and

transmitting W bit sets, the first information block being used to determine the W bit sets, each of the W bit sets comprising at least one HARQ-ACK bit, W being a positive integer greater than 1;

wherein the first search space set is associated with a first control resource set, the first control resource set belongs to a first control resource pool, and the first control resource pool comprises at least one control resource set; the first control resource pool is used to determine a first bit set out of the W bit sets, the first bit set comprises X bit subsets, X being a positive integer greater than 1; the X bit subsets are respectively for X cell groups, and any of the X cell groups comprises at least one serving cell; the first PDCCH is used for a first serving cell, and the first serving cell belongs to one or a plurality of cell groups among the X cell groups; the first PDCCH is used to determine a first identifier, and at least one of the first search space set or the first identifier is used to determine a cell group to which the first serving cell belongs out of the X cell groups.

15. The method in a first node according to claim 14 , wherein the W bit sets are respectively carried by W signals, and time-domain resources occupied by any two of the W signals are orthogonal; the W signals are respectively triggered by PDCCHs comprised in W control resource pools, and indexes of any two of the W control resource pools are unequal; one of the W signals carrying the first bit set is a target signal, and the first control resource pool is one of the W control resource pools comprising a PDCCH triggering the target signal.

16. The method in a first node according to claim 14 , wherein the X cell groups are indexed in order, and at least one of the first search space set or the first identifier is used to determine an index of a cell group to which the first serving cell belongs; the X bit subsets are concatenated to generate the first bit set, and an order of indexes of the X cell groups is used to determine a concatenation order of the X bit subsets.

17. The method in a first node according to claim 14 , comprising:

receiving a second information block;

wherein the second information block is used to determine a first time-domain resource block, and the first time-domain resource set comprises more than one time-domain resource blocks; the first PDCCH is used to determine a target time-domain resource block, the target time-domain resource block belongs to a second time-domain resource set, and the second time-domain resource set comprises more than one time-domain resource blocks; whether there exist fully or partially overlapped time-domain resource blocks between the first time-domain resource set and the second time-domain resource set is used to determine the X cell groups.

18. The method in a first node according to claim 14 , wherein a first bit subset is one of the X bit subsets, the first bit subset comprises a first bit block, the first bit block comprises at least one bit, and any bit comprised in the first bit block belongs to the first bit subset; the first bit block corresponds to a first time-domain occasion, the first time-domain occasion is a time-domain occasion comprised in a first occasion set, the first occasion set comprises at least one time-domain occasion, and a position of the first time-domain occasion in the first occasion set is used to determine the first bit block in the first bit subset.

19. The method in a first node according to claim 18 , wherein the first occasion set is one of M occasion sets, and any of the M occasion sets comprises at least one time-domain occasion, M being a positive integer; when M is greater than 1, at least one of the first search space set or the first identifier is used to determine the first occasion set out of the M occasion sets.

20. The first node according to claim 14 , comprising:

receiving a first signal; and

transmitting a third information block;

wherein the first PDCCH is used to determine time-frequency resources occupied by the first signal; the first identifier is used for a scrambling sequence of the first signal, the first signal belongs to the first serving cell, and one of the X bit subsets is used to indicate whether the first signal is correctly received; and the third information block is used to indicate that the first node supports X being greater than 1.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 28, 2025
From: SHANGHAI LANGBO COMMUNICATION TECHNOLOGY COMPANY LIMITED
To: APOGEE NETWORKS, LLC
Reel/Frame 071083/0872 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2022
From: LIU, ZHENG; ZHANG, XIAOBO
To: SHANGHAI LANGBO COMMUNICATION TECHNOLOGY COMPANY LIMITED
Reel/Frame 061522/0387 →
Priority Claims (1)
CN 202011538066.8 · Dec 23, 2020 · national
Continuity (1)
Related Publication 20220201562A1 · Jun 23, 2022