Communication method and related device

Abstract

A communication method and a related device, which are used for reducing communication interference between different communication devices by means of the intersection sparsity of different geometric figures, so as to improve the communication performance. In the method, K1 resources determined by a first communication apparatus are comprised in M resources, and the first communication apparatus may perform communication on the basis of the K1 resources, the M resources respectively corresponding to M coordinate points in an N-dimensional coordinate space, and the resource index of the K1 resources in the M resources being determined on the basis of one solution in a solution set of an i1-dimensional subspace in the N-dimensional coordinate space. Different solutions contained in the solution set of the i1-dimensional subspace can correspond to different geometric figures in space, and therefore, by means of the implementation mode of the K1 resources being determined on the basis of one solution in the solution set, communication interference between different communication devices can be reduced by means of the intersection sparsity of different geometric figures, thereby improving the communication performance.

Description

A communication method and related equipment

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office on December 1, 2023, with application number 202311655610.0 and application name “A Communication Method and Related Equipment”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communications, and in particular to a communication method and related equipment. Background Art

[0003] Wireless communication can be a transmission communication between two or more communication nodes without propagating through conductors or cables. The communication nodes generally include network devices and / or terminal devices.

[0004] In a communication system, in a large-scale connection scenario, different terminal devices may share a section of resources. For example, if the number of terminal devices exceeds the number of resources, the communication resources of different terminal devices may partially or completely overlap.

[0005] However, in the above situation, communication interference between different terminal devices will be inevitable, which will affect the communication performance.

[0006] Summary of the Invention

[0007] The present application provides a communication method and related equipment for utilizing the sparsity of intersections of different geometric figures to reduce communication interference between different communication devices and thereby improve communication performance.

[0008] The first aspect of the present application provides a communication method, which is applied to a first communication device, which can be a communication device (such as a network device or a terminal device), or the first communication device can be a partial component in the communication device (such as a processor, a chip or a chip system, etc.), or the first communication device can also be a logic module or software that can realize all or part of the functions of the communication device. In this method, the first communication device determines K1 resources, and the K1 resources are included in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein the M resources correspond to M coordinate points in an N-dimensional coordinate space, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i1 is less than or equal to N; the first communication device communicates based on the K1 resources.

[0009] Based on the above technical solution, the K1 resources determined by the first communication device are included in the M resources, and the first communication device can communicate based on the K1 resources. The M resources correspond to M coordinate points in the N-dimensional coordinate space, respectively, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space. Since the different solutions contained in the solution set of the i1-dimensional subspace can correspond to different geometric figures in space, the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set. This can utilize the sparsity of the intersection of different geometric figures to reduce the communication interference of different communication devices and improve communication performance.

[0010] In addition, compared with the implementation process of determining resources using a fixed codebook, when there are multiple solutions in the solution set of the i1-dimensional subspace, the flexibility of the determined resources can be improved by determining the resource index of K1 resources in the M resources by using one of the solutions in the solution set.

[0011] In this application, the resources involved (for example, any resource among the K1 resources, any resource among the M resources, and any resource among the K2 resources mentioned later) can be one or more time units, or one or more frequency domain units, or one or more time-frequency units.

[0012] For example, the time unit may be one or more symbols, one or more mini-slots, one or more time slots, one or more subframes, one or more frames, etc.

[0013] For another example, the frequency domain unit may be one or more subcarriers, one or more subbands, one or more bandwidth parts (BWPs), one or more carriers, and the like.

[0014] For another example, the time-frequency unit may be one or more resource elements (RE), or one or more resource blocks (RB), or one or more physical resource blocks (PRB).

[0015] From the above implementation process, it can be seen that the resource index of the K1 resources in the M resources is one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, wherein, when the values ​​of N, i1, etc. are determined, the solution set of the i1-dimensional subspace of the N-dimensional coordinate space is determined. The solution set can also be called a codebook set, and the solutions in the solution set can be called a codebook in the codebook set. In other words, in the first aspect, the first communication device can determine the resource index of the K1 resources in the M resources based on one of the codebooks in the codebook set. The specific implementation process can refer to the implementation process shown in Tables 4 to 14 below.

[0016] In a possible implementation of the first aspect, the method further includes: the first communication device receiving first information, where the first information is used to indicate the K1 resources. The first communication device determining the K1 resources includes: the first communication device determining the K1 resources based on the first information.

[0017] Based on the above technical solution, a first communication device can receive first information and, based on the first information, determine K1 resources for communication. In other words, the first communication device can serve as a resource scheduler and receive instructions from a resource scheduler to determine K1 resources for communication.

[0018] Optionally, the first information may come from other communication devices, such as network equipment or terminal equipment.

[0019] In a possible implementation manner of the first aspect, after the first communication apparatus determines K1 resources, the method further includes: the first communication apparatus sending second information, where the second information is used to indicate the K1 resources.

[0020] Based on the above technical solution, after the first communication device determines K1 resources, it can also send second information indicating the K1 resources, so that the recipient of the second information can subsequently communicate based on the indication of the second information. In other words, the first communication device can act as a resource scheduler and schedule other devices to communicate on the K1 resources using the second information.

[0021] Optionally, the first communication device may send the second information to another communication device, for example, the other communication device may be a terminal device.

[0022] In a possible implementation manner of the first aspect, the N-dimensional coordinate space is an N-dimensional affine space or an N-dimensional projective space.

[0023] Based on the above technical solution, the N-dimensional coordinate space for determining K1 resources can be implemented by any of the above methods to improve the flexibility of the solution implementation.

[0024] Optionally, the N-dimensional coordinate space is an N-dimensional projective space, which is represented by PG(N, p), where p is the order of the N-dimensional projective space and p can be a prime number or an integer power of a prime number.

[0025] In a possible implementation manner of the first aspect, the values ​​of N and p are determined based on the value of M.

[0026] Based on the above technical solution, in the N-dimensional projection space, the values ​​of N and p can determine the number of coordinate points in the space of the N-dimensional projection space. To this end, the values ​​of N and p can be determined based on the total number of resources M. In this way, K1 resources for communication can be determined in the N-dimensional projection space that is compatible with the total number of resources M.

[0027] Optionally, the total number of coordinate points in the N-dimensional projection space satisfies: M≤y;

[0028] Where y is the total number of coordinate points in the N-dimensional projection space.

[0029] In a possible implementation of the first aspect, the values ​​of N and p are determined based on third information, and the third information is used to indicate at least one of the lower limit value of the number of resources of the communication resources, the upper limit value of the number of resources of the communication resources, and the number of communication devices communicating on the M resources.

[0030] Optionally, the lower limit value of the number of communication resources can be understood as the lower limit value of the resource quantity demanded for the communication resources, that is, the lower limit value is used to indicate the minimum value of the resource quantity of the communication resources. Similarly, the upper limit value of the resource quantity of the communication resources can be understood as the upper limit value of the resource quantity demanded for the communication resources, that is, the lower limit value is used to indicate the maximum value of the resource quantity of the communication resources. For the determining party (e.g., the first communication device) that determines the values ​​of N and p, the determining party can determine the lower limit value and / or upper limit value of the resource quantity of the communication resources based on its own business needs (or the indication information of the communication peer).

[0031] Optionally, for the party that determines the values ​​of N and p (such as the first communication device), the party can determine the number of communication devices communicating on the M resources based on its own business needs (or the number information of the communication counterparts).

[0032] Based on the above technical solution, in an N-dimensional projective space, the values ​​of N and p can determine the number of resources determined by different solutions in the solution set of a subspace of the N-dimensional projective space. In other words, at least one of the above items can be used to determine the values ​​of N and p. In this way, the number of communication resources can be controlled by the values ​​of N and p.

[0033] Optionally, the solution set of the i1-dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N-i1 equations.

[0034] Optionally, any equation among the N-i1 equations satisfies: a_0*X_0+a_1*X_1+…+a_N*X_N=0;

[0035] Among them, X_0, X_1…X_N represent unknown numbers, and a_0,…,a_N all come from the Galois field GF(p).

[0036] In a possible implementation of the first aspect, the method also includes: the first communication device determines K2 resources, the K2 resources are included in the M resources, K2 is a positive integer, and M is an integer greater than or equal to K2; wherein, the resource index of the K2 resources in the M resources is determined by one of the solutions in the solution set of the i2-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i2 is less than or equal to N; the first communication device communicates based on the K2 resources.

[0037] Based on the above technical solution, in addition to determining K1 resources, the first communication device may also determine K2 resources, and communicate with different communication devices based on the K1 resources and the K2 resources respectively.

[0038] Optionally, K1=K2 and i1=i2, or K1≠K2 and i1≠i2.

[0039] For example, taking the example of a first communication device being able to communicate with a second communication device based on K1 resources, and a first communication device being able to communicate with a third communication device based on K2 resources, the solution set of the i1-dimensional subspace of the N-dimensional coordinate space is the solution set of an equation system containing N-i1 equations; correspondingly, the solution set of the i2-dimensional subspace of the N-dimensional coordinate space is the solution set of an equation system containing N-i2 equations.

[0040] Because different solutions to the same number of equations can correspond to the same number of resources, when i1 = i2, the number of resources used by the first communication device for communication with the second communication device (i.e., K1) and the number of resources used by the first communication device for communication with the third communication device (i.e., K2) are the same. In this way, the sparsity of the intersection of different geometric shapes in N-dimensional coordinate space can be exploited to reduce communication interference between different communication devices while also enabling the allocation of the same number of resources to different communication devices, adapting to scenarios where multiple communication devices require the same number of resources.

[0041] Since the number of resources corresponding to different solutions with different numbers of equations may be different, for this reason, in the case of i1≠i2, the number of resources for communication between the first communication device and the second communication device (i.e., K1), and the number of resources for communication between the first communication device and the third communication device (i.e., K2) may be different. In this way, the sparsity of the intersection of different geometric figures can be utilized based on the N-dimensional coordinate space to reduce communication interference between different communication devices, while also enabling the allocation process of different numbers of resources for different communication devices to adapt to scenarios with multiple communication devices with different resource requirements. For example, a solution set with a small number of equations (high dimension) has a larger number than a solution set with a large number of equations (low dimension), corresponding to more resources, thereby supporting the coexistence of communication devices with different rates (more resources represent a higher rate, and conversely, fewer resources represent a lower rate).

