Resource determination method, and communication node and storage medium

Abstract

Disclosed in the present application are a resource determination method, and a communication node and a storage medium. The method comprises: determining a bitmap, wherein the bitmap is mapped to a resource pool or the bitmap is mapped to each resource block (RB) set in the resource pool; and according to the bitmap, determining, from each RB set in the resource pool, a resource that is available for physical sidelink channel transmission.

Description

Resource determination method, communication node and storage medium Technical Field

[0001] The present application relates to the field of communication technology, for example, to a resource determination method, a communication node, and a storage medium. Background Art

[0002] For sidelink (SL) communications on unlicensed bands, a resource pool typically contains one or more time slots in the time domain, which can be continuous or discrete. A resource pool can contain one or more resource block sets (RB sets) in the frequency domain. When a resource pool contains multiple RB sets, a guard band (GB) is typically provided between adjacent RB sets to prevent mutual interference between transmissions on different RB sets. Furthermore, the physical resource blocks (PRBs) in the guard band are typically not used for physical sidelink feedback channel (PSFCH) transmissions. Currently, the PSFCH frequency domain resource configuration for SL in Release 16 (R16) and Release 17 (R17) on licensed bands does not consider the presence of guard bands in the resource pool. Therefore, for SL communications on unlicensed bands, it is necessary to address the impact of guard bands in the resource pool on the PSFCH frequency domain resource configuration.

[0003] Summary of the Invention

[0004] This embodiment of the present application provides a method for determining resources, including:

[0005] Determine the bitmap bitmap, the bitmap is mapped to the resource pool or the bitmap is mapped to each resource block set RB set in the resource pool;

[0006] According to the bitmap, the resources available for physical side link channel transmission in each RB set in the resource pool are determined.

[0007] An embodiment of the present application provides a communication node, comprising: a processor; the processor is configured to implement the method of any of the above embodiments when executing a computer program.

[0008] An embodiment of the present application further provides a computer-readable storage medium storing a computer program, which implements the method of any of the above embodiments when the computer program is executed by a processor.

[0009] With respect to the above embodiments and other aspects of the present application and their implementation, further description is provided in the accompanying drawings, detailed description and claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] FIG1 is a schematic diagram of a network of an SL communication system provided by an embodiment;

[0011] FIG2 is a schematic diagram of a frequency domain structure of a resource pool provided by an embodiment;

[0012] FIG3 is a schematic flow chart of a method for determining resources provided by an embodiment;

[0013] FIG4 is a flow chart of another method for determining resources provided by an embodiment;

[0014] FIG5 is a schematic diagram of mapping a bitmap to an RB set in Example 1 when S=1, provided by an embodiment;

[0015] FIG6 is a schematic diagram of mapping a bitmap to an RB set in Example 1 when S=4, provided by an embodiment;

[0016] FIG7 is a schematic diagram of mapping a bitmap to an RB set in Example 2 when S=1, provided by an embodiment;

[0017] FIG8 is a schematic diagram of mapping a bitmap to an RB set in Example 2 when S=4, provided by an embodiment;

[0018] FIG9 is a schematic diagram of mapping a bitmap to an RB set in Example 3 when S=1, provided by an embodiment;

[0019] FIG10 is a schematic diagram of mapping a bitmap to an RB set in Example 3 when S=4, provided by an embodiment;

[0020] FIG11 is a schematic diagram of mapping a bitmap to an RB set in Example 4 when S=1, provided by an embodiment;

[0021] FIG12 is a schematic diagram of mapping a bitmap to an RB set in Example 4 when S=4, provided by an embodiment;

[0022] FIG13 is a schematic diagram of mapping a bitmap to an RB set in Example 5 when S=1, provided by an embodiment;

[0023] FIG14 is a schematic diagram of mapping a bitmap to an RB set in Example 5 when S=4, provided by an embodiment;

[0024] FIG15 is a schematic diagram of a combination of Example 1 and Example 3 for performing bitmap mapping to an RB set when S=1, provided by an embodiment;

[0025] FIG16 is a flow chart of another method for determining resources provided by an embodiment;

[0026] FIG17 is a schematic diagram of mapping a bitmap to a resource pool in Example 6 provided by an embodiment;

[0027] FIG18 is a schematic diagram of a bitmap mapping to an RB set when each PSFCH transmission occupies a shared interlace within an RB set and an exclusive PRB group for the PSFCH, provided by an embodiment;

[0028] FIG19 is a schematic diagram of a bitmap mapped to an RB set when each PSFCH transmission occupies one interlace (ie, PRB group) within an RB set, provided by an embodiment;

[0029] FIG20 is a schematic structural diagram of a resource determination device provided by an embodiment;

[0030] FIG21 is a schematic structural diagram of a UE provided by an embodiment. DETAILED DESCRIPTION

[0031] It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0032] Figure 1 is a networking diagram of an SL communication system provided by an embodiment. As shown in Figure 1, in the SL communication system, when there is a service that needs to be transmitted between terminal devices, the service data between the terminal devices can be directly transmitted from the source terminal device to the target terminal device through SL without being forwarded on the network side, that is, without being forwarded through the cellular link between the terminal device and the access network device. This technology can reduce the burden on the cellular network, reduce the battery power consumption of the user device, and improve the robustness of the network infrastructure, and well meet the requirements of high data rate services and adjacent services. It also supports direct communication in scenarios without network coverage, and can meet special communication needs such as public safety. In SL communication, terminal devices generally obtain resources from a configured or pre-configured SL resource pool (resource pool) (also referred to as a resource pool) for communication. Figure 2 is a frequency domain structure diagram of a resource pool provided by an embodiment. As shown in Figure 2, the resource pool includes 4 RB sets, and there is a protection band between every two adjacent RB sets.

[0033] SL communication supports unicast, multicast and broadcast. For unicast and multicast, the current 3rd Generation Partnership Project (3GPP) protocol supports enabling Hybrid Automatic Repeat Quest (HARQ) feedback, where ACK / NACK feedback is supported for unicast, and NACK / NACK feedback is supported for multicast. In SL communication, HARQ feedback information (such as ACK, NACK) is usually transmitted using PSFCH. SL communication supports one terminal device to send a conflict information indication to another terminal device to help the other terminal device select resources. For example, when User Equipment (UE) A finds that there is a potential resource conflict with the resources reserved by UE B, UE A sends conflict information to UE B via PSFCH, where the potential resource conflict includes: the resources reserved by UE B overlap with the resources reserved by other UEs, or UE A is the target receiving UE of the transmission block sent on the reserved resources of UE B, but due to half-duplex limitations, UE A cannot receive on the resource, etc. Conflict information in SL communication can also be transmitted through PSFCH. In the SL of R16 and R17, in the frequency domain, a resource pool contains one or more subchannels, and each subchannel contains one or more PRBs; in the time domain, a resource pool contains one or more time slots. In a resource pool, in the time domain, PSFCH resources are periodic, and there is a time slot containing PSFCH resources in each period. The time slot containing PSFCH resources is also called PSFCH time slot; in the frequency domain, the system configures or preconfigures a set of PRBs for PSFCH transmission, and each subchannel in each time slot in the resource pool corresponds to one or more PSFCH PRBs. The terminal device determines the PSFCH resource corresponding to the PSSCH in the corresponding PSFCH time slot based on the time-frequency position of the physical sidelink shared channel (PSSCH) transmission and the mapping relationship between each subchannel in each time slot in the resource pool and the PSFCH PRB.

[0034] Sidelink Unlicensed (SL-U) communication in unlicensed bands supports both contiguous resource block-based data transmission (similar to SL in Release 16 and Release 17) and interleaved data transmission (similar to the interleaved data transmission in New Radio (NR) unlicensed bands). M interlaces can be defined on a carrier, with the value of M typically determined by the subcarrier spacing. The resource blocks within each interlace are evenly spaced, and the different interlaces are arranged in a comb-like pattern in the frequency domain, numbered from 0 to M-1. Typically, for data transmission based on continuous resource blocks, each PSFCH resource usually occupies one PRB in the frequency domain; for data transmission based on interleaving, each PSFCH resource usually occupies one or more dedicated PRBs in the frequency domain. The dedicated PRBs belong to the same interleave. When a terminal device sends a PSFCH, it will send it on both the shared PRB and the PSFCH-dedicated PRB resources. When communicating in an unlicensed band, sending the PSFCH on a shared PRB is mainly to meet the occupancy channel bandwidth (OCB) requirements for data transmission in an unlicensed band. A shared PRB is usually a predefined, preconfigured, or configured interleave, or one or more PRBs at both ends of an interleave. For data transmission based on interleaving, each PSFCH can also occupy an interleave within an RB set. In this case, using a PRB on an interleave to send the PFSCH already meets the OCB requirements. In this case, there is no need to configure a shared PRB.

