Communication method and related equipment

Abstract

A communication method and a related device are used for reducing communication interference of different communication devices by using sparsity of intersection of different geometric figures so as to improve communication performance. In the method, K1 resources determined by a first communication device are included in M resources, and the first communication device can communicate based on the K1 resources. Wherein the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource indexes of the K1 resources in the M resources are determined through one solution in a solution set of an i1-dimensional subspace of the N-dimensional coordinate space. Since different solutions contained in the solution set of the i1-dimensional subspace can correspond to different geometric figures in space, the communication interference of different communication devices can be reduced by using the sparsity of intersection of different geometric figures through the implementation mode of determining K1 resources by using one solution in the solution set, so that the communication performance is improved.

Description

Technical Field

[0001] This application relates to the field of communications, and in particular, to a communication method and related devices. Background Art

[0002] Wireless communication can be a transmission communication between two or more communication nodes without propagation via a conductor or cable. The communication nodes generally include network devices and / or terminal devices.

[0003] In a communication system, in a large connection scenario, different terminal devices may share a segment of resources. For example, when the number of terminal devices is greater than the number of resources, the communication resources of different terminal devices may partially or completely overlap.

[0004] However, in the above cases, communication interference between different terminal devices will be inevitable, which will affect communication performance. Summary of the Invention

[0005] This application provides a communication method and related devices, which are used to utilize the sparsity of the intersection of different geometric figures to reduce the communication interference between different communication devices and improve communication performance.

[0006] In a first aspect of this application, a communication method is provided. This method is applied to a first communication device. The first communication device can be a communication device (such as a network device or a terminal device), or the first communication device can be a part of the components in the communication device (such as a processor, a chip, or a chip system, etc.), or the first communication device can also be a logical module or software that can implement all or part of the functions of the communication device. In this method, the first communication device determines K 1 resources, and the K 1 resources are included in M resources. K 1 is a positive integer, and M is an integer greater than or equal to K 1 ; where the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource indices of the K 1 resources among the M resources are determined by one of the solutions in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space. N is an integer greater than 1, and i 1 is less than or equal to N; the first communication device communicates based on the K 1 resources.

[0007] Based on the above technical solution, the K 1 resources determined by the first communication device are included in M resources, and the first communication device can communicate based on the K 1 resources. Among them, the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the K1 The resource index of a resource among the M resources is determined by one of the solutions in the solution set of the i-dimensional subspace of the N-dimensional coordinate space. Since the different solutions contained in the solution set of the i-dimensional subspace can spatially correspond to different geometric figures, by using the implementation method of determining the resource index of K resources among the M resources with one of the solutions in the solution set, the sparsity of the intersection of different geometric figures can be utilized to reduce the communication interference between different communication devices and improve the communication performance. 1 -dimensional subspace, the implementation method of determining the resource index of K resources among the M resources with one of the solutions in the solution set can utilize the sparsity of the intersection of different geometric figures to reduce the communication interference between different communication devices and improve the communication performance. 1 -dimensional subspace, the implementation method of determining the resource index of K resources among the M resources with one of the solutions in the solution set can utilize the sparsity of the intersection of different geometric figures to reduce the communication interference between different communication devices and improve the communication performance. 1 -dimensional subspace, the implementation method of determining the resource index of K resources among the M resources with one of the solutions in the solution set can utilize the sparsity of the intersection of different geometric figures to reduce the communication interference between different communication devices and improve the communication performance.

[0008] 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 i 1 -dimensional subspace, the implementation method of determining the resource index of K resources among the M resources with one of the solutions in the solution set can improve the flexibility of the determined resources. 1 -dimensional subspace, the implementation method of determining the resource index of K resources among the M resources with one of the solutions in the solution set can improve the flexibility of the determined resources.

[0009] In this application, the resources involved (such as any one of the K 1 resources, any one of the M resources, and any one of the K 2 resources mentioned later) can be one or more time units, or one or more frequency domain units, or one or more time-frequency units.

[0010] For example, the time unit can be one or more symbols, one or more mini-slots, one or more slots, one or more sub-frames, one or more frames, etc.

[0011] Again, the frequency domain unit can be one or more sub-carriers, one or more sub-bands, one or more bandwidth parts (BWPs), one or more carriers, etc.

[0012] Again, the time-frequency unit can be one or more resource elements (REs), or one or more resource blocks (RBs), or one or more physical resource blocks (PRBs).

[0013] As can be seen from the above implementation process, the resource index of K 1 resources among the M resources is determined by one of the solutions in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space. Among them, when values such as N and i 1 are determined, the i 1The solution set of the N-dimensional subspace is determined. Among them, this solution set can also be called a codebook set, and the solutions in this solution set can be called codebooks in the codebook set. In other words, in the first aspect, the first communication device can determine the resource indices of the K 1 resources among the M resources based on one of the codebooks in the codebook set. The specific implementation process can refer to the implementation processes shown in Tables 4 to 14 later.

[0014] In a possible implementation manner of the first aspect, the method further includes: the first communication device receives first information, and the first information is used to indicate the K 1 resources. The first communication device determines the K 1 resources, including: the first communication device determines the K 1 resources based on the first information.

[0015] Based on the above technical solution, the first communication device can receive the first information, and the first communication device determines the K 1 resources for communication based on the first information. In other words, the first communication device can be a resource scheduling party, and the first communication device can receive an indication from the resource scheduling party to determine the K 1 resources for communication.

[0016] Optionally, the first information may come from other communication devices. For example, the other communication device may be a network device or a terminal device.

[0017] In a possible implementation manner of the first aspect, after the first communication device determines the K 1 resources, the method further includes: the first communication device sends second information, and the second information is used to indicate the K 1 resources.

[0018] Based on the above technical solution, after the first communication device determines the K 1 resources, the first communication device can also send second information for indicating the K 1 resources, so that the receiving party of the second information can perform communication based on the indication of the second information later. In other words, the first communication device can be a resource scheduling party and schedule other devices to communicate on the K 1 resources through the second information.

[0019] Optionally, the first communication device can send the second information to other communication devices. For example, the other communication device may be a terminal device.

[0020] 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.

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

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

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

[0024] Based on the above technical solution, in the N-dimensional projective space, the values of N and p can determine the number of coordinate points of the N-dimensional projective space in space. For this reason, the values of N and p can be determined based on the total number M of resources. In this way, K 1 resources for communication can be determined on the N-dimensional projective space adapted to the total number M of the resources.

[0025] Optionally, the total number of coordinate points of the N-dimensional projective space satisfies:

[0026]

[0027] M ≤ y;

[0028] where y is the total number of coordinate points of the N-dimensional projective space.

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

[0030] Optionally, the lower limit value of the resource quantity of the communication resources can be understood as the lower limit value of the requirement for the resource quantity of 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 requirement for the resource quantity of 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 (such as the first communication device) for determining the values of N and p, the determining party can determine the lower limit value and / or the upper limit value of the resource quantity of the communication resources based on its own service requirements (or the indication information of the communication peer).

[0031] Optionally, for the determining party (such as the first communication device) for determining the values of N and p, the determining party can determine the number of communication devices communicating on the M resources based on its own service requirements (or the quantity information of the communication peer).

[0032] Based on the above technical solution, in the 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 the subspace of the N-dimensional projective space. In other words, at least one of the above 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.

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

[0034] Optionally, any one of the N - i 1 equations satisfies:

[0035] a_0*X_0 + a_1*X_1 + … + a_N*X_N = 0;

[0036] where X_0, X_1…X_N represent unknowns, and a_0, …, a_N all come from the Galois field GF(p).

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

[0038] Based on the above technical solution, in addition to determining K 1 resources, the first communication device can also determine K 2 resources, and communicate with different communication devices based on the K 1 resources and the K 2 resources respectively.

[0039] Optionally, K 1 = K 2 and i 1 = i 2 , or, K 1 ≠ K 2 and i 1 ≠ i 2 .

[0040] Exemplarily, the first communication device can communicate with the second communication device based on K 1 resources, and the first communication device can communicate with the third communication device based on K 2 resources. Among them, the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N - i 1 equations; correspondingly, the solution set of the i 2 -dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N - i 2 equations.

[0041] Since the number of resources corresponding to different solutions with the same number of equations can be the same, for this reason, when i 1 = i 2 , the number of resources for the first communication device to communicate with the second communication device (i.e., K 1 ), and the number of resources for the first communication device to communicate with the third communication device (i.e., K 2 ) are the same. In this way, based on the sparsity of the intersection of different geometric figures in the N-dimensional coordinate space, while reducing the communication interference between different communication devices, it is also possible to realize the allocation process of the same number of resources for different communication devices to adapt to the scenario of multiple communication devices with the same resource quantity requirements.

