CN113056006B

CN113056006B - Resource pool time domain bit map configuration method and device, configuration entity and communication equipment

Info

Publication number: CN113056006B
Application number: CN201911379634.1A
Authority: CN
Inventors: 冯媛; 乔逢浩; 王世良
Original assignee: CICTCI Technology Co Ltd
Current assignee: Datang Gaohong Zhilian Technology Chongqing Co ltd
Priority date: 2019-12-27
Filing date: 2019-12-27
Publication date: 2023-12-12
Anticipated expiration: 2039-12-27
Also published as: CN113056006A

Abstract

The invention provides a resource pool time domain bit map configuration method, a device, a configuration entity and communication equipment, wherein the resource pool time domain bit map configuration method comprises the following steps: according to the polling configuration period and the length of the time domain bitmap of the resource pool, aiming at each bit with the polling configuration value of the resource pool as a first value, obtaining a resource pool bitmap corresponding to each resource pool respectively; the polling configuration period is equal to the first common divisor among the common divisors of all SPS effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value characterizes a resource grant of the resource pool to be invoked; the first common divisor is one of common divisors, and is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource pool bit map, where the first value is not configured, are all configured to be default values, and the default values represent that the resource prohibition of the resource pool is called. The scheme can solve the problems that resources cannot be used or time delay is large due to unreasonable bitmap configuration of the resource pool.

Description

Resource pool time domain bit map configuration method and device, configuration entity and communication equipment

Technical Field

The present invention relates to the field of terminal technologies, and in particular, to a method and an apparatus for configuring a resource pool time domain bitmap, a configuration entity, and a communication device.

Background

In some situations, a time division tx (transmission) resource pool needs to be configured, namely, a transmission resource pool with a bitmap (bit map) which is not all 1 is configured; the configuration of the bitmap of the sending resource pool belongs to system implementation, and is not given in the standard, and the requirements are not explicitly given, and the specific steps are as follows:

for SPS (semi-persistent scheduling) resource reservation, determination of transmission resources from a protocol perspective: the reserved subsequent resources (reservation period) are reserved according to strict logic subframe intervals, namely, only the logic subframes can be guaranteed, and the logic subframes with the bitmap configured as 1 cannot be guaranteed completely. Thus, if the bitmap configuration is unreasonable for the node, it is assumed that the bitmap corresponding to the reserved subsequent resource is configured to be 0, and although the bitmap has no influence on other nodes selecting the resource, the bitmap is also not sent by the node, which may cause a series of problems such as a large number of time-out packet losses or reselection, and a decrease in performance of a maintenance system due to multiple processes and multiple hops in a sensing window. In another aspect, when the node selects a resource, a candidate resource belonging to the transmission resource pool bitmap configured as 1 in the logical subframe window is selected. If the bitmap setting is not reasonable, it may happen that the selected resources (transmission delay) are related to the time point of arrival of the service, and candidate resources may be concentrated at the front part of the resource selection window at some time and at the rear part at some time; i.e. the delay angle between users or between processes is unfair.

Here, 2 examples are illustrated:

example 1: after reserving bitmap configuration, OM (configuration entity) configures bitmap, bitmap configuration is not 1:

the Bitmap is exemplified by 100, assuming a service period of 20ms, the Bitmap of the resource pool is configured as follows:

tx pool 1 { 100 111 00 00 100 111 00 00 100 00 100 0 0............. };

tx pool 2:{0 1 0 0 0 0 1 0 1 1................}；

tx pool 3:{..............................................}；

rx (receive) pool {1111 … … … … … … 1111};

looking at tx pool 1, the node period is 20ms, and the bitmap corresponding to the resource after the reservation period of 20ms is selected to be configured to be 0 instead of 1.

Example 2: distribution requirements for OM configuration bitmap are as follows:

bitmap＝100；

tx pool 1, {1111 111 1. Cndot. (50 pieces of 1) 00 00 00 0 0. Cndot. (50 pieces of 0) };

tx pool 2 { 00 00 00 00 (50 0) 1111 1111 (50 1) };

bitmap＝16；

tx pool 1:{1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0}；

tx pool 2:{0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1}；

assuming that the sending resource pool is tx pool 1, when the service reaches the trigger selection resource, the corresponding bitmap configuration is just 0 and just starts to be 0, so that there may be no candidate resource in the resource selection window or the delay may be very large.

In addition, if the node is a non-SPS resource occupation, the node is similar to oneshot one-time occupation, that is, although there is no subsequent reserved resource, there are also problems that if the bitmap is set unreasonably, the time delay is large, and the time delay angle between users or between processes is not fair in a statistical sense. See, in particular, example 2 above, and will not be described in detail herein.

Therefore, the problem that resources cannot be used or time delay is large due to unreasonable bitmap configuration of the existing resource pool can be seen.

Disclosure of Invention

The invention aims to provide a resource pool time domain bit map configuration method, a device, a configuration entity and communication equipment, which are used for solving the problems that resources cannot be used or time delay is large due to unreasonable bitmap configuration of a resource pool in the prior art.

In order to solve the above technical problem, an embodiment of the present invention provides a resource pool time domain bitmap configuration method, applied to a configuration entity, including:

according to the polling configuration period and the length of the time domain bitmap of the resource pool, aiming at each bit with the polling configuration value of the resource pool as a first value, obtaining a resource pool bitmap corresponding to each resource pool respectively;

the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools;

the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length;

The bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0, so that the resource prohibition used for representing the resource pool is called.

Optionally, in the case that the respective resource pools are used for SPS reservation:

if the number of the resource pools is not determined, determining the number of the resource pools by the demand proportion of the resource pools, the common divisor and the length; wherein the equivalent number of the resource pools is equal to the first common divisor, and the polling configuration period is equal to the first common divisor; or,

if the number of the resource pools is determined and the equivalent number of the resource pools is equal to a first common divisor in the common divisors, the polling configuration period is equal to the first common divisor; or,

if the number of the resource pools is determined and the equivalent number of the resource pools is not equal to any one of the common divisors, the polling configuration period is equal to a first common divisor of the common divisors, and the first common divisor is a common divisor larger than the equivalent number;

wherein the equivalent number is determined by the number and the ratio of the demands of each resource pool.

Optionally, the first common divisor is a common divisor greater than the equivalent number includes: the first common divisor is selected based on the equivalent number.