[0035] Currently, the PSFCH frequency domain resource configuration for SL in R16 and R17 on the licensed band does not take into account the situation where the resource pool contains a guard band. Therefore, for SL communications on unlicensed bands, it is necessary to solve the problem of the impact of the guard band in the resource pool on the PSFCH frequency domain resource configuration. In addition, for SL communication systems in unlicensed bands, if data transmission based on continuous resource blocks is supported, a resource pool in the frequency domain contains one or more subchannels, and each subchannel is mapped sequentially according to the size of the subchannel starting from the first PRB in the resource pool. Therefore, when the resource pool contains multiple RB sets, each subchannel may contain PRBs in the guard band, or it may be completely located within the RB set. If interleaving-based data transmission is supported, one or more interleavings within the RB set are a subchannel. Therefore, when configuring PSFCH frequency domain resources, how to ensure that each subchannel is mapped to an equal number of PSFCH resources also needs to be considered.

[0036] The resource determination method provided in this application can be applied to various wireless communication systems, such as long-term evolution (LTE) systems, fourth-generation mobile communication technology (4G) systems, fifth-generation mobile communication technology (5G) systems, LTE and 5G hybrid architecture systems, 5G NR systems, and new communication systems emerging in future communication developments, such as sixth-generation mobile communication technology (6G) systems. It is particularly suitable for SL communication systems that are networked based on the above systems, such as the SL communication system shown in Figure 1.

[0037] A terminal device can be a device with wireless transceiver capabilities, which can be deployed on land (such as indoors or outdoors, handheld, wearable or vehicle-mounted, etc.); it can also be deployed on the water (such as ships, etc.); it can also be deployed in the air (such as airplanes, balloons and satellites, etc.). Examples of some terminal devices include: UE, mobile phone, mobile station, tablet computer, notebook computer, ultra-mobile personal computer (UMPC), handheld computer, netbook, personal digital assistant (PDA) and other user equipment that can be connected to the Internet, or virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc., or Internet of Things node in the Internet of Things, or vehicle-mounted communication device in the Internet of Vehicles, or entertainment, gaming equipment or system, or global positioning system equipment, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal device. In addition, the terminal device can be referred to as the terminal.

[0038] The access network device is an access device that the terminal device uses to access the wireless communication system wirelessly. It can be a base station, an evolved NodeB (eNB or eNodeB) in Long Term Evolution Advanced (LTEA), a transmission reception point (TRP), a base station in a 5G mobile communication system or the next generation Node B (gNB), a base station in a future mobile communication system, or an access node in a Wireless Fidelity (WiFi) system. The base station may include various macro base stations, micro base stations, home base stations, wireless remote stations, routers, WIFI devices, or various network-side devices such as primary cells and secondary cells, and location management function (LMF) devices. It can also be a module or unit that completes part of the functions of the base station, for example, it can be a centralized unit (CU) or a distributed unit (DU). The embodiments of the present application do not limit the specific technology and specific device form adopted by the access network device. In addition, the access network device can be referred to as a base station.

[0039] The core network equipment may include an access and mobility management network element and a session management network element. For example, a terminal device may access the core network through the access network equipment to achieve data transmission.

[0040] In an embodiment of the present application, a method for determining resources, a communication node, and a storage medium that can be operated in the above-mentioned wireless communication system are provided, which can avoid the impact of the guard band in the resource pool on the PSFCH frequency domain resource configuration, and at the same time ensure that when configuring the PSFCH frequency domain resources, each sub-channel in the resource pool corresponds to an equal number of PSFCH resources.

[0041] The PSFCH transmission mentioned in the following embodiments of this application includes PSFCH transmission and PSFCH reception. In addition, in this application, configuration refers to configuration through high-layer signaling. For example, in a SL communication system, for each resource pool, the gNB configures a bitmap for the UE through high-layer signaling. Pre-configuration refers to pre-configuration through the network or the user equipment's own high-layer. For example, in a SL communication system, for each resource pool, the system pre-configures a bitmap and distributes it to the entire network through network-side equipment, or pre-configuration is performed on the network side and in the terminal device based on operator requirements.

[0042] The following describes the resource determination method, communication nodes, and their technical effects.

[0043] Figure 3 is a schematic flow diagram of a method for determining resources provided by one embodiment. As shown in Figure 3, the method provided in this embodiment is applicable to a communication node (also referred to as a communication node device or node). Taking the communication node as a UE as an example, the UE can be a receiving UE (also known as a target UE) or a transmitting UE (also known as a source UE). The method includes the following steps.

[0044] S110 : Determine a bitmap, and map the bitmap to a resource pool or map the bitmap to each RB set in the resource pool.

[0045] In one embodiment, the bitmap may be configured or pre-configured.

[0046] S120 : Determine, according to the bitmap, resources available for physical side link channel transmission in each RB set in the resource pool.

[0047] In one embodiment, the physical side link channel may be a PSFCH or other channels; the resource may be a PRB.

[0048] In one embodiment, resources are used to transmit control information. For a resource pool, resources for transmitting different control information are determined according to different bitmaps. Exemplarily, the control information includes HARQ feedback information and collision information, and bitmaps can be configured separately for the HARQ feedback information and the collision information. For example, two (or groups) of bitmaps are configured, one (or group) of bitmaps determines the PRBs of the PSFCH that can be used to transmit HARQ feedback information in each RB set in the resource pool, and the other (or group) of bitmaps determines the PRBs of the PSFCH that can be used to transmit collision information in each RB set in the resource pool. The UE expects that the two (or groups) of bitmaps indicate different PRBs. Each group of bitmaps consists of one or more partial bitmaps (or sub-bitmaps).

[0049] In one embodiment, the number of resources satisfies at least one of the following conditions:

[0050] The number of resources determined by all RB sets is equal;

[0051] The number of resources determined by each RB set ensures that the number of PSFCH resources corresponding to each subchannel on each time slot in the resource pool is the same;

[0052] The number of resources determined by each RB set is equal to an integer multiple of the product of the number of subchannels corresponding to the RB set and P, where P is the PSFCH period;

[0053] The number of resources determined by each RB set is equal to N times the product of the number of subchannels corresponding to the RB set and P, where P is the PSFCH period and N is a positive integer that is the same for all RB sets in the resource pool.

[0054] The subchannel corresponding to the RB set includes at least one of the following: a subchannel that is completely located in the RB set, a subchannel whose starting PRB is located in the RB set, a subchannel whose ending PRB is located in the RB set, a subchannel whose number of PRBs included in the RB set is greater than or equal to a first threshold, and a subchannel whose starting PRB is included in the RB set and the number of consecutive PRBs included in the RB set starting from the starting PRB is greater than or equal to a second threshold.

[0055] The first threshold and the second threshold may be configured or preconfigured or predefined. In one embodiment, for the second threshold, the second threshold may be greater than or equal to the number of PRBs of a Physical Sidelink Control Channel (PSCCH).

[0056] As can be seen from step S110 above, bitmap mapping can be categorized into two specific scenarios: one in which the bitmap is mapped to the resource pool; the other in which the bitmap is mapped to each RB set within the resource pool. In either scenario, in step S120, the UE can determine, based on the bitmap, the resources available for physical side link channel transmission within each RB set within the resource pool. For ease of understanding, the following embodiments describe these two scenarios in detail.

[0057] In one possible implementation, the bitmap is mapped to each RB set in the resource pool. Figure 4 is a flow chart of another resource determination method provided by an embodiment. As shown in Figure 4, the method includes the following steps.

[0058] S210: Determine a bitmap, and map the bitmap to each RB set in the resource pool.

[0059] In one embodiment, a bitmap is used to indicate the PRBs available for PSFCH transmission within each RB set. For each RB set, each bit in the bitmap indicates whether the corresponding PRB within the RB set is available for PSFCH transmission, and the bitmap is mapped starting from the Sth PRB in the RB set, where S is a positive integer.

[0060] In one embodiment, the length of the bitmap is a configured, preconfigured, or predefined positive integer. For example, the length of the bitmap is predefined as the number of PRBs contained in the RB set with the smallest bandwidth in the resource pool, or the number of PRBs contained in a subchannel in the resource pool.

[0061] In one embodiment, the values ​​of S corresponding to all RB sets in the resource pool are configured or pre-configured or pre-defined using the same parameters; or the values ​​of S corresponding to each RB set in the resource pool are configured or pre-configured using different parameters.

[0062] In one embodiment, the value of S can be a configured, preconfigured, or predefined positive integer; or, the value of S is equal to the offset offset plus one, where offset is the offset of the starting mapping position of the configured, preconfigured, or predefined bitmap relative to the first PRB of the RB set.