[0042] Since the number of resources corresponding to different solutions with different numbers of equations can be different, for this reason, when i 1 ≠ i 2 , the number of resources for the first communication device to communicate with the second communication device (i.e., K 1 ), and the number of resources for the first communication device to communicate with the third communication device (i.e., K 2 ) can be different. In this way, based on the sparsity of the intersection of different geometric figures in the N-dimensional coordinate space, while reducing the communication interference between different communication devices, it is also possible to realize the allocation process of different numbers of resources for different communication devices to adapt to the scenario of multiple communication devices with different resource quantity requirements. For example, the solution set with fewer equations (higher dimension) has a larger number than the solution set with more equations (lower dimension), corresponding to more resources, so as to support the coexistence of communication devices with different rates (the more resources, the higher the rate; conversely, the fewer resources, the lower the rate).

[0043] It can be understood that when i 1 ≠ i 2In the case of, the intersection between a space with a higher dimension and a space with a lower dimension depends on the lower-dimensional space. For example: The intersection between two lines is at most one point, and the intersection between a plane and a line (not on the plane) is also at most one point. This also ensures minimal collisions when communication devices with different rates coexist.

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

[0045] The third aspect of the present application provides a communication device, including at least one processor, and the at least one processor is coupled to a memory; the memory is used to store computer programs or instructions; the at least one processor is used to execute the computer programs or instructions so that the communication device implements the method described in the foregoing first aspect and any one of its possible implementation manners.

[0046] The fourth aspect of the present application provides a communication device, including at least one logic circuit and an input-output interface; the logic circuit is used to execute the method described in the foregoing first aspect and any one of its possible implementation manners.

[0047] The fifth aspect of the present application provides a communication system, and the communication system includes the above-mentioned first communication device.

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

[0049] The sixth aspect of the present application provides a computer-readable storage medium, and the storage medium is used to store 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 foregoing first aspect and any one of its possible implementation manners.

[0050] A seventh aspect of 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 is caused to execute the method described in the first aspect and any possible implementation manner thereof above.

[0051] An eighth aspect of the present application provides a chip system. The chip system includes at least one processor for supporting the chip system to implement the method described in the first aspect and any possible implementation manner thereof above.

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

[0053] Among them, the technical effects brought by any one of the design manners in the second aspect to the eighth aspect can be referred to the technical effects brought by the first aspect and any different design manners thereof above, and will not be elaborated herein. Description of the Drawings

[0054] Figure 1 It is a schematic diagram of the communication system provided by the present application;

[0055] Figures 2a to 2c It is some schematic diagrams of the communication system provided by the present application;

[0056] Figure 3 It is a schematic diagram of the resource allocation related to the present application;

[0057] Figure 4 It is an interaction schematic diagram of the communication method provided by the present application;

[0058] Figures 5 to 6 It is a schematic diagram of the communication device provided by the present application. Detailed Embodiments

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

[0060] (1) Configuration and pre-configuration: In this application, both configuration and pre-configuration are used. Configuration means that network devices such as base stations or servers send the configuration information of some parameters or the values of the parameters to the terminal through messages or signaling, so that the terminal can determine the communication parameters or resources during transmission according to these values or information. Pre-configuration is similar to configuration. It can be the way that network devices such as base stations or servers send parameter information or values to the terminal through communication links or carriers; it can also be the way that the corresponding parameters or parameter values are defined in the standard, or the relevant parameters or values are set in the terminal device in advance. This application does not limit this. Further, these values and parameters can be changed or updated.

[0061] (2) In this application, "for indicating" can include for direct indication and for indirect indication. When it is described 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.

[0062] In this application, the information indicated by the indication information is called 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 the direct indication method, such as indicating through the information to be indicated itself or the index of the information to be indicated, etc. It can also be implemented by the indirect indication method of indicating other information, where there is an association relationship between the other information and the information to be indicated. It can also only indicate a part of the information to be indicated, while the other parts of the information to be indicated are known or pre-agreed. For example, it can also rely on the pre-agreed (such as protocol regulations) arrangement order of each information to achieve the indication of specific information, thereby reducing the indication overhead to a certain extent.

[0063] The information to be indicated can be sent as a whole or divided into multiple sub - information and sent separately. Moreover, the sending periods and / or sending opportunities of these sub - information can be the same or different. The specific sending method is not limited in this application. Among them, the sending periods and / or sending opportunities of these sub - information can be predefined, for example, predefined 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 at least a combination of 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 medium access control control element (MAC CE); physical layer signaling, for example, includes downlink control information (DCI).

[0064] (3) The terms "system" and "network" in the embodiments of this application can be used interchangeably. "At least one" means one or more, and "a plurality" 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 represent: A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the front and back associated objects. "At least one (item)" or its similar expression refers to any combination of these items, including any combination of single - item (item) or plural - item (items). For example, "at least one of A, B, and C" includes A, B, C, AB, AC, BC, or ABC. Also, unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are used to distinguish multiple objects and are not used to limit the order, time sequence, priority, or importance of multiple objects.

[0065] (4) "Transmission" and "reception" in the embodiments of this application indicate the direction of signal transmission. In this application, when entity A transmits information to entity B, it can be that A directly transmits to B, or A transmits to B indirectly through other entities. Similarly, when entity B receives information from entity A, it can be that entity B directly receives the information transmitted by entity A, or entity B receives the information transmitted by entity A indirectly through other entities. Here, entity A and B can be RAN nodes or terminals, or modules inside RAN nodes or terminals. The transmission and reception 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 transmission and reception of information can also be information interaction between two RAN nodes, for example, information interaction between a CU and a DU; the transmission and reception of information can further be information interaction between different modules within 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. "Transmission" can also be understood as the "output" of a chip interface, and "reception" can also be understood as the "input" of a chip interface.

[0066] (5) Affine space: A coordinate space where the coordinates are taken from a Galois field.

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

[0068] (6) Projective space: A coordinate space where the coordinates are taken from a Galois field.

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

[0070] In addition, for [a 0 : a 1 : …: a N , [0:0:…:0] is not a coordinate point.

[0071] In addition, for any b ≠ 0, [a 0 :a 1 :…:a N and [ba 0 :ba 1 :…: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].

[0072] It should be noted that the projective space contains the affine space, that is, the "affine space" is a subset of the "projective space". The points in PG(N, p) can be divided into two types: a 0 = 0 and a 0 ≠ 0. The latter is actually AG(N, p). Since a 0 ≠ 0, there exists b ∈ GF(p) such that ba 0 = 1. In this way, the unified coordinates in the form of [1:a 1 :…:a N are obtained. Ignoring the first coordinate (i.e., the first term in the coordinates) gives the affine space coordinates (a 1 ,a 2 ,…,a N ).

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

[0074] In addition, the number of equations corresponding to an i-dimensional subspace: N - i. Exemplarily, the derivation process is as follows:

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

[0076] One linear equation: N - 1 dimensional subspace. Since there is one restrictive condition, not all points satisfy this equation.

[0077] Two (independent) linear equations: N - 2 dimensional subspace. With two restrictive conditions, the dimension is further reduced. This subspace is the intersection of the N - 1 dimensional subspaces established by these two equations respectively, so the dimension drops by 1. For example: The intersection of two planes (2-dimensional) is a line (1-dimensional), and the intersection of two lines (1-dimensional) is a point (0-dimensional).

[0078] And so on, 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 solution. Here, independent means that no equation is a linear combination of other equations.

[0079] In addition, the number of points on an i - dimensional subspace, that is, the number of solutions of a system of N - i (independent) equations: p i +p i-1 +…+p + 1. Exemplarily, 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) is itself a PG(i, p), so the number of points is p i +p i-1 +…+p + 1.

[0080] Specifically: The number of points on a plane: p 2 +p + 1; The number of points on a line: p + 1; The number of i - dimensional subspaces in PG(N, p) satisfies:

[0081]

[0082] Where, represents the product (or successive multiplication) of i + 1 elements of (p N-i+1 -1), (p N-i+2 -1)…(p N+1 -1), represents the product (or successive multiplication) of i + 1 elements of (p 1 -1), (p 2 -1)…(p i+1 -1). p and N are the inputs of the projective space, N is the dimension, and p is a prime number or an integer power of a prime number. i is the dimension of the subspace of interest, for example, for a line, i = 1.

[0083] Specifically, when i = 1, the number of i - dimensional subspaces can be understood as the number of lines, satisfying:

[0084] Exemplarily, for i = 1, the derivation process is as follows: Among the p N +p N-1 +…+p + 1 points in PG(N, p), 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 in permutations and combinations. However, there are p + 1 points on each line, so there are C(p + 1, 2) = (p + 1)p / 2 pairs of points, all of which determine this line. Therefore, the total number of lines should be the quotient of two numbers:

[0085]

[0086]

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

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

[0089] Please refer to Figure 1 , which is a schematic diagram of the architecture of the communication system 1000 applied in the embodiments of this application. As Figure 1 shown, the communication system includes a radio access network (RAN) 100 and a core network 200. Optionally, the communication system 1000 may further include the Internet 300. Among them, the RAN 100 includes at least one RAN node (such as Figure 1 110a and 110b in Figure 1 , collectively referred to as 110), and may further include at least one terminal (such as Figure 1 120a - 120j in

[0090] 120a - 120j in rd , collectively referred to as 120). The RAN 100 may further include other RAN nodes, for example, wireless relay devices and / or wireless backhaul devices ( Figure 1 not shown in

[0090] ). 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 wiredly. The core network devices in the core network 200 and the RAN nodes 110 in the RAN 100 may be independent different physical devices, or may be the same physical device integrating the logical functions of the core network devices and the logical functions of the RAN nodes. Terminals and terminals, as well as RAN nodes and RAN nodes, can be connected to each other wiredly or wirelessly.

[0090] The RAN 100 may be a 3rd Generation Partnership Project (3 rdThe evolved universal terrestrial radio access (E-UTRA) system, new radio (NR) system, and future radio access systems defined in the 3rd Generation Partnership Project (3GPP). The RAN 100 may also include two or more different radio access systems as described above. The RAN 100 may also be an open RAN (O-RAN).

[0091] RAN nodes, also known as radio access network devices, RAN entities, or access nodes, are used to assist terminals in accessing a communication system wirelessly. In one application scenario, the RAN node can be a base station, evolved NodeB (eNodeB), transmission reception point (TRP), next generation NodeB (gNB) in the 5th Generation (5G) mobile communication system, next generation NodeB in the 6th Generation (6G) mobile communication system, or a base station in a future mobile communication system. The RAN node can be a macro base station (such as 110a in th ), or a micro base station or an indoor station (such as 110b in th ), and can also be a relay node or a donor node. Figure 1 ), or a micro base station or an indoor station (such as 110b in Figure 1 ), and can also be a relay node or a donor node.

[0092] In another application scenario, wireless access for a terminal can be assisted through the cooperation of multiple RAN nodes, where different RAN nodes respectively implement partial functions of a base station. For example, the RAN node can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). Here, the CU completes the functions of the radio resource control protocol and the packet data convergence protocol (PDCP) of the base station, and can also complete the function of the service data adaptation protocol (SDAP); the DU completes the functions of the radio link control (RLC) layer and the MAC layer of the base station, and can also complete partial or all of the functions of the physical layer. For specific descriptions of the above respective protocol layers, reference can be made to the relevant technical specifications of 3GPP. The RU can be used to implement the functions of transmitting and receiving radio frequency signals. The CU and the DU can be two independent RAN nodes, or can be integrated in the same RAN node, for example, integrated in the baseband unit (BBU). The RU can be included in radio frequency equipment, such as included in the remote radio unit (RRU) or the 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).

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