[0042] It's understandable that when i1 ≠ i2 , the intersection point between the higher-dimensional space and the lower-dimensional space depends on the lower-dimensional space. For example, two straight lines intersect at most at one point, and a plane and a line (not on that plane) also intersect at most at one point. This also ensures minimal collisions when communication devices of different speeds coexist.

[0043] The second aspect of the present application provides a communication device, which is a first communication device, and the first communication device includes a transceiver unit and a processing unit; the processing unit is used to determine K1 resources, the K1 resources are included in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein, the M resources correspond to M coordinate points in an N-dimensional coordinate space, respectively, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i1 is less than or equal to N; the transceiver unit is used to communicate based on the K1 resources.

[0044] A third aspect of the present application provides a communication device, comprising at least one processor, wherein the at least one processor is coupled to a memory; the memory is used to store computer programs or instructions; and the at least one processor is used to execute the computer program or instructions so that the communication device implements the method described in the first aspect and any possible implementation thereof.

[0045] In a fourth aspect, the present application provides a communication device comprising at least one logic circuit and an input / output interface; the logic circuit is used to execute the method described in the first aspect and any possible implementation thereof.

[0046] A fifth aspect of the present application provides a communication system, which includes the above-mentioned first communication device.

[0047] Optionally, the communication system further includes the above-mentioned other communication devices, a second communication device, a third communication device, etc.

[0048] In a sixth aspect, the present application provides a computer-readable storage medium for storing one or more computer programs or instructions. When the computer programs or instructions are executed by a computer, the computer executes the method described in the first aspect and any possible implementation thereof.

[0049] In a seventh aspect, the present application provides a computer program product (or computer program). When the computer program in the computer program product is executed by the computer, the computer executes the method described in the first aspect and any possible implementation thereof.

[0050] In an eighth aspect, the present application provides a chip system, which includes at least one processor for supporting the chip system to implement the method described in the first aspect and any possible implementation method thereof.

[0051] In one possible design, the chip system may further include a memory for storing program instructions and data necessary for the chip system. The chip system may be composed of a chip or may include a chip and other discrete components. Optionally, the chip system may further include an interface circuit for providing computer program instructions and / or data to the at least one processor.

[0052] Among them, the technical effects brought about by any design method from the second aspect to the eighth aspect can refer to the technical effects brought about by the above-mentioned first aspect and any different design methods thereof, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] FIG1 is a schematic diagram of a communication system provided by this application;

[0054] Figures 2a to 2c are some schematic diagrams of the communication system provided by this application;

[0055] FIG3 is a schematic diagram of resource allocation involved in this application;

[0056] FIG4 is an interactive schematic diagram of the communication method provided by this application;

[0057] 5 and 6 are schematic diagrams of the communication device provided in this application. DETAILED DESCRIPTION

[0058] First, some of the terms used in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.

[0059] (1) Configuration and pre-configuration: In this application, configuration and pre-configuration will be used at the same time. Configuration refers to the network equipment such as base stations or servers sending some parameter configuration information or parameter values ​​to the terminal through messages or signaling, so that the terminal can determine the communication parameters or resources during transmission based on these values ​​or information. Pre-configuration is similar to configuration. It can be a way for network equipment such as base stations or servers to send parameter information or values ​​to the terminal through a communication link or carrier; it can also be a way to give the definition of corresponding parameters or parameter values ​​in the standard, or by setting the relevant parameters or values ​​in the terminal device in advance. This application does not limit this. Furthermore, these values ​​and parameters can be changed or updated.

[0060] (2) In this application, “used for indication” can include direct indication and indirect indication. When describing that a certain indication information is used to indicate A, it can be understood that the indication information carries A, directly indicates A, or indirectly indicates A.

[0061] In this application, the information indicated by the indication information is referred to as the information to be indicated. In the specific implementation process, there are many ways to indicate the information to be indicated. For example, it can be implemented by direct indication, such as by indicating the information to be indicated itself or the index of the information to be indicated. It can also be implemented by indirectly indicating other information, wherein there is an association between the other information and the information to be indicated. It is also possible to indicate only a part of the information to be indicated, while the other parts of the information to be indicated are known or agreed in advance. For example, the indication of specific information can also be achieved with the help of the arrangement order of each information agreed in advance (for example, stipulated in the protocol), thereby reducing the indication overhead to a certain extent.

[0062] The information to be indicated can be sent as a whole, or divided into multiple sub-information and sent separately, and the sending period and / or sending timing of these sub-information can be the same or different. The specific sending method is not limited in this application. Among them, the sending period and / or sending timing of these sub-information can be pre-defined, for example, pre-defined according to a protocol, or can be configured by the transmitting device by sending configuration information to the receiving device. Among them, the configuration information can, for example, but not limited to, include one or a combination of at least two of radio resource control (RRC) signaling, medium access control (MAC) layer signaling and physical layer signaling. Among them, MAC layer signaling, for example, includes a medium access control control element (MAC CE); physical layer signaling, for example, includes downlink control information (DCI).

[0063] (3) The terms "system" and "network" in the embodiments of the present application can be used interchangeably. "At least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, "at least one of A, B and C" includes A, B, C, AB, AC, BC or ABC. In addition, unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the order, timing, priority or importance of multiple objects.

[0064] (4) "Sending" and "receiving" in the embodiments of the present application indicate the direction of signal transmission. In the present application, when entity A sends information to entity B, it can be that A sends it directly to B, or that A sends it indirectly to B through other entities. Similarly, when entity B receives information from entity A, it can be that entity B directly receives the information sent by entity A, or that entity B indirectly receives the information sent by entity A through other entities. Entities A and B here can be RAN nodes or terminals, or modules inside RAN nodes or terminals. The sending and receiving of information can be information interaction between a RAN node and a terminal, for example, information interaction between a base station and a terminal; the sending and receiving of information can also be information interaction between two RAN nodes, for example, information interaction between a CU and a DU; the sending and receiving of information can also be information interaction between different modules inside a device, for example, information interaction between a terminal chip and other modules of the terminal, or information interaction between a base station chip and other modules in the base station. "Sending" can also be understood as the "output" of the chip interface, and "receiving" can also be understood as the "input" of the chip interface.

[0065] (5) Affine space: A coordinate space whose coordinates are taken from the Galois field.

[0066] Among them, the affine space can be expressed as AG(N, p), AG(N, p) contains p N points, the coordinates of each point are (a1, a2, ..., a N ),a i ∈GF(p), where p is a prime number or a power of a prime number. This space is analogous to the case of Euclidean space in the Galois field.

[0067] (6) Projective space: A coordinate space whose coordinates are taken from the Galois field.

[0068] The projective space can be expressed as PG(N, p). PG(N, p) contains p N +p N-1 +…+p+1 points, the coordinates of each point are [a0:a1:…:a N ],a i ∈GF(p), where p in GF(p) refers to a p-element finite field or a p-element Galois field, and p is a prime number or an integer power of a prime number.

[0069] In addition, for [a0:a1:…:a N ], [0:0:…:0] is not a coordinate point.

[0070] In addition, for any b≠0,[a0:a1:…:a N ] and [ba0:ba1:…:ba N] correspond to the same point. For example, when p = 3, [1:2:2] and [2:1:1] should be considered the same coordinates, because [2:1:1] = [2:4:4] = [1:2:2].

[0071] It is worth noting that projective space contains affine space, that is, "affine space" is a subset of "projective space". The points in PG(N, p) can be divided into two types: a0 = 0 and a0 ≠ 0. The latter is actually AG(N, p). Since a0 ≠ 0, there exists b∈GF(p) such that ba0 = 1, thus obtaining a uniform form of [1:a1:…:a N ], ignoring the first coordinate (i.e. the first item in the coordinates), we get the affine space coordinates (a1, a2, ..., a N ).

[0072] (7) i-dimensional subspace: In PG(N, p), an i-dimensional subspace is the solution set of a system of Ni (homogeneous) linear equations. A one-dimensional subspace is called a line, and a two-dimensional subspace is called a plane. The more equations there are, the lower the dimensionality. The total number of points in an i-dimensional subspace is p i +p i-1 +…+p+1.

[0073] In addition, the number of equations corresponding to the i-dimensional subspace is Ni. For example, the derivation process is as follows:

[0074] Zero equations: The entire PG(N, p) is an N-dimensional space.

[0075] A linear equation: N-1 dimensional subspace. Due to a restriction, not all points satisfy this equation.

[0076] Two (independent) linear equations: an N-2-dimensional subspace, two restrictions, and further dimensionality reduction. This subspace is the intersection of the N-1-dimensional subspaces established by the two equations, so the dimensionality is reduced by 1. For example: the intersection of two planes (2D) is a line (1D), and the intersection of two lines (1D) is a point (0D).

[0077] Similarly, N-2 (independent) linear equations: 2-dimensional subspace (plane); N-1 (independent) linear equations: 1-dimensional subspace (line); N (independent) linear equations: 0-dimensional subspace (point). Optionally, more than N linear equations may have no solutions. Independence here means that no equation is a linear superposition of other equations.

[0078] In addition, the number of points on the i-dimensional subspace, that is, the number of solutions to the system of Ni (independent) equations: p i +p i-1+…+p+1. For example, the derivation process is as follows: the i-dimensional subspace itself is a projective space, that is, the i-dimensional subspace in PG(N, p) itself is a PG(i, p), so the number of points is p i +p i-1 +…+p+1.

[0079] Special note: plane points: p 2 +p+1; number of line points: p+1; the number of i-dimensional subspaces in PG(N,p) satisfies:

[0080] in, Indicates that (p N-i+1 -1)、(p N-i+2 -1)…(p N+1 -1) a total of i+1 elements of the multiplication (or cumulative multiplication), Indicates that (p 1 -1)、(p 2 -1)…(p i+1 -1) for a total of i+1 elements. p and N are the inputs to the projective space, N is the dimension, and p is a prime number or a power of a prime number. i is the dimension of the subspace of interest, for example, i=1 for a line.

