Wireless communication method, terminal and network device
View Patent ↗The embodiments of the disclosure provide a method for wireless communication and a device, which may implement flexible transmission of a scheduling request situation for Scheduling Request (SR) information under multiple sets of SR configurations. The method includes that: a terminal determines K pieces of SR information, here, K is a positive integer; and the terminal sends a target channel, here, the target channel includes M-bit first information, the M-bit first information is used to indicate a scheduling request situation for at least part of the K pieces of SR information, M is a positive integer and a value of M is determined based on a relationship between K and at least one first numerical value.
1. A method for wireless communication, comprising:
determining, by a terminal, K pieces of Scheduling Request (SR) information, K being a positive integer; and
sending, by the terminal, M-bit first information on a target channel, the M-bit first information being used to indicate a scheduling request situation for at least part of the K pieces of SR information, M being a positive integer and a value of M being determined based on a range, within which the K falls, of ranges defined by at least one first numerical value.
2. The method of claim 1 , wherein the target channel is configured to transmit second information for non-SR information; and
the target channel overlaps, in a time domain, with a resource configured to transmit the K pieces of SR information.
3. The method of claim 1 , wherein M is equal to K when K is less than or equal to the at least one first numerical value.
4. The method of claim 3 , wherein the K pieces of SR information are in one to one correspondences with the M-bit first information by means of bit mapping.
5. The method of claim 1 , wherein when K is greater than or equal to the at least one first numerical value,
M =ceil(log 2 ( K+ 1)), or
M is a second numerical value, the second numerical value being a constant less than K.
6. The method of claim 5 , wherein the M-bit first information is used to indicate that each of the K pieces of SR information represents absence of SR,
or indicate that at least one piece of the K pieces of SR information represents presence of SR.
7. A terminal, comprising:
a processor configured to determine K pieces of Scheduling Request (SR) information, K being a positive integer; and
a transceiver configured to send M-bit first information on a target channel, the M-bit first information being used to indicate a scheduling request situation for at least part of the K pieces of SR information, M being a positive integer and a value of M being determined based on a range, within which the K falls, of ranges defined by at least one first numerical value.
8. The terminal of claim 7 , wherein the target channel is configured to transmit second information for non-SR information; and
the target channel overlaps, in a time domain, with a resource configured to transmit the K pieces of SR information.
9. The terminal of claim 8 , wherein the second information is Acknowledge (ACK)/Non-Acknowledge (NACK) information or Channel State Information (CSI).
10. The terminal of claim 7 , wherein M is equal to K when K is less than or equal to the at least one first numerical value.
11. The terminal of claim 10 , wherein the K pieces of SR information are in one to one correspondences with the M-bit first information by means of bit mapping.
12. The terminal of claim 7 , wherein when K is greater than or equal to the at least one first numerical value,
M =ceil(log 2 ( K+ 1)), or
M is a second numerical value, the second numerical value being a constant less than K.
13. The terminal of claim 12 , wherein the M-bit first information is used to indicate that each of the K pieces of SR information represents absence of SR,
or indicate that at least one piece of the K pieces of SR information represents presence of SR.
14. The terminal of claim 7 , wherein the processor is further configured to:
determine a value of the M-bit first information according to at least one of: whether each of the K pieces of SR information represents presence of SR; or an ordering of the K pieces of SR information, and according to predefined mapping relationships,
wherein in the predefined mapping relationships, different values of the M-bit first information correspond to different scheduling request situations for the K pieces of SR information.
15. The terminal of claim 14 , wherein the ordering of the K pieces of SR information is associated with at least one of respective resource configuration parameters or service channel parameters for the K pieces of SR information; or
the ordering of the K pieces of SR information is configured through high-layer signaling.
16. A network device, comprising:
a transceiver configured to receive M-bit first information sent by a terminal on a target channel; and
a processor configured to acquire a scheduling request situation for at least part of K pieces of Scheduling Request (SR) information of the terminal from the M-bit first information, M being a positive integer and a value of M being determined based on a range, within which the K falls, of ranges defined by at least one first numerical value.
17. The device of claim 16 , wherein the target channel is configured to transmit second information for non-SR information; and
the target channel overlaps, in a time domain, with a resource configured to transmit the K pieces of SR information.
18. The device of any one of claim 16 , wherein M is equal to K when K is less than or equal to the at least one first numerical value.
19. The device of claim 18 , wherein the K pieces of SR information are in one to one correspondences with the M-bit first information by means of bit mapping.
20. The device of claim 16 , wherein when K is greater than or equal to the at least one first numerical value,
M =ceil(log 2 ( K+ 1)), or
M is a second numerical value, the second numerical value being a constant less than K.