[0094] 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 can also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely applied 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 wearables, smart transportation, smart city, etc. A terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle, aircraft, ship, robot, robotic arm, smart home device, etc. Embodiments of the present application do not limit the specific technologies and specific device forms adopted by the terminal.

[0095] The base station and the terminal can be fixed in position or movable. The base station and the terminal can be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed on aircraft, balloons, and artificial satellites. Embodiments of the present application do not limit the application scenarios of the base station and the terminal.

[0096] The roles of the base station and the terminal can be relative. For example, Figure 1 the helicopter or drone 120i in [Figure] can be configured as a mobile base station. For those terminals 120j that access the radio access network 100 through 120i, the terminal 120i is a base station; but for the base station 110a, 120i is a terminal, that is, the communication between 110a and 120i is through the radio air interface protocol. Of course, the communication between 110a and 120i can also be through the interface protocol between base stations. At this time, relative to 110a, 120i is also a base station. Therefore, both the base station and the terminal can be uniformly referred to as communication devices. Figure 1 The 110a and 110b in [Figure] can be referred to as communication devices with base station functions. Figure 1 The 120a - 120j in [Figure] can be referred to as communication devices with terminal functions.

[0097] Communication can be carried out between a base station and a terminal, between base stations, and between terminals through licensed spectrum, through unlicensed spectrum, or through both licensed and unlicensed spectrum simultaneously; communication can be carried out through spectrum below 6 gigahertz (GHz), through spectrum above 6 GHz, or through both spectrum below 6 GHz and spectrum above 6 GHz simultaneously. Embodiments of this application do not limit the spectrum resources used for wireless communication.

[0098] In embodiments of this application, the functions of a base station can also be performed by a module (such as a chip) in the base station, or by a control subsystem including base station functions. The control subsystem including base station functions here can be a control center in the above application scenarios such as smart grid, industrial control, intelligent transportation, and smart city. The functions of a terminal can also be performed by a module (such as a chip or a modem) in the terminal, or by a device including terminal functions.

[0099] Figure 2a FIG. is a schematic diagram of a communication system provided by an embodiment of this application. In Figure 2a this figure, the network device is taken as an example of a base station for illustration, and both device 1 and device 2 are terminal devices. As Figure 2a shown, the communication link between device 1 and device 2 can be referred to as a sidelink (SL), and the communication link between device 1 (or device 2) and the base station can be referred to as an uplink and downlink, including an uplink and a downlink; it can be seen that the sidelink is a communication mechanism in which different devices (such as terminal devices) communicate directly without passing through a network device (such as a base station).

[0100] Optionally, in the sidelink (SL), generally speaking, the transmitting device and the receiving device can be terminal devices or network devices of the same type, or a roadside unit (RSU) and a terminal device. Among them, from a physical entity perspective, the RSU is a roadside station or a roadside unit, and from a functional perspective, the RSU can be a terminal device or a network device, and this application does not limit 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 roadside station and the receiving device is also a roadside station; or, the transmitting device is a terminal device and the receiving device is a roadside station. In addition, the sidelink can also be base station devices of the same type or different types. At this time, the function of the sidelink is similar to that of a relay link, but the air interface technology used can be the same or different.

[0101] As Figure 2bAs shown in the figure, 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 sidelink, or it can be said that the two terminal devices communicate based on the proximity-based services communication 5 (PC5) interface.

[0102] As Figure 2c shown in the figure, as a typical application of sidelink, V2X communication technology utilizes and enhances the current cellular network functions and elements to achieve low-latency and high-reliability communication among various nodes in a vehicle network, including vehicle-to-vehicle communication (abbreviated as V2V), vehicle-to-pedestrian communication (abbreviated as V2P), vehicle-to-infrastructure communication (abbreviated as V2I), and vehicle-to-network communication (abbreviated as V2N). With the evolution of the cellular system from 4G Long-Term Evolution (abbreviated as LTE) to 5G, C-V2X evolves from LTE-V2X to NR-V2X (New Radio V2X, abbreviated as NR-V2X).

[0103] In addition, V2X communication has great potential in reducing vehicle collision accidents, so it can also reduce the corresponding number of casualties. The advantages of V2X are not limited to improving safety. Vehicles capable of V2X communication contribute to better traffic management, further promoting green transportation and lower energy consumption. The intelligent transportation system (abbreviated as ITS) is an application that combines with V2X. Based on V2X technology, vehicle users (abbreviated as V-UE) can send some of their own information, such as location, speed, intentions (turning, lane changing, reversing), etc., periodically and information triggered by some non-periodic events to surrounding V-UEs. Similarly, V-UEs will also receive information from surrounding users in real time. 5G NR V2X can support lower transmission latency, more reliable communication transmission, higher throughput, better user experience, and meet the needs of a wider range of application scenarios. Further, the vehicle-to-vehicle communication technology supported by V2X can be extended to device-to-device (abbreviated as D2D) communication under any system.