[0081] In particular, when i=1, the number of i-dimensional subspaces can be understood as the number of straight lines, satisfying:

[0082] For example, for i=1, the derivation process is as follows: N +p N-1 Among the points +…+p+1, every two points determine a line, that is, a total of C(p N +p N-1 +…+p+1,2)=(p N +p N-1 +…+p+1)(p N +p N-1 +…+p) / 2 lines, where C() is a function of permutations and combinations. However, each line has p+1 points, so there are C(p+1,2)=(p+1)p / 2 pairs of points, each of which defines the line. Therefore, the total number should be the quotient of two numbers:

[0083] (8) Overloading factor (OF): the ratio of the number of users to the number of resources.

[0084] (9) Surjective: When mapping coordinates to resources, if each coordinate corresponds to a certain resource, it is a surjective.

[0085] Please refer to Figure 1, which is a schematic diagram of the architecture of a communication system 1000 used in an embodiment of the present application. As shown in Figure 1, the communication system includes a radio access network (RAN) 100 and a core network 200. Optionally, the communication system 1000 may also include the Internet 300. The RAN 100 includes at least one RAN node (such as 110a and 110b in Figure 1, collectively referred to as 110), and may also include at least one terminal (such as 120a-120j in Figure 1, collectively referred to as 120). The RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1). The terminal 120 is connected to the RAN node 110 wirelessly, and the RAN node 110 is connected to the core network 200 wirelessly or by wire. The core network devices in the core network 200 and the RAN node 110 in the RAN 100 may be independent and different physical devices, or they may be the same physical device that integrates the logical functions of the core network devices and the logical functions of the RAN nodes. Terminals and RAN nodes may be connected to each other via wired or wireless means.

