Method and apparatus for obtaining resource indication value
This application provides a method and apparatus for obtaining a resource indication value. The method includes: receiving downlink control information, where the downlink control information includes a first resource indication value n, a quantity of bits of the first resource indication value n is determined based on a first bandwidth part, and the downlink control information is used to schedule a data channel located in a second bandwidth part; determining a second resource indication value r based on the first resource indication value n, where r=└±a·n+b┘ or r=└a·n┘, a is a positive number, and b is a positive integer; and determining, based on the second resource indication value r, a resource occupied by the data channel. Flexibility of scheduling a data channel by a network device can be improved in this manner.
1. A method comprising:
determining, by a terminal device, a quantity of bits of a resource indication value based on a first bandwidth part;
receiving, by the terminal device, downlink control information, wherein the downlink control information comprises the resource indication value, and the downlink control information indicates a data channel in a second bandwidth part;
determining, by the terminal device, a positive number K based on a bandwidth N RB BWP1 of the first bandwidth part and a bandwidth N RB BWP2 of the second bandwidth part, wherein the positive number K satisfies K≤└N RB BWP2 /N RB BWP1 ┘;
determining, by the terminal device, a second number RB start and a second length L RBs based on the resource indication value, the bandwidth N RB BWP1 of the first bandwidth part and the positive number K, wherein the second number RB start indicates a number identifying a starting virtual resource block of contiguous virtual resource blocks occupied by the data channel, and the second length L RBs indicates a quantity of the contiguous virtual resource blocks; and
determining, by the terminal device based on the second number RB start and the second length L RBs ,a resource occupied by the data channel.
2. The method according to claim 1 , wherein the determination of the second number RB start and the second length L RBs comprises:
determining, by the terminal device, a first number RB′ start and a first length L′ RBs based on the resource indication value and the bandwidth N RB BWP1 of the first bandwidth part; and
determining, by the terminal device, the second number RB start based on the first number RB′ start , and determining the second length L RBs based on the first length L′ RBs , wherein the second number RB start satisfies RB start =└K·RB′ start ┘, and the second length L RBs satisfies L RBs=└K·L′ RBs ┘.
3. The method according to claim 1 , wherein K is a maximum value of at least one candidate value K′, wherein the at least one candidate value K′ satisfies K′≤└N RB BWP2 /N RB BWP1 ┘.
4. The method according to claim 3 , wherein the at least one candidate value K′ is comprised in a candidate set, wherein the candidate set comprises 2, 4 and 8.
5. The method according to claim 1 , wherein K equals 2, 4 or 8.
6. The method according to claim 1 , wherein K equals 1.
7. The method according to claim 1 , further comprising:
sending, by the terminal device, data on the resource.
8. The method according to claim 1 , further comprising:
receiving, by the terminal device, data on the resource.
9. An apparatus comprising:
a storage medium including executable instructions; and
a processor;
wherein the executable instructions, when executed by the processor, cause the apparatus to:
determine a quantity of bits of a resource indication value based on a first bandwidth part;
receive downlink control information, wherein the downlink control information comprises the resource indication value, and the downlink control information indicates a data channel in a second bandwidth part; and
determine a positive number K based on a bandwidth N RB BWP1 of the first bandwidth part and a bandwidth N RB BWP2 of the second bandwidth part, wherein the positive number K satisfies K≤└N RB BWP2 /N RB BWP1 ┘;
determine a second number RB start and a second length L RBs based on the resource indication value, the bandwidth N RB BWP1 of the first bandwidth part and the positive number K, wherein the second number RB start indicates a number identifying a starting virtual resource block of contiguous virtual resource blocks allocated for the data channel, and the second length L RBs indicates a quantity of the contiguous virtual resource blocks; and
determine, based on the second number RB start and the second length L RBs , a resource occupied by the data channel.
10. The apparatus according to claim 9 , wherein the determination of the second number RB start and the second length L RBs comprises:
determining a first number RB′ start and a first length L′ RBs based on the resource indication value and the bandwidth N RB BWP1 of the first bandwidth part; and
determining the second number RB start based on the first number RB′ start , and determining the second length L RBs based on the first length L′ RBs , wherein the second number RB start satisfies RB start =└K·RB′ start ┘, and the second length L RBs satisfies L RBs =└K·L′ RBs ┘.
11. The apparatus according to claim 9 , wherein K is a maximum value of at least one candidate value K′, wherein the at least one candidate value K′ satisfies K′≤└N RB BWP2 /N RB BWP1 ┘.
12. The apparatus according to claim 11 , wherein the at least one candidate value K′ is comprised in a candidate set, wherein the candidate set comprises 2, 4 and 8.
13. The apparatus according to claim 9 , wherein K equals 2, 4 or 8.
14. The apparatus according to claim 9 , wherein K equals 1.
15. The apparatus according to claim 9 , wherein the executable instructions, when executed by the processor, further cause the apparatus to:
send data on the resource.
16. The apparatus according to claim 9 , wherein the executable instructions, when executed by the processor, further cause the apparatus to:
receive data on the resource.
17. A non-transitory computer-readable storage medium, comprising executable instructions, wherein the executable instructions, when executed by a computer, cause the computer to:
determine a quantity of bits of a resource indication value based on a first bandwidth part;
receive downlink control information, wherein the downlink control information comprises the resource indication value, and the downlink control information indicates indicate a data channel in a second bandwidth part; and
determine a positive number K based on a bandwidth N RB BWP1 of the first bandwidth part and a bandwidth N RB BWP2 of the second bandwidth part, wherein the positive number K satisfies K≤└N RB BWP2 /N RB BWP1 ┘;
determine a second number RB start and a second length L RBs based on the resource indication value, the bandwidth N RB BWP1 of the first bandwidth part and the positive number K, wherein the second number RB start indicates a number identifying a starting virtual resource block of contiguous virtual resource blocks allocated for the data channel, and the second length L RBs indicates a quantity of the contiguous virtual resource blocks; and
determine, based on the second number RB start and the second length L RBs , a resource occupied by the data channel.
18. The non-transitory computer-readable storage medium according to claim 17 , wherein the determination of the second number RB start and the second length L RBs comprises:
determine a first number RB′ start and a first length L′ RBs based on the resource indication value and the bandwidth N RB BWP1 of the first bandwidth part; and
determine the second number RB start based on the first number RB′ start and determining the second length L RBs based on the first length L′ RBs , wherein the second number RB start satisfies RB start =└K·RB′ start ┘, and the second length L RBs satisfies L RBs =└K·L′ RBs ┘.
19. The non-transitory computer-readable storage medium according to claim 17 , wherein K is a maximum value of at least one candidate value K′, wherein the at least one candidate value K′ satisfies K′≤└N RB BWP2 /N RB BWP1 ┘.
20. The non-transitory computer-readable storage medium according to claim 19 , wherein the at least one candidate value K′ is comprised in a dandidate set, wherein the candidate set comprises 2, 4 and 8.