[0104] In a communication system (such as Figure 1 , Figure 2a, Figure 2b or Figure 2c In the communication system shown in Figure 2b or Figure 2c , in the large connection scenario, different terminal devices may share a section of resources. For example, when the number of terminal devices is greater than the number of resources, the communication resources of different terminal devices may partially or completely overlap. It can be seen that in the above cases, communication interference between different terminal devices will be inevitable, which will affect communication performance.

[0105] As an implementation example, through the sparse code multiple access (SCMA) technology, interference can be reduced. Below, the SCMA technology will be described in combination with some implementation examples.

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

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

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

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

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

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

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

[0113] In Figure 3 , when the number of communicable resources is 4, the network device can access 6 terminal devices (i.e., 6 users), and the number of available resources for each user is 2, and the overload factor OF = 1.5 (i.e., 6 / 4 = 1.5).

[0114] In addition, in Figure 3 , the three terminal devices, terminal device 1, terminal device 3, and terminal device 4, will have resource collisions on resource 1 and thus generate interference. The three terminal devices, terminal device 1, terminal device 2, and terminal device 5, will have resource collisions on resource 2 and thus generate interference. The three terminal devices, terminal device 2, terminal device 4, and terminal device 6, will have resource collisions on resource 3 and thus generate interference. The three terminal devices, terminal device 3, terminal device 5, and terminal device 6, will have resource collisions on resource 4 and thus generate interference. In other words, based on the SCMA technology, the probability of resource collisions (or collision loss rate) of resources used by different terminal devices is less than or equal to 1 / 2.

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

[0116] To solve the above problems, the present application provides a communication method and related devices, which are used to utilize the sparsity of the intersection of different geometric figures to reduce the communication interference between different communication devices and improve the communication performance. The following will be introduced in detail with reference to the accompanying drawings.

[0117] Please refer to Figure 4 , which is a schematic diagram of the communication method provided by the present application. The method includes the following steps.

[0118] It should be noted that, in Figure 4 , the communication device is used as an example of the execution subject of the information sending and receiving process to illustrate the method, but the present application does not limit the execution subject of the information sending and receiving process. For example, in Figure 4 , the execution subject of the method can be replaced by a chip, a chip system, a processor, a logic module, or software in the communication device, etc. Among them, the first communication device can be a network device or a terminal device, etc.

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

[0120] S402. The first communication device communicates based on the K 1 resources.

[0121] In the present application, the resources involved (for example, any one of the K 1 resources, any one of the M resources, and any one of the K 2 resources mentioned later) can be one or more resource elements (REs), or one or more resource blocks (RBs), or one or more physical resource blocks (PRBs).

[0122] Optionally, the resources involved in this application may be replaced with time units, frequency domain units, etc.

[0123] In a possible implementation, before S401, the method further includes: the first communication device receives first information, and the first information is used to indicate the K 1 resources. Correspondingly, the process by which the first communication device determines the K 1 resources in S401 includes: the first communication device determines the K 1 resources based on the first information. In other words, the first communication device may receive the first information, and the first communication device determines the K 1 resources for communication based on the first information. The first communication device may act as the resource scheduling party, and the first communication device may receive an indication from the resource scheduling party to determine the K 1 resources for communication.

[0124] Optionally, the first information may come from other communication devices, such as the second communication device. Among them, the second communication device may be a network device or a terminal device different from the first communication device.

[0125] In a possible implementation, after the first communication device determines the K 1 resources in S401, the method further includes: the first communication device sends second information, and the second information is used to indicate the K 1 resources. In this way, the receiving party of the second information can subsequently communicate based on the indication of the second information. The first communication device may act as the resource scheduling party and schedule other devices to communicate on the K 1 resources through the second information.

[0126] Optionally, the first communication device may send the second information to other communication devices, such as the third communication device. Among them, the third communication device may be a terminal device.

[0127] Optionally, the first information or the second information may indicate the K 1 resources in multiple ways. For example, the first information or the second information may carry the index of the K 1 resources in the time domain, the index of the K 1 resources in the frequency domain, and one or more of the indications of the number of resources K 1 .

[0128] Based on Figure 4 the technical solution, the K 1 resources determined by the first communication device in S401 are included in M resources, and the first communication device may, in S402, based on the K 1communicate with M resources. Among them, the M resources respectively correspond to M coordinate points in the N-dimensional coordinate space, and the K 1 resource index of the K resources among the M resources is determined by one solution in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space. Since the different solutions contained in the solution set of the i 1 -dimensional subspace can correspond to different geometric figures in space, by using the implementation method of determining the resource index of the K 1 resources among the M resources with one solution in the solution set, the sparsity of the intersection of different geometric figures can be utilized (the resource collision used by different communication devices corresponds to the intersection point between the figures. If the intersection points are few, the resource collision is few), so as to reduce the communication interference between different communication devices and improve the communication performance.

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

[0130] In a possible implementation manner, the N-dimensional coordinate space is an N-dimensional affine space or an N-dimensional projective space. Among them, the N-dimensional coordinate space used to determine the K 1 resources can be implemented in any of the above ways to improve the flexibility of the scheme implementation.

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

[0132] In a possible implementation manner, the values of N and p are determined based on the value of M. Specifically, in the N-dimensional projective space, the values of N and p can determine the number of coordinate points in the N-dimensional projective space in space. For this reason, the values of N and p can be determined based on the total number M of resources. In this way, the K 1 resources for communication can be determined on the N-dimensional projective space adapted to the total number M of the resources.

[0133] Optionally, the total number of coordinate points of the N-dimensional projective space satisfies:

[0134]

[0135] M ≤ y;

[0136] where y is the total number of coordinate points of the N-dimensional projective space.

[0137] In a 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 the 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 the subspace of the N-dimensional projective space. The above at least one item 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.

[0138] Optionally, the lower limit value of the number of communication resources can be the lower limit value of the demand for the number of communication resources, that is, this lower limit value is used to indicate the minimum value of the number of communication resources. Similarly, the upper limit value of the number of communication resources can be the upper limit value of the demand for the number of communication resources, that is, this lower limit value is used to indicate the maximum value of the number of communication resources. For the determining party (such as the first communication device) that determines the values of N and p, the determining party can determine the lower limit value and / or the upper limit value of the number of communication resources based on its own service requirements (or the indication information of the communication peer).

[0139] Optionally, for the determining party (such as the first communication device) that determines the values of N and p, the determining party can determine the number of communication devices communicating on the M resources based on its own service requirements (or the quantity information of the communication peer).

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

[0141] Optionally, any one of the N - i 1 equations satisfies:

[0142] a_0*X_0 + a_1*X_1 + … + a_N*X_N = 0;

[0143] where X_0, X_1…X_N represent unknowns, and a_0,…,a_N all come from the Galois field GF(p).

[0144] In a possible implementation, the method further includes: the first communication device determines K 2 resources, the K 2 resources are included in the M resources, K 2 is a positive integer, and M is an integer greater than or equal to K 2 ; wherein, the resource indexes of the K 2 resources in the M resources are obtained through the i 2Determined by one of the solutions in the solution set of the i-dimensional subspace, where N is an integer greater than 1, and i 2 is less than or equal to N; where, K 1 = K 2 and i 1 = i 2 , or, K 1 ≠ K 2 and i 1 ≠ i 2 ; The first communication device communicates based on the K 2 resources. Specifically, in addition to determining the K 1 resources, the first communication device can also determine the K 2 resources, and communicate with different communication devices respectively based on the K 1 resources and the K 2 resources.

[0145] Optionally, K 1 = K 2 and i 1 = i 2 , or, K 1 ≠ K 2 and i 1 ≠ i 2 .

[0146] Exemplarily, take the case where the first communication device can communicate with the second communication device based on the K 1 resources, and the first communication device can communicate with the third communication device based on the K 2 resources. Among them, the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N - i 1 equations; correspondingly, the solution set of the i 2 -dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N - i 2 equations.

[0147] Since the number of resources corresponding to different solutions with the same number of equations can be the same, for this reason, when i 1 = i 2 , the number of resources for the first communication device to communicate with the second communication device (i.e., K 1 ), and the number of resources for the first communication device to communicate with the third communication device (i.e., K 2 ) are the same. In this way, based on the sparsity of the intersection of different geometric figures in the N-dimensional coordinate space, while reducing the communication interference of different communication devices, it is also possible to realize the allocation process of the same number of resources for different communication devices to adapt to the scenario of multiple communication devices with the same resource quantity requirements.

[0148] Since the number of resources corresponding to different solutions with different numbers of equations can be different, for this reason, when i 1 ≠ i 2 the number of resources for the first communication device to communicate with the second communication device (i.e., K 1 ), and the number of resources for the first communication device to communicate with the third communication device (i.e., K 2 ) can be different. In this way, based on the sparsity of the intersection of different geometric figures in the N-dimensional coordinate space, while reducing the communication interference between different communication devices, it is also possible to implement the allocation process of different numbers of resources for different communication devices to adapt to the scenario of multiple communication devices with different resource quantity requirements. For example, the solution set with fewer equations (higher dimension) has a larger number than the solution set with more equations (lower dimension), corresponding to more resources, so as to support the coexistence of communication devices with different rates (the more resources, the higher the rate; conversely, the fewer resources, the lower the rate).

[0149] It can be understood that when i 1 ≠ i 2 the intersection point between the higher-dimensional space and the lower-dimensional space depends on the lower space. For example: at most one intersection point between two lines, and also at most one intersection point between a plane and a line (not in the plane). This also ensures the minimum collision when communication devices with different rates coexist.

[0150] 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 projective space in the previous text, the number of points in PG(3, 2) is 2 3 + 2 2 + 2 + 1 = 15. Each resource is corresponding to a coordinate. According to the definition of the projective space in the previous text, PG(3, 2) has a total of 35 lines, and each line has 3 (p + 1 = 3) points. In Table 1 below, there are 15 coordinate points, corresponding to 15 resources respectively. Among them, 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", "A3 - B5".

[0151] Table 1

[0152] Index A1 A2 A3 B1 [1:0:0:0] [1:1:1:0] [0:1:0:0] B2 [1:1:0:0] [1:1:0:1] [0:0:1:0] B3 [1:0:1:0] [1:0:1:1] [0:0:0:1] B4 [1:0:0:1] [1:1:1:1] [0:0:1:1] B5 [0:1:0:1] [0:1:1:0] [0:1:1:1]

[0153] In addition, for the solutions in the solution set of the 1 (i.e., i = 1)-dimensional coordinate space, the number of corresponding equations is 2 (N - i = 3 - 2 = 1).

[0154] Taking the system of equations 1: x = w, y = w as an example, corresponding to the three solutions [1:1:0:1], [0:0:1:0], and [1:1:1:1] in Table 1, the corresponding resource indices are "A2 - B2", "A3 - B2", and "A2 - B4" respectively.

[0155] Taking the system of equations 2: x = w, z = w as an example, corresponding to the three solutions [1:0:1:1], [1:1:1:1], and [0:1:0:0] in Table 1, the corresponding resource indices are "A2 - B3", "A2 - B4", and "A3 - B1" respectively.

[0156] Taking the system of equations 3: x = 0, z = 0 as an example, corresponding to the three solutions [0:1:0:0], [0:0:0:1], and [0:1:0:1] in Table 1, the corresponding resource indices are "A3 - B1", "A3 - B3", and "A1 - B5" respectively.

[0157] In Figure 4 the example shown, the resource indices of K 1 resources and the resource indices of K 2 resources can be the resource indices corresponding to any two different systems of equations among the above three systems of equations.

[0158] For example, when the resource indices of the K 1 resources determined through S401 and the resource indices of the K 2 resources are determined by the system of equations 1 and 2 respectively, during the process of communicating based on the K 1 resources in S402, the K 1 resources and the K 2 resources may have a resource conflict, that is, they conflict on one of the three resources (index "A2 - B4").

[0159] Another example, when the resource indices of the K 1 resources determined through S401 and the resource indices of the K 2 resources are determined by the system of equations 2 and 3 respectively, during the process of communicating based on the K 1 resources in S402, the K 1 resources and the K 2 resources may have a resource conflict, that is, they conflict on one of the three resources (index "A3 - B1").

[0160] Another example, when the K 1The resource index of a resource and K 2 When the resource indices of a resource and K are determined by Equation Sets 1 and 3 respectively, during the communication process based on K for 1 1 resources, K 1 resources and K 2 resources have no resource conflict, that is, there is no collision between them.

[0161] As can be seen from the above example, in space, there is only one intersection point or no intersection point between two lines. Therefore, the example shown in Table 1 can allocate resources to 35 different communication devices, and each communication device obtains 3 resource units. The resource collision between different communication devices occurs at most once. Therefore, the collision loss rate is less than or equal to 1 / 3, and the overload factor OF = 35 / 15 ≈ 2.33.

[0162] Similarly, more design space and gain can be brought for more resource numbers. For example:

[0163] When the number of resources is 31 (i.e., M = 31), the coordinates of PG(4, 2) (i.e., N = 4, p = 2) can be adopted. There are 155 lines in total, and there are 3 points on each line. The corresponding design can support 155 different communication devices. A single communication device can use 3 (for example, K 1 = K 2 = 3) resources, the collision loss rate < 1 / 3, and the overload factor OF = 5.

[0164] When the number of resources is 40 (i.e., M = 40), the coordinates of PG(3, 3) (i.e., N = 3, p = 3) can be adopted. There are 130 lines in total, and there are 4 points on each line. The corresponding design can support 130 different communication devices. A single communication device can use 4 (for example, K 1 = K 2 = 4) resources, the collision loss rate < 1 / 4, and the overload factor OF = 3.25.

[0165] As can be seen from the above implementation process, compared with SCMA based on a fixed codebook, even when the number of resources increases, the collision loss rate is still 1 / 2, and the overload factor OF is still 1.5. However, the above design scheme is more flexible and has higher gain. The design space brought by more resources can be fully utilized to design an allocation scheme with a smaller collision loss rate and a higher overload factor OF.

[0166] In the example shown in Table 1 above, the number of resources (i.e., M) and the number of coordinate points in the projective space can be equal, that is, the two can be in one-to-one correspondence. However, in actual applications, the two may not be equal. More implementation examples will be described below. In the following examples, the number of resources is taken as 12 (i.e., M = 12) as an example.

[0167] As an implementation example, the PG(2, 3) (i.e., N = 2, p = 3) coordinate space can be selected. From the definition of the projective space in the previous text, it can be known that the number of points in PG(2, 3) is 3 2 + 3 + 1 = 13. Corresponding each resource to a coordinate, select 12 of the 13 coordinate points to perform the subsequent resource allocation process with 12 resources, as shown in Table 2 below.

[0168] Table 2

[0169] [1:0:0] [1:0:1] [1:2:1] [1:1:0] [1:0:2] [0:1:0] [1:2:0] [1:1:2] [0:1:1] [1:1:1] [1:2:2] [0:1:2]

[0170] As another implementation example, the PG(3, 2) (i.e., N = 2, p = 3) coordinate space can be selected. From the definition of the projective space in the previous text, it can be known that the number of points in PG(3, 2) is 2 3 + 2 2 + 2 + 1 = 15. Corresponding each resource to a coordinate, select 12 of the 15 coordinate points to perform the subsequent resource allocation process with 12 resources, as shown in Table 3 below.

[0171] Table 3

[0172] [1:0:0:0] [1:1:1:0] [0:1:0:0] [1:1:0:0] [1:1:0:1] [0:0:1:0] [1:0:1:0] [1:0:1:1] [0:0:0:1] [1:0:0:1] [1:1:1:1] [0:0:1:1]

[0173] It can be seen from Table 2 and Table 3 that for any number of resources, a design with few collisions and little interference can be flexibly generated. It will not be restricted by a fixed codebook and limit the number of resources (such as the number of resources in SCMA must be a multiple of 4). In addition, in the schemes shown in Table 2 and Table 3, the former is closer to a surjection than the latter because it is closer to the "number of coordinate points 15 in PG(3, 2)", "12", and "number of coordinate points 13 in PG(2, 3)". The latter has a smaller granularity than the former (i.e., when determining the resource index in the form of 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 it supports the coexistence of users with different rates.

[0174] In the scheme shown in Table 2, since the corresponding coordinates come 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 obtained from the system of equations formed by 2 equations)" of the solutions of 2 linear equations, and the number of coordinate points on each resource is 4, that is, the communication device can obtain 4 resources (for example, K 1 = K 2 = 4). Referring to the implementation method shown in Table 1, the 4 resources used by different communication devices only collide on one of the resources.

[0175] In the solution 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 obtained from the system of equations formed by two equations)" of the solutions of two linear equations, and the number of coordinate points on each resource is 4, that is, the communication device can obtain 4 resources. Or, the coordinates corresponding to the resources allocated to a communication device can be the "resource plane (i.e., the solution obtained from the system of equations formed by one equation)" of the solution of one linear equation, and the number of coordinate points on each resource is 7, that is, the communication device can obtain 7 resources. In this way, some communication devices can obtain 4 resources for communication, and some other communication devices can obtain 7 resources for communication (e.g., K 1 = 4 and K 2 = 7), to meet the communication requirements of different communication rates, and the communication device that obtains 7 resources can achieve a higher communication transmission gain.

