阅读说明：本技术 可配置带宽的资源分配 (Resource allocation for configurable bandwidth ) 是由 李剑 梁亚超 郝鹏 于 2018-02-14 设计创作，主要内容包括：本文公开了当可配置宽带可用时,用于资源分配的方法、装置和系统。一种方法包括使用第一带宽中的第一组资源进行第一传输,随后使用第二带宽中的第二组资源进行第二传输,其中所述第一带宽大于所述第二带宽,其中所述第一组资源和第二组资源分别由第一值和第二值标识,并且其中在最高有效位(MSB)或最低有效位(LSB)上,第一值的位表示为第二值的位表示的补零版本。(Methods, apparatuses, and systems for resource allocation when configurable bandwidth is available are disclosed herein. A method includes performing a first transmission using a first set of resources in a first bandwidth, followed by a second transmission using a second set of resources in a second bandwidth, wherein the first bandwidth is greater than the second bandwidth, wherein the first and second sets of resources are identified by a first value and a second value, respectively, and wherein on a Most Significant Bit (MSB) or a Least Significant Bit (LSB), a bit of the first value is represented as a zero-padded version of a bit representation of the second value.)

1. A method of wireless communication, comprising:

performing a first transmission using a first set of resources in a first bandwidth; and

subsequent to the first transmission, performing a second transmission using a second set of resources in a second bandwidth,

wherein the first bandwidth is greater than the second bandwidth,

wherein the first set of resources is identified by a first value,

wherein the second set of resources is identified by a second value,

wherein the bit representation of the first value is a zero-padded version of the bit representation of the second value, and

wherein the bit representation of the second value is zero-padded on a Most Significant Bit (MSB) or a Least Significant Bit (LSB).

2. The method of claim 1, wherein the first and second values correspond to a first Resource Indication Value (RIV) and a second Resource Indication Value (RIV), respectively, wherein the first and second sets of resources correspond to a first and second number of resource blocks, respectively, wherein the first and second bandwidths correspond to a first and second bandwidth portions (BWP ), respectively.

3. The method of claim 2, wherein the first value identifying the first set of resources is based on a first BWP index.

4. The method of claim 2 or 3, wherein the second value identifying the second set of resources is based on a second BWP index.

5. The method of claim 4, further comprising:

receiving Downlink Control Information (DCI) including the second BWP index; and

determining that the second BWP index is different from the first BWP index.

6. The method of any of claims 1 to 5, wherein zero padding on the MSB or LSB is based on one indicator bit indication.

7. The method of any one of claims 1 to 6, wherein the indication bits are part of a frequency domain resource allocation field.

8. The method of any of claims 1 to 6, wherein the indicator bit is based on a value of a bandwidth part indicator field.

9. A method of wireless communication, comprising:

performing a first transmission using a first set of resources in a first bandwidth;

performing a second transmission using a second set of resources in a second bandwidth after the first transmission; and

performing a third transmission using a third set of resources in the second bandwidth after the second transmission; and

wherein the second bandwidth is greater than the first bandwidth,

wherein the first set of resources is identified by a plurality of first values,

wherein the second set of resources is identified by a plurality of second values,

wherein the third set of resources is identified by a plurality of third values, an

Wherein the plurality of third values are determined by selecting a subset of a plurality of second values based on the relative sizes of the first set of resources and the second set of resources.

10. The method of claim 9, wherein the plurality of first values, the plurality of second values, and the plurality of third values correspond to a plurality of first Resource Indication Values (RIV), a plurality of second Resource Indication Values (RIV), and a plurality of third Resource Indication Values (RIV), respectively, and wherein the first set of resources, the second set of resources, and the third set of resources correspond to a first number of resource blocks, a second number of resource blocks, and a third number of resource blocks, respectively, wherein the first bandwidth and the second bandwidth correspond to a first bandwidth part (BWP) and a second bandwidth part (BWP), respectively.

11. The method of claim 9 or 10, wherein the subset is selected uniformly from the plurality of second values.

12. The method of claim 9 or 10, wherein the subset is non-uniformly selected from the plurality of second values.

13. The method of claim 9 or 10, wherein selecting the subset of the plurality of second values is further based on an offset value, and wherein the offset value is based on a bit representation of the first value.

