Method and apparatus for obtaining resource indication value
This application provides a method and apparatus for obtaining a resource indication value. The method includes: a network device determines a bit quantity of a resource indication value based on a first bandwidth part, sends downlink control information, which includes the resource indication value and indicates a data channel in a second bandwidth part, and sends or receives the data channel occupying a plurality of contiguous virtual resource blocks, wherein a number RB start identifying the starting virtual resource block of the contiguous virtual resource blocks, a quantity L RBs of the contiguous virtual resource blocks, and the resource indication value RIV satisfy following relation: RB start =└K·RB′ start ┘, and L RBs =└K·L′ RBs ┘, wherein K is a positive number and satisfies K≤└N RB BWP2 /N RB BWP1 ┘, and N RB BWP2 refers to a bandwidth of the second bandwidth part; and RIV=N RB BWP1 (L′ RBs −1)+RB′ start when (L′ RBs −1)≤└N RB BWP1 /2┘, or RIV=N RB BWP1 (N RB BWP1 −L′ RBs +1)+(N RB BWP1 −1−RB′ start ) when (L′ RBs −1)>└N RB BWP1 /2┘, wherein N RB BWP1 refers to a bandwidth of the first bandwidth part.
1. A method comprising:
determining, by a network device, a quantity of bits of a resource indication value (RIV) based on a first bandwidth part;
sending, by the network device, downlink control information comprising including the resource indication value, wherein the downlink control information indicates a data channel in a second bandwidth part; and
sending or receiving the data channel occupying a plurality of contiguous virtual resource blocks, wherein
a number identifying a starting virtual resource block of the contiguous virtual resource blocks RB start , a quantity of the contiguous virtual resource blocks L RBs , and the RIV satisfy:
RB start =└K·RB′ start ┘, and
L RBs =└K·L′ RBs ┘, 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 ┘, wherein
N RB BWP1 refers to a bandwidth of the first bandwidth part, and N RB BWP2 refers to a bandwidth of the second bandwidth part; and
RIV=N RB BWP1 ( L′ RBs −1)+ RB′ start when ( L′ RBs −1)≤└ N RB BWP1 /2┘, or
RIV=N RB BWP1 ( N RB BWP1 −L′ RBs +1)+( N RB BWP1 −1− RB′ start ) when ( L′ RBs −1)>└ N RB BWP1 /2┘.
2. The method according to claim 1 , wherein the at least one candidate value K′ is included in a candidate set, wherein the candidate set includes 1, 2, 4 and 8.
3. The method according to claim 1 wherein K is one of 1, 2, 4 or 8.
4. The method according to claim 1 , wherein K is 1.
5. An apparatus comprising:
at least one processor; and
a memory coupled to the at least one processor and storing programming instructions for execution by the at least one processor, the programming instructions instruct the at least one processor to:
determine a quantity of bits of a resource indication value (RIV) based on a first bandwidth part;
send downlink control information including the resource indication value, wherein the downlink control information indicates a data channel in a second bandwidth part; and
send or receive the data channel occupying a plurality of contiguous virtual resource blocks, wherein
a number identifying a starting virtual resource block of the contiguous virtual resource blocks RB start , a quantity of the contiguous virtual resource blocks L RBs , and the RIV satisfy:
RB start =└K·RB′ start ┘, and
L RBs =└K·L′ RBs ┘, wherein
K is a maximum value of at least one candidate vale K′, wherein
the at least one candidate value K′ satisfies:
K≤└N RB BWP2 /N RB BWP1 ┘, wherein
N RB BWP1 refers to a bandwidth of the first bandwidth part, and N RB BWP2 refers to a bandwidth of the second bandwidth part; and
RIV=N RB BWP1 ( L′ RBs −1)+ RB′ start when ( L′ RBs −1)≤└ N RB BWP1 /2┘, or
RIV=N RB BWP1 ( N RB BWP1 −L′ RBs +1)+( N RB BWP1 −1− RB′ start ) when ( L′ RBs −1)>└ N RB BWP1 /2┘.
6. The apparatus according to claim 5 , wherein the at least one candidate value K′ is included in a candidate set, wherein the candidate set includes 1, 2, 4 and 8.
7. The apparatus according to claim 6 , wherein K is one of 1, 2, 4 and 8.
8. The apparatus according to claim 5 , wherein K is 1.
9. 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;
send downlink control information including the resource indication value (RIV), wherein the downlink control information indicates a data channel in a second bandwidth part; and
send or receive the data channel occupying a plurality of contiguous virtual resource blocks, wherein
a number identifying a starting virtual resource block of the contiguous virtual resource blocks RB start , a quantity of the contiguous virtual resource blocks L RBs , and the RIV satisfy:
RB start =└K·RB′ start ┘, and
L RBs =└K·L′ RBs ┘, wherein
K is a maximum value of at least one candidate vale K′, wherein
the at least one candidate value K′ satisfies:
K≤└N RB BWP2 /N RB BWP1 ┘, wherein
N RB BWP1 refers to a bandwidth of the first bandwidth part, and N RB BWP2 refers to a bandwidth of the second bandwidth part; and
RIV=N RB BWP1 ( L′ RBs −1)+ RB′ start when ( L′ RBs −1)≤└ N RB BWP1 /2┘, or
RIV=N RB BWP1 ( N RB BWP1 −L′ RBs +1)+( N RB BWP1 −1− RB′ start ) when ( L′ RBs −1)>└ N RB BWP1 /2┘.
10. The non-transitory computer-readable storage medium according to claim 9 , wherein the at least one candidate value K′ is included in a candidate set, wherein the candidate set includes 1, 2, 4 and 8.
11. The non-transitory computer-readable storage medium according to claim 9 , wherein K is one of 1, 2, 4 and 8.
12. The non-transitory computer-readable storage medium according to claim 9 , wherein K is 1.