Optionally, the first common divisor is a divisor of the length.

Optionally, when the number of the resource pools is determined and the equivalent number of the resource pools is not equal to any of the common divisors, and the bit map length to be configured is smaller than the equivalent number in the bit map length corresponding to each polling configuration period, the bit map length to be configured is configured for the corresponding number of the resource pools;

the length of the remaining bit map to be configured is as follows: after traversing all the resource pools for n times, the bit map length to be configured is remained in the bit map length corresponding to the polling configuration period; n is a positive integer;

the corresponding number is determined by the length of the remaining bit map to be configured and the selected demand proportion of the resource pool.

Optionally, when the length to be configured in the resource pool time domain bitmap is smaller than the polling configuration period in the case that the first common divisor is not a divisor of the length, the length to be configured is configured for a corresponding number of the resource pool polls;

the corresponding quantity is determined by the length to be configured and the selected demand proportion of the resource pool;

The length to be configured is as follows: after the polling configuration period is an integer multiple of the polling configuration period, the length remaining in the length of the resource pool time domain bitmap.

Optionally, in a case where the respective resource pools are not used for semi-persistent scheduling, SPS, reservation, the poll configuration period is equal to an equivalent number of the resource pools;

Optionally, according to the polling configuration period and the length of the resource pool time domain bitmap, the polling configuration for each resource pool has a bit with a value of a first value, including:

according to the polling configuration period, the length of the time domain bitmap of the resource pool and the corresponding equivalent times of each resource pool, the bit with the value of the first value is configured for each resource pool;

and the equivalent times corresponding to the resource pools are determined by the corresponding demand proportions.

Optionally, according to the polling configuration period and the length of the resource pool time domain bitmap, for each bit of the resource pool polling configuration value as the first value, obtaining a resource pool bitmap corresponding to each resource pool, including:

And according to the polling configuration period and the length of the time domain bit map of the resource pool, sequentially and circularly configuring bits with the value of a first value for each resource pool to obtain the bit map of the resource pool corresponding to each resource pool.

The embodiment of the invention also provides a resource pool time domain bit map configuration method which is applied to the communication equipment and comprises the following steps:

acquiring a resource pool bit map corresponding to each resource pool configured by a configuration entity;

the configuration entity obtains a bit with a first value for each resource pool polling configuration value according to a polling configuration period and the length of the resource pool time domain bit map;

And enabling the number of the bits corresponding to each configured resource pool to be closest to the demand proportion of each resource pool.

The first common divisor is the maximum value of the common divisors.

Optionally, the first common divisor is a divisor of the length.

The embodiment of the invention also provides a configuration entity, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor; the processor, when executing the program, performs the steps of:

Optionally, the first common divisor is a divisor of the length.

Optionally, the processor is specifically configured to:

The embodiment of the invention also provides communication equipment, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor; the processor, when executing the program, performs the steps of:

Optionally, the first common divisor is a divisor of the length.

The embodiment of the invention also provides a computer readable storage medium, on which a computer program is stored, which when being executed by a processor, implements the steps of the resource pool time domain bit map configuration method on the entity side or the communication equipment side.

The embodiment of the invention also provides a resource pool time domain bit map configuration device which is applied to a configuration entity and comprises the following components:

the first processing module is used for obtaining a resource pool bit map corresponding to each resource pool respectively according to the polling configuration period and the length of the resource pool time domain bit map and aiming at each bit of which the polling configuration value is a first value;

Optionally, the first common divisor is a divisor of the length.

Optionally, the first processing module includes:

and the first processing submodule is used for sequentially and circularly configuring bits with the value of a first value for each resource pool according to the polling configuration period and the length of the time domain bit map of the resource pool to obtain the bit map of the resource pool corresponding to each resource pool.

The embodiment of the invention also provides a resource pool time domain bit map configuration device which is applied to the communication equipment and comprises:

the first acquisition module is used for acquiring resource pool bit maps corresponding to the resource pools configured by the configuration entity respectively;

Optionally, the first common divisor is a divisor of the length.

The technical scheme of the invention has the following beneficial effects:

in the above scheme, the resource pool time domain bitmap configuration method obtains the resource pool bitmap corresponding to each resource pool respectively by polling bits with the configuration value of the first value for each resource pool according to the polling configuration period and the length of the resource pool time domain bitmap; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the reserved subsequent resources can be ensured to correspond to the logic subframes which are allowed to be called by the resources of the resource pool, so that the reserved subsequent resources are ensured to be usable resources, and the situation that the resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Drawings

Fig. 1 is a flowchart of a method for configuring a resource pool time domain bit map according to an embodiment of the present invention;

fig. 2 is a flowchart of a resource pool time domain bit map configuration method according to a second embodiment of the present invention;

fig. 3 is a schematic diagram of mutually invisible RSU scenarios according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of a configuration entity structure according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of a communication device according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of a resource pool time domain bit map configuration apparatus according to an embodiment of the present invention;

fig. 7 is a schematic diagram of a configuration apparatus for resource pool time domain bit map according to an embodiment of the present invention.

Detailed Description

In order to make the technical problems, technical solutions and advantages to be solved more apparent, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.

The invention provides a resource pool time domain bit map configuration method, which is applied to a configuration entity, as shown in fig. 1, aiming at the problem that the resource cannot be used or the time delay is large due to unreasonable bitmap configuration of a resource pool in the prior art, and comprises the following steps:

step 11: according to the polling configuration period and the length of the time domain bitmap of the resource pool, aiming at each bit with the polling configuration value of the resource pool as a first value, obtaining a resource pool bitmap corresponding to each resource pool respectively; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; the bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0, so that the resource prohibition used for representing the resource pool is called.

Here, the SPS valid reservation period is for an SPS invalid period, which may be 0.