[0176] In addition, in the case where the plane and the straight line are not coplanar, since there is at most one coordinate point at the intersection of the plane and the straight line, generally, the number of intersection points between a high-dimensional space and a low-dimensional space only depends on the low-dimensional space, that is to say, the number of intersection points is equal to the intersection points of two straight lines in the same low-dimensional space. Based on this property, different rate users can coexist without causing too much interference.

[0177] Particularly, in Tables 2 and 3, if there is a communication device with a relatively low communication rate requirement, the coordinates corresponding to the resources allocated to this communication device can be the "resource line (i.e., the solution obtained from the system of equations formed by three equations)" of the solutions of three linear equations, and this resource corresponds to a point in the coordinate space, that is, this communication device can obtain 1 resource. Correspondingly, this communication device will only collide with other communication devices on one resource.

[0178] From the above implementation process, it can be seen that the resource index of K 1 resources among M resources is one of the solutions in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space. Among them, when values such as N and i 1 are determined, the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space is determined. Among them, this solution set can also be called a codebook set, and the solutions in this solution set can be called codebooks 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 this first communication device can determine the resource index of the K 1 (or K 2 ) resources among the M resources in the codebook set. The following will describe this implementation process in combination with the Figure 4 shown process.

[0179] S401. The first communication device determines K 1 resources, where the resource indices of the K 1 resources are determined by one of the codebooks in the codebook set.

[0180] S402. The first communication device communicates based on the K 1 resources.

[0181] Specifically, when the resource indices of the K 1 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 i 1 -dimensional subspace of the N-dimensional coordinate space, therefore, the technical effects shown above can also be obtained in this case. For example, since different codebooks in the codebook set correspond to different solutions included in the solution set of the i 1 -dimensional subspace, and the different solutions can correspond to different geometric figures in space, by using the implementation method of determining the resource indices of the K 1 resources among the M resources by one of the codebooks in the codebook set (i.e., one of the solutions in the solution set), the sparsity of the intersection of different geometric figures can be utilized to reduce the communication interference between different communication devices and improve the communication performance.

[0182] It should be noted that the first communication device can determine other resources (such as the K 2 resources described above) through the above codebook set, and the specific implementation process can refer to the description above and will not be elaborated here.

[0183] Optionally, during the process of the first communication device determining the K 1 resources through the above codebook set, it can determine the K 1 resources in the way of the codebook set based on the first information sent by other communication devices (such as the second communication device described above). For example, the first information sent by the other communication device can include the position, index, etc. of the resource indices of the K 1 resources in the codebook set.

[0184] Optionally, after the first communication device determines the K 1 resources through the above codebook set, the first communication device can send second information to other communication devices (such as the third communication device described above) to indicate the K 1 resources. For example, the second information sent to other communication devices can include the position, index, etc. of the resource indices of the K 1 resources in the codebook set.