14. The method of claim 13, wherein the offset value is selected from a set ranging from 0 to (S-1), wherein S is a sampling interval, and wherein the sampling interval is based on a ratio of sizes of the first set of resources and the second set of resources.

15. A method of wireless communication, comprising:

performing a first transmission using a first set of resources in a bandwidth; and

performing a second transmission using a second set of resources in the bandwidth after the first transmission,

wherein the first set of resources is identified by a plurality of first values,

wherein the second set of resources is identified by a plurality of second values,

wherein the plurality of first values are based on the plurality of second values, and

wherein a third value of the plurality of second values is greater than a fourth value of the plurality of second values, and (a) a length corresponding to the third value is greater than or equal to a length corresponding to the fourth value, or (b) a start index corresponding to the third value is greater than or equal to a start index corresponding to the fourth value.

16. The method of claim 15, wherein the plurality of first values and the plurality of second values correspond to a plurality of first Resource Indication Values (RIV) and a plurality of second Resource Indication Values (RIV), respectively, wherein the first set of resources and the second set of resources correspond to a first number of resource blocks and a second number of resource blocks, respectively, and wherein the bandwidth corresponds to a bandwidth portion (BWP).

17. The method of claim 16, wherein the plurality of first values (RIV) are determined_new) Is based on the following process:

if (m ═ 0), then

RIV_new＝RIV

Otherwise

If (RIV > (mN-1)) and (RIV < (m +1) N-m), then

RIV_new＝RIV-m(m+1)/2

Otherwise

RIV_new＝max(RIV)-((m-2N)(m+1)/2+RIV)

End up

End up

Wherein max (riv) is the maximum value of the first value, where N is the bandwidth, and m is floor (N/2).

18. A method of wireless communication, comprising:

performing a first transmission using a first set of resources in a bandwidth; and

performing a second transmission using a second set of resources in the bandwidth after the first transmission,

wherein the first set of resources is identified by one of a plurality of first values, wherein the second set of resources is identified by one of a plurality of second values, wherein the plurality of first values are determined by keeping a value of a first variable constant and increasing a value of a second variable, and wherein the plurality of second values are determined by keeping a value of the second variable constant and increasing a value of the first variable.

19. The method of claim 18, wherein the first and second values correspond to first and second Resource Indication Values (RIVs), respectively, wherein the first and second sets of resources correspond to first and second numbers of resource blocks, respectively, wherein the bandwidth corresponds to a bandwidth portion (BWP), and wherein the first variable corresponds to a length of the set of resources and the second variable corresponds to a starting index of the set of resources.

20. The method of claim 19, wherein the plurality of second values are determined using a first equation or a second equation,

wherein the first equation is:

if (RB)_startFloor (N/2)), then

RIV＝N×RB_start+(L_RBs-1)

Otherwise

RIV＝N(N-RB_start)+(N-L_RBs)

And the process is finished, so that the process is finished,

wherein ((N-RB)_start)≤L_RBs≤1)，

Wherein the second equation is:

if (RB)_startFloor (N/2)), then

RIV_temp＝N×RB_start+(L_RBs-1)

Otherwise

RIV_temp＝N(N-RB_start)+(N-L_RBs)

End up

RIV＝RIV_max-RIV_tempAnd wherein ((N-RB)_start)≤L_RBs≤1)。

21. A wireless communication apparatus comprising a processor, wherein the processor is configured to implement the method of any of claims 1-20.

22. A computer program product comprising a computer readable program medium having code stored thereon, which when executed by a processor causes the processor to implement the method according to any of claims 1 to 20.

Technical Field

This document relates generally to wireless communications.

Background

Wireless communication technology is driving the world to an increasingly interconnected and networked society. Rapid advances in wireless communications and advances in technology have resulted in greater demands for capacity and connectivity. Other aspects, such as energy consumption, equipment cost, spectral efficiency, and latency, are also important to meet the needs of various communication scenarios. Next generation systems and wireless communication technologies need to provide greater flexibility in resource allocation and support a large number of connections than existing wireless networks.

Disclosure of Invention