[0086] RAN 100 may be a 3rd Generation Partnership Project (3 rd The RAN 100 may include two or more of the aforementioned different radio access systems. The RAN 100 may also be an open RAN (O-RAN).

[0087] RAN nodes, also known as radio access network equipment, RAN entities or access nodes, are used to help terminals access the communication system through wireless means. In an application scenario, RAN nodes can be base stations, evolved NodeBs (eNodeBs), transmission reception points (TRPs), fifth generation (5G) th Next generation NodeB (gNB) and sixth generation (6 thA RAN node is a next-generation base station in a 6G (6th generation) mobile communication system or a base station in a future mobile communication system. A RAN node can be a macro base station (such as 110a in Figure 1), a micro base station, or an indoor station (such as 110b in Figure 1), or a relay node or donor node.

[0088] In another application scenario, multiple RAN nodes can collaborate to help terminals achieve wireless access, with different RAN nodes implementing portions of the base station's functions. For example, a RAN node can be a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). The CU implements the base station's radio resource control protocol and packet data convergence protocol (PDCP) functions, and can also implement the service data adaptation protocol (SDAP) functions; the DU implements the base station's radio link control (RLC) and MAC layer functions, and can also implement some or all of the physical layer functions. For detailed descriptions of each of the above protocol layers, please refer to the relevant 3GPP technical specifications. The RU can be used to implement the transmission and reception of radio frequency signals. The CU and DU can be two independent RAN nodes, or they can be integrated into the same RAN node, such as in a baseband unit (BBU). The RU can be included in radio frequency equipment, such as a remote radio unit (RRU) or an active antenna unit (AAU). The CU can be further divided into two types of RAN nodes: CU-control plane (CU-CP) and CU-user plane (CU-UP).

[0089] In different systems, RAN nodes may have different names. For example, in an O-RAN system, a CU may be called an open CU (O-CU), a DU may be called an open DU (O-DU), and a RU may be called an open RU (O-RU). The RAN node in the embodiments of the present application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module. For example, the RAN node may be a server loaded with the corresponding software module. The embodiments of the present application do not limit the specific technology and specific device form adopted by the RAN node. For ease of description, the following description takes a base station as an example of a RAN node.

[0090] A terminal is a device with wireless transceiver capabilities that can send signals to a base station or receive signals from a base station. A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. A terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle, airplane, ship, robot, robotic arm, smart home device, etc. The embodiments of this application do not limit the specific technology and specific device form adopted by the terminal.

[0091] Base stations and terminals can be fixed or mobile. They can be deployed on land, indoors or outdoors, handheld or vehicle-mounted; on water; or on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of base stations and terminals.

[0092] The roles of base stations and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. To terminals 120j accessing the wireless access network 100 via 120i, terminal 120i is a base station. However, to base station 110a, 120i is a terminal, meaning that communication between 110a and 120i occurs via a wireless air interface protocol. Of course, communication between 110a and 120i can also occur via a base station-to-base station interface protocol. In this case, 120i is also a base station relative to 110a. Therefore, base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be referred to as communication devices with base station functionality, while 120a-120j in Figure 1 can be referred to as communication devices with terminal functionality.

[0093] Communication between base stations and terminals, between base stations, and between terminals can be carried out through authorized spectrum, unauthorized spectrum, or both; communication can be carried out through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz. The embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0094] In the embodiments of the present application, the functions of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem that includes the base station functions. The control subsystem that includes the base station functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal may also be performed by a module (such as a chip or modem) in the terminal, or by a device that includes the terminal functions.

[0095] Figure 2a is a schematic diagram of a communication system provided by an embodiment of the present application. In Figure 2a, the network device is a base station as an example for illustration, and device 1 and device 2 are both terminal devices. As shown in Figure 2a, the communication link between device 1 and device 2 can be called a sidelink (SL), and the communication link between device 1 (or device 2) and the base station can be called an uplink and a downlink, including an uplink and a downlink. It can be seen that a sidelink is a communication mechanism that allows different devices (such as terminal devices) to communicate directly without going through a network device (such as a base station).

[0096] Optionally, in the sidelink, generally speaking, the transmitting device and the receiving device can be a terminal device or network device of the same type, or a road side unit (RSU) and a terminal device, wherein the RSU is a road side station or road side unit from a physical entity point of view, and from a functional point of view, the RSU can be a terminal device or a network device, and this application does not impose any restrictions on this. That is, the transmitting device is a terminal device and the receiving device is also a terminal device; or, the transmitting device is a road side station and the receiving device is also a terminal device; or, the transmitting device is a terminal device and the receiving device is also a road side station. In addition, the sidelink can also be a base station device of the same type or different types. At this time, the function of the sidelink is similar to that of the relay link, but the air interface technology used can be the same or different.

[0097] As shown in Figure 2b, when a terminal device (denoted as UE1) communicates directly with another terminal device (denoted as UE2) without going through a network device, the communication link between the two terminal devices can be called a side link, or the two terminal devices are said to communicate based on the proximity-based services communication 5 (PC5) port.

[0098] As shown in Figure 2c, V2X communication technology, a typical application of sidelinks, leverages and enhances current cellular network features and elements to enable low-latency and high-reliability communications between various nodes in a vehicle network, including vehicle-to-vehicle (V2V), vehicle-to-pedestrian (V2P), vehicle-to-infrastructure (V2I), and vehicle-to-network (V2N). As cellular systems evolve from 4G long-term evolution (LTE) to 5G, C-V2X is evolving from LTE-V2X to NR-V2X (new radio V2X).

[0099] Furthermore, V2X communication has significant potential to reduce vehicle collisions, thereby reducing the number of casualties. The advantages of V2X extend beyond safety. Vehicles capable of V2X communication contribute to better traffic management, further promoting green transportation and lowering energy consumption. Intelligent transportation systems (ITS) are an application that integrates V2X. Based on V2X technology, vehicle users (V-UEs) can transmit information such as their location, speed, and intentions (turns, lane changes, and reversing) to surrounding V-UEs periodically, as well as information triggered by aperiodic events. Similarly, V-UEs receive real-time information from surrounding users. 5G NR V2X supports lower transmission latency, more reliable communication, higher throughput, and a better user experience, meeting the needs of a wider range of application scenarios. Furthermore, the vehicle-to-vehicle communication technology supported by V2X can be extended to device-to-device (D2D) communication in any system.

[0100] In a communication system (such as the one shown in Figures 1, 2a, 2b, or 2c), in a large-scale connection scenario, different terminal devices may share a segment of resources. For example, if the number of terminal devices exceeds the number of resources, the communication resources of different terminal devices may partially or completely overlap. It can be seen that in such a situation, communication interference between different terminal devices is inevitable, which will affect communication performance.

[0101] As an implementation example, interference can be reduced through sparse code multiple access (SCMA) technology. The SCMA technology will be described below with reference to some implementation examples.

[0102] Taking Figure 3 as an example, SCMA uses a fixed codebook to allocate resources. When the number of resources is 4 (or a multiple of 4), the SCMA resource allocation scheme is shown in Figure 3, including:

[0103] The resources allocated to terminal device 1 are resource 3 and resource 4;

[0104] The resources allocated to terminal device 2 are resource 2 and resource 3;

[0105] The resources allocated to terminal device 3 are resource 1 and resource 4;

[0106] The resources allocated to terminal device 4 are resource 2 and resource 4;

[0107] The resources allocated to terminal device 5 are resource 1 and resource 3;

[0108] The resources allocated to terminal device 6 are resource 1 and resource 2.

[0109] In FIG3 , when there are 4 communicable resources, the network device can access 6 terminal devices (ie, 6 users), and the number of available resources for each user is 2, and the overload factor OF=1.5 (ie, 6 / 4=1.5).

[0110] Furthermore, in Figure 3, terminal devices 1, 3, and 4 will experience a resource collision on resource 1, causing interference. Terminal devices 1, 2, and 5 will experience a resource collision on resource 2, causing interference. Terminal devices 2, 4, and 6 will experience a resource collision on resource 3, causing interference. And terminal devices 3, 5, and 6 will experience a resource collision on resource 4, causing interference. In other words, with SCMA, the probability of a transmission collision (or collision loss rate) between resources used by different terminal devices is less than or equal to 1 / 2.

[0111] However, in the communication process based on SCMA technology, since the fixed codebook SCMA is used to determine resources, it is difficult to flexibly design the resource allocation granularity, number of resources, and number of users.

[0112] To address the above issues, this application provides a communication method and related equipment for utilizing the sparsity of intersections between different geometric shapes to reduce communication interference between different communication devices and improve communication performance. This will be described in detail below with reference to the accompanying drawings.

[0113] Please refer to FIG4 , which is a schematic diagram of the communication method provided in this application. The method includes the following steps.

[0114] It should be noted that, while FIG4 illustrates the method using a communication device as an example of the execution subject of the information transmission and reception process, this application does not limit the execution subject of the information transmission and reception process. For example, in FIG4 , the execution subject of the method can be replaced by a chip, chip system, processor, logic module, or software in the communication device. The first communication device can be a network device or a terminal device, for example.

[0115] S401. The first communication device determines K1 resources, and the K1 resources are included in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein, the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i1 is less than or equal to N.

[0116] S402. The first communication device communicates based on K1 resources.

[0117] In this application, the resources involved (for example, any resource among the K1 resources, any resource among the M resources, and any resource among the K2 resources mentioned later) can be one or more resource elements (RE), or one or more resource blocks (RB), or one or more physical resource blocks (PRB).

[0118] Optionally, the resources involved in this application can be replaced by time units, frequency domain units, etc.

[0119] In one possible implementation, before S401, the method further includes: the first communication device receiving first information, where the first information is used to indicate the K1 resources. Accordingly, the process of the first communication device determining the K1 resources in S401 includes: the first communication device determining the K1 resources based on the first information. In other words, the first communication device can receive the first information, and the first communication device determines the K1 resources for communication based on the first information. The first communication device can serve as a resource scheduler and can receive an instruction from a resource scheduler to determine the K1 resources for communication.

[0120] Optionally, the first information may come from another communication device, such as a second communication device, wherein the second communication device may be a network device or a terminal device different from the first communication device.

[0121] In one possible implementation, after the first communications device determines K1 resources in S401, the method further includes: the first communications device sending second information indicating the K1 resources. In this manner, a recipient of the second information can subsequently communicate based on the indication of the second information. The first communications device can act as a resource scheduler, scheduling other devices to communicate using the K1 resources using the second information.

[0122] Optionally, the first communication device may send the second information to another communication device, such as a third communication device, where the third communication device may be a terminal device.

[0123] Optionally, the first information or the second information may indicate the K1 resources in a variety of ways. For example, the first information or the second information may carry one or more of the index of the K1 resources in the time domain, the index of the K1 resources in the frequency domain, and an indication of the number of resources K1.

[0124] In the technical solution based on FIG4 , the K1 resources determined by the first communication device in S401 are included in the M resources, and the first communication device can communicate based on the K1 resources in S402. The M resources correspond to M coordinate points in the N-dimensional coordinate space, respectively, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space. Since the different solutions contained in the solution set of the i1-dimensional subspace can correspond to different geometric figures in space, the implementation method of determining the resource index of the K1 resource in the M resources by using one of the solutions in the solution set can utilize the sparsity of the intersection of different geometric figures (the collision of resources used by different communication devices corresponds to the intersection between the corresponding figures, and if there are fewer intersections, there are fewer resource collisions), reduce the communication interference of different communication devices, and thus improve the communication performance.

[0125] In addition, compared with the implementation process of determining resources using a fixed codebook, when there are multiple solutions in the solution set of the i1-dimensional subspace, the flexibility of the determined resources can be improved by determining the resource index of K1 resources in the M resources by using one of the solutions in the solution set.

[0126] In a possible implementation, the N-dimensional coordinate space is an N-dimensional affine space or an N-dimensional projective space. The N-dimensional coordinate space used to determine the K1 resources can be implemented in any of the above ways to improve the flexibility of the solution implementation.

[0127] Optionally, the N-dimensional coordinate space is an N-dimensional projective space, and the N-dimensional projective space is expressed as PG(N, p), where p is the order of the N-dimensional projective space.

[0128] In one possible implementation, the values ​​of N and p are determined based on the value of M. Specifically, in an N-dimensional projection space, the values ​​of N and p can determine the number of coordinate points in the N-dimensional projection space. To this end, the values ​​of N and p can be determined based on the total number of resources M. In this way, K1 resources for communication can be determined in the N-dimensional projection space that is compatible with the total number of resources M.

[0129] Optionally, the total number of coordinate points in the N-dimensional projection space satisfies: M≤y;

[0130] Where y is the total number of coordinate points in the N-dimensional projection space.

[0131] In one possible implementation, the values ​​of N and p are determined based on third information, which is used to indicate at least one of a lower limit value of the number of communication resources, an upper limit value of the number of communication resources, and the number of communication devices communicating on the M resources. Specifically, in an N-dimensional projection space, the values ​​of N and p can determine the number of resources determined by different solutions in a solution set of a subspace of the N-dimensional projection space. At least one of the above items can be used to determine the values ​​of N and p. In this way, the number of communication resources can be regulated by the values ​​of N and p.

[0132] Optionally, the lower limit value of the resource quantity of the communication resources may be the lower limit value of the resource quantity demanded for the communication resources, that is, the lower limit value is used to indicate the minimum value of the resource quantity of the communication resources. Similarly, the upper limit value of the resource quantity of the communication resources may be the upper limit value of the resource quantity demanded for the communication resources, that is, the lower limit value is used to indicate the maximum value of the resource quantity of the communication resources. For the determining party (e.g., the first communication device) that determines the values ​​of N and p, the determining party may determine the lower limit value and / or upper limit value of the resource quantity of the communication resources based on its own business needs (or indication information of the communication peer).

[0133] Optionally, for the party that determines the values ​​of N and p (such as the first communication device), the party can determine the number of communication devices communicating on the M resources based on its own business needs (or the number information of the communication counterparts).

[0134] Optionally, the solution set of the i1-dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N-i1 equations.

[0135] Optionally, any equation among the N-i1 equations satisfies: a_0*X_0+a_1*X_1+…+a_N*X_N=0;

[0136] Among them, X_0, X_1…X_N represent unknown numbers, and a_0,…,a_N all come from the Galois field GF(p).

[0137] In one possible implementation, the method further includes: the first communication device determining K2 resources, the K2 resources being included in the M resources, K2 being a positive integer, and M being an integer greater than or equal to K2; wherein the resource index of the K2 resources in the M resources is determined by one of the solutions in the solution set of the i2-dimensional subspace of the N-dimensional coordinate space, N being an integer greater than 1, and i2 being less than or equal to N; wherein K1=K2 and i1=i2, or K1≠K2 and i1≠i2; and the first communication device communicating based on the K2 resources. Specifically, in addition to determining the K1 resources, the first communication device may also determine K2 resources, and communicate with different communication devices based on the K1 resources and the K2 resources, respectively.

[0138] Optionally, K1=K2 and i1=i2, or K1≠K2 and i1≠i2.

[0139] For example, taking the example of a first communication device being able to communicate with a second communication device based on K1 resources, and a first communication device being able to communicate with a third communication device based on K2 resources, the solution set of the i1-dimensional subspace of the N-dimensional coordinate space is the solution set of an equation system containing N-i1 equations; correspondingly, the solution set of the i2-dimensional subspace of the N-dimensional coordinate space is the solution set of an equation system containing N-i2 equations.

[0140] Because different solutions to the same number of equations can correspond to the same number of resources, when i1 = i2, the number of resources used by the first communication device for communication with the second communication device (i.e., K1) and the number of resources used by the first communication device for communication with the third communication device (i.e., K2) are the same. In this way, the sparsity of the intersection of different geometric shapes in N-dimensional coordinate space can be exploited to reduce communication interference between different communication devices while also enabling the allocation of the same number of resources to different communication devices, adapting to scenarios where multiple communication devices require the same number of resources.

[0141] Since the number of resources corresponding to different solutions with different numbers of equations may be different, for this reason, in the case of i1≠i2, the number of resources for communication between the first communication device and the second communication device (i.e., K1), and the number of resources for communication between the first communication device and the third communication device (i.e., K2) may be different. In this way, the sparsity of the intersection of different geometric figures can be utilized based on the N-dimensional coordinate space to reduce communication interference between different communication devices, while also enabling the allocation process of different numbers of resources for different communication devices to adapt to scenarios with multiple communication devices with different resource requirements. For example, a solution set with a small number of equations (high dimension) has a larger number than a solution set with a large number of equations (low dimension), corresponding to more resources, thereby supporting the coexistence of communication devices with different rates (more resources represent a higher rate, and conversely, fewer resources represent a lower rate).

[0142] It's understandable that when i1 ≠ i2 , the intersection point between the higher-dimensional space and the lower-dimensional space depends on the lower-dimensional space. For example, two straight lines intersect at most at one point, and a plane and a line (not on that plane) also intersect at most at one point. This also ensures minimal collisions when communication devices of different speeds coexist.

[0143] As an implementation example, for a group of resources containing 15 (i.e., M=15) resources, PG(3,2) (i.e., N=3, p=2) is selected as the coordinate space. According to the definition of the projection space above, the number of points in PG(3,2) is 2 3 +2 2 +2+1=15. Correspond the coordinates of each resource. According to the definition of the projection space above, PG(3,2) has There are 3 (p+1=3) points on each line. In Table 1 below, there are 15 coordinate points, corresponding to 15 resources. The indexes of these 15 resources are "A1-B1", "A1-B2", "A1-B3", "A1-B4", "A1-B5", "A2-B1", "A2-B2", "A2-B3", "A2-B4", "A2-B5", "A3-B1", "A3-B2", "A3-B3", "A3-B4", and "A3-B5".

[0144] Table 1

[0145] In addition, the number of equations corresponding to the solutions in the solution set of the 1-dimensional coordinate space (ie, i=1) is 2 (Ni=3-2=1).

[0146] Taking equation group 1: x=w, y=w as an example, the three solutions [1:1:0:1], [0:0:1:0], and [1:1:1:1] in Table 1 have corresponding resource indexes of "A2-B2", "A3-B2", and "A2-B4", respectively.

[0147] Taking equation group 2: x=w, z=w as an example, the three solutions [1:0:1:1], [1:1:1:1], and [0:1:0:0] in Table 1 have corresponding resource indexes of "A2-B3", "A2-B4", and "A3-B1", respectively.

[0148] Taking equation group 3: x=0, z=0 as an example, the three solutions [0:1:0:0], [0:0:0:1], and [0:1:0:1] in Table 1 have corresponding resource indexes of "A3-B1", "A3-B3", and "A1-B5" respectively.

[0149] In the example shown in FIG4 , the resource indexes of the K1 resources and the resource indexes of the K2 resources may be resource indexes corresponding to any two different sets of equations among the three sets of equations.

[0150] For example, when the resource index of the K1 resources and the resource index of the K2 resources determined by S401 are respectively determined by equation groups 1 and 2, in the process of communication based on K1 resources in S402, there may be a resource conflict between the K1 resources and the K2 resources, that is, the two resources conflict on one of the three resources (indexed as "A2-B4").

[0151] For example, when the resource index of the K1 resources and the resource index of the K2 resources determined by S401 are respectively determined by equation groups 2 and 3, during the communication based on the K1 resources in S402, there may be a resource conflict between the K1 resources and the K2 resources, that is, the two resources conflict on one of the three resources (indexed as "A3-B1").

[0152] For example, when the resource index of the K1 resources and the resource index of the K2 resources determined by S401 are respectively determined by equation groups 1 and 3, in the process of communication based on K1 resources in S402, there is no resource conflict between the K1 resources and the K2 resources, that is, there is no collision between the two.

[0153] As can be seen from the above example, in space, two lines have only one or no intersection. Therefore, the example shown in Table 1 allocates resources to 35 different communication devices, with each receiving 3 resource units. Resources between different communication devices collide at most once, resulting in a collision loss rate of less than or equal to 1 / 3, and an overload factor of OF = 35 / 15 ≈ 2.33.

[0154] Similarly, more design space and gains can be achieved for a larger number of resources, for example:

[0155] When the number of resources is 31 (i.e., M = 31), the coordinate system PG(4, 2) (i.e., N = 4, p = 2) can be used, resulting in 155 lines, each with 3 points. This design can accommodate 155 different communication devices, with each device using 3 resources (e.g., K1 = K2 = 3), a collision loss rate of < 1 / 3, and an overload factor of 5.

[0156] When the number of resources is 40 (i.e., M = 40), the coordinate system PG(3, 3) (i.e., N = 3, p = 3) can be used, resulting in 130 lines, each with 4 points. This design can accommodate 130 different communication devices, with each device using 4 resources (e.g., K1 = K2 = 4), a collision loss rate of < 1 / 4, and an overload factor of 3.25.

[0157] As shown in the above implementation, compared to SCMA, which uses a fixed codebook, the collision loss rate remains at 1 / 2 and the overload factor (OF) remains at 1.5 even when the number of resources increases. This design is more flexible and offers higher gains. This allows us to fully utilize the design space created by more resources, resulting in an allocation scheme with a lower collision loss rate and a higher overload factor (OF).

[0158] In the example shown in Table 1 above, the number of resources (i.e., M) and the number of coordinate points in the projection space can be equal, that is, the two can have a one-to-one correspondence. However, in actual applications, the two may not be equal. The following will describe this with more implementation examples. In the following example, the number of resources is 12 (i.e., M = 12).

[0159] As an implementation example, we can choose the PG(2,3) (i.e. N=2, p=3) coordinate space. According to the definition of the projection space above, the number of points in PG(2,3) is 3. 2 +3+1=13. Each resource is mapped to a coordinate, and 12 of the 13 coordinate points are selected to perform a subsequent resource allocation process with the number of resources being 12, as shown in Table 2 below.

[0160] Table 2

[0161] As another implementation example, we can choose the PG(3, 2) (i.e. N=2, p=3) coordinate space. According to the definition of the projection space above, the number of points in PG(3, 2) is 2 3 +2 2+2+1=15. Each resource is mapped to a coordinate, and 12 of the 15 coordinate points are selected to perform a subsequent resource allocation process with the number of resources being 12, as shown in Table 3 below.

[0162] Table 3

[0163] It can be seen from Tables 2 and 3 that for any number of resources, a design with less collision and less interference can be flexibly generated. The number of resources will not be limited due to being restricted by a fixed codebook (such as the number of resources in SCMA must be a multiple of 4). In addition, among the schemes shown in Tables 2 and 3, the former is closer to surjection than the latter, because compared to "the number of coordinate points of PG (3, 2) is 15", "12" and "the number of coordinate points of PG (2, 3) is 13" are closer. The latter has a smaller granularity than the former (that is, when the resource index is determined as a one-dimensional straight line in space, the granularity refers to the number of points on the straight line (equal to the value of p+1), the former is 4, and the latter is 3), and supports the coexistence of users with different rates.

[0164] In the solution shown in Table 2, since the corresponding coordinates are from two dimensions (i.e., N = 2), the coordinates corresponding to the resources allocated to a communication device can be the "resource line" (i.e., the solution to the system of equations formed by the two equations) of the solution of two linear equations. The number of coordinate points on each resource is four, which means that the communication device can obtain four resources (e.g., K1 = K2 = 4). Referring to the implementation shown in Table 1, it can be seen that the four resources used by different communication devices only collide on one of the resources.

[0165] In the scheme shown in Table 3, since the corresponding coordinates are from three dimensions (i.e., N = 3), the coordinates corresponding to the resources allocated to a communication device can be the "resource line (i.e., the solution to the system of equations formed by the two equations)" of the solutions to two linear equations, with the number of coordinate points on each resource being four, meaning that the communication device can obtain four resources. Alternatively, the coordinates corresponding to the resources allocated to a communication device can be the "resource plane (i.e., the solution to the system of equations formed by the one equation)" of the solutions to a linear equation, with the number of coordinate points on each resource being seven, meaning that the communication device can obtain seven resources. In this way, some communication devices can obtain four resources for communication, while other communication devices can obtain seven resources for communication (e.g., K1 = 4 and K2 = 7), thereby meeting communication requirements at different communication rates. Furthermore, the communication device that obtains seven resources can achieve a higher rate of communication transmission gain.

[0166] Furthermore, when a plane and a line are not coplanar, since the plane and line intersect at most at a single coordinate point, the number of intersections between high-dimensional and low-dimensional space generally depends solely on the low-dimensional space. In other words, the number of intersections is equal to the intersection of two lines of the same low-dimensional space. This property allows users with different speeds to coexist without causing excessive interference.

[0167] In particular, in Tables 2 and 3, if a communication device has a low communication rate requirement, the coordinates of the resources allocated to that communication device may be the "resource line" (i.e., the solution to the system of three equations) that is the solution to the three linear equations. This resource corresponds to a point in the coordinate space, meaning that the communication device can obtain one resource. Consequently, this communication device will only collide with other communication devices on a single resource.

[0168] It can be seen from the above implementation process that the resource index of the K1 resources in the M resources is one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, wherein, when the values ​​of N, i1, etc. are determined, the solution set of the i1-dimensional subspace of the N-dimensional coordinate space is determined. The solution set can also be called a codebook set, and the solutions in the solution set can be called a codebook in the codebook set. In S401, the first communication device does not need to determine the resource index through the aforementioned N-dimensional coordinate space, and the first communication device can determine the resource index of the K1 (or K2) resources in the M resources based on one of the codebooks in the codebook set. The implementation process will be described below in conjunction with the process shown in Figure 4.

[0169] S401. The first communication device determines K1 resources, where resource indexes of the K1 resources are determined by one of the codebooks in the codebook set.

[0170] S402. The first communication device communicates based on the K1 resources.

[0171] Specifically, when the resource indexes of the K1 resources are determined by one of the codebooks in the codebook set, since the codebooks in the codebook set can correspond to some or all of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, this situation can also achieve the technical effects described above. For example, since different codebooks in the codebook set correspond to different solutions contained in the solution set of the i1-dimensional subspace, and the different solutions can correspond to different geometric figures in space, the resource indexes of the K1 resources in the M resources are determined by using one of the codebooks in the codebook set (i.e., one of the solutions in the solution set). This can utilize the sparsity of the intersection of different geometric figures to reduce communication interference between different communication devices, thereby improving communication performance.

[0172] It should be noted that the first communication device can determine other resources (such as the K2 resources described above) through the above-mentioned codebook set. The specific implementation process can be referred to the above description and will not be repeated here.

[0173] Optionally, in the process of the first communication device determining K1 resources by means of the above-mentioned codebook set, the K1 resources can be determined in the codebook set based on the first information sent by other communication devices (for example, the second communication device described above). For example, the first information sent by the other communication device may include the position, index, etc. of the resource index of the K1 resources in the codebook set.

[0174] Optionally, after the first communication device determines K1 resources using the above-mentioned codebook set, the first communication device may send second information to other communication devices (for example, the third communication device described above) to indicate the K1 resources. For example, the second information sent to other communication devices may include the position, index, etc. of the resource index of the K1 resources in the codebook set.

[0175] Exemplarily, the first information and / or the second information may be used to indicate some or all elements included in a codebook corresponding to a codebook index in any of the following tables 4 to 14.

[0176] It can be understood that since the resource index of K1 resources in M ​​resources is one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, in the process of the first communication device determining the K1 resources by means of the above-mentioned codebook set, the codebook contained in the codebook set can also refer to the implementation process of the above-mentioned N-dimensional coordinate space (and related subspaces) and achieve corresponding technical effects.

[0177] For ease of understanding, some implementation examples of codebook sets are provided below through Tables 4 to 14.

[0178] In some embodiments, in the following examples, the information in any of Tables 4 to 14 is considered a codebook set, and the value corresponding to a certain index in any of the tables is a codebook in the codebook set. In actual applications, the information in any of Tables 4 to 14 can be considered a codebook, and the value corresponding to a certain index in any of the tables can be a code in the codebook; in other words, the codebook set described below can be replaced by "codebook", and the codebook described below can be replaced by "code". Alternatively, the information in the following tables can be replaced by other expressions, such as resource set-resource index-resource, resource block set-resource block index-resource block, etc.

[0179] In some embodiments, in the following codebook sets, each codebook set is implemented as a table as an example. However, in actual applications, the codebooks included in different codebook sets can be replaced by matrices, number series or other methods.

[0180] In some embodiments, in the following examples of codebook sets, a codebook set can be understood as a set of resource allocation codes, where each codebook is an ordered sequence of 0s and 1s. Each position in the codebook represents a resource. In the following examples, a 0 at a position indicates that the resource cannot be occupied by (the device assigned to this code), while a 1 indicates that it can be occupied; or, alternatively, a 1 at a position indicates that the resource cannot be occupied by (the device assigned to this code), while a 0 indicates that it can be occupied. The following description uses the former as an example.

[0181] As an implementation example, in the case of p=2, N=2, and i=1, an implementation example of the codebook set is shown in Table 4.

[0182] In some embodiments, in the codebook set shown in Table 4, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=p+1=3, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=7, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in the N-dimensional space, or the number of codebooks in the codebook set) is