[0185] Exemplarily, the first information and / or the second information can be used to indicate some or all of the elements included in the codebook corresponding to one of the codebook indexes in any of the following Tables 4 to 14.

[0186] It can be understood that since the resource indexes of K 1 resources among M resources are one of the solutions in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space, for this reason, when the first communication device determines K 1 resources through the above codebook set, the codebooks included in the codebook set can also refer to the implementation process of the above N-dimensional coordinate space (and related subspaces) and achieve corresponding technical effects.

[0187] For the sake of easy understanding, some implementation examples of the codebook set will be provided below through Tables 4 to 14.

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

[0189] In some embodiments, in the following codebook set, taking the implementation of each codebook set in the form of a table as an example, in actual applications, the codebooks included in different codebook sets can be replaced and implemented by matrices, sequences or other means.

[0190] In some embodiments, in the following examples of the codebook set, the codebook set can be understood as a set composed of resource allocation codes, and each codebook is a column of ordered 0s and 1s. Each position on the codebook represents a resource. In the following examples, 0 at a position means that the resource cannot be occupied by the device (assigned to this code), and vice versa, 1 means it can be occupied; or, 1 at a position means that the resource cannot be occupied by the device (assigned to this code), and vice versa, 0 means it can be occupied; the former will be used as an example for description hereinafter.

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

[0192] In some embodiments, in the codebook set shown in Table 4, take the lines in the N-dimensional space corresponding to each codebook as an example. As described above, in the case of i = 1, the number of points on each line (i.e., the available resources of each codebook) is K 1 = p i + p i-1 + … + p + 1 = p + 1 = 3, and the number of coordinate points (i.e., the total resources of each codebook) is M = p N + p N-1 + … + p + 1 = 7. The number of i-dimensional spaces (where i = 1, that is, 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

[0193] Table 4

[0194] Codebook Index Codebook 0 (1,0,0,1,0,1,0) 1 (0,0,1,1,0,0,1) 2 (1,0,1,0,1,0,0) 3 (0,0,0,0,1,1,1) 4 (1,1,0,0,0,0,1) 5 (0,1,1,0,0,1,0) 6 (0,1,0,1,1,0,0)

[0195] In some embodiments, in Table 4 and other examples hereinafter, the available resources corresponding to different codebooks included in each table are the same (i.e., all are K 1 ). Take this as an example.

[0196] In some embodiments, in Table 4 and other examples hereinafter, the number of elements included in each codebook is M, which can be expressed as:

[0197] a 1 、a 2 ...a M 。

[0198] And, in Table 4 and other examples hereinafter, by comparing the values of "a 1 、a 2 ...a M " in different codebooks, it can be determined whether there is a resource conflict in this different codebook. For example, in Table 4, the element values included in codebook index 0 are "1 0 0 10 1 0", and the element values included in codebook index 3 are "0 0 0 0 1 1 1". It can be seen that the values of both are 1 for the element a 6 , while the values of other elements are not 1 at the same time.

[0199] It can be seen that in Table 4 and other examples hereinafter, when the number of codebooks in the codebook set is the same as the available resources, the maximum number of supported communication devices is the same, which can avoid the large communication interference caused by different communication devices occupying exactly the same resources. In this way, it can be ensured that the resources occupied by different communication devices collide at most on one resource, and the interference can be reduced as much as possible.

[0200] Optionally, for a 1 、a2 ...a M For the corresponding M resources, there can be multiple implementation methods for the actual resource mapping positions of these M resources. The magnitudes of the subscripts "1, 2... M" of these M resources do not imply the resource mapping position relationships of different resources. Below, taking the resource indices in ascending order as b 1 、b 2 ...b M For the corresponding M resources as an example, an explanation is given.

[0201] Example 1, for the a 1 、a 2 ...a M corresponding M resources in the codebook and the resources with resource indices b 1 、b 2 ...b M corresponding M resources, both can be sorted in ascending order of subscript index to achieve a one-to-one correspondence between the two sets of M resources. For example, the resource corresponding to a 1 in the codebook is the resource with resource index b 1 , the resource corresponding to a 2 in the codebook is the resource with resource index b 2 , and so on. The resource corresponding to a M in the codebook is the resource with resource index b M .

[0202] Example 2, for the a 1 、a 2 ...a M corresponding M resources in the codebook and the resources with resource indices b 1 、b 2 ...b M corresponding M resources, the former can be sorted in ascending order of subscript index, and the latter can be sorted in descending order of subscript index to achieve a one-to-one correspondence between the two sets of M resources. For example, the resource corresponding to a 1 in the codebook is the resource with resource index b M , the resource corresponding to a 2 in the codebook is the resource with resource index b M-1 , and so on. The resource corresponding to a M in the codebook is the resource with resource index b 1 .

[0203] Example 3, for the a 1 、a 2 ...a M corresponding M resources in the codebook and the resources with resource indices b 1 、b 2 ...b MThe corresponding M resources, and the subscript indexes of the two can have an arbitrary sorting correspondence to achieve a one-to-one correspondence between the two sets of M resources. Among them, in different codebooks included in the same table, the correspondence between the two sets of M resources in each codebook is the same. For example, in Table 4, taking the resources corresponding to a 1 as an example, the values of the first elements in the seven codebooks are respectively "1 0 1 0 1 0 0", and these elements all correspond to the resources with resource index b 4 That is to say, the three codebooks with codebook indexes 0, 2, and 4 will occupy the resources corresponding to resource index b 4 while the other codebooks do not occupy the resources corresponding to resource index b 4 corresponding resources. 4 Corresponding resources.

[0204] Optionally, each of 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, 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 K 1 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 method of deleting 0 or 1 or more codebooks from the multiple codebooks included in each of Tables 4 to 14 can be used to determine K 1 resources. In this way, the overhead can be reduced and it is applicable to the scenario where the number of communication devices is small, that is, there is no need to allocate the lines in the N-dimensional space to the corresponding communication devices one by one.

[0205] Optionally, in Table 4 and other subsequent examples, for the M resources corresponding to a 1 and a 2 ...a M in S401, when determining resources based on the codebook, K 1 resources can be determined based on some or all of the M resources. In other words, in Table 4 and subsequent examples, M elements included in any codebook can be deleted, that is, a subset of the codebook set in Table 4 and subsequent examples is used to determine K 1 resources.

[0206] For ease of understanding, the following will take the implementation process shown in Table 4 as an example, and one or more elements among the 7 (M = 7) elements included in the codebook can be deleted.

[0207] For example, taking the deletion of the element corresponding to "a 1 " as an example, M - 1 resources corresponding to a 2 ...a M can be obtained, and the codebook in Table 4 can be transformed into:

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

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

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

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

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

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

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

[0215] For another example, taking the deletion of the elements corresponding to "a 1 " and "a M-1 " as an example, a 2 ...a M corresponding M - 1 resources can be obtained, and the codebook in Table 4 can be transformed into:

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

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

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

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

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

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

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

[0223] It can be seen that through this method, while improving the flexibility of the scheme implementation, the resources corresponding to each codebook still satisfy that resource collisions occur on at most one resource, which can reduce interference as much as possible. In addition, when indicating K 1 resources through indication information (such as the first information, the second information, etc. mentioned above), the overhead can also be saved.

[0224] Optionally, in practical 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). Among them, when the number of actually available resources is greater than 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.

[0225] For ease of understanding, the implementation process shown in Table 4 will be used as an example for illustration below.

[0226] Example A, when the number of actually available resources is less than the number of coordinate points (i.e., the total number of resources in each codebook), one or more elements among the 7 (M = 7) elements included in the codebook can be deleted.

[0227] For example, when the number of actually available resources is 6, one of the elements corresponding to "a 1 、a 2 ...a M " can be deleted as an example, and the corresponding M - 1 resources can be obtained. Among them, for the implementation process of deleting the element corresponding to "a 1 ", the codebook in Table 4 can refer to the transformation process of the above example. Or, when the number of actually available resources is 6, taking the deletion of the element corresponding to "a 2 " as an example, a 1 、a 3 ...a M corresponding M - 1 resources can be obtained, and the codebook in Table 4 can be transformed into:

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

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

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

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

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

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

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

[0235] Another example, when the number of actually available resources is 5, "a 1 、a 2 ...aM Taking any one of the corresponding elements as an example, M - 2 corresponding resources can be obtained. Among them, deleting "a" 1 " and "a" M The implementation process of deleting the elements corresponding to "" and "a" can refer to the transformation process of the above example in the codebook in Table 4. Or, when the number of actually available resources is 5, "a" can be deleted 1 " and "a" 2 Taking the elements corresponding to "" as an example, a can be obtained 3 ...a M The corresponding M - 2 resources, and the codebook in Table 4 can be transformed into:

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

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

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

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

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

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

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

[0243] It can be seen that in Example A, while the flexibility of the scheme implementation can be improved, the resources corresponding to each codebook still satisfy that resource collisions occur on at most one resource, and interference can be reduced as much as possible. In addition, when indicating K 1 resources through indication information (such as the first information, the second information, etc. mentioned above), the overhead can also be saved.

[0244] Example B, when the number of actually available resources is greater than the number of coordinate points (i.e., the total number of resources of each codebook), it can be defaulted that the values of the resources corresponding to the difference between the two values are both 0 or both 1.

[0245] For example, when the number of actually available resources is 8, a new element can be added before any one of the elements corresponding to "a 1 、a 2 ...a M " to obtain M + 1 elements to implement the indication of 8 resources.

[0246] Taking "a" 1Taking the addition of the new element "0" before "a" as an example, the codebook in Table 4 can be transformed as follows:

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

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

[0249] For codebook index 2, the corresponding codebook is (0, 1, 0, 1, 0, 1, 0, 0);

[0250] For codebook index 3, the corresponding codebook is (0, 0, 0, 0, 0, 1, 1, 1);

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

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

[0253] For codebook index 6, the corresponding codebook is (0, 0, 1, 0, 1, 1, 0, 0).

[0254] Taking the addition of the new element "1" before "a" 1 as an example, the codebook in Table 4 can be transformed as follows:

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

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

[0257] For codebook index 2, the corresponding codebook is (1, 1, 0, 1, 0, 1, 0, 0);

[0258] For codebook index 3, the corresponding codebook is (1, 0, 0, 0, 0, 1, 1, 1);

[0259] For codebook index 4, the corresponding codebook is (1, 1, 1, 0, 0, 0, 0, 1);

[0260] For codebook index 5, the corresponding codebook is (1, 0, 1, 1, 0, 0, 1, 0);

[0261] For codebook index 6, the corresponding codebook is (1, 0, 1, 0, 1, 1, 0, 0).

[0262] Taking the addition of the new element "0" before "a" 1 and before "a" 2 as an example, the codebook in Table 4 can be transformed as follows:

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

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

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

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

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

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

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

[0270] It can be seen that in Example B, while the flexibility of the solution implementation can be improved, in the way of adding the new element "0", the resources corresponding to each codebook still satisfy that there is at most one resource collision on one resource, and the interference can be reduced as much as possible.

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

[0272] In some embodiments, for any two tables with the same values of N and p, since the number of points on each line (i.e., the available resources of each codebook) in these two tables may be different, therefore, different rate coexistence can be achieved through the way of codebook mixing to meet the transmission process with different rate requirements.

[0273] The above examples mainly describe some examples given from the parameters included in Table 4. For the implementation processes of Tables 5 to 14, the descriptions of the above Table 4 and related implementation examples can also be referred to.

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

[0275] It should be understood that in the codebook set shown in Table 5, taking each codebook corresponding to a line in the N-dimensional space as an example. As described above, when i = 1, the number of points on each line (i.e., the available resources of each codebook) is K 1= p + 1 = 3, the number of coordinate points (i.e., the total resources of each codebook) is M = p N + p N-1 + … + p + 1 = 15, the number of i-dimensional spaces (where i = 1, that is, 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

[0276] Table 5

[0277]

[0278]

[0279] As an implementation example, when p = 2, N = 3, i = 2, K 1 = 7, M = 15, an implementation example of the codebook set is shown in Table 6

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

[0281] Table 6

[0282] Codebook Index Codebook 0 (0,0,0,0,0,0,0,0,1,1,1,1,1,1,1) 1 (1,0,0,1,0,1,1,0,0,1,1,0,0,1,0) 2 (0,0,1,1,1,1,0,0,0,0,1,1,0,0,1) 3 (1,1,0,0,0,0,1,1,0,0,1,1,0,0,1) 4 (1,0,0,1,1,0,0,1,1,0,0,1,0,1,0) 5 (1,0,1,0,1,0,1,0,1,0,1,0,1,0,0) 6 (0,0,1,1,0,0,1,1,1,1,0,0,0,0,1) 7 (0,1,1,0,0,1,1,0,1,0,0,1,0,1,0) 8 (1,0,1,0,0,1,0,1,0,1,0,1,1,0,0) 9 (0,1,0,1,0,1,0,1,1,0,1,0,1,0,0) 10 (0,1,1,0,1,0,0,1,0,1,1,0,0,1,0) 11 (0,1,0,1,1,0,1,0,0,1,0,1,1,0,0) 12 (1,1,0,0,1,1,0,0,1,1,0,0,0,0,1) 13 (0,0,0,0,1,1,1,1,0,0,0,0,1,1,1) 14 (1,1,1,1,0,0,0,0,0,0,0,0,1,1,1)

[0283] As an implementation example, when p = 2, N = 4, i = 1, K 1 = 3, M = 31, an implementation example of the codebook set is shown in Table 7

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

[0285] Table 7

[0286]

[0287]

[0288]

[0289]

[0290] As an implementation example, when p = 2, N = 4, i = 2, K 1 = 7, M = 31, an implementation example of the codebook set is shown in Table 8.

[0291] It should be understood that in the codebook set shown in Table 8, taking each codebook corresponding to a line on the N - dimensional space as an example. As described above, when i = 2, the number of points on each line (that is, the available resources of each codebook) is K 1 = p i + p i-1 +…+ p + 1 = 7, the number of coordinate points (that is, the total resources of each codebook) is M = p N + p N-1 +…+ p + 1 = 31, the number of i - dimensional spaces (where i = 2, that is, the number of i - dimensional spaces can also be the number of planes on the N - dimensional space, or the number of codebooks in the codebook set) is

[0292] Table 8

[0293]

[0294]

[0295]

[0296]

[0297]

[0298] As an implementation example, when p = 2, N = 4, i = 3, K 1 = 15, M = 31, an implementation example of the codebook set is shown in Table 9.

[0299] It should be understood that in the codebook set shown in Table 9, taking each codebook corresponding to a line in the N-dimensional space as an example. As described above, in the case of i = 3, the number of points on each line (i.e., the available resources of each codebook) is K 1 = p i + p i-1 + … + p + 1 = 15, and the number of coordinate points (i.e., the total resources of each codebook) is M = p N + p N-1 + … + p + 1 = 31, and the number of i-dimensional spaces (i.e., the number of codebooks in the codebook set) is

[0300] Table 9

[0301] Codebook Index Codebook 0 (0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1) 1 (1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0) 2 (1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0) 3 (0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0) 4 (1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0) 5 (1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0) 6 (1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0,1) 7 (1,0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0) 8 (1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0,1) 9 (0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0) 10 (1,0,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0,1,1,0,0) 11 (0,1,1,0,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,0) 12 (0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1) 13 (0,0,1,1,1,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0,1) 14 (0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,0,1,1,0,0,1,1,0,0,0,0,1) 15 (0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0) 16 (0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0) 17 (0,0,1,1,0,0,1,1,1,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1) 18 (1,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1) 19 (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1) 20 (0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0) 21 (0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1) 22 (0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,0) 23 (1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1) 24 (1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1) 25 (1,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,1,0,0,1,0,1,0) 26 (1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,0,0,1) 27 (0,1,0,1,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0) 28 (1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1) 29 (1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0) 30 (0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,0,0,1)

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

[0303] It should be understood that in the codebook set shown in Table 10, taking each codebook corresponding to a line in the N-dimensional space as an example. As described above, in the case of i = 1, the number of points on each line (i.e., the available resources of each codebook) is K 1 = p i + p i-1 + … + p + 1 = 3 + 1 = 4, and the number of coordinate points (i.e., the total resources of each codebook) is M = p N + p N-1 + … + p + 1 = 13, and the number of i-dimensional spaces (where i = 1, that is, 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

[0304] Table 10

[0305] Codebook Index Codebook 0 (0,1,0,1,0,0,0,0,1,0,0,1,0) 1 (0,1,0,0,0,1,1,0,0,0,1,0,0) 2 (0,0,1,1,0,0,0,1,0,0,1,0,0) 3 (0,0,0,0,0,0,0,0,0,1,1,1,1) 4 (0,0,0,1,1,1,0,0,0,0,0,0,1) 5 (0,0,0,0,0,0,1,1,1,0,0,0,1) 6 (0,1,0,0,1,0,0,1,0,1,0,0,0) 7 (1,0,0,1,0,0,1,0,0,1,0,0,0) 8 (0,0,1,0,0,1,0,0,1,1,0,0,0) 9 (1,0,0,0,1,0,0,0,1,0,1,0,0) 10 (1,0,0,0,0,1,0,1,0,0,0,1,0) 11 (1,1,1,0,0,0,0,0,0,0,0,0,1) 12 (0,0,1,0,1,0,1,0,0,0,0,1,0)

[0306] As an implementation example, in the case of p = 3, N = 3, i = 1, K 1 = 4, M = 40, an implementation example of the codebook set is shown in Table 11

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

[0308] Table 11

[0309]

[0310]

[0311]

[0312]

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

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

[0315] Table 12

[0316]

[0317]

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

[0319] It should be understood that in the codebook set shown in Table 13, taking each codebook corresponding to a line on the N - dimensional space as an example. As described above, when i = 1, the number of points on each line (that is, the available resources of each codebook) is K 1 = p i +p i-1+…+p + 1 = p + 1 = 6, the number of coordinate points (i.e., the total resources of each codebook) is M = p N +p N-1 +…+p + 1 = 31, the number of i-dimensional spaces (where i = 1, that is, 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

[0320] Table 13

[0321]

[0322]

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

[0324] It should be understood that in the codebook set shown in Table 14, taking each codebook corresponding to a line in the N-dimensional space as an example. As described above, when i = 1, the number of points on each line (i.e., the available resources of each codebook) is K 1 = p i +p i-1 +…+p + 1 = p + 1 = 8, the number of coordinate points (i.e., the total resources of each codebook) is M = p N +p N-1 +…+p + 1 = 57, the number of i-dimensional spaces (where i = 1, that is, 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

[0325] Table 14

[0326]

[0327]

[0328]

[0329]

[0330] It should be noted that in addition to the implementation methods of the above Tables 4 to 14, N, p, and i can also be implemented through 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.

[0331] For example, when p = 5, N = 3, and i = 1, take the lines in the N-dimensional space corresponding to each codebook as an example. As described above, when i = 1, the number of points on each line (i.e., the available resources of each codebook) is K 1 = p i + p i-1 + … + p + 1 = p + 1 = 6, and the number of coordinate points (i.e., the total resources of each codebook) is M = p N + p N-1 + … + p + 1 = 156. The number of i-dimensional spaces (where i = 1, that is, 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

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

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

[0334] For another example, p = 3, N = 4, and i = 1 or 2 or 3.

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

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

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

[0338] In the above examples, take the lines in the N-dimensional space corresponding to each codebook as an example. The number of points on each line (i.e., the available resources of each codebook) is K 1 = p i + p i-1 + … + p + 1, and the number of coordinate points (i.e., the total resources of 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

[0339] Please refer 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 (such as the first communication device, the second communication device, the third communication device, etc.) in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiment of the present application, the communication device 500 can be a communication device, or an integrated circuit or component inside the communication device, such as a chip. In the following embodiments, the communication device 500 is taken as a communication device for illustration.

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

[0341] It should be noted that for the information execution process and the like of the units of the foregoing communication device 500, please refer to the description in the method embodiments shown in the foregoing of this application, which will not be elaborated here.

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

[0343] . The input / output interface 602 may include an input interface and an output interface. Alternatively, the communication interface may also be a transceiver circuit, and the transceiver circuit may include an input interface circuit and an output interface circuit.

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

[0344] Among them, the logic circuit 601 and the input / output interface 602 can also execute other steps performed by the terminal device or the network device in any of the embodiments and achieve the corresponding beneficial effects, which will not be elaborated here.

[0345] In a possible implementation, Figure 5 the processing unit 501 shown can be Figure 6 the logic circuit 601 in

[0346] Optionally, the logic circuit 601 can be a processing device, and the functions of the processing device can be implemented partially or entirely by software. Among them, the functions of the processing device can be implemented partially or entirely by software.

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

[0348] Optionally, the processing device can only include a processor. The memory for storing the computer program is located outside the processing device, and the processor is connected to the memory through a circuit / wire to read and execute the computer program stored in the memory. Among them, the memory and the processor can be integrated together, or they can also be physically independent of each other.

[0349] Optionally, the processing device can be one or more chips, or one or more processors.

[0350] It can be understood that the processor in the embodiments of the present application can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), network processors (NPs), field programmable gate arrays (FPGAs), programmable logic devices (PLDs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor can be a microprocessor or any conventional processor.

[0351] An embodiment of the present application also provides a computer-readable storage medium for storing 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 manners of the first communication device (such as a terminal device or a network device) in the foregoing embodiments.

[0352] An embodiment of the present application also provides a computer program product (or a 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 manners of the foregoing first communication device (such as a terminal device or a network device).

[0353] An embodiment of the present application also provides a chip system, which includes at least one processor for supporting the communication device to implement the functions involved in the possible implementation manners of the foregoing communication device. Optionally, the chip system further includes an interface circuit, and the interface circuit provides program instructions and / or data for the at least one processor. In a possible design, the chip system may further include a memory for storing the necessary program instructions and data of the communication device. The chip system may be composed of chips or may include chips and other discrete devices, where the communication device may specifically be the first communication device (such as a terminal device or a network device) in the foregoing method embodiments.

[0354] An embodiment of the present application also provides a communication system, which includes the first communication device in any of the foregoing embodiments.

[0355] Optionally, the communication system further includes other communication devices, such as a second communication device, a third communication device, and the like.

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

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

[0358] In addition, in each embodiment of the present application, each functional unit may be integrated in a processing unit, may exist physically alone for each unit, or two or more units may be integrated in one unit.

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

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

[0361] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions executable by a processor. The software instructions may be composed of corresponding software modules. The software modules may be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a removable hard disk, a 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 may also be a component of the processor. The processor and the storage medium may be located in an ASIC. In addition, the ASIC may be located in a base station or a terminal. The processor and the storage medium may also exist as discrete components in a base station or a terminal.

[0362] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part 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 executed in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable devices. The computer program or instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer program or instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center in a wired or wireless manner. The computer-readable storage medium can be any available medium that the computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, a hard disk, or a magnetic tape; it can also be an optical medium, such as a digital video disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile types of storage media.

[0363] In various embodiments of the present application, if there is no special explanation and logical conflict, the terms and / or descriptions between different embodiments are consistent and can be cross-referenced to each other. The technical features in different embodiments can be combined to form new embodiments according to their internal logical relationships.

[0364] It can be understood that the various numerical numbers involved in the embodiments of the present application are only for the convenience of description and do not limit the scope of the embodiments of the present application. The magnitude of the serial numbers of the above processes does not mean the order of execution. The order of execution of each process should be determined by its function and internal logic.

Claims

1. A communication method, characterized in that, comprising: Determine K 1 resources, and the K 1 resources are included in M resources. K 1 is a positive integer, and M is an integer greater than or equal to K 1 ; among them, the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource index of the K 1 resources among the M resources is determined by one of the solutions in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space. N is an integer greater than 1, and i 1 is less than or equal to N; Communicate based on the described K 1 resources.

2. The method according to claim 1, characterized in that, further comprising: Receive first information, the first information being used to indicate the 1 K resources; The determination of K 1 resources include: determining the K 1 resources based on the first information.

3. The method according to claim 1, characterized in that, Said determination of K 1 After said 1 resources, the method further comprises: Send a second message, where the second message is used to indicate the 1 K 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 projective space, and the N-dimensional projective space is represented as PG(N, p), where p is the order of the N-dimensional projective 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 projective space satisfies: M ≤ y; where y is the total number of coordinate points in the N-dimensional projective 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 i 1 -dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N - i 1 equations.

10. The method according to claim 9, characterized in that, The N-i 1 Any one of the following equations is satisfied: a_0*X_0 + a_1*X_1 + … + a_N*X_N = 0; where X_0, X_1…X_N represent unknowns, 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, further comprising: Determine K 2 resources, and the 2 K resources are included in the M resources. K 2 is a positive integer, and M is an integer greater than or equal to K 2 ; wherein, the resource indices of the 2 K resources in the M resources are determined by one of the solutions in the solution set of the 2 i-dimensional subspace of the N-dimensional coordinate space. N is an integer greater than 1, and i 2 is less than or equal to N; Communicate based on the described K 2 resources.

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

13. A communication device, characterized in that, comprising a transceiver unit and a processing unit; The processing unit is used to determine K 1 resources, and the K 1 resources are included in M resources. K 1 is a positive integer, and M is an integer greater than or equal to K 1 ; among them, the M resources respectively correspond to M coordinate points in an N-dimensional coordinate space, and the resource indexes of the K 1 resources among the M resources are determined by one of the solutions in the solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space. N is an integer greater than 1, and i 1 is less than or equal to N. The transceiver unit is used to communicate based on the 1 K resources.

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

15. The device according to claim 13, characterized in that, The transceiver unit is further configured to send second information, and the second information is used to indicate the K 1 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 projective space, and the N-dimensional projective space is represented as PG(N, p), where p is the order of the N-dimensional projective 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 projective space satisfies: M ≤ y; where y is the total number of coordinate points in the N-dimensional projective 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, where 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 apparatus according to any one of claims 13 to 20, wherein, The solution set of the i 1 -dimensional subspace of the N-dimensional coordinate space is the solution set of a system of equations containing N - i 1 equations.

22. The apparatus according to claim 21, wherein, The said N-i 1 Any one of the following equations is satisfied: a_0*X_0 + a_1*X_1 + … + a_N*X_N = 0; where X_0, X_1…X_N represent unknowns, and a_0, …, a_N all come from the Galois field GF(p).

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

24. The apparatus according to any one of claims 13 to 23, wherein, The resource is one or more resource elements RE, or one or more resource blocks RB, or one or more physical resource blocks PRB.

25. A communication apparatus, wherein, 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 apparatus according to claim 25, wherein, The communication apparatus is a chip or a chip system.

27. A computer-readable storage medium, wherein, 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, wherein, comprises instructions, and when the instructions are run on a computer, the method according to any one of claims 1 to 12 is implemented.

Images