This document relates to methods, systems, and devices for resource allocation, e.g., to provide configurable bandwidth, in new wireless (NR) systems.

In one exemplary aspect, a method of wireless communication is disclosed. The method includes performing a first transmission using a first set of resources in a first bandwidth and performing a second transmission using a second set of resources in a second bandwidth after the first transmission, wherein, based on one embodiment of the disclosed technology, a second value identifying the second set of resources is determined using a first value identifying the first set of resources.

In yet another exemplary aspect, the above-described method is embodied in the form of processor-executable code and stored in a computer-readable program medium.

In yet another exemplary embodiment, an apparatus configured or operable to perform the above method is disclosed.

The above and other aspects and implementations thereof are explained in more detail in the drawings, description and claims.

Drawings

Fig. 1 illustrates an example of a Base Station (BS) and a User Equipment (UE) in a wireless communication system, in accordance with some embodiments of the disclosed technology.

Fig. 2 shows an example of a method for resource allocation of configurable bandwidth.

Figures 3A-3B illustrate an example of another method for resource allocation of configurable bandwidth.

Fig. 4A, 4B, and 4C illustrate an example of yet another method for resource allocation of configurable bandwidth.

Fig. 5 illustrates a flow diagram of an exemplary method for resource allocation of configurable bandwidth.

FIG. 6 is a block diagram representation of portions of an apparatus that may implement the methods or techniques described in this patent document.

Fig. 7 illustrates examples of monotonicity and non-monotonicity in an exemplary method for resource allocation of a configurable bandwidth.

Detailed Description

New wireless (NR) systems are designed to use a wider bandwidth than existing Long Term Evolution (LTE) systems, which can use resources more efficiently with lower control overhead. Furthermore, the introduction of a new bandwidth part (BWP) concept allows flexible and dynamic configuration of the operating bandwidth of the User Equipment (UE), which will make NR a power saving solution despite its support for wide bandwidth.

The concept of the bandwidth part for NR provides a way to operate the UE with a smaller bandwidth than the configured Channel Bandwidth (CBW), which makes NR a power saving solution despite its support for broadband operation. Operation using BWP involves no need for the UE to transmit or receive outside the configured frequency range of the active BWP, thus saving power.

In one example, a handover from one BWP to another BWP may include specifying a Physical Downlink Shared Channel (PDSCH) or Physical Uplink Shared Channel (PUSCH) resource allocation. This may be achieved using a Resource Indication Value (RIV). In general, two values (e.g., a number or length of resource blocks and a starting resource block) may be used to specify one resource allocation. RIV allows a single value to be used to represent both values, simplifying the overhead required to communicate the resource allocation specification.

Fig. 1 shows an example of a wireless communication system including a Base Station (BS)120 and one or more User Equipments (UEs) 111, 112 and 113. In some embodiments, the UE may use the first set of resources for the first transmission (131, 132, 133). In a system with configurable bandwidth, the base station may then send an indication to the UE to use a different BWP (141, 142, 143). The UE may then use a second set of resources for a second transmission.

Resource Allocation (RA) examples in existing systems

In existing NR systems, the BWP index may be used to change the BWP being used by the UE. Downlink Control Information (DCI) is related to the BWP indicated by the index, but the interpretation of the DCI (number of bits) is determined by the current BWP. Currently, there is no operation to map DCI to a new BWP (different from the current BWP).

In some existing systems, the size of all DCI bit fields with DCI formats of 0-1 and 1-1 in the UE-specific search space (USS) is determined by the current BWP. Data may be transmitted on the BWP indicated by the BWP index. If the BWP index activates another BWP, the following conversion rule is implemented: (1) zero padding small bit fields to match the new BWP, and (2) truncating large bit fields to match the new BWP.

In the existing NR resource allocation of type 1, the DCI frequency domain resource allocation field needs to be

Bit, wherein, N_RBIs the number of resource blocks (RBs, which may also be referred to as physical resource blocks or PRBs). In one example, if a smaller BWP (e.g., 50 RBs requiring 11 bits) needs to be switched to a larger BWP (e.g., 200 RBs requiring 15 bits), the current NR system algorithm zero-fills the smaller bit field to match the new BWP (fills in 4 zero bits). The NR system defines two schemes: (1) zero padding on the Most Significant Bit (MSB) of the smaller bit field, or (2) zero padding on the Least Significant Bit (LSB) of the smaller bit field.