According to the resource pool time domain bitmap configuration method provided by the embodiment of the invention, the resource pool bitmap corresponding to each resource pool is obtained by aiming at each bit with the polling configuration value of each resource pool as a first value according to the polling configuration period and the length of the resource pool time domain bitmap; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the reserved subsequent resources can be ensured to correspond to the logic subframes which are allowed to be called by the resources of the resource pool, so that the reserved subsequent resources are ensured to be usable resources, and the situation that the resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Wherein, in the case where the respective resource pools are used for SPS reservation: if the number of the resource pools is not determined, determining the number of the resource pools by the demand proportion of the resource pools, the common divisor and the length; wherein the equivalent number of the resource pools is equal to the first common divisor, and the polling configuration period is equal to the first common divisor; or if the number of the resource pools is determined and the equivalent number of the resource pools is equal to a first common divisor of the common divisors, the polling configuration period is equal to the first common divisor; or if the number of the resource pools is determined and the equivalent number of the resource pools is not equal to any one of the common divisors, the polling configuration period is equal to a first common divisor of the common divisors, and the first common divisor is a common divisor greater than the equivalent number; wherein the equivalent number is determined by the number and the ratio of the demands of each resource pool.

Examples are given herein with respect to equivalent numbers: assuming that a first resource pool and a second resource pool exist, the demand ratio of the first resource pool to the second resource pool is 1:1, and the equivalent number is 1+1=2; assuming that there are a first resource pool and a second resource pool, the demand ratio of the first resource pool to the second resource pool is 1:2, and the equivalent number is 1+2=3.

Specifically, the first common divisor being a common divisor greater than the equivalent number includes: the first common divisor is selected based on the equivalent number.

Therefore, the number of the bits corresponding to each configured resource pool can be closest to the demand proportion of each resource pool.

In the embodiment of the present invention, the first common divisor may be a maximum value in the common divisors.

Wherein the first common divisor is a divisor of the length.

In the embodiment of the present invention, when the number of the resource pools is determined and the equivalent number of the resource pools is not equal to any one of the common divisors, and the bit map length to be configured is smaller than the equivalent number in the bit map length corresponding to each polling configuration period, the bit map length to be configured is configured for the corresponding number of the resource pool polls; the length of the remaining bit map to be configured is as follows: after traversing all the resource pools for n times, the bit map length to be configured is remained in the bit map length corresponding to the polling configuration period; n is a positive integer; the corresponding number is determined by the length of the remaining bit map to be configured and the selected demand proportion of the resource pool.

Wherein the corresponding number of the resource pools may be adjacent or non-adjacent, and the corresponding number of the resource pools at any position.

In the embodiment of the present invention, when the length to be configured in the resource pool time domain bitmap is smaller than the polling configuration period in the case where the first common divisor is not a divisor of the length, the length to be configured is configured for the corresponding number of resource pool polls; the corresponding quantity is determined by the length to be configured and the selected demand proportion of the resource pool; the length to be configured is as follows: after the polling configuration period is an integer multiple of the polling configuration period, the length remaining in the length of the resource pool time domain bitmap.

In the embodiment of the invention, under the condition that each resource pool is not used for semi-persistent scheduling (SPS) reservation, the polling configuration period is equal to the equivalent number of the resource pools; wherein the equivalent number is determined by the number and the ratio of the demands of each resource pool.

The equivalent numbers here are the same as those mentioned above, and will not be described here again.

Wherein, according to the polling configuration period and the length of the resource pool time domain bitmap, the polling configuration value of each resource pool is a bit of a first value, including: according to the polling configuration period, the length of the time domain bitmap of the resource pool and the corresponding equivalent times of each resource pool, the bit with the value of the first value is configured for each resource pool; and the equivalent times corresponding to the resource pools are determined by the corresponding demand proportions.

In this description, the equivalent number is also understood as the polling number, which refers to the number of times the bits are allocated to the resource pool in one polling allocation period.

In the embodiment of the present invention, according to a polling configuration period and a length of a resource pool time domain bitmap, for each bit of a first value of a polling configuration value of a resource pool, obtaining a resource pool bitmap corresponding to each resource pool, respectively, includes: and according to the polling configuration period and the length of the time domain bit map of the resource pool, sequentially and circularly configuring bits with the value of a first value for each resource pool to obtain the bit map of the resource pool corresponding to each resource pool.

For the above-described "sequential loop configuration" illustrated herein, it is assumed that the resource pool includes resource pool 1, resource pool 2, and resource pool 3; in the case that the polling configuration period is 3 and the length of the resource pool time domain bitmap is 6: the first bit in the bitmap of resource pool 1 is configured as 1, then the second bit in the bitmap of resource pool 2 is configured as 1, then the third bit in the bitmap of resource pool 3 is configured as 1, then the following steps are sequentially performed: the fourth bit in the bit map of the resource pool 1 is configured to be 1, then the fifth bit in the bit map of the resource pool 2 is configured to be 1, and then the sixth bit in the bit map of the resource pool 3 is configured to be 1, and the obtained bit maps of the resource pool 1, the resource pool 2 and the resource pool 3 are respectively as follows:

resource pool 1:100100;

and (2) a resource pool: 010010;

and (3) a resource pool: 001001.

the embodiment of the invention also provides a resource pool time domain bit map configuration method which is applied to the communication equipment, as shown in fig. 2, and comprises the following steps:

step 21: acquiring a resource pool bit map corresponding to each resource pool configured by a configuration entity; the configuration entity obtains a bit with a first value for each resource pool polling configuration value according to a polling configuration period and the length of the resource pool time domain bit map; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; the bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0, so that the resource prohibition used for representing the resource pool is called.

The resource pool time domain bit map configuration method provided by the embodiment of the invention obtains the resource pool bit maps respectively corresponding to each resource pool configured by the configuration entity; the configuration entity obtains a bit with a first value for each resource pool polling configuration value according to a polling configuration period and the length of the resource pool time domain bit map; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the use of the acquired resource Chi Bite map can be guaranteed: the reserved subsequent resources correspond to the logic subframes which are allowed to be called by the resources in the resource pool, so that the reserved subsequent resources are guaranteed to be usable resources, and the situation that resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Wherein the first common divisor is a divisor of the length.

In the embodiment of the present invention, when the length to be configured in the resource pool time domain bitmap is smaller than the polling configuration period in the case where the first common divisor is not a divisor of the length, the length to be configured is configured for the bits for the corresponding number of resource pool polls; the corresponding quantity is determined by the length to be configured and the selected demand proportion of the resource pool; the length to be configured is as follows: after the polling configuration period is an integer multiple of the polling configuration period, the length remaining in the length of the resource pool time domain bitmap.

The method for configuring the resource pool time domain bitmap on the configuration entity side provided by the embodiment of the present invention is further described below, and the resource pool is exemplified by a sending resource pool.