[0183] Table 4

[0184] In some embodiments, in Table 4 and other examples below, the number of occupiable resources corresponding to different codebooks included in each table is the same (ie, all are K1).

[0185] In some embodiments, in Table 4 and other examples below, each codebook contains M elements, which can be expressed as: a1, a2...a M .

[0186] Moreover, in Table 4 and other examples below, by comparing “a1, a2...a M" can be used to determine whether there is a resource conflict between different codebooks. For example, in Table 4, the element value contained in codebook index 0 is "1 0 0 1 0 1 0" and the element value contained in codebook index 3 is "0 0 0 0 1 1 1". It can be seen that the value of the element a6 in both is 1, while the values ​​of other elements are not 1 at the same time.

[0187] As can be seen in Table 4 and other examples below, the number of codebooks in the codebook set is the same as the maximum number of supported communication devices when the number of available resources is the same. This can avoid significant communication interference caused by different communication devices occupying exactly the same resources. In this way, resource collisions between resources occupied by different communication devices can occur on at most one resource, minimizing interference.

[0188] Optionally, for a1, a2...a M For the corresponding M resources, there are multiple ways to implement the actual resource mapping location of these M resources. The size of the subscripts "1, 2...M" of these M resources does not mean the resource mapping location relationship of different resources. M The corresponding M resources are taken as an example for explanation.