According to the mathematical definition of RIV, zero padding on the MSB of the bit field means that RIV can only take very small values, and therefore, the length of the RB can only take very small values. Similarly, zero padding on the LSB of the bit field means that the RIV can only take very large values, and therefore, the length of the RB can only take very large values.

In one example, and in the case of BWP switching to a larger BWP, zero padding on the LSB of the bit field seems more reasonable. However, if the network node (e.g., the gNB) schedules other UEs on RBs that occupy a portion of the frequency corresponding to RBs with high valued indices, zero padding on the LSB will result in scheduling conflicts, and therefore, zero padding on the MSB may be preferable.

As previously mentioned, the RIV may depend on the number/length of resource blocks (denoted L)_RBs) And starting resource block (denoted as RB)_start). According to the mathematical definition of RIV in NR, RIV is determined by maintaining L_RBsIs unchanged and RB is increased_startMay result in the length of RBs that the UE can schedule being limited and may cause resource blocking.

Numerical values are exemplified.In the example of Resource Allocation (RA) type 1, BWP1 uses 24 RBs (requiring 9 bits) and BWP2 uses 275 RBs (requiring 16 bits). If the UE needs to switch from BWP1 to BWP2, zero-padded 7 bits are needed.

Assume bit field of BWP1 is configured to 001101101.

Zero padding on the MSB of the bit field of BWP2 yields a result of 0000000001101101, i.e., RIV 107. According to the mathematical definition of RIV, this means L_RBsIs 1 RB, RB_startIs the 107 th RB. Alternatively, zero padding on the LSB of the bit field of BWP2 results in 0011011010000000, i.e., RIV 13952. According to the mathematical definition of RIV, this means L_RBsIs 51 RBs, RB_startIs the 107 th RB.

And (4) mathematical definition.According to the existing NR specification, the mathematical definition of RIV does not guarantee monotonicity of RIV.

If it is not

Then

Otherwise

WhereinL_RBsNot less than 1 and should not exceed

In particular, the "otherwise" condition does not guarantee monotonicity of the RIV.

In NR (new RAT) resource allocation of type 1 (which is similar to LTE resource allocation of type 2), resource block allocation information to a UE indicates a resource block allocation of size of

A set of contiguously allocated resource blocks within a wide portion of the active carrier band of each PRB. However, when DCI formats 1-0 are decoded in the common search space of CORESET 0, the indication is interpreted as the size to be used asAn initial bandwidth portion of one PRB.

For the NR resource allocation type 1, the NR resource allocation type is,the LSB provides resource allocation in a DCI format frequency domain resource allocation field, and the resource allocation field is defined by a code corresponding to a starting Resource Block (RB)_start) Resource Indication Value (RIV) and length (L) based on continuously allocated resource blocks_RBs) And (4) forming.

Typically, these two values (RB)_startAnd L_RBs) Can be used to specify resource allocation, but using RIV allows a single value to be used to represent both values, which will have some advantages in terms of the number of bits to carry the information.

According to the DCI format, the mathematical definition of RIV is as follows:

if it is not

Then

Otherwise

Wherein L is_RBsNot less than 1 and should not exceed

The above definition shows that the ordering order of RIVs includes first maintaining L_RBsConstant and increasing RB_start. For example, using symbols (RB)_start,L_RBs)，

RIV 0 corresponds to (0,1)

RIV 1 corresponds to (1,1)

RIV 2 corresponds to (2,1)

…

Corresponding to (0,2)

…

BWP background.A UE configured to operate in a bandwidth part (BWP) of a serving cell for which a set of up to four bandwidth parts (BWPs) (DL BWP groups) with parameters in DL bandwidth being DL-BWPs is used by the UE for reception and a set of up to four BWPs (UL BWP groups) with parameters in UL bandwidth being UL-BWPs is used by the UE for transmission is configured by higher layers.

If the bandwidth path indicator field is configured in DCI format 1-1, the bandwidth path indicator field value indicates an active DL BWP for DL reception in the configured DL BWP group. If the bandwidth path indicator field is configured in DCI format 0-1, the bandwidth path indicator field value indicates an active UL BWP for UL transmission in the configured UL BWP group.