[0063] In one embodiment, the offset values ​​corresponding to all RB sets in the resource pool are configured or pre-configured or pre-defined using the same parameters; or the offset values ​​corresponding to each RB set in the resource pool are configured or pre-configured using different parameters.

[0064] In one embodiment, each RB set mapped to the resource pool by the bitmap satisfies at least one of the following characteristics:

[0065] The bitmap is mapped once on one RB set;

[0066] The bitmap is mapped cyclically on an RB set.

[0067] In one embodiment, mapping a bitmap on an RB set once includes at least one of the following:

[0068] The length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1. Bits in the bitmap that are mapped outside the RB set are invalid, or bits in the bitmap that are mapped outside the RB set are not allowed to be set to 1;

[0069] The length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1. The bitmap is truncated based on the difference between the number of PRBs contained in the RB set and S-1, and the truncated bitmap is mapped to the RB set;

[0070] The length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. After the bitmap is mapped once on the RB set, the remaining PRBs of the RB set are not mapped.

[0071] In one embodiment, cyclic mapping of a bitmap on an RB set includes at least one of the following:

[0072] The length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. The bitmap is cyclically mapped on the RB set until the last PRB in the RB set.

[0073] The length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. The bitmap is cyclically mapped on the RB set according to a configured or preconfigured or predefined number of cycles.

[0074] Below, some examples of bitmap mapping to RB sets in the resource pool are given, based on the relationship between the length of the bitmap and the difference between the number of PRBs contained in the RB set and S-1. In the following examples, for each RB set, only the PRBs corresponding to the bits with a value of 1 in the bitmap can be used for PSFCH transmission. That is, the PRBs corresponding to the bits with a value of 0 in the bitmap cannot be used for PSFCH transmission, the PRBs corresponding to invalid bits in the bitmap cannot be used for PSFCH transmission, and the PRBs in the RB set that are not mapped by the bitmap cannot be used for PSFCH transmission. The PRBs in the RB set that are not mapped by the bitmap include: the first S-1 PRBs in the RB set and the last PRB in the RB set that is not mapped by the bitmap.

[0075] Example 1: If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1 (that is, the bitmap exceeds the range of the RB set when mapped to the RB set), then the bits in the bitmap mapped outside the RB set are invalid, or the bits in the bitmap mapped outside the RB set are not allowed to be set to 1.

[0076] FIG5 is a schematic diagram of the bitmap mapping to an RB set in Example 1 when S=1, provided by an embodiment. As shown in FIG5 , the bitmap length is 52 (the length of the bitmap is the number of bits contained in the bitmap), RB set k in the resource pool contains 50 PRBs, and the bitmap is mapped starting from the first PRB in RB set k, with each bit corresponding to a PRB. Because the bitmap length 52 is greater than the difference between the number of PRBs contained in RB set k (50) and 0 (50), the last two bits of the bitmap are mapped outside RB set k. In this case, the UE considers the bits in the bitmap mapped outside RB set k to be invalid, or the UE does not expect the bits in the bitmap mapped outside RB set k to be set to 1, or the protocol stipulates that the bits in the bitmap mapped outside RB set k are not allowed to be set to 1. Therefore, the UE only needs to determine whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped within RB set k. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0077] Figure 6 is a schematic diagram of the bitmap mapping to RB sets in Example 1 when S = 4, provided by an embodiment. As shown in Figure 6, S = 4 indicates that the offset of the starting mapping position of the bitmap relative to the first PRB of RB set k is 3. The bitmap length is 52, and RB set k in the resource pool contains 50 PRBs. The bitmap is mapped starting from the 4th PRB of RB set k, with each bit corresponding to a PRB. Because the bitmap length 52 is greater than the difference (47) between the number of PRBs contained in RB set k (50) and 3, the last 5 bits of the bitmap are mapped outside RB set k. In this case, the UE considers the bits in the bitmap mapped outside RB set k to be invalid, or the UE does not expect the bits in the bitmap mapped outside RB set k to be set to 1, or the protocol stipulates that the bits in the bitmap mapped outside RB set k are not allowed to be set to 1. Therefore, the UE only needs to determine whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped within RB set k. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0078] In the present application, when the resource pool contains multiple RB sets, there is a guard band between adjacent RB sets, that is, except for the last RB set, the remaining RB sets usually have a guard band on the right side. Bitmap mapping outside the RB set includes but is not limited to: bitmap mapping to the guard band on the right side of the RB set, bitmap mapping outside the resource pool (for example, the last RB set corresponding to the resource pool), bitmap mapping to the guard band on the right side of the RB set and the next RB set. In either case, the UE may consider that when the bitmap is mapped to the RB set, the bits outside the RB set range are invalid, or the UE does not expect the bits outside the RB set range to be set to 1, or the protocol stipulates that the bits outside the RB set range are not allowed to be set to 1. For each RB set, the UE only needs to determine whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit mapped to the RB set in the bitmap.

[0079] Example 2: If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is truncated according to the difference between the number of PRBs contained in the RB set and S-1, and the truncated bitmap is mapped to the RB set.

[0080] Figure 7 is a schematic diagram of mapping the bitmap to the RB set in Example 2 when S=1, provided by an embodiment. As shown in Figure 7, the bitmap length is 52, and the RB set k in the resource pool contains 50 PRBs. Since the length of the bitmap, 52, is greater than the difference between the number of PRBs contained in RB set k, 50 and 0, the last two bits of the bitmap are truncated, the length of the truncated bitmap is 50, and the truncated bitmap is mapped starting from the first PRB of RB set k, with each bit corresponding to one PRB, until the end of RB set k. For RB set k, the UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the truncated bitmap. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0081] Figure 8 is a schematic diagram of mapping the bitmap to the RB set in Example 2 when S=4, provided by an embodiment. As shown in Figure 8, S=4 indicates that the offset of the starting mapping position of the bitmap relative to the first PRB of RB set k is equal to 3. The bitmap length is 52, and RB set k in the resource pool contains 50 PRBs. The length of the bitmap is greater than the difference between the number of PRBs contained in RB set k and 3, so the last 5 bits of the bitmap are truncated, and the truncated bitmap length is 47. The truncated bitmap is mapped starting from the 4th PRB of RB set k, with each bit corresponding to one PRB until the end of RB set k. For RB set k, the UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the truncated bitmap. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0082] Example 3: If the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is mapped once on the RB set, and the remaining PRBs in the RB set are not mapped.

[0083] Figure 9 is a schematic diagram of a bitmap mapped to an RB set in Example 3 when S=1, provided by an embodiment. As shown in Figure 9, the bitmap length is 45, and the RB set k in the resource pool contains 50 PRBs. The length of the bitmap is less than the difference between 50 and 0, which is 50, of the number of PRBs contained in the RB set k. Therefore, the last 5 PRBs of the RB set k are not mapped by the bitmap and cannot be used for PSFCH transmission. For the first 45 PRBs of the RB set k, the UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to the RB set k. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0084] Figure 10 is a schematic diagram of a bitmap mapped to an RB set in Example 3 when S=4, provided by an embodiment. As shown in Figure 10, the bitmap length is 45, and the RB set k in the resource pool contains 50 PRBs. The length of the bitmap is less than the difference of 50 and 3, which is 47, of the number of PRBs contained in the RB set k. Therefore, the last two PRBs of the RB set k are not mapped by the bitmap and cannot be used for PSFCH transmission. For the 4th to 48th PRBs of the RB set k, the UE determines whether the corresponding PRBs can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to the RB set k. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0085] Example 4: If the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is cyclically mapped on the RB set until the last PRB in the RB set.

[0086] In Example 4, when the last mapping of the bitmap on the RB set exceeds the range of the RB set (that is, the last mapping of the bitmap on the RB set is mapped outside the RB set), the UE can adopt the methods in Examples 1 to 3 above, for example: the bits in the bitmap that exceed the RB set range are invalid, or the bits in the bitmap that exceed the RB set range are not allowed to be set to 1, or the bitmap mapping is truncated according to the number of PRBs remaining in the RB set after the previous bitmap mapping, or the last bitmap mapping is canceled.

[0087] The following takes the cancellation of the last bitmap mapping when the last bitmap mapping on the RB set exceeds the range of the RB set as an example for explanation.

[0088] Figure 11 is a schematic diagram of the bitmap mapping to RB sets in Example 4 when S = 1, provided by an embodiment. As shown in Figure 11, the bitmap length is 4, RB set k in the resource pool contains 50 PRBs, and the bitmap length is less than the difference (50) between the number of PRBs in RB set k and 0. The bitmap is cyclically mapped to RB set k. After 12 cyclic mappings, 2 PRBs remain unmapped in RB set k. This means that one more mapping would exceed the range of RB set k, so the last mapping can be canceled. For the first 48 PRBs in RB set k, the UE determines whether the corresponding PRBs can be used for PSFCH transmission based on the values ​​of the bits in the bitmap mapped to RB set k. For example, for each cyclic mapping of the bitmap, the PRBs corresponding to bits with a value of 1 in the bitmap can be used for PSFCH transmission, while the PRBs corresponding to bits with a value of 0 in the bitmap cannot be used for PSFCH transmission. PRBs in RB set k that are not mapped by the bitmap cannot be used for PSFCH transmission.

[0089] Figure 12 is a schematic diagram of the bitmap mapping to RB sets in Example 4 when S = 4, provided by an embodiment. As shown in Figure 12, the bitmap length is 4, RB set k in the resource pool contains 50 PRBs, and the bitmap length is less than the difference (47) between 50 and 3, the number of PRBs contained in RB set k. After the bitmap is cyclically mapped on RB set k 11 times, 3 PRBs remain unmapped in RB set k. This means that one more mapping would exceed the range of RB set k, so the last mapping can be canceled. For the 4th to 47th PRBs in RB set k, the UE determines whether the corresponding PRBs can be used for PSFCH transmission based on the values ​​of the bits in the bitmap mapped to RB set k. For example, for each cyclic mapping of the bitmap, the PRBs corresponding to bits with a value of 1 in the bitmap can be used for PSFCH transmission, while the PRBs corresponding to bits with a value of 0 in the bitmap cannot be used for PSFCH transmission. PRBs in RB set k that are not bitmap-mapped cannot be used for PSFCH transmission.

[0090] Example 5: If the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is cyclically mapped on the RB set according to a configured or preconfigured or predefined number of cycles.

[0091] Figure 13 is a schematic diagram of the bitmap mapping to RB sets in Example 5 when S = 1, provided by an embodiment. As shown in Figure 13, the bitmap length is 4, RB set k in the resource pool contains 50 PRBs, and the bitmap length is less than the difference between 50 and 0, the number of PRBs in RB set k. Assuming the configured bitmap iteration count is 12, the bitmap is repeatedly mapped 12 times on RB set k, starting from the first PRB in RB set k. The last two PRBs in RB set k are not mapped and cannot be used for PSFCH transmission. For the first 48 PRBs in RB set k, the UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to RB set k. For example, for each iteration of the bitmap, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, while the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission. PRBs in RB set k that are not mapped by the bitmap cannot be used for PSFCH transmission.

[0092] Figure 14 is a schematic diagram of the bitmap mapping to RB sets in Example 5 when S = 4, provided by an embodiment. As shown in Figure 14 , the bitmap length is 4, RB set k in the resource pool contains 50 PRBs, and the bitmap length is less than the difference (47) between the number of PRBs in RB set k (50) and 3. Assuming the configured bitmap repetition count is 11, the bitmap is repetitively mapped 11 times on RB set k, starting with the 4th PRB in RB set k. The last 3 PRBs in RB set k are not mapped and cannot be used for PSFCH transmission. For the 4th through 47th PRBs in RB set k, the UE determines whether the corresponding PRBs can be used for PSFCH transmission based on the values ​​of the bits in the bitmap mapped to RB set k. For example, for each repetitive bitmap mapping, the PRBs corresponding to bits with a value of 1 in the bitmap can be used for PSFCH transmission, while the PRBs corresponding to bits with a value of 0 in the bitmap cannot be used for PSFCH transmission. PRBs in RB set k that are not bitmap-mapped cannot be used for PSFCH transmission.

[0093] In this application, the number of cycles can be configured, preconfigured, or predefined for a resource pool, i.e., all RB sets in the resource pool use the same number of cycles; or the number of cycles can be configured, preconfigured, or predefined for each RB set in the resource pool. For each RB set in the resource pool, when the bitmap is cyclically mapped across the RB set according to the configured, preconfigured, or predefined number of cycles, the UE does not expect the mapping to exceed the range of the RB set, i.e., the number of cycles can be understood as the maximum number of cycles.

[0094] In the present application, when the resource pool includes multiple RB sets, the above examples 1 to 5 can be used in combination without conflict to determine the PRBs that can be used for PSFCH transmission in each RB set in the resource pool.

[0095] In one embodiment, the above Example 1 may be combined with Example 3, Example 4, or Example 5.

[0096] For example, combine the above Example 1 and Example 3: for each RB set in the resource pool, the bitmap is mapped starting from the Sth PRB in the RB set, and each bit in the bitmap corresponds to one PRB. If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bits in the bitmap mapped to outside the RB set are invalid, or the bits in the bitmap mapped to outside the RB set are not allowed to be set to 1; if the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, after the bitmap is mapped once on the RB set, the remaining PRBs in the RB set are not mapped. Figure 15 is a schematic diagram of a combination of Example 1 and Example 3 provided by an embodiment for bitmap mapping to an RB set when S=1. As shown in Figure 15, the resource pool contains two RB sets, and the value of S corresponding to each RB set is 1, the bitmap length is 50, and the number of PRBs contained in RB set 0 and RB set 1 is 50 and 52, respectively. For RB set 0, the bitmap starts mapping from the first PRB in RB set 0 to all PRBs in RB set 0. The UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to RB set 0. For RB set 1, the bitmap starts mapping from the first PRB in RB set 1. Because the bitmap length is less than the number of PRBs contained in RB set 1, the last two PRBs in RB set 1 are not mapped. The UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to RB set 1. For example, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission, and the last two unmapped PRBs in RB set 1 cannot be used for PSFCH transmission.

[0097] For another example, combine Example 1 and Example 4 above: for each RB set in the resource pool, the bitmap is mapped starting from the Sth PRB of the RB set, and each bit in the bitmap corresponds to one PRB. If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bits in the bitmap mapped to outside the RB set are invalid, or the bits in the bitmap mapped to outside the RB set are not allowed to be set to 1; if the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is cyclically mapped on the RB set until the last PRB of the RB set. In addition, when the last mapping of the bitmap on the RB set exceeds the range of the RB set, the UE may adopt the methods in Examples 1 to 3 above, for example: the bits in the bitmap that exceed the range of the RB set are invalid, or the bits in the bitmap that exceed the range of the RB set are not allowed to be set to 1, or the bitmap mapping is truncated according to the number of PRBs remaining in the RB set after the previous bitmap mapping, or the last bitmap mapping is canceled.

[0098] For another example, combine the above Example 1 and Example 5: for each RB set in the resource pool, the bitmap is mapped starting from the Sth PRB of the RB set, and each bit in the bitmap corresponds to one PRB. If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bits in the bitmap mapped to outside the RB set are invalid, or the bits in the bitmap mapped to outside the RB set are not allowed to be set to 1; if the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is cyclically mapped on the RB set according to the configured or preconfigured or predefined number of cycles.

[0099] In one embodiment, the above Example 2 may also be combined with Example 3, Example 4 or Example 5.

[0100] For example, combine the above Example 2 and Example 3: for each RB set in the resource pool, the bitmap is mapped starting from the Sth PRB of the RB set, and each bit in the bitmap corresponds to one PRB. If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is truncated according to the difference between the number of PRBs contained in the RB set and S-1, and the truncated bitmap is mapped to the RB set; if the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, after the bitmap is mapped once on the RB set, the remaining PRBs of the RB set are not mapped.

[0101] For another example, combine Example 2 and Example 4 above: for each RB set in the resource pool, the bitmap is mapped starting from the Sth PRB of the RB set, and each bit in the bitmap corresponds to one PRB. If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is truncated according to the difference between the number of PRBs contained in the RB set and S-1, and the truncated bitmap is mapped to the RB set; if the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is cyclically mapped on the RB set until the last PRB of the RB set. In addition, when the last mapping of the bitmap on the RB set exceeds the range of the RB set, the UE may adopt the methods in Examples 1 to 3 above, for example: the bits in the bitmap that exceed the range of the RB set are invalid, or the bits in the bitmap that exceed the range of the RB set are not allowed to be set to 1, or the bitmap mapping is truncated according to the number of PRBs remaining in the RB set after the previous bitmap mapping, or the last bitmap mapping is canceled.

[0102] For another example, combine the above Example 2 and Example 5: for each RB set in the resource pool, the bitmap is mapped starting from the Sth PRB of the RB set, and each bit in the bitmap corresponds to one PRB. If the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is truncated according to the difference between the number of PRBs contained in the RB set and S-1, and the truncated bitmap is mapped to the RB set; if the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1, the bitmap is cyclically mapped on the RB set according to the configured or preconfigured or predefined number of cycles.