[0189] Example 1: For a1, a2...a in the codebook M The corresponding M resources and resource indexes are b1, b2...b M The corresponding M resources can be sorted in ascending order according to the subscript index to achieve a one-to-one correspondence between the two groups of M resources. For example, the resource corresponding to a1 in the codebook is the resource with resource index b1, the resource corresponding to a2 in the codebook is the resource with resource index b2, and so on. M The corresponding resource is resource index b M resources.

[0190] Example 2: For a1, a2...a in the codebook M The corresponding M resources and resource indexes are b1, b2...b M The corresponding M resources can be sorted in descending order according to the subscript index, and the latter can be sorted in descending order according to the index in the table below to achieve a one-to-one correspondence between the two groups of M resources. For example, the resource corresponding to a1 in the codebook is resource index b. M The resource corresponding to a2 in the codebook is resource index b M-1 Resources, and so on, in the code book a M The corresponding resource is the resource with resource index b1.

[0191] Example 3: For a1, a2...a in the codebook M The corresponding M resources and resource indexes are b1, b2...b M The corresponding M resources, the subscript indexes of the two can be a corresponding relationship of any order to achieve a one-to-one correspondence between the two groups of M resources. Among them, in the different codebooks contained in the same table, the corresponding relationship between the two groups of M resources of each codebook is the same. For example, in Table 4, taking the resource corresponding to a1 as the resource corresponding to resource index b4 as an example, the values ​​of the first elements in the seven codebooks are "1 0 1 0 1 0 0" respectively. These elements all correspond to the resources corresponding to resource index b4. In other words, the three codebooks with codebook indices of 0, 2, and 4 will occupy the resources corresponding to resource index b4, while other codebooks do not occupy the resources corresponding to resource index b4.

[0192] Optionally, each table in Tables 4 to 14 can be used to represent a codebook set, and in the process of determining resources based on the following codebook set, the resources can be determined based on some or all of the codebooks included in the codebook set. For example, in S401, the first communication device can determine K1 resources based on some or all of the codebooks indicated by some or all of the rows in one of the following tables. In other words, the implementation of 0 or 1 or more codebooks in the multiple codebooks included in each table in Tables 4 to 14 can be deleted to determine K1 resources. In this way, the overhead can be reduced and it is applicable to scenarios with a small number of communication devices, that is, there is no need to assign lines in the N-dimensional space to corresponding communication devices one by one.

[0193] Optionally, in Table 4 and other examples below, for a1, a2...a M For the corresponding M resources, in S401, when determining resources based on the codebook, K1 resources can be determined based on part or all of the M resources. In other words, in Table 4 and the examples below, the M elements included in any codebook can be deleted, that is, the K1 resources are determined by a subset of the codebook set in Table 4 and the examples below.

[0194] For ease of understanding, the implementation process shown in Table 4 is taken as an example below, and one or more elements among the 7 (M=7) elements included in the codebook may be deleted.

[0195] For example, by deleting the element corresponding to "a1", we can get a2...a M For the corresponding M-1 resources, the codebook in Table 4 can be transformed into:

[0196] Codebook index 0, the corresponding codebook is (0,0,1,0,1,0);

[0197] Codebook index 1, the corresponding codebook is (0, 1, 1, 0, 0, 1);

[0198] Codebook index 2, the corresponding codebook is (0, 1, 0, 1, 0, 0);

[0199] Codebook index 3, the corresponding codebook is (0,0,0,1,1,1);

[0200] Codebook index 4, the corresponding codebook is (1, 0, 0, 0, 0, 1);

[0201] Codebook index 5, the corresponding codebook is (1,1,0,0,1,0);

[0202] Codebook index 6, the corresponding codebook is (1, 0, 1, 1, 0, 0).

[0203] For example, by deleting "a1" and "a M-1 " Take the corresponding element as an example, we can get a2...a M For the corresponding M-1 resources, the codebook in Table 4 can be transformed into:

[0204] Codebook index 0, the corresponding codebook is (0,0,1,0,0);

[0205] Codebook index 1, the corresponding codebook is (0, 1, 1, 0, 1);

[0206] Codebook index 2, the corresponding codebook is (0, 1, 0, 1, 0);

[0207] Codebook index 3, the corresponding codebook is (0,0,0,1,1);

[0208] Codebook index 4, the corresponding codebook is (1, 0, 0, 0, 1);

[0209] Codebook index 5, the corresponding codebook is (1,1,0,0,0);

[0210] Codebook index 6, the corresponding codebook is (1, 0, 1, 1, 0).

[0211] As can be seen, this approach improves the flexibility of the solution implementation while ensuring that resource collisions occur on at most one resource for each codebook, minimizing interference. Furthermore, when K1 resources are indicated by indication information (such as the first information and second information described above), overhead can also be reduced.

[0212] Optionally, in actual applications, the number of actually available resources may not be equal to the number of coordinate points (i.e., the total number of resources in each codebook). In the case where the actually available number of resources is greater or less than the number of coordinate points (i.e., the total number of resources in each codebook), resources can still be determined based on the codebooks in Table 4 and related examples.

[0213] For ease of understanding, the implementation process shown in Table 4 is used as an example for explanation below.

[0214] Example A: When the number of actually available resources is less than the number of coordinate points (ie, the total number of resources in each codebook), one or more elements of the 7 (M=7) elements included in the codebook may be deleted.

[0215] For example, if the actual number of available resources is 6, you can delete "a1, a2...a M " is taken as an example, the corresponding M-1 resources can be obtained. Among them, the implementation process of deleting the element corresponding to "a1" can refer to the transformation process of the above example in the codebook in Table 4. Or, when the actual number of available resources is 6, the element corresponding to "a2" can be deleted as an example, and a1, a3...a M For the corresponding M-1 resources, the codebook in Table 4 can be transformed into:

[0216] Codebook index 0, the corresponding codebook is (1, 0, 1, 0, 1, 0);

[0217] Codebook index 1, the corresponding codebook is (0, 1, 1, 0, 0, 1);

[0218] Codebook index 2, the corresponding codebook is (1,1,0,1,0,0);

[0219] Codebook index 3, the corresponding codebook is (0,0,0,1,1,1);

[0220] Codebook index 4, the corresponding codebook is (1, 0, 0, 0, 0, 1);

[0221] Codebook index 5, the corresponding codebook is (0,1,0,0,1,0);

[0222] Codebook index 6, the corresponding codebook is (0, 0, 1, 1, 0, 0).

[0223] For example, if the actual number of available resources is 5, you can delete "a1, a2...a M " Take any element corresponding to " as an example, we can get the corresponding M-2 resources. Among them, deleting "a1" and "a M "The implementation process of the elements corresponding to " can refer to the transformation process of the above example for the codebook in Table 4. Alternatively, when the actual number of available resources is 5, the elements corresponding to "a1" and "a2" can be deleted for example, and a3...a M For the corresponding M-2 resources, the codebook in Table 4 can be transformed into:

[0224] Codebook index 0, the corresponding codebook is (0,1,0,1,0);

[0225] Codebook index 1, the corresponding codebook is (1,1,0,0,1);

[0226] Codebook index 2, the corresponding codebook is (1, 0, 1, 0, 0);

[0227] Codebook index 3, the corresponding codebook is (0,0,1,1,1);

[0228] Codebook index 4, the corresponding codebook is (0,0,0,0,1);

[0229] Codebook index 5, the corresponding codebook is (1, 0, 0, 1, 0);

[0230] Codebook index 6, the corresponding codebook is (0, 1, 1, 0, 0).

[0231] As can be seen, in Example A, while improving the flexibility of the solution implementation, the resources corresponding to each codebook still meet the requirement of a maximum of one resource collision, thereby minimizing interference. Furthermore, when K1 resources are indicated by indication information (such as the first information and second information described above), overhead can also be saved.

[0232] Example B: When the number of actually available resources is greater than the number of coordinate points (ie, the total number of resources in each codebook), the values ​​of the resource numbers corresponding to the two numerical differences may be assumed to be both 0 or both 1.