Aiming at the technical problems, the embodiment of the invention provides a resource pool time domain bitmap configuration method, wherein the following two principles are mainly considered about the configuration of a resource Chi Bite bitmap:

bitmap configuration principle 1: for SPS resource reservation, the configuration entity OM needs to ensure that resources corresponding to the logic subframes are still reserved after any reservation period when configuring bitmap;

Bitmap configuration principle 2: the OM needs to guarantee statistically uniform and fair delay as much as possible when configuring bitmap.

Specifically, if the node requirements in each transmission resource pool are consistent, it is necessary to ensure that the logic subframes are uniform in each transmission resource pool, so that the delay requirements can be effectively ensured as much as possible. If the configuration is uneven, since the new service arrival may trigger the resource selection at any time, it may cause the resource selection to be limited (for example, the resource selection window is configured to be small in the number of logical subframes of the sending resource pool), which further causes no resource to be selected in the time delay requirement range or the average time delay of the service is larger:

for the allocation of multiple resource pools in Zong (divided area) geographic areas and multiple resource pools under the mutual hearing requirement of RSU (road side unit), the logic subframes are equally allocated by the resource pools as far as possible, and the bitmap in each resource pool is configured as 1. If the traffic demands are different, such as traffic with different QoS (quality of service) demands for NR (new air interface), if the demands are determined, the averaging process may be performed according to the ratio (i.e. the above-mentioned demand ratio). The following description will take each transmission resource pool halving logic subframe as an example:

OM configures bitmap to take the following factors into account:

when in configuration, firstly, the number of the sending resource pools is considered to be determined: may be determined based on actual deployment conditions.

Further, specific bitmap configuration and: there is a certain constraint relation between tx pool number, bitmap length and SPS reservation period.

Specifically, finding the greatest common divisor that the resource pool can support reserving SPS periods, for example, the reserving period set that the current LTE (long term evolution) system can support is: {20, 50, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000}; namely, the greatest common divisor of all reservation period configurations which can be supported by the current LTE system is 10, and further, all common divisors are {1,2,5, 10}; similar extensions can be made for other minimum reservation periods:

such as the reserved SPS period that the current NR system resource pool can support has not yet been fully determined: { [ 1:99 ], 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000} assume here the choice: {5, 10, 20, 30, 40, 50, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000}, i.e., the greatest common divisor herein is 5.

In the embodiment of the invention, the configuration of the resource Chi Bite graph follows the following principle:

(1) Under the condition that the number of the TX resource pools is the divisor of the greatest common divisor of all SPS reservation periods, the logical subframe resource bisection of each TX resource pool can be ensured; on the contrary, bisection cannot be achieved. The application ensures that: the number of the TX resource pools is a divisor of the greatest common divisor of all SPS reservation periods.

(2) The actual bitmap is a cycle under the configuration of the minimum length of the bitmap (i.e. the polling configuration period described above) (see the following specific relation between the bitmap length and the number of resource pools).

(3) If the distribution of the logic subframe resources of the TX resource pool is uniform, the minimum length of the Bitmap is the number of the resource pools; i.e. bitmap polling configuration at each tx pool with the number of resource pools as a period.

(4) If the logic resource requirements are unevenly distributed, or if the TX resource pool number is not a divisor of the greatest common divisor of all SPS reservation periods, the bitmap minimum length needs to be redetermined (see for details that the bitmap length is not an integer multiple of the resource pool number in example 5 below).

(5) The Bitmap minimum length should not exceed the greatest common divisor of the SPS reservation period.

(6) Considering the difference of the number of the logic resources of each TX pool, the minimum length of the bitmap can be considered to be adjusted, but the minimum length of the bitmap needs to be satisfied and the minimum length of the bitmap should not exceed the greatest common divisor of the SPS reservation period.

(7) If the resource pool does not support SPS, namely, all the resources are business without reservation period, the limitation of reservation period is not needed to be considered when the resource pool is configured; the requirements of logic resource requirements of the resource pools are met only by considering the bitmap length, the number of the resource pools, and the time delay fairness is finally embodied.

In the embodiment of the present invention, OM is used as a configuration entity, and the pre-configuration includes, but is not limited to, the following configuration forms:

writing dead (i.e. configuration complete and unchangeable) in the UE (terminal) device; writing death in USIM (universal subscriber identity card) card; is issued by a V2X control function (internet of vehicles control function) entity over the V3 interface and embodied in SIB (system information block) or RRC (radio resource control) reconfiguration message.

The following illustrates the scheme provided by the embodiment of the invention.

Example 1: the method for determining the number of tx pool in the OM configuration actual scene.

Under the adoption of a azoning mode, the method for determining the number of tx pool comprises the following steps:

the number of resource pools may be determined jointly based on the communication distance and the greatest common divisor of all supported SPS reservation periods.

For example, the communication distance is 300 meters, the interference range can be considered to be 900 meters, and all resource pools of 900 meters need to be considered to be multiplexed once. Assuming that 5 resource pools are selected, regardless of frequency division, the width of the resource pools is 900/5 (meters).

Assuming that the greatest common divisor of all supported SPS reservation periods is 20ms, the number of the recommended resource pool (which is a divisor of the common divisor) is {2,4,5}, the frequency division extension may be considered to be {2,4,5,6,8}, for example, the number is 2, and the frequency division is considered to be 3 times, for example, the number is 6.

Assuming that the greatest common divisor of all supported SPS reservation periods is 10ms, the number of resource pools is suggested to be {2,5} and the frequency division expansion can be considered to be {2,4,5,6}.

Assuming that the greatest common divisor of all supported SPS reservation periods is 100ms, the number of resource pools is suggested to be {2,4,5} and the frequency division extension can be considered to be {2,4,5,6,8}.

The configuration of the SPS reservation period supported is assumed here to include the LTE resource pool configuration and the NR resource pool configuration.

Example 2: the method for determining the number of tx pool in the OM configuration actual scene.

According to the specific scene, the following steps are determined:

for example, on highways or intersections, between RSUs (road side units) 1 and 2 are not visible to each other due to NLOS (non line of sight), while OBUs (on board units) have the need to receive both RSU messages at the same time; however, the RSU1 and RSU2 resources cannot be staggered through Sensing (Sensing), and once the RSU1 and RSU2 resources collide, the receiving of the OBU message is affected; a time division resource pool is needed for the RSU1 and the RSU 2; i.e. it is determined that 2 orthogonal tx pool are allocated to RSU1 and RSU2, respectively. I.e. several RSUs, which are mutually invisible to the NLOS, correspond to several resource pools. With specific reference to fig. 3, RSU1 and RSU2 are not visible (2 km apart), the resources cannot be staggered, and the OBU can see both RSUs at the same time, and the emission signals of both RSUs affect performance when the overlapping areas collide.

Example 3: assuming that the SPS reservation period and bitmap length have already been determined at the time of OM configuration, the method of tx pool number and tx pool bitmap configuration is described.

Reservation period: it is assumed that the resource pool supports all SPS reservation period configurations, illustrated by LTE, including {20, 50, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000}12 SPS periods.

The bitmap length may be: {16, 20, 100}, assumed to be 100 in this example.

In this exemplary scheme, the tx pool number and tx pool bitmap configuration need to be determined.

The example scheme specifically may include:

(1) Determining the greatest common divisor of all supported SPS reservation periods of a resource pool: 10ms;

(2) The number of tx resource pools that can be considered supported should be a divisor of the supported period common divisor: 2 or 5;

(3) If the resource pool is divided equally, the bitmap length is a multiple of the supportable resource pool; i.e., the minimum length of the bitmap is 2, both of which can be supported if the bitmap length is 100 or 20; if the bitmap is 16 in length, 2 resource pools are preferably selected and allocated.

(4) And completely halving the configuration of each resource pool, namely, the bitmap polls the configuration at each tx pool by taking the number of the resource pools as a period.

The method can be concretely understood as follows: the actual Bitmap is a loop in the Bitmap minimum length configuration. If the logic resources are uniformly distributed, the minimum length of Bitmap is the number of resource pools, and the minimum length of Bitmap should not exceed the greatest common divisor of SPS reservation period.

Specifically:

the greatest common divisor of all supported SPS reservation periods is: 10ms, the number of tx resource pools is {2,5} and a configuration mode of orderly arrangement is adopted.

If tx pool number is 2: i.e., the minimum bitmap length is 2, the bitmap length includes, but is not limited to, 16, 20 or 100 (a multiple of any 2), and the bitmap is configured at each tx pool poll with a period of 2.

The configuration for the bitmap may be as follows:

tx pool 1: bitmap { 10 10 10 10 10 10 1 0......... };

tx pool 2: bitmap is {0 10 10 10 10 10 10 1......... }.

If the tx pool number is 5: i.e., a minimum bitmap length of 5, including but not limited to 20 or 100 (a multiple of any 5), the bitmap is configured for polling at each tx pool with a period of 5.

The configuration for the bitmap may be as follows:

tx pool 1: bitmap { 100 00 100 0 0..once. };

tx pool 2: bitmap {0 100 00 100 0..once. };

tx pool 3: bitmap { 00 100 00 10 0..once. };

tx pool 4: bitmap { 00 0 100 00 1 0..once. };