[0103] In one embodiment, for a resource pool, the length of the bitmap and the difference between the number of PRBs contained in the RB set and S-1 may be restricted, so that the same example in Examples 1 to 5 above is adopted for each RB set in the resource pool. For example, for each RB set in the resource pool, the length of the bitmap is restricted to be greater than or equal to the difference between the number of PRBs contained in the RB set and S-1. For example, for a resource pool, the length of the bitmap is configured to be the number of PRBs contained in the RB set with the largest bandwidth, S=1. In this way, for each RB set in the resource pool, the length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1, and each RB set can use the method of Example 1 or Example 2 to determine the PRBs that can be used for PSFCH transmission. For another example, for a resource pool, the length of the configuration bitmap is the number of PRBs contained in the RB set with the smallest bandwidth, S=1. In this way, for each RB set in the resource pool, the length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. Each RB set can use the method of Example 3, Example 4, or Example 5 to determine the PRBs that can be used for PSFCH transmission.

[0104] S220 : Determine, according to the bitmap, the PRBs available for PSFCH transmission in each RB set in the resource pool.

[0105] In one embodiment, for each RB set, the UE may determine, based on the value of each bit in the bitmap, whether the PRB corresponding to the bit can be used for PSFCH transmission.

[0106] In one embodiment, each PSFCH resource occupies one or more PRBs. For example, when a resource pool is configured or preconfigured to support interleaving-based SL transmission, each PSFCH resource occupies K discrete PRBs, where the K discrete PRBs belong to the same interleaving, and K is greater than or equal to 1. Exemplarily, for each interleaving within an RB set, every K=2 PRBs constitutes a PSFCH resource. When a bitmap is used to indicate the PRBs available for PSFCH transmission within an RB set, the value of the bit corresponding to each PRB in the same candidate PSFCH resource is the same.

[0107] Each RB set in the resource pool and each subchannel in the RB set corresponds to a set of PSFCH resources in the PRBs within the RB set that can be used for PSFCH transmission. The UE can determine the PSFCH resource set corresponding to the PSSCH transmission based on the subchannel occupied by the PSSCH transmission. Therefore, the number of PSFCH resources corresponding to the subchannel will affect the number of PSFCH resources corresponding to the PSSCH.

[0108] For multicast PSSCH with ACK / NACK feedback, each group member UE receiving the multicast PSSCH needs to transmit the PSFCH on a different PSFCH resource. The number of PSFCH resources corresponding to the PSSCH determines the maximum number of group members in the multicast communication. Therefore, ensuring that each subchannel has the same number of PSFCH resources can simplify the complexity of PSFCH resource selection in multicast communication. For example, when selecting PSSCH resources, controlling the number of selected subchannels can ensure that each group member has a PSFCH resource. Therefore, for each RB set in the resource pool, it is possible to consider properly configuring the bitmap or limiting the number of PRBs determined by the RB set that can be used for PSFCH transmission, so that each subchannel in the resource pool has the same number of PSFCH resources.

[0109] The following are some conditions that need to be met so that each subchannel in the resource pool corresponds to the same number of PSFCH resources.

[0110] For each RB set in the resource pool, the number of PRBs available for PSFCH transmission determined based on the bitmap satisfies at least one of the following conditions:

[0111] The number of PRBs available for PSFCH transmission determined by all RB sets is equal;

[0112] The number of PRBs available for PSFCH transmission determined by each RB set ensures that the number of PSFCH resources corresponding to each subchannel in each time slot in the resource pool is the same;

[0113] The number of PSFCH resources available for PSFCH transmission determined by each RB set is an integer multiple of the product of the number of subchannels corresponding to the RB set and P, where P is the PSFCH period and is measured in time slots within the resource pool.

[0114] The number of PSFCH resources available for PSFCH transmission for each RB set is N times the product of the number of subchannels corresponding to the RB set and P, where P is the PSFCH period in time slots within the resource pool, and N is a positive integer that is the same for all RB sets in the resource pool.

[0115] The subchannel corresponding to the RB set includes at least one of the following: a subchannel that is completely located in the RB set, a subchannel whose starting PRB is located in the RB set, a subchannel whose ending PRB is located in the RB set, a subchannel whose number of PRBs included in the RB set is greater than or equal to a first threshold, and a subchannel whose starting PRB is included in the RB set and the number of consecutive PRBs included in the RB set starting from the starting PRB is greater than or equal to a second threshold.

[0116] Optionally, the method may further include: selecting at least part of the resources from the resources determined according to the bitmap so that each subchannel in the resource pool corresponds to the same number of PSFCH resources.

[0117] For RB set k in the resource pool, if the number of PRBs Nk available for PSFCH transmission determined according to the bitmap exceeds Nmin, then Nk-Nmin PRBs are removed from the PRBs available for PSFCH transmission determined according to the bitmap, where Nmin is the minimum number of PRBs available for PSFCH transmission determined according to the bitmap for all RB sets in the resource pool, and Nk is the number of PRBs available for PSFCH transmission determined according to the bitmap for RB set k.

[0118] For example, a resource pool contains four RB sets: RB set 0, RB set 1, RB set 2, and RB set 3. The number of PRBs available for PSFCH transmission in these four RB sets, as determined by the bitmap, is 40, 41, 42, and 43, respectively. Therefore, Nmin = 40. For the last three RB sets, the last 1, 2, and 3 PRBs are removed from the PRBs available for PSFCH transmission, as determined by the bitmap.

[0119] In addition, for each RB set in the resource pool, some PRBs are removed from the PRBs available for PSFCH transmission as determined by the bitmap. This is equivalent to setting the bit values ​​corresponding to some PRBs to 0 or invalidating the bits when the bitmap is mapped to the RB set. For example, a resource pool contains four RB sets: RB set 0, RB set 1, RB set 2, and RB set 3. For RB set 0, which has the smallest bandwidth, the number of PRBs available for PSFCH transmission as determined by the bitmap is 40. For the remaining three RB sets, the PRBs available for PSFCH transmission are determined based on the first 40 bits in the bitmap that are 1. In the case of cyclic repetition mapping, the bitmap here can be understood as the bitmap after cyclic repetition. For example, if the configured, preconfigured, or predefined bitmap = 1011, and the number of cyclic repetition mappings is 2, then the bitmap after cyclic repetition = 10111011.

[0120] In another possible implementation, the bitmap is mapped to a resource pool. Figure 16 is a flow chart of another method for determining resources provided by an embodiment. As shown in Figure 16, the method includes the following steps.

[0121] S310: Determine a bitmap, and map the bitmap to a resource pool.

[0122] In one embodiment, a bitmap is used to indicate PRBs in a resource pool that can be used for PSFCH transmission. Since the bitmap is mapped to the resource pool, each bit in the bitmap corresponds to a PRB in the resource pool, and the bitmap is mapped starting from the first PRB in the resource pool. Alternatively, the bitmap includes multiple partial bitmaps, each partial bitmap corresponds to an RB set in the resource pool, each bit in the partial bitmap corresponds to a PRB in its corresponding RB set, and the partial bitmap is mapped starting from the first PRB in its corresponding RB set.

[0123] In one embodiment, the bitmap is mapped to the resource pool to meet at least one of the following characteristics:

[0124] Map the bitmap to each PRB in the resource pool after removing the guard band;

[0125] The bitmap is mapped to each PRB in the resource pool in sequence. The bits corresponding to the PRBs in the guard band are invalid, or the bits corresponding to the PRBs in the guard band are not allowed to be set to 1.

[0126] Below are some examples of bitmap mapping to resource pools. In these examples, only PRBs corresponding to bits with a value of 1 in the bitmap can be used for PSFCH transmission. That is, PRBs corresponding to bits with a value of 0 in the bitmap cannot be used for PSFCH transmission, and PRBs corresponding to invalid bits in the bitmap cannot be used for PSFCH transmission.

[0127] Example 6: Map the bitmap sequentially to each PRB in the resource pool after removing the guard band.

[0128] In Example 6, the length of the bitmap is the number of PRBs in the resource pool after the guard band is removed. The bitmap is sequentially mapped to each PRB in the resource pool after the guard band is removed. For each RB set in the resource pool, the value of the bit in the bitmap mapped to the RB set determines whether the corresponding PRB can be used for PSFCH transmission.

[0129] Figure 17 is a schematic diagram of the bitmap mapped to the resource pool in Example 6 provided by an embodiment. As shown in Figure 17, the bandwidths of RB set 0, guard band GB, and RB set 1 in the resource pool are 50 PRBs, 5 PRBs, and 52 PRBs, respectively. After removing GB, the number of PRBs contained in the resource pool is 102, that is, the length of the bitmap is 102, and the first 50 bits and the last 52 bits in the bitmap are mapped to RB set 0 and RB set 1, respectively. The UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit mapped to the RB set in the bitmap. For example, for each RB set, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0130] Example 7: The bitmap is sequentially mapped to each PRB in the resource pool. The bit corresponding to the PRB in the guard band is invalid, or the bit corresponding to the PRB in the guard band is not allowed to be set to 1.

[0131] In Example 7, the length of the bitmap is the number of PRBs contained in the resource pool. The bitmap is mapped to each PRB in the resource pool in sequence. For each RB set, the UE determines whether the corresponding PRB can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to the RB set. For example, for each RB set, the PRB corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission. That is, the bits mapped to the guard band in the bitmap are invalid, or the bits corresponding to the PRBs in the guard band are not allowed to be set to 1.

[0132] S320 : Determine, according to the bitmap, the PRBs that can be used for PSFCH transmission in each RB set in the resource pool.

[0133] In one embodiment, the resources available for PSFCH transmission determined according to the bitmap should satisfy the requirement that each subchannel in the resource pool corresponds to the same number of PSFCH resources.

[0134] Optionally, the method may further include: selecting at least part of the resources from the resources determined according to the bitmap so that each subchannel in the resource pool corresponds to the same number of PSFCH resources.

[0135] The description of step S320 can refer to the description of the above step S220, and for the sake of brevity, it will not be repeated here.

[0136] Through any of the above possible implementation methods, the impact of the guard band in the resource pool on the PSFCH frequency domain resource configuration can be avoided, and at the same time, it is ensured that when configuring the PSFCH frequency domain resources, each subchannel in the resource pool corresponds to an equal number of PSFCH resources.

[0137] The present application also provides a method for mapping each bit in a bitmap to a PRB group to determine resources. The method specifically includes:

[0138] The UE determines a bitmap. For each RB set in the resource pool, the bitmap is used to indicate the PRB groups within the RB set that can be used for PSFCH transmission. Each bit in the bitmap corresponds to a PRB group. When the bitmap is mapped to the RB set, it starts mapping from the Sth PRB group in the RB set. S is a positive integer.

[0139] In one embodiment, the bitmap is mapped once on an RB set; or, the bitmap is cyclically mapped on an RB set.

[0140] In one embodiment, for each RB set, whether the corresponding PRB group can be used for PSFCH transmission is determined according to the value of the bit mapped to the RB set in the bitmap.

[0141] In one embodiment, the length of the bitmap is a configured, preconfigured, or predefined positive integer, for example, the number of PRB groups included in the RB set with the smallest bandwidth in the resource pool, or the number of PRB groups included in the subchannel of the resource pool.

[0142] In one embodiment, S is a configured, preconfigured, or predefined positive integer; or S=offset+1, where offset is the offset of the starting mapping position of the configured, preconfigured, or predefined bitmap relative to the first PRB group of the RB set.

[0143] In one embodiment, the value of S corresponding to all RB sets in the resource pool is the same, and S is less than the number of PRB groups included in the RB set with the smallest bandwidth in the resource pool; or, the value of S corresponding to each RB set in the resource pool is configured or pre-configured separately, and for each RB set, S is less than or equal to the number of PRB groups included in the RB set.

[0144] In one embodiment, a PRB group includes one or more PRBs, and each PSFCH resource occupies one PRB group. For example, when a resource pool is configured or preconfigured to support interleave-based SL transmission, each PSFCH resource occupies K discrete PRBs, where the K discrete PRBs belong to the same interleave, and K is greater than or equal to 1. For example, for each interleave within an RB set, every K = 2 PRBs constitutes a PSFCH resource.

[0145] In one embodiment, the bitmap may be configured or pre-configured.

[0146] In one embodiment, multiple bitmaps may be configured for a resource pool, each bitmap indicating the PRB group of the PSFCH that transmits different control information within each RB set in the resource pool. For example, for a resource pool, if the control information includes HARQ feedback information and collision information, a bitmap may be configured for each of the HARQ feedback information and the collision information, i.e., two (or groups of) bitmaps may be configured: one bitmap (or group of) indicating the PRB group of the PSFCH that transmits HARQ feedback information within each RB set in the resource pool, and another bitmap (or group of) indicating the PRB group of the PSFCH that transmits collision information within each RB set in the resource pool. The UE expects that the two (or groups of) bitmaps indicate different PRB groups.

[0147] In the embodiments shown in Figures 3, 4, and 16, each bit in the bitmap corresponds to a PRB. However, the difference between this embodiment and the above embodiment is that each bit in the bitmap in this embodiment corresponds to a PRB group. When a PRB group contains one PRB, it is equivalent to the above embodiment, and the only difference is the description method. When a PRB group contains multiple PRBs, the solution of this embodiment can be obtained by replacing "PRB" in the above embodiment with "PRB group". Another difference is that the offset in the above embodiment is in units of PRBs, while the offset in this embodiment is in units of PRB groups. In addition, if multiple PRBs in a PRB group are discrete, for example, multiple PRBs belong to the same interlace, then when "PRB group" in the above embodiment is replaced with "PRB", the multiple PRBs in the PRB group in the schematic diagram of the above embodiment are PRBs in the same interlace within the RB set. Similar to the above embodiment, please refer to the example given below for details.

[0148] In one example, for each RB set in the resource pool, when the bitmap is mapped to the RB set, the mapping starts from the Sth PRB group of the RB set, and each bit in the bitmap corresponds to a PRB group. If the length of the bitmap is greater than or equal to the difference between the number of PRB groups contained in the RB set and S-1 (that is, the bitmap exceeds the RB set range when mapped to the RB set), the bits mapped outside the RB set are invalid, or the bits mapped outside the RB set are not allowed to be set to 1.

[0149] In one example, for each RB set in the resource pool, when the bitmap is mapped to the RB set, the mapping starts from the Sth PRB group of the RB set. Each bit in the bitmap corresponds to a PRB group. If the length of the bitmap is greater than or equal to the difference between the number of PRB groups contained in the RB set and S-1, the bitmap is truncated according to the difference between the number of PRB groups contained in the RB set and S-1, and then the truncated bitmap is mapped to the RB set.

[0150] In one example, for each RB set in the resource pool, when the bitmap is mapped to the RB set, the mapping starts from the Sth PRB group of the RB set. Each bit in the bitmap corresponds to a PRB group. If the length of the bitmap is less than or equal to the difference between the number of PRB groups contained in the RB set and S-1, the remaining PRB groups in the RB set are not mapped after the bitmap is mapped once.

[0151] In one example, for each RB set in a resource pool, when the bitmap is mapped to the RB set, the mapping starts from the Sth PRB group of the RB set, and each bit in the bitmap corresponds to a PRB group. If the length of the bitmap is less than or equal to the difference between the number of PRB groups contained in the RB set and S-1, the bitmap is repeatedly mapped on the RB set until the end of the RB set. Optionally, when the last mapping of the bitmap on the RB set exceeds the range of the RB set, the method in the above example of this embodiment can be adopted, for example, the bits in the bitmap that exceed the range of the RB set are invalid, or the bits in the bitmap that exceed the range of the RB set are not allowed to be set to 1, or the bitmap mapping is truncated according to the number of PRB groups remaining in the RB set after the previous bitmap mapping, or the last bitmap mapping is canceled.

[0152] In one instance, for each RB set in the resource pool, when the bitmap is mapped to the RB set, the mapping starts from the Sth PRB group of the RB set, and each bit in the bitmap corresponds to a PRB group. If the length of the bitmap is less than or equal to the difference between the number of PRB groups contained in the RB set and S-1, the bitmap is cyclically repeated on the RB set according to the configured or preconfigured or predefined number of bitmap cyclic mapping repetitions.

[0153] This embodiment provides a method for mapping a bitmap to an RB set from the perspective of an RB set. When a resource pool contains multiple RB sets, the methods in the above examples can be combined or reused to determine the PRB group that can be used for PSFCH transmission in each RB set in the resource pool.

[0154] Example 8: For each RB set in a resource pool, a bitmap is used to indicate the PRB group within the RB set that can be used for PSFCH transmission.

[0155] In Example 8, for each RB set in the resource pool, the bitmap is mapped to the RB set starting from the first PRB in the RB set. Each bit in the bitmap corresponds to a PRB group. The value of the bit in the bitmap mapped to the RB set determines whether the corresponding PRB group can be used for PSFCH transmission.

[0156] The following takes the example that the length of the bitmap is equal to the number of PRB groups contained in the RB set to provide some detailed explanations of the method of mapping the bitmap to the RB set. Figure 18 is a schematic diagram of a method provided by an embodiment for mapping the bitmap to the RB set when each PSFCH transmission occupies a shared interlace within the RB set and an exclusive PRB group for the PSFCH. As shown in Figure 18, the subcarrier spacing is 30kHz, RB set k contains 50 PRBs, and M=5 interlaces are defined on the carrier where RB set k is located, namely interlace 0, interlace 1, interlace 2, interlace 3 and interlace 4, where the 10 PRBs in interlace 0 are shared PRBs for PSFCH, and every 5 PRBs in the remaining 4 interlaces form a PRB group, for a total of 8 PRB groups, which are numbered in ascending order of the interlace index as group 1 to group 8. The length of the bitmap is 8, which is equal to the number of PRB groups contained in RB set k. The bitmap is mapped starting from the first PRB group (group 1) in RB set k. Each bit corresponds to a PRB group. The UE determines whether the corresponding PRB group can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to RB set k. For example, the PRB group corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, while the PRB group corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0157] Each PSFCH's dedicated resource is a PRB group. Each PSFCH is transmitted on a shared PRB and its dedicated PRB group. The shared PRBs for a PSFCH can be determined by configuration, pre-configuration, or pre-defined methods. All PSFCH transmissions in the resource pool use the same shared PRBs. Therefore, the bitmap only needs to indicate the dedicated PRB group used to transmit the PSFCH.

[0158] If each PSFCH resource occupies one interlace within an RB set, there is no need to define shared PRBs for the PSFCH. Figure 19 is a schematic diagram of a bitmap mapped to an RB set when each PSFCH transmission occupies one interlace (i.e., PRB group) within an RB set, provided by an embodiment. As shown in Figure 19, the subcarrier spacing is 30kHz, RB set k contains 50 PRBs, and M=5 interlaces are defined on the carrier where RB set k is located, namely interlace 0, interlace 1, interlace 2, interlace 3, and interlace 4. Each interlace within RB set k is a PRB group, and interlaces 0 to 4 within the RB set are the 5 PRB groups within the RB set, numbered as group 1 to group 5. The length of the bitmap is 5, and each bit of the bitmap corresponds to a PRB group (i.e., interlace) within RB set k. The UE determines whether the corresponding PRB group can be used for PSFCH transmission based on the value of the bit in the bitmap mapped to RB set k. For example, the PRB group corresponding to the bit with a value of 1 in the bitmap can be used for PSFCH transmission, and the PRB group corresponding to the bit with a value of 0 in the bitmap cannot be used for PSFCH transmission.

[0159] Example 9: For each RB set in a resource pool, the number of PRB groups available for PSFCH transmission determined according to the bitmap is limited to meet a specific condition.

[0160] For each RB set in the resource pool, the number of PRB groups available for PSFCH transmission determined based on the bitmap satisfies at least one of the following conditions:

[0161] The number of PRB groups available for PSFCH transmission determined by all RB sets is equal;

[0162] The number of PRB groups available for PSFCH transmission determined by each RB set ensures that the number of PSFCH resources corresponding to each subchannel on each time slot in the resource pool is the same;

[0163] The number of PRB groups available for PSFCH transmission in each RB set is an integer multiple of the product of the number of subchannels in the RB set and P, where P is the PSFCH period in time slots within the resource pool.

[0164] The number of PRB groups available for PSFCH transmission determined by each RB set is N times the product of the number of subchannels in the RB set and P, where P is the PSFCH period and is measured in time slots in the resource pool, and N is a positive integer and is equal for all RB sets in the resource pool.

[0165] Example 10: By removing some PRB groups from the PRB groups that can be used for PSFCH transmission determined according to the bitmap, each subchannel in the resource pool corresponds to the same number of PSFCH resources.

[0166] For RB set k in the resource pool, if the number of PRB groups Nk that can be used for PSFCH transmission determined according to the bitmap exceeds Nmin, then Nk-Nmin PRB groups are removed from the PRB groups that can be used for PSFCH transmission determined according to the bitmap, where Nmin is the minimum number of PRB groups that can be used for PSFCH transmission determined according to the bitmap for all RB sets in the resource pool, and Nk is the number of PRB groups that can be used for PSFCH transmission determined according to the bitmap for RB set k.

[0167] In addition, for each RB set in the resource pool, some PRB groups are removed from the PRB groups that can be used for PSFCH transmission determined according to the bitmap, which is equivalent to the values ​​of the bits corresponding to some PRB groups being 0 when the bitmap is mapped to the RB set, or the bits corresponding to some PRB groups being invalid.

[0168] FIG20 is a schematic structural diagram of a resource determination device provided by an embodiment. The device may be configured in a communication node. As shown in FIG20 , the device includes: a mapping module 10 and a determination module 11 .

[0169] A mapping module 10 is configured to determine a bitmap, the bitmap is mapped to a resource pool or the bitmap is mapped to each resource block set RB set in the resource pool;

[0170] The determination module 11 is configured to determine, according to the bitmap, resources available for physical side link channel transmission in each RB set in the resource pool.

[0171] The resource determination device provided in this embodiment is to implement the resource determination method of the above embodiment. The implementation principle and technical effects of the resource determination device provided in this embodiment are similar to those of the above embodiment and will not be repeated here.

[0172] In one embodiment, a bitmap is mapped to each RB set in the resource pool, and the bitmap is used to indicate a physical resource block (PRB) in each RB set that can be used for transmission of a physical side link feedback channel (PSFCH);

[0173] For each RB set, each bit in the bitmap indicates whether the corresponding PRB in the RB set can be used for PSFCH transmission, and the bitmap is mapped starting from the Sth PRB in the RB set, where S is a positive integer.

[0174] In one embodiment, the values ​​of S corresponding to all RB sets in the resource pool are configured or pre-configured or pre-defined by the same parameter; or,

[0175] The value of S corresponding to each RB set in the resource pool is configured or pre-configured through different parameters.

[0176] In one embodiment, the value of S is equal to the offset plus one, where offset is the offset of the starting mapping position of the configured, pre-configured, or pre-defined bitmap relative to the first PRB of the RB set.

[0177] In one embodiment, the offset values ​​corresponding to all RB sets in the resource pool are configured or pre-configured or pre-defined using the same parameters; or,

[0178] The offset value corresponding to each RB set in the resource pool is configured or pre-configured through different parameters.

[0179] In one embodiment, each RB set mapped to the resource pool by the bitmap satisfies at least one of the following characteristics:

[0180] The bitmap is mapped once on one RB set;

[0181] The bitmap is mapped cyclically on an RB set.

[0182] In one embodiment, mapping a bitmap on an RB set once includes at least one of the following:

[0183] The length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1. Bits in the bitmap that are mapped outside the RB set are invalid, or bits in the bitmap that are mapped outside the RB set are not allowed to be set to 1;

[0184] The length of the bitmap is greater than or equal to the difference between the number of PRBs contained in the RB set and S-1. The bitmap is truncated based on the difference between the number of PRBs contained in the RB set and S-1, and the truncated bitmap is mapped to the RB set;

[0185] The length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. After the bitmap is mapped once on the RB set, the remaining PRBs of the RB set are not mapped.

[0186] In one embodiment, cyclic mapping of a bitmap on an RB set includes at least one of the following:

[0187] The length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. The bitmap is cyclically mapped on the RB set until the last PRB in the RB set.

[0188] The length of the bitmap is less than or equal to the difference between the number of PRBs contained in the RB set and S-1. The bitmap is cyclically mapped on the RB set according to a configured or preconfigured or predefined number of cycles.

[0189] In one embodiment, the bitmap is mapped to a resource pool, and the bitmap is used to indicate the PRBs in the resource pool that can be used for PSFCH transmission;

[0190] Each bit in the bitmap corresponds to a PRB in the resource pool, and the bitmap is mapped starting from the first PRB in the resource pool; or

[0191] The bitmap includes several partial bitmaps, one partial bitmap corresponds to an RB set in the resource pool, each bit in the partial bitmap corresponds to a PRB in the corresponding RB set, and the partial bitmap is mapped starting from the first PRB in the corresponding RB set.

[0192] In one embodiment, the bitmap is mapped to the resource pool to meet at least one of the following characteristics:

[0193] Map the bitmap to each PRB in the resource pool after removing the guard band;

[0194] The bitmap is mapped to each PRB in the resource pool in sequence. The bits corresponding to the PRBs in the guard band are invalid, or the bits corresponding to the PRBs in the guard band are not allowed to be set to 1.

[0195] In one embodiment, the number of resources satisfies at least one of the following conditions:

[0196] The number of resources determined by all RB sets is equal;

[0197] The number of resources determined by each RB set ensures that the number of PSFCH resources corresponding to each subchannel on each time slot in the resource pool is the same;

[0198] The number of resources determined by each RB set is equal to an integer multiple of the product of the number of subchannels corresponding to the RB set and P, where P is the PSFCH period;

[0199] The number of resources determined by each RB set is equal to N times the product of the number of subchannels corresponding to the RB set and P, where P is the PSFCH period and N is a positive integer that is the same for all RB sets in the resource pool.

[0200] The subchannel corresponding to the RB set includes at least one of the following: a subchannel that is completely located in the RB set, a subchannel whose starting PRB is located in the RB set, a subchannel whose ending PRB is located in the RB set, a subchannel whose number of PRBs included in the RB set is greater than or equal to a first threshold, and a subchannel whose starting PRB is included in the RB set and the number of consecutive PRBs included in the RB set starting from the starting PRB is greater than or equal to a second threshold.

[0201] In one embodiment, the determination module 11 is further configured to select at least part of the resources from the resources so that each subchannel in the resource pool corresponds to the same number of PSFCH resources.

[0202] The present application also provides a communication node, including a processor configured to implement the method provided in any embodiment of the present application when executing a computer program. Specifically, the communication node may be a transmitting UE or a receiving UE provided in any embodiment of the present application, and the present application does not impose any specific limitation on this.

[0203] Illustratively, the following embodiment provides a structural diagram in which a communication node is a UE.

[0204] Figure 21 is a structural diagram of a UE provided by an embodiment. The UE can be implemented in various forms. The UE in this application may include but is not limited to mobile terminal devices such as mobile phones, smart phones, laptops, digital broadcast receivers, personal digital assistants (PDAs), tablet computers (PADs), portable multimedia players (PMPs), navigation devices, vehicle-mounted terminal devices, vehicle-mounted display terminals, vehicle-mounted electronic rearview mirrors, etc., as well as fixed terminal devices such as digital televisions (TVs) and desktop computers.

[0205] As shown in FIG21 , UE 50 may include a wireless communication unit 51, an audio / video (A / V) input unit 52, a user input unit 53, a sensing unit 54, an output unit 55, a memory 56, an interface unit 57, a processor 58, and a power supply unit 59, among others. FIG21 shows a UE including various components, but it should be understood that implementation of all illustrated components is not required. More or fewer components may be implemented instead.

[0206] In this embodiment, the wireless communication unit 51 allows radio communication between the UE 50 and a base station or network. The A / V input unit 52 is configured to receive audio or video signals. The user input unit 53 can generate key input data based on user input commands to control various operations of the UE 50. The sensing unit 54 detects the current state of the UE 50, the location of the UE 50, the presence or absence of user touch input to the UE 50, the orientation of the UE 50, the acceleration or deceleration movement and direction of the UE 50, and generates commands or signals for controlling the operation of the UE 50. The interface unit 57 serves as an interface through which at least one external device can connect to the UE 50. The output unit 55 is configured to provide output signals in a visual, audio, and / or tactile manner. The memory 56 can store software programs, etc., for processing and control operations executed by the processor 58, or can temporarily store data that has been output or is to be output. The memory 56 can include at least one type of storage medium. Furthermore, the UE 50 can cooperate with a network storage device that performs the storage function of the memory 56 via a network connection. The processor 58 generally controls the overall operation of the UE 50. The power supply unit 59 receives external power or internal power under the control of the processor 58 and provides appropriate power required to operate various elements and components.

[0207] The processor 58 executes at least one functional application and data processing by running the program stored in the memory 56, such as implementing the method provided in the embodiment of the present application.

[0208] An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the method provided in any embodiment of the present application is implemented.

[0209] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. The computer-readable storage medium includes (a non-exhaustive list): an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0210] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, the data signal carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transfer a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0211] The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.

[0212] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages ​​or a combination of multiple programming languages, including object-oriented programming languages ​​(such as Java, Smalltalk, C++, Ruby, Go), and conventional procedural programming languages ​​(such as "C" or similar programming languages). The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0213] It will be appreciated by those skilled in the art that the term user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.

[0214] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.

[0215] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0216] Any block diagram of a logical flow in the drawings of this application may represent program steps, or may represent interconnected logical circuits, modules and functions, or may represent a combination of program steps and logical circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs DVD or CD), etc. Computer-readable media may include non-transitory storage media. A data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a programmable logic device (FPGA), and a processor based on a multi-core processor architecture.

Claims

1. A method for determining resources, comprising: Determine a bitmap bitmap, the bitmap is mapped to a resource pool or the bitmap is mapped to each RB set in at least one resource block set RB set in the resource pool; According to the bitmap, resources available for physical side link channel transmission in each RB set in the resource pool are determined.

2. The method according to claim 1, wherein: The bitmap is mapped to each RB set in the resource pool, and the bitmap is used to indicate the physical resource blocks PRBs that can be used for physical side link feedback channel PSFCH transmission in each RB set; For each RB set, each bit in the at least one bit in the bitmap indicates whether a corresponding PRB in the RB set can be used for PSFCH transmission, and the bitmap is mapped starting from the Sth PRB of the RB set, where S is a positive integer.

3. The method according to claim 2, wherein: The values ​​of S corresponding to all RB sets in the resource pool are configured or pre-configured or pre-defined by the same parameter; or, The value of S corresponding to each RB set in the resource pool is configured or pre-configured through different parameters.

4. The method according to claim 2, wherein: The value of S is equal to the offset offset plus one, where the offset is the offset of the starting mapping position of the configured, pre-configured or pre-defined bitmap relative to the first PRB of the RB set.

5. The method according to claim 4, wherein: The offset values ​​corresponding to all RB sets in the resource pool are configured or pre-configured or pre-defined by the same parameter; or, The offset value corresponding to each RB set in the resource pool is configured or pre-configured through different parameters.

6. The method according to claim 2, wherein: The bitmap is mapped to each RB set in the resource pool, satisfying at least one of the following characteristics: The bitmap is mapped once on one RB set; The bitmap is cyclically mapped on an RB set.

7. The method according to claim 6, wherein: The bitmap is mapped once on one RB set, including at least one of the following: The length of the bitmap is greater than or equal to the difference between the number of PRBs included in the RB set and S-1, the bits in the bitmap mapped to outside the RB set are invalid, or the bits in the bitmap mapped to outside the RB set are not allowed to be set to 1; The length of the bitmap is greater than or equal to the difference between the number of PRBs included in the RB set and S-1, the bitmap is truncated according to the difference between the number of PRBs included in the RB set and S-1, and the truncated bitmap is mapped to the RB set; The length of the bitmap is less than or equal to the difference between the number of PRBs included in the RB set and S-1. After the bitmap is mapped once on the RB set, the remaining PRBs of the RB set are not mapped.

8. The method according to claim 6, wherein: The bitmap is cyclically mapped on an RB set, including at least one of the following: The length of the bitmap is less than or equal to the difference between the number of PRBs included in the RB set and S-1, and the bitmap is cyclically mapped on the RB set until the last PRB of the RB set; The length of the bitmap is less than or equal to the difference between the number of PRBs included in the RB set and S-1, and the bitmap is cyclically mapped on the RB set according to a configured or preconfigured or predefined number of cycles.

9. The method according to claim 1, wherein: The bitmap is mapped to a resource pool, and the bitmap is used to indicate the PRBs in the resource pool that can be used for PSFCH transmission; Each bit in the bitmap corresponds to a PRB in the resource pool, and the bitmap is mapped starting from the first PRB in the resource pool; or, The bitmap includes multiple partial bitmaps, one partial bitmap corresponds to an RB set in the resource pool, each bit in the partial bitmap corresponds to a PRB in the corresponding RB set, and the partial bitmap is mapped starting from the first PRB in the corresponding RB set.

10. The method according to claim 9, wherein: The bitmap is mapped to the resource pool, satisfying at least one of the following characteristics: Mapping the bitmap sequentially to each PRB in the resource pool after removing the guard band; The bitmap is mapped to each PRB in the resource pool in sequence, and the bit corresponding to the PRB in the guard band is invalid, or the bit corresponding to the PRB in the guard band is not allowed to be set to 1.

11. The method according to claim 1, wherein: The quantity of the resources satisfies at least one of the following conditions: The quantities of the resources determined by all RB sets are equal; The number of resources determined by each RB set makes the number of PSFCH resources corresponding to each subchannel on each time slot in the resource pool the same; The number of resources determined by each RB set is equal to an integer multiple of the product of the number of subchannels corresponding to each RB set and P, where P is the period of the PSFCH; The number of resources determined by each RB set is equal to N times the product of the number of subchannels corresponding to each RB set and P, where P is the period of the PSFCH, and N is a positive integer, and N is equal for all RB sets in the resource pool; The subchannel corresponding to the RB set includes at least one of the following: a subchannel that is completely located in the RB set, a subchannel whose starting PRB is located in the RB set, a subchannel whose ending PRB is located in the RB set, a subchannel whose number of PRBs included in the RB set is greater than or equal to a first threshold, and a subchannel whose starting PRB is included in the RB set and whose number of consecutive PRBs included in the RB set starting from the starting PRB is greater than or equal to a second threshold.

12. The method according to claim 1, further comprising: At least part of the resources are selected from the resources so that each subchannel in the resource pool corresponds to the same number of PSFCH resources.

13. A communication node, comprising: processor; The processor is configured to implement the resource determination method as described in any one of claims 1-12 when executing a computer program.

14. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method for determining resources according to any one of claims 1 to 12.

Images