[0233] For example, if the number of actually available resources is 8, you can M "Add an element before any element corresponding to it, and get M+1 elements to indicate 8 resources.

[0234] Taking the addition of the element "0" before "a1" as an example, the codebook in Table 4 can be transformed into:

[0235] Codebook index 0, the corresponding codebook is (0, 1, 0, 0, 1, 0, 1, 0);

[0236] Codebook index 1, the corresponding codebook is (0, 0, 0, 1, 1, 0, 0, 1);

[0237] Codebook index 2, the corresponding codebook is (0, 1, 0, 1, 0, 1, 0, 0);

[0238] Codebook index 3, the corresponding codebook is (0, 0, 0, 0, 1, 1, 1);

[0239] Codebook index 4, the corresponding codebook is (0, 1, 1, 0, 0, 0, 0, 1);

[0240] Codebook index 5, the corresponding codebook is (0, 0, 1, 1, 0, 0, 1, 0);

[0241] Codebook index 6, the corresponding codebook is (0, 0, 1, 0, 1, 1, 0, 0).

[0242] Taking the addition of element "1" before "a1" as an example, the codebook in Table 4 can be transformed into:

[0243] Codebook index 0, the corresponding codebook is (1, 1, 0, 0, 1, 0, 1, 0);

[0244] Codebook index 1, the corresponding codebook is (1, 0, 0, 1, 1, 0, 0, 1);

[0245] Codebook index 2, the corresponding codebook is (1, 1, 0, 1, 0, 1, 0, 0);

[0246] Codebook index 3, the corresponding codebook is (1, 0, 0, 0, 0, 1, 1, 1);

[0247] Codebook index 4, the corresponding codebook is (1, 1, 1, 0, 0, 0, 0, 1);

[0248] Codebook index 5, the corresponding codebook is (1, 0, 1, 1, 0, 0, 1, 0);

[0249] Codebook index 6, the corresponding codebook is (1, 0, 1, 0, 1, 1, 0, 0).

[0250] Taking the example of adding the element "0" before "a1" and "a2", the codebook in Table 4 can be transformed into:

[0251] Codebook index 0, the corresponding codebook is (1, 0, 0, 0, 1, 0, 1, 0);

[0252] Codebook index 1, the corresponding codebook is (0, 0, 0, 1, 1, 0, 0, 1);

[0253] Codebook index 2, the corresponding codebook is (1, 0, 0, 1, 0, 1, 0, 0);

[0254] Codebook index 3, the corresponding codebook is (0, 0, 0, 0, 0, 1, 1, 1);

[0255] Codebook index 4, the corresponding codebook is (1, 0, 1, 0, 0, 0, 1);

[0256] Codebook index 5, the corresponding codebook is (0, 0, 1, 1, 0, 0, 1, 0);

[0257] Codebook index 6, the corresponding codebook is (0, 0, 1, 0, 1, 1, 0, 0).

[0258] It can be seen that in Example B, while improving the flexibility of the solution implementation, in the manner of adding the element "0", the resources corresponding to each codebook still meet the requirement that a resource collision occurs on at most one resource, thereby minimizing interference.

[0259] Optionally, in Tables 4 to 14, codebooks in different tables may be mixed. For example, codebooks corresponding to some or all rows in one table and codebooks corresponding to some or all rows in another table may form a new codebook set, and resources may be subsequently determined based on the new codebook set.

[0260] In some embodiments, for any two tables with the same value of N and the same value of p, since the number of points on each line in the two tables (that is, the number of available resources in each codebook) may be different, different rates can coexist by mixing codebooks to meet transmission processes with different rate requirements.

[0261] The above examples are mainly described by giving some examples based on the parameters included in Table 4. For the implementation process of Tables 5 to 14, reference can also be made to the description of Table 4 and related implementation examples.

[0262] As an implementation example, in the case of p=2, N=3, and i=1, an implementation example of the codebook set is shown in Table 5.

[0263] It should be understood that in the codebook set shown in Table 5, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the previous description, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p+1=3, and the number of coordinate points (i.e., the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=15, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in N-dimensional space, or the number of codebooks in the codebook set) is

[0264] Table 5

[0265] As an implementation example, in the case of p=2, N=3, i=2, K1=7, and M=15, an implementation example of the codebook set is shown in Table 6.

[0266] It should be understood that in the codebook set shown in Table 5, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=2, the number of points on each line (that is, the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=7, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=15, the number of i-dimensional spaces (where i=2, i.e., the number of i-dimensional spaces can also be the number of faces in N-dimensional space, or the number of codebooks in the codebook set) is

[0267] Table 6

[0268] As an implementation example, in the case of p=2, N=4, i=1, K1=3, and M=31, an implementation example of the codebook set is shown in Table 7.

[0269] It should be understood that in the codebook set shown in Table 7, each codebook corresponds to a line in N-dimensional space. As described above, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=p+1=3, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=31, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in N-dimensional space, or the number of codebooks in the codebook set) is

[0270] Table 7

[0271] As an implementation example, in the case of p=2, N=4, i=2, K1=7, and M=31, an implementation example of the codebook set is shown in Table 8.

[0272] It should be understood that in the codebook set shown in Table 8, each codebook corresponds to a line in N-dimensional space. As can be seen from the above description, when i=2, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=7, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1+…+p+1=31, the number of i-dimensional spaces (where i=2, i.e., the number of i-dimensional spaces can also be the number of faces in N-dimensional space, or the number of codebooks in the codebook set) is

[0273] Table 8

[0274] As an implementation example, in the case of p=2, N=4, i=3, K1=15, and M=31, an implementation example of the codebook set is shown in Table 9.

[0275] It should be understood that in the codebook set shown in Table 9, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=3, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=15, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=31, the number of i-dimensional spaces (i.e., the number of codebooks in the codebook set) is

[0276] Table 9

[0277] As an implementation example, in the case of p=3, N=2, i=1, K1=4, and M=13, an implementation example of the codebook set is shown in Table 10.

[0278] It should be understood that in the codebook set shown in Table 10, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=3+1=4, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=13, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in N-dimensional space, or the number of codebooks in the codebook set) is

[0279] Table 10

[0280] As an implementation example, when p=3, N=3, i=1, K1=4, and M=40, an implementation example of the codebook set is shown in Table 11.

[0281] It should be understood that in the codebook set shown in Table 11, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=p+1=4, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=40, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in the N-dimensional space, or the number of codebooks in the codebook set) is

[0282] Table 11

[0283] As an implementation example, when p=3, N=3, i=2, K1=13, and M=40, an implementation example of the codebook set is shown in Table 12.

[0284] It should be understood that in the codebook set shown in Table 12, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=2, the number of points on each line (that is, the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=13, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=40, the number of i-dimensional spaces (where i=2, i.e., the number of i-dimensional spaces can also be the number of faces in N-dimensional space, or the number of codebooks in the codebook set) is

[0285] Table 12

[0286] As an implementation example, when p=5, N=2, i=1, K1=6, and M=31, an implementation example of the codebook set is shown in Table 13.

[0287] It should be understood that in the codebook set shown in Table 13, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=p+1=6, the number of coordinate points (i.e. the total number of resources in each codebook) is M=pN +p N-1 +…+p+1=31, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in N-dimensional space, or the number of codebooks in the codebook set) is

[0288] Table 13

[0289] As an implementation example, when p=7, N=2, i=1, K1=8, and M=57, an implementation example of the codebook set is shown in Table 14.

[0290] It should be understood that in the codebook set shown in Table 14, each codebook corresponds to a line in N-dimensional space as an example. As can be seen from the above description, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=p+1=8, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=57, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in N-dimensional space, or the number of codebooks in the codebook set) is

[0291] Table 14

[0292] It should be noted that in addition to the implementation methods of Tables 4 to 14 above, N, p, and i can also be implemented by other values ​​(N is an integer greater than 1, p is a positive integer, and i is less than or equal to N) to obtain other tables to represent various possible implementations of the codebook index and the codebook.

[0293] For example, in the case of p=5, N=3, i=1, each codebook corresponds to a line in N-dimensional space. As described above, when i=1, the number of points on each line (i.e., the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1=p+1=6, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1=156, the number of i-dimensional spaces (where i=1, i.e., the number of i-dimensional spaces can also be the number of lines in the N-dimensional space, or the number of codebooks in the codebook set) is

[0294] For example, p=2, N=5, i=1 or 2 or 3 or 4.

[0295] For example, p=2, N=6, i=1 or 2 or 3 or 4 or 5.

[0296] For example, p=3, N=4, i=1 or 2 or 3.

[0297] For example, p=3, N=5, i=1 or 2 or 3 or 4.

[0298] For example, p=5, N=4, i=1 or 2 or 3.

[0299] For another example, p=7, N=3, i=1 or 2.

[0300] In the above example, each codebook corresponds to a line in N-dimensional space. The number of points on each line (ie, the number of available resources in each codebook) is K1=p i +p i-1 +…+p+1, the number of coordinate points (i.e. the total number of resources in each codebook) is M=p N +p N-1 +…+p+1, the number of i-dimensional spaces (i.e., the number of codebooks in the codebook set) is

[0301] Referring to Figure 5, an embodiment of the present application provides a communication device 500. The communication device 500 can implement the functions of the communication devices (e.g., the first communication device, the second communication device, the third communication device, etc.) in the above-described method embodiments, and thus can also achieve the beneficial effects of the above-described method embodiments. In the embodiment of the present application, the communication device 500 can be a communication device, or it can be an integrated circuit or component within the communication device, such as a chip. The following embodiments are described using the communication device 500 as an example.

[0302] In one possible implementation, when the device 500 is used to execute the aforementioned method, the device 500 includes a processing unit 501 and a transceiver unit 502; the processing unit 501 is used to determine K1 resources, where the K1 resources are contained in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i1 is less than or equal to N; the transceiver unit 502 communicates based on the K1 resources.

[0303] It should be noted that, for details of the information execution process and other contents of the units of the above-mentioned communication device 500, please refer to the description in the method embodiment shown above in this application, and will not be repeated here.

[0304] Please refer to Figure 6, which is another schematic structural diagram of a communication device 600 provided in this application. Communication device 600 includes a logic circuit 601 and an input / output interface 602. Communication device 600 may be a chip or an integrated circuit. The transceiver unit 502 shown in Figure 5 may be a communication interface, which may be the input / output interface 602 in Figure 6. The input / output interface 602 may include an input interface and an output interface. Alternatively, the communication interface may be a transceiver circuit, which may include an input interface circuit and an output interface circuit.

[0305] Optionally, the logic circuit 601 is used to determine K1 resources, where the K1 resources are included in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource index of the K1 resource in the M resources is determined by one of the solutions in the solution set of the i1-dimensional subspace of the N-dimensional coordinate space, where N is an integer greater than 1, and i1 is less than or equal to N; the input and output interface 602 communicates based on the K1 resources.

[0306] The logic circuit 601 and the input / output interface 602 may also execute other steps executed by the terminal device or the network device in any embodiment and achieve corresponding beneficial effects, which will not be described in detail here.

[0307] In a possible implementation, the processing unit 501 shown in FIG5 may be the logic circuit 601 in FIG6 .

[0308] Optionally, the logic circuit 601 may be a processing device, and the functions of the processing device may be partially or entirely implemented by software. The functions of the processing device may be partially or entirely implemented by software.

[0309] Optionally, the processing device may include a memory and a processor, wherein the memory is used to store a computer program, and the processor reads and executes the computer program stored in the memory to perform corresponding processing and / or steps in any one of the method embodiments.

[0310] Alternatively, the processing device may include only a processor. A memory for storing the computer program is located outside the processing device, and the processor is connected to the memory via circuits / wires to read and execute the computer program stored in the memory. The memory and processor may be integrated or physically separate.

[0311] Optionally, the processing device may be one or more chips, or one or more processors.

[0312] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), network processors (NP), field programmable gate arrays (FPGA), programmable logic devices (PLD), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0313] An embodiment of the present application also provides a computer-readable storage medium, which is used to store one or more computer-executable instructions. When the computer-executable instructions are executed by a processor, the processor executes the method described in the possible implementation method of the first communication device (such as a terminal device or a network device) in the aforementioned embodiment.

[0314] An embodiment of the present application also provides a computer program product (or computer program). When the computer program in the computer program product is executed by the processor, the processor executes the method of the possible implementation method of the above-mentioned first communication device (such as a terminal device or a network device).

[0315] An embodiment of the present application also provides a chip system, which includes at least one processor for supporting a communication device to implement the functions involved in the possible implementation of the above-mentioned communication device. Optionally, the chip system also includes an interface circuit, which provides program instructions and / or data to the at least one processor. In one possible design, the chip system may also include a memory, which is used to store the necessary program instructions and data for the communication device. The chip system can be composed of chips, or it can include chips and other discrete devices, wherein the communication device can specifically be the first communication device (such as a terminal device or a network device) in the aforementioned method embodiment.

[0316] An embodiment of the present application further provides a communication system, which includes the first communication device in any of the above embodiments.

[0317] Optionally, the communication system further includes other communication devices, such as a second communication device, a third communication device, etc.

[0318] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0319] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0320] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0321] When the communication device is a chip implemented in a terminal, the terminal chip implements the functions of the terminal in the above-described method embodiments. When the terminal chip receives information from a base station, it can be understood that the information is first received by other modules in the terminal (such as a radio frequency module or antenna) and then transmitted to the terminal chip by these modules. When the terminal chip sends information to a base station, it can be understood that the information is first sent to other modules in the terminal (such as a radio frequency module or antenna) and then transmitted to the base station by these modules.

[0322] When the above-mentioned communication device is a chip applied to a base station, the base station chip implements the functions of the base station in the above-mentioned method embodiment. When the base station chip receives information from the terminal, it can be understood that the information is first received by other modules in the base station (such as a radio frequency module or antenna) and then sent to the base station chip by these modules. When the base station chip sends information to the terminal, it can be understood that the information is sent to other modules in the base station (such as a radio frequency module or antenna) and then sent to the terminal by these modules.

[0323] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and storage medium can be located in an ASIC. In addition, the ASIC can be located in a base station or a terminal. The processor and storage medium can also exist in a base station or a terminal as discrete components.

[0324] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0325] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0326] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A communication method, characterized in that: include: Determine K1 resources, wherein the K1 resources are included in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein the M resources correspond to M coordinate points in an N-dimensional coordinate space, respectively, and a resource index of the K1 resource in the M resources is determined by one of the solutions in a solution set of an i1-dimensional subspace of the N-dimensional coordinate space, wherein N is an integer greater than 1, and i1 is less than or equal to N; Communication is performed based on the K1 resources.

2. The method according to claim 1, characterized in that: Also includes: receiving first information, where the first information is used to indicate the K1 resources; The determining K1 resources includes: determining the K1 resources based on the first information.

3. The method according to claim 1, characterized in that: After determining K1 resources, the method further includes: Send second information, where the second information is used to indicate the K1 resources.

4. The method according to any one of claims 1 to 3, characterized in that: The N-dimensional coordinate space is an N-dimensional affine space or an N-dimensional projective space.

5. The method according to any one of claims 1 to 4, characterized in that: The N-dimensional coordinate space is an N-dimensional projection space, and the N-dimensional projection space is expressed as PG(N, p), where p is the order of the N-dimensional projection space.

6. The method according to claim 5, characterized in that The values ​​of N and p are determined based on the value of M.

7. The method according to claim 6, characterized in that The total number of coordinate points in the N-dimensional projection space satisfies: M≤y; Wherein, y is the total number of coordinate points in the N-dimensional projection space.

8. The method according to any one of claims 5 to 7, characterized in that: The values ​​of N and p are determined based on third information, and the third information is used to indicate at least one of a lower limit value of the number of communication resources, an upper limit value of the number of communication resources, and the number of communication devices communicating on the M resources.

9. The method according to any one of claims 1 to 8, characterized in that: The solution set of the i1-dimensional subspace of the N-dimensional coordinate space is the solution set of the equation system containing N-i1 equations.

10. The method according to claim 9, characterized in that Any equation among the N-i1 equations satisfies: a_0*X_0+a_1*X_1+…+a_N*X_N=0; Among them, X_0, X_1…X_N represent unknown numbers, and a_0,…,a_N all come from the Galois field GF(p).

11. The method according to any one of claims 1 to 10, characterized in that: Also includes: Determine K2 resources, wherein the K2 resources are included in the M resources, K2 is a positive integer, and M is an integer greater than or equal to K2; wherein the resource index of the K2 resources in the M resources is determined by one of the solutions in the solution set of the i2-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i2 is less than or equal to N; Communication is performed based on the K2 resources.

12. The method according to any one of claims 1 to 11, characterized in that: The resource is one or more resource units RE, or one or more resource blocks RB, or one or more physical resource blocks PRB.

13. A communication device, characterized in that: including a transceiver unit and a processing unit; The processing unit is used to determine K1 resources, wherein the K1 resources are included in M ​​resources, K1 is a positive integer, and M is an integer greater than or equal to K1; wherein the M resources correspond to M coordinate points in an N-dimensional coordinate space, respectively, and a resource index of the K1 resource in the M resources is determined by one of the solutions in a solution set of an i1-dimensional subspace of the N-dimensional coordinate space, wherein N is an integer greater than 1, and i1 is less than or equal to N; The transceiver unit is used for communicating based on the K1 resources.

14. The device according to claim 13, characterized in that The transceiver unit is further used to receive first information, where the first information is used to indicate the K1 resources; The processing unit is configured to determine K1 resources, including: the processing unit is configured to determine the K1 resources based on the first information.

15. The device according to claim 13, characterized in that The transceiver unit is further used to send second information, where the second information is used to indicate the K1 resources.

16. The device according to any one of claims 13 to 15, characterized in that The N-dimensional coordinate space is an N-dimensional affine space or an N-dimensional projective space.

17. The device according to any one of claims 13 to 16, characterized in that The N-dimensional coordinate space is an N-dimensional projection space, and the N-dimensional projection space is expressed as PG(N, p), where p is the order of the N-dimensional projection space.

18. The device according to claim 17, characterized in that The values ​​of N and p are determined based on the value of M.

19. The device according to claim 18, characterized in that The total number of coordinate points in the N-dimensional projection space satisfies: M≤y; Wherein, y is the total number of coordinate points in the N-dimensional projection space.

20. The device according to any one of claims 17 to 19, characterized in that The values ​​of N and p are determined based on third information, and the third information is used to indicate at least one of a lower limit value of the number of communication resources, an upper limit value of the number of communication resources, and the number of communication devices communicating on the M resources.

21. The device according to any one of claims 13 to 20, characterized in that The solution set of the i1-dimensional subspace of the N-dimensional coordinate space is the solution set of the equation system containing N-i1 equations.

22. The device according to claim 21, characterized in that Any equation among the N-i1 equations satisfies: a_0*X_0+a_1*X_1+…+a_N*X_N=0; Among them, X_0, X_1…X_N represent unknown numbers, and a_0,…,a_N all come from the Galois field GF(p).

23. The device according to any one of claims 13 to 22, characterized in that The processing unit is further used to determine K2 resources, wherein the K2 resources are included in the M resources, K2 is a positive integer, and M is an integer greater than or equal to K2; wherein the resource index of the K2 resources in the M resources is determined by one of the solutions in the solution set of the i2-dimensional subspace of the N-dimensional coordinate space, N is an integer greater than 1, and i2 is less than or equal to N; The transceiver unit is further configured to communicate based on the K2 resources.

24. The device according to any one of claims 13 to 23, characterized in that The resource is one or more resource units RE, or one or more resource blocks RB, or one or more physical resource blocks PRB.

25. A communication device, characterized in that: The method comprises at least one processor; the at least one processor is configured to execute the method according to any one of claims 1 to 12.

26. The communication device according to claim 25, characterized in that The communication device is a chip or a chip system.

27. A computer-readable storage medium, characterized in that: The medium stores instructions, and when the instructions are executed by a computer, the method according to any one of claims 1 to 12 is implemented.

28. A computer program product, characterized in that The method comprises instructions, and when the instructions are executed on a computer, the method according to any one of claims 1 to 12 is implemented.

Images