RA example embodiments based on RIV zero padding with bit indication

As shown in fig. 2, zero padding on the MSB or LSB may be used to convert a bit field associated with a first BWP into that for a second BWP. As shown, the BWP1 RA bit field may be padded on the MSB or LSB to increase its length to be equal to the length of the BWP2 RA bit field. Embodiments of the disclosed technology may use an indicator bit to select between zero padding on the MSB or LSB.

In some embodiments, the indication bit is in a frequency domain resource allocation field, e.g., the MSB of the field or the second significant bit of the field. In other embodiments, the indicator bit may be an implicit indication through a bandwidth path indicator field when the BWP index is different from the current BWP index.

In some embodiments, where resource allocation type 0 and type 1 are configured, the indicator bits may be used to select between resource allocation types (e.g., dynamically switch between RA type 0 and RA type 1). In some embodiments, a network node (e.g., eNB) may select whether zero padding is on the MSB or on the LSB.

RA example embodiments based on a new RIV mathematical definition

Embodiments of the disclosed technology may use a new mathematical definition of RIV to ensure that resource blocking is eliminated. As described in the context of existing NR systems and as shown in fig. 3B, RIV can be obtained by first maintaining L_RBsConstant and increasing RB_startTo be determined.

In contrast, as shown in FIG. 3A, some embodiments of the disclosed technology operate by selecting from one RB_startIncrease L_RBsTo determine the RIV. Then, RB_startIncrease in value, hold L_RBsConstant at a fixed value.

In one example, Symbols (RBs) are used_start,L_RBs) A plurality of RIVs may be determined, as follows:

RIV 0 corresponds to (0,1)

RIV 1 corresponds to (0,2)

RIV 2 corresponds to (0,3)

…

Is equivalent to

Corresponding to (1,1)

…

RIV max _ value corresponds to

In some embodiments, and applicable to the scenario described above, the following first alternative mathematical definition of RIV may be expressed as:

if it is notThen

Otherwise

Wherein L is_RBsNot less than 1 and should not exceed

In other embodiments, any starting point of the resource block index or the maximum value of the resource block index may be used. In this case, a plurality of RIVs may be determined, as follows:

RIV 1 corresponds to

RIV 2 corresponds to

RIV-3 corresponds to

RIV-4 corresponds to

RIV-5 corresponds to

RIV 6 corresponds to

…

RIV max _ value corresponds to

Among them, RIVtarget ═ abs (RIVmax-RIV).

In some embodiments, and applicable to the scenario described above, the following second alternative mathematical definition of RIV may be expressed as:

if it is not

Then

Otherwise

RIV＝RIV_Max-RIV_temp

Wherein L is_RBsNot less than 1 and should not exceed

In some embodiments, the first or second alternative mathematical definition of an RIV may be selected based on the indicator bits. In one example, the indication bit is in a frequency domain resource allocation field, e.g., the MSB of the field or the second significant bit of the field. In another example, the indicator bit may be an implicit indication through a bandwidth path indicator field when the BWP index is different from the current BWP index.

As seen and described in this patent document, various embodiments of the disclosed technology can be combined unless implementation is explicitly prohibited. For example, the zero padding method may be used in conjunction with the new mathematical definition of the RIV, as shown in the numerical example below.

Numerical values are exemplified.Continuing with the example described for Resource Allocation (RA) type 1 in the context of the existing NR system, where BWP1 uses 24 RBs, BWP2 uses 275 RBs, and the UE needs to switch from BWP1 to BWP2, assuming that the BWP1 bit field is configured 001101101.

Zero padding on the MSB of the BWP2 bit field yields a result of 0000000001101101, i.e., RIV 107. According to the mathematical definition of RIV, this means L_RBsIs 1 RB, RB_startIs the 107 th RB. If a new mathematical definition of RIV is used, the result is L_RBsIs 107 RB, RB_startIs the 0 th RB.

Zero padding on the LSB of the BWP2 bit field yields a result of 0011011010000000, i.e., RIV 13952. According to the mathematical definition of RIV, this means L_RBsIs 51 RBs, RB_startIs the 107 th RB. If a new mathematical definition of RIV is used, the result is L_RBsIs 107 RB, RB_startIs the 51 st RB.

Example embodiments of RA based on RIV sampling

Embodiments of the disclosed technology may sample (more specifically, downsample) a set of RIVs to generate a set of alternative RIVs that may prevent resource blocking. In one example, as shown in FIGS. 4A-4C, the smaller BWP RIV state indexes from 0 to (M-1) and the larger BWP RIV state indexes from 0 to (N-1).

In some embodiments, as shown in FIG. 4A, a larger ceil (log2(N)) -bitBWP bit field (which indicates N states) may be sampled at equal intervals. For example, a sampling interval of floor (N/M) may be used to select a subset of states for a larger ceil (log2(N)) -bit BWP bit field to determine the state of a smaller ceil (log2(M)) -bit BWP bit field.

In other embodiments, as shown in FIG. 4B, the larger ceil (log2(N)) -bit BWP bit field may be sampled with equal spacing and offset from the first state of the larger BWP bit field. For example, the sampling interval of floor (N/M) may be used along with offset values to select a subset of states for the larger ceil (log2(N)) -bit BWP bit field to determine the state of the smaller ceil (log2(M)) -bit field.

In other embodiments, as shown in FIG. 4C, the larger ceil (log2(N)) -bitBWP bit field may be sampled using unequal intervals. For example, a sampling interval of floor (N/M) + offset Y may be used to select a larger subset of states of the ceil (log2(N)) -bit BWP bit field to determine the states of the smaller ceil (log2(M)) -bit field. Fig. 4C illustrates that the sampling interval may vary continuously as a larger BWP bit field is sampled. In one example, the offset may be predetermined and read from a table or specification. In another example, the offset may be randomly generated. In yet another example, the offset may be based on a portion of a smaller ceil (log2(M)) -bit field. In the remaining examples, the offset may be calculated in real time.

Numerical values are exemplified.In one example, the bit field for large BWPs (e.g., 200 RBs requiring 15 bits) uses 2^15 states, while the bit field for small BWPs (e.g., 50 RBs requiring 11 bits) uses only 2^11 states. In this case, a sample of (1:2^ (15-11):2^15) representation may be used, where the intervals may be equal or unequal, with or without an offset.

In some embodiments, sampling may be from a larger ceil (log2(N)) set of RIV values to a smaller ceil (log2(M)) set of RIV values, as shown in FIGS. 4A-4C. For example, the states shown in FIGS. 4A-4C correspond to individual RIV values. In other embodiments, the sampling may be from a single bit field as described in the numerical example above. For example, the states in FIGS. 4A-4C correspond to individual bits.

Example embodiments of RIV monotonicity based RA

Embodiments of the disclosed technology may modify the monotonicity of the definitions to eliminate resource blocking. Original definition of RIV for LTE systems, as described in the context of existing systems, the RIV value ordering order is to first maintain L_RBsConstant while increasing RB_start. However, this results in a lack of monotonicity, as shown in fig. 7.

For monotonicity, L_RBsWhen 1, the RIV value should be increased with RB_startIncrease by corresponding, and L_RBsWhen the value is 2, the RIV value is increased with RB_startIncrease correspondingly, and so on. However, L_RBsNot less than 1 and the parameter does not exceed

May result in RB_startAt L_RBs>All values cannot be traversed for 1. Thus, the RIV value does not always indicate the RB traversed_startAnd L_RBsCombinations of (a) and (b). As shown in Table 1, the bold/highlighted entry corresponds to an RIV value that does not correspond to a monotonically varying RB_startAnd L_RBsCombinations of (a) and (b).

Table 1: examples of lack of monotonicity in RIV value generation

In some embodiments, the following formula may be used to correct for monotonicity of the RIV:

wherein max (RIV) ═ maximum state of RIV, whereinAnd wherein N is BWPThe bandwidth of (c).

Different embodiments of the disclosed techniques, such as zero padding with bit indication, new mathematical definitions, sampling and monotonicity, may be combined to provide embodiments that prevent resource blocking and provide an efficient resource allocation method when configurable bandwidth is available.

Fig. 5 illustrates a flow diagram of an exemplary method for resource allocation of configurable bandwidth. The method 500 includes, at step 510, performing a first transmission using a first set of resources in a first bandwidth.

The method 500 includes, at step 520, performing a second transmission using a second set of resources in a second bandwidth after the first transmission. The first set of resources is identified by a first value (or values) and the second set of resources is identified by a second value (or values), and corresponds to a UE that switches from using the first set of resources for a first transmission to using the second set of resources for a second transmission.

In some embodiments, the bit representation of the first value is a zero-padded version of the bit representation of the second value, which is zero-padded on the MSB or LSB, as described in the context of the embodiments of RA based on RIV zero-padded with bit indication section.

In some embodiments, the plurality of first values may be determined by selecting a subset of the plurality of second values based on the relative sizes of the first set of resources and the second set of resources, as described in the context of the "embodiment of RA based on RIV sampling" section. For example, equal or unequal sampling intervals, with or without offsets.

In some embodiments, as described in the context of the "embodiment of RA based on RIV monotonicity" section, the second value is based on a first value, and the second value is calculated using a monotonic function, wherein the first value is greater than the second value, which means that (a) the length of the first set of resources is greater than or equal to the length of the second set of resources, or (b) the starting index of the first set of resources is greater than or equal to the starting index of the second set of resources.

At one endIn some embodiments, the first value is determined by holding a first variable (e.g., L) as described in the context of the "embodiments of RA based on New RIV mathematical definition" section_RBs) Is constant and increases a second variable (e.g., RB)_start) Is generated, and the second value is a value of the second type generated by keeping the value of the second variable constant and increasing the value of the first variable.

Fig. 6 is a block diagram of an example apparatus that may implement a method or technique (e.g., method 500) described in this document. The apparatus 605, such as a base station or wireless device (or UE), may include processor electronics 610, such as a microprocessor, that implement one or more of the techniques described in this document. The apparatus 605 may include transceiver electronics 615 to transmit and/or receive wireless signals over one or more communication interfaces, such as one or more antennas 620. The apparatus 605 may include other communication interfaces for sending and receiving data. The apparatus 605 may include one or more memories (not explicitly shown) configured to store information such as data and/or instructions. In some implementations, the processor electronics 610 may include at least a portion of the transceiver electronics 615. In some embodiments, at least a portion of the disclosed techniques, modules, or functions are implemented using the apparatus 605.

This description, together with the drawings, is to be considered exemplary only, in that the illustrations are meant to be exemplary, and not meant to imply ideal or preferred embodiments, unless otherwise specified. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Further, the use of "or" is intended to include "and/or" unless the context clearly indicates otherwise.

Some embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers in networked environments. Computer-readable media may include removable and non-removable storage devices including, but not limited to, read-only memory (ROM), random-access memory (RAM), Compact Disks (CDs), Digital Versatile Disks (DVDs), and the like. Accordingly, the computer readable medium may include a non-transitory storage medium. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-or processor-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.

Some embodiments disclosed may be implemented as a device or module using hardware circuitry, software, or a combination thereof. For example, a hardware circuit implementation may include discrete analog and/or digital components, e.g., integrated as part of a printed circuit board. Alternatively, or in addition, the disclosed components or modules may be implemented as Application Specific Integrated Circuit (ASIC) and/or Field Programmable Gate Array (FPGA) devices. Some implementations may additionally or alternatively include a Digital Signal Processor (DSP), which is a special purpose microprocessor having an architecture optimized for the operational needs of the digital signal processing associated with the disclosed functionality of the present application. Similarly, various components or sub-components within each module may be implemented in software, hardware, or firmware. Connections between modules and/or components within modules may be provided using any of a variety of connection methods and media known in the art, including, but not limited to, communications over the internet, wired or wireless networks using an appropriate protocol.

While this document contains many specifics, these should not be construed as limitations on the scope of the claimed invention or of what may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a described combination can in some cases be excised from the combination, and the described combination may be directed to a subcombination or variation of a subcombination. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.

Only a few implementations and examples are described and other implementations, enhancements and transformations may be made based on what is described and illustrated in this disclosure.