tx pool 5:bitmap is { 00 00 100 00 1.

Example 4: assuming that the reservation period and bitmap length at the time of OM configuration have already been determined, the method of tx pool number and respective tx pool bitmap configuration is related.

Reservation period: it is assumed that the resource pool supports all reservation period configurations only {20, 100}.

The bitmap length may be: {16, 20, 100}, assumed to be 100 in this example.

In this example, the greatest common divisor of all the SPS reservation periods supported by the resource pool may be determined to be 20ms, and the number of the recommended resource pools may be {2,4,5}, which adopts a completely uniform configuration mode.

tx pool 1: bitmap { 10 10 10 10 10 10 1 0......... };

tx pool 2: bitmap is {0 10 10 10 10 10 10 1......... }.

If tx pool number is 4: i.e., a minimum length of 4, including but not limited to 16, 20, or 100 (a multiple of any 4), the bitmap is configured at each tx pool poll with a period of 4.

tx pool 1: bitmap { 1000 1000 1000 100 0..once. };

tx pool 2: bitmap {0 1000 1000 1000 10 0..once. };

tx pool 3: bitmap { 00 1000 1000 1000 1 0..once. };

tx pool 4:bitmap is { 000 1000 1000 1000 1.

tx pool 1: bitmap { 1000 0 1000 0..once. };

tx pool 2: bitmap {0 1000 0 100 0..once. };

tx pool 3: bitmap { 00 1000 0 10 0..once. };

tx pool 4: bitmap { 000 1000 0 1 0..once. };

tx pool 5:bitmap is { 000 0 1000 0 1.

Example 5: assuming that the reservation period at the time of OM configuration, the bitmap length and the tx pool number are determined, the method of configuration is related to each tx pool bitmap.

Reservation period: the SPS period configuration supported by the resource pool is assumed to include: {20, 50, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000}12 SPS periods.

The bitmap length may be: {16, 20, 100}, assumed to be 100 in this example.

The Tx pool number is assumed to be: 4.

Like example 3 (the information according to this example can be directly determined), the greatest common divisor configured for all reservation periods that can be currently supported by the resource pool is 10ms, all common divisors are {1,2,5, 10}, and when the tx pool number is required to be configured to be 4, the tx pool number is configured to be 4 and is not a divisor supporting the greatest common divisor of the periods, i.e. the minimum length of bitmap cannot be set to be 4, and the logical resource bisection of each resource pool cannot be supported. Only the uneven distribution can be considered here, and in order to reduce the difference of each tx pool logical subframe as much as possible, the number of preferential equivalent resource pools is considered here to be 10 instead of the number of equivalent resource pools being 5. 10 also meets the constraint that the Bitmap minimum length should not exceed the greatest common divisor of all reservation period configurations.

From the above, determining the minimum period 10 of bitmap; tx pool 1 and tx pool 2 can be selected to bisect the excess 2 resources.

tx pool 1: bitmap { 10 0 0 10 0 0 10 };

tx pool 2: bitmap {0 10 0 0 10 0 0 1};

tx pool 3: bitmap {0 0 10 0 0 10 0 0};

tx pool 4: bitmap is {0 0 0 10 0 0 10 0}.

Example 6: assuming the number of the resource pools is 3; the greatest common divisor of SPS period is 20ms, namely the common divisor set is {2,4,5, 10, 20}; the length of the Bitmap is 16; that is, the number of resource pools is neither a divisor of the bitmap length nor one of the common divisor sets.

According to the above determination regarding the first common divisor: the first common divisor is one of the common divisors, and is required to be greater than or equal to the number of resource pools and cannot exceed the length of the bit map;

the candidate common divisor for the first common divisor (i.e., polling configuration period) is obtained as follows: {4,5, 10};

if the polling configuration period is 4, the bit map of the resource pool is configured as (since 4 is a common divisor of 16, it is possible to configure according to 4):

Tx pool 1:{1001 1001 1001 1001}；

Tx pool 2:{0100 0100 0100 0100}；

Tx pool 3:{0010 0010 0010 0010}；

if the polling configuration period is 5, the bitmap of the resource pool is configured as (because 5 is not a common divisor of 16, it is required to be configured as 16):

TX pool 1:{10010 10010 10010 1}；

TX pool 2:{01001 01001 01001 0}；

TX pool 3:{00100 00100 00100 0}；

if the polling configuration period is 10, the bit map of the resource pool is configured (because 10 is not a common divisor of 16, it is required to be configured by 16):

TX pool 1:{1001001001 100100}；

TX pool 2:{0100100100 010010}；

TX pool 3:{0010010010 001001}。

example 7: the bitmap length may be: {16, 20, 100}, assumed to be 100 in this example.

The Tx pool number is assumed to be: 4.

The greatest common divisor of all reservation period configurations which can be supported currently by the resource pool is 10ms, and all common divisors are {1,2,5, 10};

The candidate common divisor for the first common divisor (i.e., polling configuration period) is obtained as follows: {5, 10};

if the polling configuration period is 5, the bit map of the resource pool is configured as (since 5 is a common divisor of 100, it is possible to configure according to 5 cycles):

tx pool 1: bitmap is { 100 0 1.. . . . (loop configuration) };

tx pool 2: bitmap is {0 100 0.. . . . (loop configuration) };

tx pool 3: bitmap { 00 10 0.. . . . (loop configuration) };

tx pool 4: bitmap { 00 0 1 0.. . . . (loop configuration) }.

If the polling configuration period is 10, the bit map of the resource pool is configured as (since 10 is a common divisor of 100, it is possible to configure according to 10 cycles):

tx pool 1: bitmap is { 100 0 100 0 1 0.. . . . (loop configuration) };

tx pool 2: bitmap is {0 100 0 100 0 1.. . . . (loop configuration) };

tx pool 3: bitmap { 00 100 0 100 0.. . . . (loop configuration) };

tx pool 4: bitmap { 00 0 100 0 10 0.. . . . (loop configuration) }.

Both configurations may be preferred according to the ratio of the demand of the resource pool (also understood as the equivalent number), and are not limited herein.

Example 8 assumes a number of resource pools of 5; the greatest common divisor of SPS period is 20ms, namely the common divisor set is {2,4,5, 10, 20}; the length of the Bitmap is 16; i.e. the number of resource pools is one of a common divisor set, but not a divisor of bitmap.

TX pool 1:{10000 10000 10000 1}；

TX pool 2:{01000 01000 01000 0}；

TX pool 3:{00100 00100 00100 0}；

TX pool 4:{00010 00010 00010 0}；

TX pool 5:{00001 00001 00001 0}。

TX pool 1:{1000010000 100001}；

TX pool 2:{0100001000 010000}；

TX pool 3:{0010000100 001000}；

TX pool 4:{0001000010 000100}；

TX pool 5:{0000100001 000010}。

example 9: the method for configuring each tx pool bitmap is provided that the bitmap length and the tx pool number are determined at the time of OM configuration without considering SPS resources.

Under the condition that the whole resource pool is not provided with SPS resource allocation, the periods of all nodes are not provided with common divisors, namely SPS period factors are not needed to be considered, and only bitmap setting is needed to be considered so that logic resources are equally divided among tx pool or are equally divided in time as far as possible according to requirements.

Wherein, reservation period: and 1 in the non-SPS mode.

Assume that the bitmap length can be: {16, 20, 100}, assumed to be 100 in this example.

Regarding determining tx pool bitmap configuration:

if the resource pool is divided equally, the bitmap length only needs to be a multiple of the supportable resource pool. And completely halving the configuration of each resource pool, namely, the bitmap polls the configuration at each tx pool by taking the number of the resource pools as a period. The actual Bitmap is a loop in the Bitmap minimum length configuration. If the logic resources are uniformly distributed, the minimum length of the Bitmap is the number of the resource pools.

Specifically:

The configuration for the bitmap may be as follows:

tx pool 1: bitmap { 10 10 10 10 10 10 1 0......... };

tx pool 2: bitmap is {0 10 10 10 10 10 10 1......... }.

The configuration for the bitmap may be as follows:

tx pool 1: bitmap {1 0 0 0 0 1 0 0 0 0..once. };

tx pool 2: bitmap {0 1 0 0 0 0 1 0 0 0..once. };

tx pool 3: bitmap {0 0 1 0 0 0 0 1 0 0..once. };

tx pool 4: bitmap {0 0 0 1 0 0 0 0 1 0..once. };

tx pool 5:bitmap is {0 0 0 0 1 0 0 0 0 1.

In this description, the preset periods referred to in the above examples are all effective periods.

As can be seen from the above, the scheme provided by the embodiment of the invention provides a feasible method for optimizing the configuration parameters of the resource pool, and for the resource pool with the SPS reservation period mode, the reservation of any period in each transmission resource pool is ensured to be still on the allowed transmission resource, so that the processing complexity is reduced and the time delay is relatively more controllable; for resource pools with non-SPS reservations, i.e., oneshot reservation-free periodic patterns, latency is relatively fair to promote between users, between traffic, or between processes.

The embodiment of the invention also provides a configuration entity, as shown in fig. 4, comprising a memory 41, a processor 42 and a computer program 43 stored on the memory 41 and executable on the processor 42; the processor 42, when executing the program, performs the following steps:

In an embodiment of the present invention, the configuration entity may further include a transceiver, which is not limited herein.

The configuration entity provided by the embodiment of the invention obtains a resource pool bit map corresponding to each resource pool respectively by polling bits with configuration values of a first value for each resource pool according to a polling configuration period and the length of the resource pool time domain bit map; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the reserved subsequent resources can be ensured to correspond to the logic subframes which are allowed to be called by the resources of the resource pool, so that the reserved subsequent resources are ensured to be usable resources, and the situation that the resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Wherein the first common divisor is a divisor of the length.

In an embodiment of the present invention, the processor is specifically configured to: and according to the polling configuration period and the length of the time domain bit map of the resource pool, sequentially and circularly configuring bits with the value of a first value for each resource pool to obtain the bit map of the resource pool corresponding to each resource pool.

The implementation embodiments of the resource pool time domain bit map configuration method on the configuration entity side are applicable to the embodiment of the configuration entity, and the same technical effects can be achieved.

The embodiment of the invention also provides a communication device, as shown in fig. 5, comprising a memory 51, a processor 52 and a computer program 53 stored on the memory 51 and executable on the processor 52; the processor 52, when executing the program, performs the following steps:

In an embodiment of the present invention, the communication device may further include a transceiver, which is not limited herein.

The communication equipment provided by the embodiment of the invention obtains the resource pool bit map respectively corresponding to each resource pool configured by the configuration entity; the configuration entity obtains a bit with a first value for each resource pool polling configuration value according to a polling configuration period and the length of the resource pool time domain bit map; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the use of the acquired resource Chi Bite map can be guaranteed: the reserved subsequent resources correspond to the logic subframes which are allowed to be called by the resources in the resource pool, so that the reserved subsequent resources are guaranteed to be usable resources, and the situation that resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Wherein the first common divisor is a divisor of the length.

The implementation embodiments of the resource pool time domain bit map configuration method on the communication equipment side are applicable to the embodiments of the communication equipment, and the same technical effects can be achieved.

The implementation embodiments of the resource pool time domain bit map configuration method on the configuration entity side or the communication equipment side are applicable to the embodiments of the resource pool time domain bit map configuration device, and can achieve the corresponding same technical effects.

The embodiment of the invention also provides a resource pool time domain bit map configuration device which is applied to a configuration entity, as shown in fig. 6, and comprises the following steps:

a first processing module 61, configured to, according to the polling configuration period and the length of the resource pool time domain bitmap, poll bits with a first value configured for each resource pool to obtain a resource pool bitmap corresponding to each resource pool;

The resource pool time domain bitmap configuration device provided by the embodiment of the invention obtains a resource pool bitmap corresponding to each resource pool respectively by aiming at each bit with a first value of the resource pool polling configuration value according to the polling configuration period and the length of the resource pool time domain bitmap; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the reserved subsequent resources can be ensured to correspond to the logic subframes which are allowed to be called by the resources of the resource pool, so that the reserved subsequent resources are ensured to be usable resources, and the situation that the resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Wherein the first common divisor is a divisor of the length.

In an embodiment of the present invention, the first processing module includes: and the first processing submodule is used for sequentially and circularly configuring bits with the value of a first value for each resource pool according to the polling configuration period and the length of the time domain bit map of the resource pool to obtain the bit map of the resource pool corresponding to each resource pool.

The implementation embodiments of the resource pool time domain bit map configuration method on the configuration entity side are applicable to the embodiments of the resource pool time domain bit map configuration device, and the same technical effects can be achieved.

The embodiment of the invention also provides a resource pool time domain bit map configuration device which is applied to the communication equipment, as shown in fig. 7, and comprises:

a first obtaining module 71, configured to obtain a resource pool bit map corresponding to each resource pool configured by the configuration entity;

The resource pool time domain bit map configuration device provided by the embodiment of the invention obtains the resource pool bit maps respectively corresponding to each resource pool configured by the configuration entity; the configuration entity obtains a bit with a first value for each resource pool polling configuration value according to a polling configuration period and the length of the resource pool time domain bit map; the polling configuration period is equal to a first common divisor among common divisors of all semi-persistent scheduling (SPS) effective reservation periods supportable by the resource pool; or the polling configuration period is equal to the number of the resource pools; the first value is 1, and is used for representing that the resource of the resource pool is allowed to be called; the first common divisor is one of the common divisors, and the first common divisor is larger than or equal to the number of the resource pools and smaller than the length; bit positions of the resource Chi Bite graph, where the first value is not configured, are all configured to be default values, and the default values are 0 and are used for representing that the resource prohibition of the resource pool is called; the use of the acquired resource Chi Bite map can be guaranteed: the reserved subsequent resources correspond to the logic subframes which are allowed to be called by the resources in the resource pool, so that the reserved subsequent resources are guaranteed to be usable resources, and the situation that resources cannot be used due to unreasonable bitmap configuration of the resource pool is avoided; the resource pool resource can be ensured to be uniformly distributed in the logic subframe window, so that the resource calling time delay is reduced, the relatively fair delay angle between users or processes is ensured, and the problem of large time delay caused by unreasonable bitmap configuration of the resource pool is avoided.

Wherein the first common divisor is a divisor of the length.

The implementation embodiments of the resource pool time domain bit map configuration method on the communication equipment side are applicable to the embodiments of the resource pool time domain bit map configuration device, and the same technical effects can be achieved.

It should be noted that many of the functional components described in this specification are referred to as modules/sub-modules in order to more particularly emphasize their implementation independence.

In embodiments of the invention, the modules/sub-modules may be implemented in software for execution by various types of processors. An identified module of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions which may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different bits which, when joined logically together, comprise the module and achieve the stated purpose for the module.

Indeed, a module of executable code may be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Likewise, operational data may be identified within modules and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices.

Where a module may be implemented in software, taking into account the level of existing hardware technology, a module may be implemented in software, and one skilled in the art may, without regard to cost, build corresponding hardware circuitry, including conventional Very Large Scale Integration (VLSI) circuits or gate arrays, and existing semiconductors such as logic chips, transistors, or other discrete components, to achieve the corresponding functions. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.

While the foregoing is directed to the preferred embodiments of the present invention, it will be appreciated by those skilled in the art that various modifications and changes can be made without departing from the principles of the present invention, and such modifications and changes should also be considered as being within the scope of the present invention.

Claims

1. A resource pool time domain bitmap configuration method, applied to a configuration entity, comprising:

2. The resource pool time domain bitmap configuration method according to claim 1, wherein in the case where the respective resource pools are used for SPS reservation:

3. The resource pool time domain bitmap configuration method of claim 2, wherein the first common divisor being a common divisor greater than the equivalent number comprises: the first common divisor is selected based on the equivalent number.

4. The resource pool time domain bitmap configuration method of claim 2, wherein the first common divisor is a divisor of the length.

5. The resource pool time domain bitmap configuration method according to any one of claims 2 to 4, wherein in a case where the number of the resource pools has been determined and the equivalent number of the resource pools is not equal to any one of the common divisors, when a remaining bitmap length to be configured in a bitmap length corresponding to each polling configuration period is smaller than the equivalent number, the remaining bitmap length to be configured is configured for a corresponding number of the resource pool polls;

6. The resource pool time domain bitmap configuration method according to claim 1, wherein in a case where the first common divisor is not a divisor of the length, when a length to be configured remaining in the resource pool time domain bitmap is smaller than the polling configuration period, the length to be configured remaining is to configure the bits for a corresponding number of the resource pool polls;

7. The resource pool time domain bitmap configuration method according to claim 1, wherein the poll configuration period is equal to an equivalent number of the resource pools in the case where the respective resource pool is not used for semi-persistent scheduling, SPS, reservation;

8. The method for configuring a resource pool time domain bitmap according to claim 1, wherein the configuring bits with a first value for each resource pool poll according to the poll configuration period and the length of the resource pool time domain bitmap comprises:

9. The method for configuring a resource pool time domain bitmap according to claim 1, wherein the obtaining the resource pool bitmap corresponding to each resource pool according to the polling configuration period and the length of the resource pool time domain bitmap and for each bit having the polling configuration value of the first value includes:

10. A resource pool time domain bitmap configuration method, applied to a communication device, comprising:

11. The resource pool time domain bitmap configuration method according to claim 10, wherein in the case where the respective resource pools are used for SPS reservation:

12. The resource pool time domain bitmap configuration method of claim 11, wherein the first common divisor being a common divisor greater than the equivalent number comprises: the first common divisor is selected based on the equivalent number.

13. The resource pool time domain bitmap configuration method of claim 11, wherein the first common divisor is a divisor of the length.

14. The resource pool time domain bitmap configuration method according to any one of claims 11 to 13, wherein in a case where the number of the resource pools has been determined and the equivalent number of the resource pools is not equal to any one of the common divisors, when a remaining bitmap length to be configured in a bitmap length corresponding to each polling configuration period is smaller than the equivalent number, the remaining bitmap length to be configured is configured for a corresponding number of the resource pool polls;

15. The resource pool time domain bitmap configuration method according to claim 10, wherein in the case where the first common divisor is not a divisor of the length, when a length to be configured remaining in the resource pool time domain bitmap is smaller than the polling configuration period, the length to be configured remaining configures the bits for a corresponding number of the resource pool polls;

16. The resource pool time domain bitmap configuration method according to claim 10, wherein said polling configuration period is equal to an equivalent number of said resource pools in the case where said respective resource pool is not used for semi-persistent scheduling, SPS, reservation;

17. The method for configuring a resource pool time domain bitmap according to claim 10, wherein the configuring bits with a first value for each resource pool poll according to the poll configuration period and the length of the resource pool time domain bitmap comprises:

18. A configuration entity comprising a memory, a processor, and a computer program stored on the memory and executable on the processor; wherein the processor, when executing the program, performs the steps of:

19. The configuration entity according to claim 18, wherein in case the respective resource pools are used for SPS reservation:

20. The configuration entity according to claim 19, wherein said first common divisor being a common divisor greater than said equivalent number comprises: the first common divisor is selected based on the equivalent number.

21. The configuration entity according to claim 19, wherein said first common divisor is a divisor of said length.

22. The configuration entity according to any of the claims 19 to 21, characterized in that in case the number of resource pools has been determined and the equivalent number of resource pools is not equal to any of the common divisors, when the remaining bit pattern length to be configured in the bit pattern length corresponding to each polling configuration period is smaller than the equivalent number, the bit pattern length to be configured is configured for a corresponding number of the resource pool polls;

23. The configuration entity according to claim 18, wherein in case the first common divisor is not a divisor of the length, when a length to be configured remaining in the resource pool time domain bitmap is smaller than the poll configuration period, the length to be configured remaining is to configure the bits for a corresponding number of the resource pool polls;

24. The configuration entity according to claim 18, wherein the poll configuration period is equal to an equivalent number of the resource pools, if the respective resource pools are not used for semi-persistent scheduling, SPS, reservation;

25. The configuration entity according to claim 18, wherein said polling configuration bits having a value of a first value for each resource pool according to a polling configuration period and a length of the resource pool time domain bit map, comprises:

26. The configuration entity according to claim 18, wherein the processor is specifically configured to:

27. A communication device comprising a memory, a processor and a computer program stored on the memory and executable on the processor; wherein the processor, when executing the program, performs the steps of:

28. The communication device of claim 27, wherein, if the respective resource pools are for SPS reservations:

29. The communication device of claim 28, wherein the first common divisor is a common divisor greater than the equivalent number comprises: the first common divisor is selected based on the equivalent number.

30. The communication device of claim 28, wherein the first common divisor is a divisor of the length.

31. The communication apparatus according to any one of claims 28 to 30, wherein in a case where the number of the resource pools has been determined and the equivalent number of the resource pools is not equal to any one of the common divisors, when a remaining bitmap length to be configured in a bitmap length corresponding to each polling configuration period is smaller than the equivalent number, the remaining bitmap length to be configured is configured for a corresponding number of the resource pool polls;

32. The communication device of claim 27, wherein when a length to be configured remaining in the resource pool time domain bitmap is less than the poll configuration period in the case where the first common divisor is not a divisor of the length, the length to be configured remaining is to configure the bits for a corresponding number of the resource pool polls;

33. The communication device of claim 27, wherein the poll configuration period is equal to an equivalent number of the resource pools if the respective resource pools are not used for semi-persistent scheduling, SPS, reservation;

34. The communication device of claim 27, wherein the polling configuration value is a first value of bits for each resource pool according to a polling configuration period and a length of the resource pool time domain bitmap, comprising:

35. A computer readable storage medium having stored thereon a computer program, which when executed by a processor performs the steps of the resource pool time domain bitmap configuration method of any of claims 1 to 17.

36. A resource pool time domain bitmap configuration apparatus, applied to a configuration entity, comprising:

37. A resource pool time domain bitmap configuration apparatus, applied to a communication device, comprising: