Communication method, communication apparatus, and storage medium

Abstract

The embodiments of the present application are applied to the technical field of communications. Provided are a communication method, a communication apparatus, and a storage medium, which are used for solving the problem of a constellation diagram having a relatively poor distribution performance after being subjected to superposition. The method in the embodiments of the present application comprises: obtaining a first signal on the basis of X constellation points of a first constellation diagram, wherein X is determined on the basis of a modulation order and the number N of users using a first resource, the first constellation diagram is a lattice-structured constellation diagram, and both X and N are positive integers; and sending the first signal on the first resource. In the embodiments of the present application, a constellation diagram which has been subjected to superposition is directly optimized, and the constellation diagram which has been subjected to superposition is designed by using a lattice structure, thereby improving the performance.

Description

Communication method, communication apparatus and storage medium TECHNICAL FIELD

[0001] Embodiments of the present application relate to the technical field of communication, and in particular to a communication method, a communication apparatus and a storage medium. BACKGROUND

[0002] With the continuous evolution of wireless cellular networks, orthogonal multiple access technologies have gradually failed to meet the increasing demand for cellular networks, such as the capacity demand brought by massive access and continuous improvement of spectrum efficiency. At the same time, the research and application of non-orthogonal multiple access technologies are gradually attracting more and more attention from the industry and academia. People hope that future wireless cellular networks can effectively solve the problem of capacity improvement with the help of non-orthogonal multiple access technologies.

[0003] Sparse code multiple access (SCMA) technology and low density signature (LDS) technology are two typical non-orthogonal multiple access and transmission technologies with similar principles. This kind of technology superimposes M data streams from one or more users on N subcarriers for transmission (M and N are both integers not less than 1), where each data of each data stream is spread to N subcarriers by sparse spreading. When the value of M is greater than N, this kind of technology can effectively improve the network capacity, including the number of users that the system can access and the spectrum efficiency.

[0004] In existing SCMA research, constellation point optimization is an important research direction. The current optimization mainly assumes independent optimization of constellation points, and then superimposes in a linear superposition manner. However, this linear superposition manner may result in small distance of superimposed constellation points, thereby resulting in poor constellation point distribution performance.

[0005] SUMMARY

[0006] The present application provides a communication method, a communication apparatus and a storage medium, which are used to solve the problem of poor distribution performance of superimposed constellation diagram, and can directly optimize the superimposed constellation diagram, use the superimposed constellation diagram designed by lattice structure, and thereby realize performance improvement.

[0007] The first aspect of the present application provides a communication method. Optionally, the execution subject of the method can be a first device, which can be a network device, a component or device (such as a processor, a chip, or a chip system, etc.) applied to the network device, or a logic module or software (such as a central unit (CU), a distributed unit (DU), or a radio unit (RU), etc.) capable of realizing all or part of the network device functions. Taking the network device as an example, in the method, the network device obtains a first signal based on X constellation points of a first constellation diagram, wherein X is determined according to a modulation order and a number N of users using a first resource, the first constellation diagram is a lattice constellation diagram, and X and N are positive integers. The network device transmits the first signal on the first resource.

[0008] Based on the first aspect of the present application, by determining the first constellation diagram, the superimposed constellation diagram is directly optimized, and then the mapping is performed according to the optimized constellation diagram, thereby improving the anti-noise performance and distribution performance of the system. Moreover, since the first constellation diagram is a lattice constellation diagram, the Euclidean distance between the constellation points in the constellation diagram is optimized.

[0009] Based on the first aspect of the present application, in some possible implementation manners, the X constellation points of the first constellation diagram are obtained by dividing Y constellation points of a second constellation diagram using a first window function, the second constellation diagram is a lattice constellation diagram, and Y is a positive integer greater than X.

[0010] In the present embodiment, the first constellation diagram is obtained by dividing a larger constellation diagram, i.e., the second constellation diagram, so that the number of constellation points is met while the Euclidean distance between the constellation points in the first constellation diagram is ensured, thereby improving the distribution performance of the superimposed constellation diagram and further improving the link performance of the SCMA or LDS system.

[0011] Based on the first aspect of the present application, in some possible implementation manners, the first window function is a circular window function, a rectangular window function, or a hexagonal window function.

[0012] Since the first constellation diagram is obtained by dividing the second constellation diagram using the circular window function, the rectangular window function, or the hexagonal window function, the distribution of the constellation points in the first constellation diagram is more symmetrical, thereby optimizing the distribution performance of the first constellation diagram.

[0013] Based on the first aspect of the present application, in some possible implementation manners, the first constellation diagram is composed of X constellation points of Z constellation points of a third constellation diagram, the Z constellation points of the third constellation diagram are obtained by dividing Y constellation points of a second constellation diagram using a first window function, Z is a positive integer greater than X, and X is determined according to a modulation order and N.

[0014] The first constellation diagram can be composed of part of the constellation points in the third constellation diagram after the second constellation diagram is divided, and thus the constellation points with better distribution performance in the third constellation diagram can be selected, so that the distribution performance of the first constellation diagram is optimized.

[0015] In some possible implementation manners based on the first aspect of the present application, the first constellation diagram is composed of X constellation points in Y constellation points of the second constellation diagram, and Y is a positive integer greater than X.

[0016] Since the first constellation diagram is obtained by selecting part of the constellation points in the second constellation diagram, the distribution performance of the first constellation diagram can be optimized by selecting the constellation points.

[0017] In some possible implementation manners based on the first aspect of the present application, the first signal is obtained by mapping the X constellation points to the first resource, and the user data streams of the N users are mapped to the X constellation points.

[0018] In the embodiment, the first constellation diagram is determined, so that the superimposed constellation diagram is directly optimized, and then the mapping is performed according to the optimized constellation diagram, thereby improving the anti-noise performance and distribution performance of the system.

[0019] In some possible implementation manners based on the first aspect of the present application, the user data streams of the N users are mapped to the X constellation points based on a first mapping criterion, and the first mapping criterion corresponds to the first resource.

[0020] Since the constellation diagrams corresponding to different carriers are different, and the distance distributions are usually different, the mutual information of the multi-dimensional constellation diagram is improved. Based on the constellation diagrams corresponding to different carriers, the corresponding mapping criterion is needed to implement the resource mapping.

[0021] In some possible implementation manners based on the first aspect of the present application, the first mapping criterion is used to indicate that the minimum Euclidean distance (MED) of the first constellation diagram is maximum.

[0022] In the embodiment, the user data streams are mapped based on the maximum MED of the first constellation diagram, so that the access performance of the system is improved.

[0023] The second aspect of the present application provides a communication method. Optionally, the execution subject of the method can be a second device, which can be a terminal device, a component or device (such as a processor, a chip, or a chip system) applied to the terminal device, or a logic module or software capable of realizing all or part of the functions of the terminal device. Taking the terminal device as an example, in the method, the terminal device receives a first signal on a first resource, the first signal is obtained based on X constellation points of a first constellation diagram, the X constellation points are used to map user data streams of N users, the first constellation diagram is a lattice constellation diagram, and X and N are positive integers. The terminal device obtains a user data stream of a first user according to the X constellation points, and the first user is any one of the N users.

[0024] Based on the second aspect of the present application, by mapping based on the first constellation diagram, the anti-noise performance and distribution performance of the system are improved. Moreover, since the first constellation diagram is a lattice constellation diagram, the Euclidean distances between the constellation points in the constellation diagram are optimized.

[0025] Based on the second aspect of the present application, in some possible implementation manners, the user data stream of the first user is mapped to M constellation points in the X constellation points, and M is less than X.

[0026] Based on the first aspect or the second aspect of the present application, in some possible implementation manners, the lattice constellation diagram is a constellation diagram generated based on Eisenstein integers, or the lattice constellation diagram is a constellation diagram generated based on Gaussian integers.

[0027] Since the first constellation diagram is a lattice constellation diagram, the Euclidean distances between the constellation points in the superimposed constellation diagram can be ensured, thereby improving the anti-noise performance and distribution performance of the system.

[0028] Based on the first aspect or the second aspect of the present application, in some possible implementation manners, the first constellation diagram satisfies at least one of the following conditions:

[0029] The total energy of the first constellation diagram is less than a first preset value;

[0030] The constellation points in the first constellation diagram are symmetrical; or

[0031] The minimum Euclidean distance MED of the first constellation diagram is greater than a second preset value.

[0032] By limiting the conditions satisfied by the first constellation diagram, the distribution performance of the superimposed constellation diagram is better, and thus the link performance of the SCMA or LDS system is improved.

[0033] The third aspect of the present application provides a communication device, which comprises:

[0034] The processing module is configured to obtain the first signal based on X constellation points of a first constellation diagram, where X is determined according to a modulation order and a number N of users using the first resource, the first constellation diagram is a lattice constellation diagram, and X and N are positive integers.

[0035] The interface module is configured to send the first signal on the first resource.

[0036] The fourth aspect of the present application provides a communication device, which includes:

[0037] The interface module is configured to receive the first signal on the first resource, where the first signal is obtained based on X constellation points of a first constellation diagram, the X constellation points are used to map user data streams of N users, the first constellation diagram is a lattice constellation diagram, and X and N are positive integers.

[0038] The processing module is configured to obtain the user data stream of the first user according to the X constellation points, where the first user is any one of the N users.

[0039] The fifth aspect of the embodiments of the present application provides a communication device, which can be the first device or the second device, can be a component (for example, a processor, a chip, or a chip system, etc.) applied to the first device or the second device, can also be a logic module or software (such as a CU, a DU, or a RU, etc.) capable of realizing all or part of the functions of the first device or the second device. The communication device includes:

[0040] The processor is configured to execute a program, so that the communication device performs the method described in the first aspect or the second aspect and any possible implementation manner thereof.

[0041] Optionally, the communication device further includes a memory, and the processor is coupled with the memory; and the memory is configured to store the program.

[0042] The sixth aspect of the present application provides a chip or a chip system, which includes at least one processor and a communication interface, the communication interface and the at least one processor are interconnected through a line, and the at least one processor is configured to run a computer program or instructions to perform the communication method described in any one of the first aspect or the second aspect and any possible implementation manner thereof.

[0043] In the chip, the communication interface can be an input / output interface, a pin, or a circuit, etc.

[0044] In a possible implementation, the chip or the chip system described in the present application further includes at least one memory, and the at least one memory stores instructions. The memory can be a storage unit inside the chip, for example, a register, a cache, etc., or can be a storage unit of the chip, for example, a read-only memory, a random access memory, etc.

[0045] The seventh aspect of the present application provides a communication system, comprising a communication device performing the method according to the first aspect and any possible implementation thereof, and a communication device performing the method according to the second aspect and any possible implementation thereof.

[0046] The eighth aspect of the present application provides a computer readable storage medium, comprising instructions which, when executed on a computer, cause the computer to perform the method according to the first aspect, or cause the computer to perform the method according to the second aspect.

[0047] The ninth aspect of the present application provides a computer program product comprising instructions which, when executed on a computer, cause the computer to perform the method according to the first aspect, or cause the computer to perform the method according to the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0048] Fig. 1 is a schematic diagram of encoding principle of a transmitting end of SCMA technology and LDS technology according to an embodiment of the present application;

[0049] Fig. 2 is a network structure diagram according to an embodiment of the present application;

[0050] Fig. 3 is a schematic diagram of an embodiment of an application scenario of the communication method according to an embodiment of the present application;

[0051] Fig. 4 is a schematic diagram of an embodiment of a constellation diagram of linear superposition according to an embodiment of the present application;

[0052] Fig. 5 is a schematic diagram of an embodiment of the communication method according to an embodiment of the present application;

[0053] Fig. 6 is a schematic diagram of an embodiment of a constellation diagram generated based on Eisenstein integers according to an embodiment of the present application;

[0054] Fig. 7 is a schematic diagram of an embodiment of a constellation diagram generated based on Eisenstein integers using circular window segmentation according to an embodiment of the present application;

[0055] Fig. 8 is a schematic diagram of an embodiment of a constellation diagram generated based on Eisenstein integers using rectangular window segmentation according to an embodiment of the present application;

[0056] Fig. 9 is a schematic diagram of an embodiment of a constellation diagram generated based on Gaussian integers according to an embodiment of the present application;

[0057] Fig. 10 is a schematic diagram of an embodiment of a constellation diagram generated based on Gaussian integers using circular window segmentation according to an embodiment of the present application;

[0058] Fig. 11 is a schematic diagram of an embodiment of a constellation diagram generated based on Gaussian integers using rectangular window segmentation according to an embodiment of the present application;

[0059] FIG. 12 is a schematic diagram of one embodiment of mapping to a first constellation in the embodiments of the present application;

[0060] FIG. 13 is a schematic diagram of one embodiment of a communication device in the embodiments of the present application;

[0061] FIG. 14 is a schematic diagram of another embodiment of a communication device in the embodiments of the present application;

[0062] FIG. 15 is a schematic diagram of another embodiment of a communication device in the embodiments of the present application;

[0063] FIG. 16 is a schematic diagram of another embodiment of a communication device in the embodiments of the present application. DETAILED DESCRIPTION

[0064] The present application provides a communication method, a communication device and a storage medium, which are used to solve the problem of poor distribution performance of superimposed constellation, and can improve the performance by directly optimizing the superimposed constellation and using the superimposed constellation designed by lattice structure.

[0065] The embodiments of the present application will be described below with reference to the drawings. It is obvious to those skilled in the art that with the development of technology and the emergence of new scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0066] The terms "first", "second", and the like in the specification, claims, and drawings of the present application are used to distinguish similar objects, and do not necessarily have to describe a specific order or sequence. It should be understood that the terms used in this way can be interchanged under appropriate circumstances, and this is only a distinguishing way used in the description of the embodiments of the present application to describe the objects with the same attributes. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, so that the processes, methods, systems, products or equipment containing a series of units do not have to be limited to those units, but can include other units not clearly listed or inherent to these processes, methods, products or equipment.

[0067] First, some technical terms involved in the embodiments of the present application are introduced.

[0068] 1. Orthogonal multiple access technology:

[0069] Orthogonal multiple access (OMA) is a multiple access technique that utilizes the orthogonality of resources to distinguish between different users' access methods. In OMA, each user uses an orthogonal channel for communication, which is independent of other users' channels and does not interfere with each other, allowing concurrent transmission without collision. In OMA, channel resources are divided into multiple orthogonal parts, each of which is allocated to a user. These orthogonal parts can be different frequency bands, such as frequency division multiple access (FDMA), different time windows, such as time division multiple access (TDMA), or different spreading codes, such as code division multiple access (CDMA).

[0070] FDMA is used to divide the communication frequency band into several segments, each of which is allocated to a user, and interference between frequency bands is avoided by setting a guard band.

[0071] TDMA is based on FDMA, further dividing the frequency band into multiple time windows, and each user occupies a specific time window during communication.

[0072] The principle of CDMA is based on spread spectrum technology, which modulates the information data to be transmitted with a high-speed pseudo-random code with a bandwidth much larger than the signal bandwidth, so that the original data signal bandwidth is expanded, and then modulated and sent out by carrier. The receiving end uses the same pseudo-random code to correlate with the received wideband signal to convert the wideband signal into the original information data narrowband signal, i.e. de-spreading, to achieve information communication.

[0073] 2. Non-orthogonal multiple access technology:

[0074] Non-orthogonal multiple access (NOMA) is an advanced wireless communication technology, whose core idea is that multiple users can share resources non-orthogonally on the same time-frequency resource, thereby realizing multiple access in the power domain. NOMA allows multiple users to share the same time-frequency resource non-orthogonally in the power domain. This means that different users' data signals overlap in time, frequency, or code domain when transmitted, but are distinguished at the receiving end through specific signal processing techniques.

[0075] Sparse Code Multiple Access (SCMA) and Low Density Signature (LDS) are two typical non-orthogonal multiple access and transmission technologies with similar principles. The technologies superimpose M (M is an integer not less than 1) data streams from one or more users onto N (N is an integer not less than 1) subcarriers for transmission, where each data of each data stream is spread onto N subcarriers by sparse spreading. When the value of M is greater than N, the technologies can effectively improve network capacity, including system accessible user number and spectrum efficiency, etc.

[0076] FIG. 1 shows a schematic diagram of encoding principles of a SCMA technology and an LDS technology transmitting end. There are M=6 variable nodes and N=4 function nodes in total, each variable node represents a data stream, and each function node represents a subcarrier or a resource element (RE). For convenience of description, the variable node appearing hereinafter is equivalent to the data stream represented by the variable node, and the function node is equivalent to the subcarrier or resource element represented by the function node. The M=6 variable nodes form a SCMA group or an LDS group, and the N=4 function nodes form a SCMA encoding block or an LDS encoding block. The connection between the variable node and the function node represents that the data of the variable node will be transmitted as non-zero symbols on the function node after spreading. As can be seen from the figure, the data of each variable node will be transmitted as non-zero symbols on multiple function nodes after spreading, and the data transmitted by each function node is the superposition of non-zero symbols obtained by spreading the data from multiple variable nodes. For example, the data s3 of the variable node 3 will be transmitted as non-zero symbols on the function node 1 and the function node 2 after spreading, and the data x2 transmitted by the function node 3 is the superposition of non-zero symbols obtained by spreading the data s2, s4 and s6 of the variable node 2, the variable node 4 and the variable node 6, respectively.

[0077] In the SCMA group and the LDS group, the subcarriers or resource elements on which the data in the data stream is transmitted as non-zero symbols after spreading are determined by the SCMA characteristic matrix and the LDS signature matrix, respectively. The SCMA characteristic matrix and the LDS signature matrix have the following form:

[0078] Wherein, the N rows represent the N function nodes in a SCMA encoding block or an LDS encoding block, and the M columns represent the M variable nodes in a SCMA group or an LDS group. Although the SCMA characteristic matrix and the LDS signature matrix can be expressed in a general form, they have their own matrix characteristics.

[0079] The SCMA feature matrix has the following characteristics:

[0080] 1) The elements in the SCMA feature matrix satisfy r n,m ∈{0,1}, 1≤n≤N, 1≤m≤M. Wherein, r n,m =1 indicates that the data of variable node m is sent after spreading non-zero symbol on function node n. r n,m =0 indicates that the data of variable node m is sent after spreading zero symbol on function node n;

[0081] 2) Generally, the number of 0 elements is not less than the number of 1, so as to reflect the characteristics of sparse coding.

[0082] The matrix satisfying the above characteristics can be called SCMA feature matrix. At the same time, we call the column in the feature matrix as SCMA feature sequence, which corresponds to a variable node and reflects which function nodes the data of the variable node is sent after spreading non-zero symbol. Therefore, the SCMA feature matrix can be regarded as a matrix composed of a series of SCMA feature sequences. The column in the feature matrix can be expressed as:

[0083] The LDS signature matrix has the following characteristics:

[0084] 1) The elements in the LDS signature matrix satisfy r n,m ∈{0,α*exp(j*β)}, 1≤n≤N, 1≤m≤M, α≠0. Wherein, r n,m =α*exp(j*β) indicates that the data of variable node m is sent after spreading non-zero symbol on function node n. r n,m =0 indicates that the data of variable node m is sent after spreading zero symbol on function node n;

[0085] 2) Generally, the number of 0 elements is not less than the number of non-zero elements, so as to reflect the characteristics of low density coding.

[0086] The matrix satisfying the above characteristics can be called LDS signature matrix. At the same time, we call the column in the signature matrix as LDS signature sequence, which corresponds to a variable node. Unlike SCMA feature sequence, LDS signature sequence not only reflects which function nodes the data of the corresponding variable node is sent after spreading non-zero symbol, but also is used for the calculation of the non-zero symbol. Similarly, the LDS signature matrix can be regarded as a matrix composed of a series of LDS signature sequences. The column in the signature matrix can be expressed as:

[0087] For ease of description, the feature matrix and feature sequence mentioned below are equivalent to the SCMA feature matrix and SCMA feature sequence, respectively, and the signature matrix and signature sequence are equivalent to the LDS signature matrix and LDS signature sequence, respectively.

[0088] Based on the above descriptions of the features and signature matrices, in the example given in Figure 1, the corresponding feature and signature matrices are as follows:

[0089] as well as

[0090] The feature matrix and feature sequence, as well as the signature matrix and signature sequence, reflect or determine which functional nodes transmit non-zero symbols after the data in the data stream has been spread. The non-zero symbols transmitted at the corresponding functional nodes after data spread are determined by the codebook. The codebook has the following form:

[0091] A codebook consists of one or more codewords. A codeword has the following form:

[0092] The number of codewords Q in the codebook m The codebook is determined by the modulation order corresponding to it. For example, the codebook for Quadrature Phase Shift Keying (QPSK) or 4th order modulation consists of 4 codewords, i.e., Q... m =4, and each codeword corresponds to a combination of 2 data bits according to a certain mapping relationship. For example, 00 corresponds to codeword 1, 01 corresponds to codeword 2, 10 corresponds to codeword 3, and 11 corresponds to codeword 4. For SCMA and LDS, each codeword in the codebook is a vector composed of N elements, where the positions of the non-zero elements are determined by the feature sequence and signature sequence corresponding to the codebook, and the positions of the non-zero elements are the same for all codewords in the same codebook.

[0093] Based on the above, when using QPSK or 4th-order modulation, the codebook used by variable node 3 in Figure 1 should have the following form:

[0094] As can be seen from the above description, there is a one-to-one relationship between codebooks and sequences, meaning that one SCMA codebook or LDS codebook uniquely corresponds to one SCMA feature sequence or LDS signature sequence; while there is a one-to-many relationship between sequences and codebooks, meaning that one SCMA feature sequence or LDS signature sequence corresponds to one or more SCMA codebooks or LDS codebooks. The correspondence between sequences and codebooks is determined by the following two conditions:

[0095] Condition 1: the code word in the codebook has the same number of elements as the corresponding signature sequence or signature vector;

[0096] Condition 2: the code word in the codebook has the same non-zero element position as the corresponding signature sequence or signature vector.

[0097] For example, the SCMA codebook or the LDS codebook is:

[0098] The corresponding signature sequence or signature vector is respectively:

[0099] The representation and storage form of the codebook in the SCMA system (a system applying SCMA technology, hereinafter referred to as SCMA system) and the LDS system (a system applying LDS technology, hereinafter referred to as LDS system) are generally different. In the SCMA system, the codebook is usually directly represented and stored, for example, the codebook or each code word in the codebook described above is directly stored, or the non-zero elements are stored. In the LDS system, the signature matrix or signature sequence and the modulation constellation are usually directly represented and stored, and the codebook is indirectly generated through the signature sequence and the modulation constellation. A commonly used generation method is to multiply the signature sequence and the constellation point or modulation symbol in the modulation constellation, for example, when Qm-order modulation is used, the signature sequence is:

[0100] The corresponding variable node uses the codebook:

[0101] Where q i is the constellation point or modulation symbol in the Q m -order modulation constellation, 1≤i≤Q m . Therefore, when QPSK or 4-order modulation is used, the LDS codebook used by the variable node 3 in FIG. 1 is:

[0102] 3, constellation diagram:

[0103] The constellation diagram is a commonly used tool for representing the discrete states of the modulation signal. These discrete states are called symbol points on the vector diagram, and the combination of symbol points constitutes a constellation diagram. The symbol point is also called a constellation point. The constellation diagram is a two-dimensional graph, whose horizontal and vertical axes represent the in-phase and quadrature components of the modulation signal, respectively. The two components together determine the position of the symbol point in the complex plane.

[0104] Please refer to FIG. 2, the network architecture based on which the communication method in the embodiment of the present application is described as follows:

[0105] FIG. 2 is a schematic diagram of a possible, non-limiting system. As shown in FIG. 2, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. The RAN 100 includes at least one RAN node (e.g., 110a and 110b in FIG. 2, collectively referred to as 110) and at least one terminal (e.g., 120a-120j in FIG. 2, collectively referred to as 120). Other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in FIG. 2), can also be included in the RAN 100. The terminal 120 is wirelessly connected to the RAN node 110. The RAN node 110 is connected to the core network 200 by wire or wirelessly. The core network devices in the core network 200 and the RAN nodes 110 in the RAN 100 can be different physical devices respectively, or can be the same physical device integrated with the logical functions of the core network and the radio access network.

[0106] The RAN 100 can be a 3rd generation partnership project (3GPP)-related cellular system, such as a 4th generation mobile communication technology (4G), a 5th generation mobile communication technology (5G) mobile communication system, or a future mobile communication system. The RAN 100 can also be an open-radio access network (ORAN), a cloud-radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN 100 can also be a communication system in which two or more of the above systems are integrated.

[0107] The RAN node 110, which can also be referred to as an access network device, a RAN entity, or an access node, etc., forms part of the communication system, and is configured to facilitate wireless access to the communication system by terminals. The RAN nodes 110 in the communication system 10 can be of the same type or different types. In some scenarios, the roles of the RAN node 110 and the terminal 120 are relative, e.g., the network element 120i in Figure 2 can be a helicopter or a drone, which can be configured to move as a mobile base station, to the terminal 120j accessing the RAN 100 via the network element 120i, the network element 120i is a base station; but to the base station 110a, the network element 120i is a terminal. Both the RAN node 110 and the terminal 120 are sometimes referred to as communication apparatuses, e.g., the network elements 110a and 110b in Figure 2 can be understood as communication apparatuses with base station functionalities, and the network elements 120a-120j can be understood as communication apparatuses with terminal functionalities.

[0108] In a possible scenario, the RAN node can be a base station (BS), an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a next generation base station in a future mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc. The RAN node can be a macro base station (e.g., 110a in Figure 2), a micro base station or an indoor station (e.g., 110b in Figure 2), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in vehicle to everything (V2X) technology can be a road side unit (RSU). All or part of the functions of the RAN node in this application can also be implemented by software functions running on hardware, or by virtualized functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be provided with a communication module, circuit or chip for performing corresponding communication functions, and program instructions for performing corresponding communication functions. The RAN node in this application can also be a logical node, a logical module or software that can implement all or part of the functions of the RAN node.

[0109] In another possible scenario, multiple RAN nodes cooperate to assist a terminal to implement wireless access, and different RAN nodes respectively implement part of functions of a base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), a CU-CP, a CU-UP, or a radio unit (RU), etc. The CU and the DU can be separately configured, or can also be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna processing unit (AAU), or a remote radio head (RRH).

[0110] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0111] A terminal can be a device or module with corresponding communication functions and can access the above-mentioned communication system. The terminal can also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. The terminal can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, remote medical treatment, smart grid, smart home, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, unmanned aerial vehicle, helicopter, airplane, ship, robot, mechanical arm, smart home device, transport vehicle with wireless communication function, communication module, etc. Embodiments of the present application do not limit the device form of the terminal. The terminal usually has a communication module, circuit or chip for performing corresponding communication functions. The terminal can also be configured with program instructions for performing corresponding communication functions.

[0112] In addition, the embodiments of the present application can also be applicable to other future-oriented communication technologies. The network architecture and service scenarios described in the present application are for more clearly illustrating the technical solutions of the present application and do not constitute a limitation on the technical solutions provided by the present application. Those skilled in the art can know that, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided by the present application are also applicable to similar technical problems.

[0113] FIG. 3 shows an application scenario to which embodiments of the present application are applicable. Terminal device 302, terminal device 303, terminal device 304 and terminal device 305 are connected to network device 301. Network device 301 superimposes information to be sent to multiple terminal devices on the same resource. For example, network device 301 superimposes information to be sent to terminal device 302, terminal device 303 and terminal device 304 on the same carrier, and the information of each terminal device is mapped in the same constellation diagram in the form of a symbol point in the constellation diagram.

[0114] As shown in FIG. 4, since the constellation diagrams corresponding to multiple terminal devices are superimposed in a linear superimposition manner, the Euclidean distance between symbol points in the superimposed constellation diagram is uncertain, which can cause the Euclidean distance between symbol points to be too small, thereby causing poor constellation point distribution performance.

[0115] Based on this, the embodiments of the present application provide a method. Please refer to FIG. 5, a communication method in the embodiments of the present application includes:

[0116] 501、obtain a first signal based on X constellation points of a first constellation diagram;

[0117] The step 501 can be executed by a network device or by a module (such as a processor, a chip, a chip system, a circuit, etc.) therein. Taking the network device as an example, the network device obtains a first signal based on X constellation points of a first constellation diagram.

[0118] The network device maps user data streams of N users on constellation points of the first constellation diagram, and then maps the constellation points of the first constellation diagram on a first resource to obtain a first signal. The first constellation diagram is one of the constellation diagrams generated by superposition of a constellation with a quadrature amplitude modulation (QAM) structure or a regular hexagon structure. The set composed of the vertices of the uniform square or the vertices and the center point of the uniform hexagon is called a lattice structure. The first constellation diagram includes X constellation points, and X is determined according to a modulation order and the number N of users using the first resource, that is, X = M N N. The first constellation diagram can have multiple design methods, which are described as follows.

[0119] Method 1: The first constellation diagram is designed based on a constellation diagram generated by Eisenstein integers, as shown in FIG. 6. The constellation diagram generated by Eisenstein integers is also called a lattice constellation diagram, and the Euclidean distance from each point to all adjacent constellation points is equal. Therefore, the lattice constellation diagram is the constellation diagram with the optimal Euclidean distance in all two-dimensional constellation diagrams (i.e., one-dimensional complex constellation diagram). The coordinates of the constellation points of the lattice constellation diagram are represented as: x = [1, w] · z

[0120] wherein z is an integer, and w is For example, when z is 1 or -1, the coordinates are or

[0121] In a possible implementation, a second constellation diagram is generated based on Eisenstein integers, and the number of constellation points in the second constellation diagram is greater than the number of constellation points in the first constellation diagram.

[0122] Optionally, the network device divides Y constellation points in the second constellation diagram using a first window function to obtain X constellation points to form the first constellation diagram. The window function is a mathematical function used for truncation processing of a signal to reduce spectral energy leakage. The basic definition of the window function is: in order to reduce spectral energy leakage, different functions can be used for truncation of a signal, and these truncation functions are called window functions, which are simply referred to as windows.

[0123] For example, the first window function is a circular window, as shown in FIG. 7. The first constellation diagram shown in FIG. 7 can be regarded as segmenting the Y constellation points in the second constellation diagram shown in FIG. 6 using a circular window to obtain X constellation points. The X constellation points form the first constellation diagram shown in FIG. 7. For another example, the first window function is a rectangular window, as shown in FIG. 8. The first constellation diagram shown in FIG. 8 can be regarded as segmenting the Y constellation points in the second constellation diagram shown in FIG. 6 using a rectangular window to obtain X constellation points. The X constellation points form the first constellation diagram shown in FIG. 8. The first window function can also be of other shapes, for example, a hexagon, which is not limited here.

[0124] Optionally, the network device segments the Y constellation points in the second constellation diagram using the first window function to obtain Z constellation points. The Z constellation points form a third constellation diagram. X constellation points are selected from the Z constellation points of the third constellation diagram to form the first constellation diagram.

[0125] Optionally, the network device selects X constellation points from the Y constellation points of the second constellation diagram to form the first constellation diagram.

[0126] Method 2: Design the first constellation diagram based on a Gaussian integer generated constellation diagram, as shown in FIG. 9. The Gaussian integer generated constellation diagram is also called a quadrature amplitude modulation (QAM) constellation diagram. The coordinates of the constellation points of the QAM constellation diagram are represented as: x = [1, 1i] · z

[0127] wherein z is an integer. For example, when z takes 1 or -1, the coordinates are (1, 1i), (-1, 1i), (1, -1i) or (-1, -1i).

[0128] Optionally, the network device segments the Y constellation points in the second constellation diagram using the first window function to obtain X constellation points to form the first constellation diagram. For example, the first window function is a circular window, as shown in FIG. 10. The first constellation diagram shown in FIG. 10 can be regarded as segmenting the Y constellation points in the second constellation diagram shown in FIG. 9 using a circular window to obtain X constellation points. The X constellation points form the first constellation diagram shown in FIG. 10. For another example, the first window function is a rectangular window, as shown in FIG. 11. The first constellation diagram shown in FIG. 11 can be regarded as segmenting the Y constellation points in the second constellation diagram shown in FIG. 9 using a rectangular window to obtain X constellation points. The X constellation points form the first constellation diagram shown in FIG. 11. The first window function can also be of other shapes, for example, a hexagon, which is not limited here.

[0129] Optionally, the network device obtains Z constellation points after dividing the Y constellation points in the second constellation diagram using the first window function. The Z constellation points form a third constellation diagram. X constellation points are selected from the Z constellation points in the third constellation diagram to form the first constellation diagram.

[0130] Optionally, the network device selects X constellation points from the Y constellation points in the second constellation diagram to form the first constellation diagram.

[0131] It should be understood that the first constellation diagram determined based on the above-described manner 1 or manner 2 should satisfy at least one of the following conditions:

[0132] Condition 1: The total energy of the X constellation points in the first constellation diagram is less than a first preset value.

[0133] Condition 2: The X constellation points in the first constellation diagram are symmetrical, for example, the X constellation points are symmetrical about a vertical axis, for another example, the X constellation points are symmetrical about a horizontal axis, and for another example, the X constellation points are symmetrical about a center of an origin.

[0134] Condition 3: A minimum Euclidean distance (MED) of the X constellation points in the first constellation diagram is greater than a second preset value. The Euclidean distance is also referred to as an Euclidean distance.

[0135] In the embodiments of the present application, the performance of the constellation diagram is optimized by designing the superimposed constellation diagram, and thus the link performance of the SCMA or LDS system is improved.

[0136] After the network device determines the first constellation diagram, the user data stream is mapped on the X constellation points of the first constellation diagram. Specifically, the data sent by each user can be represented by a bit sequence b j , where j represents that the bit sequence string is needed to be received by the user j, and there are N users in total.

[0137] The signal y j received by the jth user can be represented as:

[0138] , where E s is the energy of the transmitted signal, B is the information bit sent to the N users, h j is the channel between the network device and the jth user, n j is the noise of the jth user, and g(.) represents a function mapping, which is used to map the information bit sent to the N users into a constellation point in the superimposed lattice-based mixed constellation.

[0139] It should be noted that the constellation diagram corresponding to each carrier can be different, so that the distance distribution is also different, which helps to improve the mutual information and shape gain of the multi-dimensional constellation diagram. Since the constellation diagram points on each carrier are different, the optimal mapping criterion is also different.

[0140] As an example, the mapping criterion can be a first mapping criterion, which is used to indicate that the MED of the first constellation diagram is maximum. As shown in FIG. 12, the input bit stream of each user is b j , and the data stream of N users superimposed on each carrier is denoted as , which will be further mapped to the constellation diagram point s k on the kth carrier. Denote the input bits of all users as B = [b1, b2, … b J , and the data stream superimposed on the carrier is denoted as s = [s1, s2, … s K , and the entire mapping process is denoted as s = f NL-SCMA (B). The MED of the superimposed code word can be expressed as:

[0141] In the embodiment of the application, by determining the first constellation diagram, the superimposed constellation diagram is directly optimized, and then the mapping is performed according to the optimized constellation diagram, thereby optimizing the Euclidean distance between the constellation points in the constellation diagram and improving the noise resistance performance and distribution performance of the system.

[0142] 502, sending a first signal;

[0143] Step 502 can be executed by a network device or by a module (such as a processor, a chip, a chip system, a circuit, etc.) therein. Taking the network device as an example, the network device sends a first signal to a terminal device, and correspondingly, the terminal device receives the first signal from the network device.

[0144] The terminal device can determine a first constellation diagram based on the first signal, and M constellation points of X constellation points of the first constellation diagram are mapped with a user data stream of a first user corresponding to the terminal device.

[0145] 503, obtaining the user data stream of the first user according to the X constellation points;

[0146] Step 502 can be executed by a terminal device or by a module (such as a processor, a chip, a chip system, a circuit, etc.) therein. Taking the terminal device as an example, the terminal device obtains the user data stream of the first user according to the X constellation points.

[0147] The terminal device determines M constellation points from the X constellation points, and the user data stream of the first user is mapped to the M constellation points.

[0148] As an example, the M constellation points can be preconfigured by the network device or protocol, or can be indicated by the network device by sending first signaling before sending the first signal, without limitation.

[0149] The terminal device obtains the user data stream of the first user by demapping the M constellation points.

[0150] The communication method in the embodiments of the present application is described above, and the communication apparatus in the embodiments of the present application is described below. Referring to FIG. 13, the communication apparatus 1300 can be used to perform the process performed by the network device in the embodiment shown in FIG. 5, and details can be referred to the related description in the foregoing method embodiments. The communication apparatus 1300 can be a network device, or a component or apparatus (such as a processor, a chip, or a chip system, etc.) applied to the network device, and can also be a logic module or software that can realize all or part of the network device functions.

[0151] The communication apparatus 1300 includes an interface module 1301 and a processing module 1302.

[0152] The processing module 1302 is configured to perform data processing. The interface module 1301 can implement corresponding communication functions. The interface module 1301 can also be referred to as a communication interface or a communication module.

[0153] Optionally, the communication apparatus 1300 can further include a storage module, which can be used to store program codes, program instructions and / or data. The processing module 1302 can read the instructions and / or data in the storage module, so that the communication apparatus 1300 implements the foregoing method embodiments.

[0154] The communication apparatus 1300 can be used to perform the actions performed by the network device in the foregoing method embodiments. For example, the network device or a communication module in the network device, or a circuit or chip responsible for communication functions in the network device. The communication apparatus 1300 can be a network device or a component configurable to the network device. The processing module 1302 is configured to perform processing-related operations on the network device side in the foregoing method embodiments. The interface module 1301 is configured to perform receiving-related operations on the network device side in the foregoing method embodiments.

[0155] Optionally, the interface module 1301 can include a sending module and a receiving module. The sending module is configured to perform the sending operations in the foregoing method embodiments. The receiving module is configured to perform the receiving operations in the foregoing method embodiments.

[0156] It should be noted that the communication apparatus 1300 can include the sending module and not include the receiving module. Alternatively, the communication apparatus 1300 can include the receiving module and not include the sending module. Whether the communication apparatus 1300 includes the sending module or the receiving module can depend on whether the communication apparatus 1300 performs the sending action or the receiving action in the above-mentioned schemes. For example, the communication apparatus 1300 is configured to perform the actions performed by the network device in the embodiment shown in Fig. 5. Details can be referred to the related description in the embodiment shown in Fig. 5, which will not be repeated here.

[0157] For example, the communication apparatus 1300 is configured to perform the following schemes.

[0158] The processing module 1302 is configured to obtain the first signal based on the X constellation points of the first constellation diagram, where X is determined according to the modulation order and the number N of users using the first resource, and the first constellation diagram is a lattice structure constellation diagram, and X and N are positive integers.

[0159] The interface module 1301 is configured to send the first signal on the first resource.

[0160] It should be understood that the specific process of each module performing the corresponding process has been described in detail in the above-mentioned method embodiments, and will not be repeated here for the sake of brevity.

[0161] The processing module 1302 in the above-mentioned embodiments can be implemented by at least one processor or processor-related circuit. The interface module 1301 can be implemented by a transceiver or transceiver-related circuit. The interface module 1301 can also be referred to as a communication module or a communication interface. The storage module can be implemented by at least one memory.

[0162] Another structural schematic diagram of the communication apparatus in the embodiments of the present application is shown below. Please refer to Fig. 14. The communication apparatus can be configured to perform the processes performed by the terminal device in the embodiment shown in Fig. 5. Details can be referred to the related description in the above-mentioned method embodiments.

[0163] The communication apparatus 1400 includes the interface module 1401. Optionally, the processing module 1402.

[0164] The processing module 1402 is configured to perform data processing. The interface module 1401 can implement corresponding communication functions. The interface module 1401 can also be referred to as a communication interface or a communication module.

[0165] Optionally, the communication apparatus 1400 can further include a storage module, which can be configured to store program codes, program instructions and / or data. The processing module 1402 can read the instructions and / or data in the storage module, so that the communication apparatus 1400 implements the above-mentioned method embodiments.

[0166] The communication apparatus 1400 can be configured to perform the actions of the terminal device in the above method embodiments. For example, the terminal device or a communication module in the terminal device, or a circuit or chip responsible for communication functions in the terminal device. The communication apparatus 1400 can be the terminal device or a component configurable to the terminal device. The processing module 1402 is configured to perform the processing-related operations of the terminal device side in the above method embodiments. The interface module 1401 is configured to perform the receiving-related operations of the terminal device side in the above method embodiments.

[0167] Optionally, the interface module 1401 can include a sending module and a receiving module. The sending module is configured to perform the sending operations in the above method embodiments. The receiving module is configured to perform the receiving operations in the above method embodiments.

[0168] It should be noted that the communication apparatus 1400 can include a sending module and not include a receiving module. Alternatively, the communication apparatus 1400 can include a receiving module and not include a sending module. Specifically, whether the communication apparatus 1400 includes a sending action and a receiving action can be determined according to the above-described schemes performed by the communication apparatus 1400. For example, the communication apparatus 1400 is configured to perform the actions of the terminal device in the above-described embodiment shown in FIG. 5. For details, please refer to the related description in the above-described embodiment shown in FIG. 5, which will not be described here in detail.

[0169] For example, the communication apparatus 1400 is configured to perform the following schemes:

[0170] The interface module 1401 is configured to receive a first signal on a first resource, the first signal being obtained based on X constellation points of a first constellation diagram, the X constellation points being used to map user data streams of N users, the first constellation diagram being a lattice structure constellation diagram, and X and N are positive integers.

[0171] The processing module 1402 is configured to obtain a user data stream of a first user according to the X constellation points, the first user being any one of the N users.

[0172] It should be understood that the specific processes of each module performing the above corresponding processes have been described in detail in the above method embodiments, and will not be described here in detail for the sake of brevity.

[0173] Optionally, when the communication apparatus 1400 is a terminal device or a communication module in a terminal device, the processing module 1402 in the above embodiment can be implemented by at least one processor or processor-related circuit. Specifically, the processor can include a Modem chip, or a system on chip (SoC) chip or a system in package (SIP) chip containing a Modem core. The interface module 1401 can be implemented by a transceiver or transceiver-related circuit. The interface module 1401 can also be referred to as a communication module or a communication interface. The storage module can be implemented by at least one memory.

[0174] Optionally, when the communication apparatus 1400 is a circuit or chip responsible for communication functions in a terminal device, such as a Modem chip or a SoC chip or a SIP chip containing a Modem core, the functions of the processing module 1402 can be implemented by the circuit system including one or more processors or processing cores in the above-mentioned chip. The functions of the interface module 1401 can be implemented by the interface circuit or data transceiver circuit on the above-mentioned chip.

[0175] Next, a communication apparatus provided by an embodiment of the present application is introduced. Referring to FIG. 15, FIG. 15 is a structural schematic diagram of a communication apparatus provided by an embodiment of the present application. The communication apparatus can be a network device or a terminal device in the above-mentioned method embodiments, and can also be a chip, a chip system, or a processor, etc. supporting the network device or the terminal device to implement the above-mentioned method. The communication apparatus can be used to implement the method described in the above-mentioned method embodiments. For details, refer to the description in the above-mentioned method embodiments.

[0176] The communication apparatus can include one or more processors 1501. The processor 1501 is connected with a memory 1502, an input and output unit 1503, and a bus 1504. The processor 1501 can be a general-purpose processor or a special-purpose processor, etc. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control the communication apparatus (such as a base station, a baseband chip, a terminal, a terminal chip, a DU or a CU, etc.), execute software programs, and process data of the software programs.

[0177] Optionally, the communication apparatus can include one or more memories 1502, which can have instructions stored thereon. The instructions can be run on the processor 1501, so that the communication apparatus executes the method described in the above-mentioned method embodiments. Optionally, the memory 1502 can also store data. The processor 1501 and the memory 1502 can be separately arranged, or integrated together.

[0178] Optionally, the communication apparatus can further include a transceiver, an antenna. The transceiver can be referred to as a transceiving unit, a transceiver, or a transceiving circuit, etc., and is configured to implement the functions of receiving and transmitting. The transceiver can include a receiver and a transmitter. The receiver can be referred to as a receiver, a receiving circuit, etc., and is configured to implement the function of receiving. The transmitter can be referred to as a transmitter, a transmitting circuit, etc., and is configured to implement the function of transmitting.

[0179] In another possible design, the processor 1501 can include a transceiver configured to implement the functions of receiving and transmitting. For example, the transceiver can be a transceiving circuit, or an interface, or an interface circuit. The transceiving circuit, the interface, or the interface circuit configured to implement the functions of receiving and transmitting can be separate or integrated together. The transceiving circuit, the interface, or the interface circuit can be configured to read and write codes / data, or the transceiving circuit, the interface, or the interface circuit can be configured to transmit or transfer signals.

[0180] In yet another possible design, the processor 1501 can store instructions. The instructions can be executed on the processor 1501, and can cause the communication apparatus to perform the methods described in the above method embodiments. The instructions can be fixed in the processor 1501. In this case, the processor 1501 can be implemented by hardware.

[0181] In yet another possible design, the communication apparatus can include a circuit. The circuit can implement the functions of transmitting or receiving, or communicating, of the network device or the terminal device described in the foregoing method embodiments. The processor and the transceiver described in the embodiments of the present application can be implemented on an integrated circuit (IC), an analog IC, a radio frequency integrated circuit (RFIC), a mixed-signal IC, an application specific integrated circuit (ASIC), a printed circuit board (PCB), an electronic device, etc. The processor and the transceiver can also be manufactured by various IC technologies, such as complementary metal oxide semiconductor (CMOS), n metal-oxide-semiconductor (NMOS), positive channel metal oxide semiconductor (PMOS), Bipolar Junction Transistor (BJT), BiCMOS, silicon germanium (SiGe), gallium arsenide (GaAs), etc.

[0182] The communication apparatus in the above embodiments can be a network device or a terminal device, but the communication apparatus described in the embodiments of the present application is not limited to this, and the structure of the communication apparatus can not be limited to that shown in FIG. 15. The communication apparatus can be a stand-alone device or a part of a larger device. For example, the communication apparatus can be:

[0183] (1) a stand-alone integrated circuit (IC), or a chip, or a chip system or subsystem;

[0184] (2) a set of one or more ICs, optionally including memory means for storing data, instructions;

[0185] (3) an ASIC, such as a modem;

[0186] (4) a module that can be embedded within other devices;

[0187] (5) a receiver, a terminal, a smart terminal, a cellular phone, a wireless device, a handset, a mobile unit, a car-mounted device, a network device, a cloud device, an artificial intelligence device, etc.;

[0188] (6) and the like.

[0189] For the case that the communication apparatus is a chip or a chip system, refer to the structure diagram of the chip shown in FIG. 16. The chip 1600 shown in FIG. 16 includes a processor 1601, an interface 1602. Optionally, it can also include a memory 1603. Among them, the number of processors 1601 can be one or more, and the number of interfaces 1602 can be multiple.

[0190] For the case that the chip is used to implement the functions of the network device or the terminal device in the embodiments of the present application:

[0191] The interface 1602 is configured to receive or output a signal;

[0192] The processor 1601 is configured to perform data processing operations of the network device or the terminal device.

[0193] It can be understood that some optional features in the embodiments of the present application can be implemented independently in some scenarios, without relying on other features, such as the scheme currently based on, to solve the corresponding technical problems and achieve the corresponding effects. Also, in some scenarios, it can be combined with other features according to needs. Correspondingly, the communication apparatus given in the embodiments of the present application can also realize these features or functions, which will not be described here.

[0194] It should be understood that the processor in the embodiments of the present application can be an integrated circuit chip with a processing capability of signals. In the implementation process, each step of the method embodiments described above can be completed by the integrated logic circuit of hardware in the processor or the instructions in the form of software. The processor described above can be a general processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0195] It can be understood that the memory in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically EPROM (EEPROM) or a flash memory. The volatile memory can be a random access memory (RAM) used as an external cache. By way of example and not limitation, many forms of RAK are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM) and direct rambus RAM (DR RAM). It should be noted that the memory of the system and method described herein is intended to include but not limited to these and any other suitable types of memory.

[0196] The embodiments of the present application also provide a computer readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method in the foregoing embodiments.

[0197] The embodiment of the present application further provides a computer program product comprising instructions which, when executed on a computer, cause the computer to perform the method in the foregoing embodiment.

[0198] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be described here.

[0199] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other manners. For example, the above-described device embodiments are merely schematic, and the division of the units is merely a logical function division, and there can be another division manner in actual implementation, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections between the units can be indirect couplings or communication connections through some interfaces, devices or units, and can be electrical, mechanical or in other forms.

[0200] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, that is, can be located in one place, or can be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0201] In addition, each functional unit in the embodiments of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be realized in the form of hardware, or in the form of software functional unit.

[0202] The integrated unit, if realized in the form of software functional unit and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the part of the prior art that makes contributions, or all or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, read-only memory), a random access memory (RAM, random access memory), a magnetic disk or an optical disk, and various program codes that can be stored in the medium.

[0203] In the foregoing embodiments, all or some of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or some of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, all or some of the processes or functions according to the embodiments of the present application are generated. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions can be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be transmitted from one website site, computer, server or data center to another website site, computer, server or data center through wired (for example, coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (for example, infrared, wireless, microwave, etc.). The computer readable storage medium can be any available medium accessible by a computer or a data storage device such as a server, data center, etc. integrated with one or more available media. The available medium can be a magnetic medium (for example, floppy disk, hard disk, magnetic tape), an optical medium (for example, high-density digital video disc (digital video disc, DVD)), or a semiconductor medium (for example, solid state disk (solid state disk, SSD)), etc.

Claims

1. A communication method characterized by comprising: The method comprises: a first signal is obtained based on X constellation points of a first constellation diagram, X is determined according to a modulation order and a number N of users using a first resource, the first constellation diagram is a lattice structure constellation diagram, and X and N are both positive integers; the first signal is sent on the first resource.

2. The method of claim 1, wherein, The lattice structure constellation diagram is a constellation diagram generated based on Eisenstein integers, or the lattice structure constellation diagram is a constellation diagram generated based on Gaussian integers.

3. The method according to claim 1 or 2, characterized in that, The first constellation diagram satisfies at least one of the following conditions: total energy of the X constellation points is less than a first preset value; the X constellation points are symmetrical; or a minimum Euclidean distance MED of the X constellation points is greater than a second preset value.

4. The method according to any one of claims 1 to 3, characterized in that, The X constellation points of the first constellation diagram are obtained by dividing Y constellation points of a second constellation diagram using a first window function, the second constellation diagram is the lattice structure constellation diagram, and Y is a positive integer greater than X.

5. The method of claim 4, wherein, The first window function is a circular window function, a rectangular window function or a hexagonal window function.

6. The method according to claim 4 or 5, characterized in that, The first constellation diagram is composed of X constellation points of Z constellation points of a third constellation diagram, the Z constellation points of the third constellation diagram are obtained by dividing Y constellation points of the second constellation diagram using a first window function, Z is a positive integer greater than X, and X is determined according to the modulation order and the number N.

7. The method according to any one of claims 1 to 3, characterized in that, The first constellation diagram is composed of the X constellation points of Y constellation points of a second constellation diagram, the second constellation diagram is the lattice structure constellation diagram, and Y is a positive integer greater than X.

8. The method according to any one of claims 1 to 7, characterized in that, The first signal is obtained by mapping the X constellation points to the first resource, and user data streams of the N users are mapped to the X constellation points.

9. The method according to any one of claims 1 to 7, characterized in that, User data streams of the N users are mapped to the X constellation points based on a first mapping criterion corresponding to the first resource.

10. The method of claim 9, wherein, The first mapping criterion is used to indicate that a minimum Euclidean distance MED of the first constellation diagram is maximum.

11. A communication method, comprising: The method comprises: a first signal is obtained based on X constellation points of a first constellation diagram, X is determined according to a modulation order and a number N of users using a first resource, the first constellation diagram is a lattice structure constellation diagram, and X and N are both positive integers; a user data stream of a first user is obtained according to the X constellation points, and the first user is any one of the N users.

12. The method of claim 11, wherein, The lattice structure constellation diagram is a constellation diagram generated based on Eisenstein integers, or the lattice structure constellation diagram is a constellation diagram generated based on Gaussian integers.

13. The method according to claim 11 or 12, characterized in that, The first constellation diagram satisfies at least one of the following conditions: total energy of the first constellation diagram is less than a first preset value; constellation points in the first constellation diagram are symmetrical; or a minimum Euclidean distance MED of the first constellation diagram is greater than a second preset value.

14. The method according to any one of claims 11 to 13, characterized in that, The user data stream of the first user is mapped to M constellation points in the X constellation points, and M is less than X.

15. A communications device, characterized by The method comprises: a first signal is obtained based on X constellation points of a first constellation diagram, X is determined according to a modulation order and a number N of users using a first resource, the first constellation diagram is a lattice structure constellation diagram, and X and N are both positive integers; an interface module configured to transmit the first signal on the first resource.

16. A communications device, characterized by comprising: an interface module configured to receive a first signal on a first resource, the first signal being derived based on X constellation points of a first constellation, the X constellation points being used to map user data streams of N users, the first constellation being a lattice structured constellation, the X and the N being positive integers; a processing module configured to derive a user data stream of a first user based on the X constellation points, the first user being any one of the N users.

17. A communications device, characterized by comprising: a processor configured to execute a program, so that the communication device performs the method according to any one of claims 1 to 10.

18. A communications device, characterized by comprising: a processor configured to execute a program, so that the communication device performs the method according to any one of claims 11 to 14.

19. A communication system, characterized by comprising: a communication device configured to perform the method according to any one of steps 1 to 10, and a communication device configured to perform the method according to any one of claims 11 to 14.

20. A computer readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method according to any one of claims 1 to 10, or cause the computer to perform the method according to any one of claims 11 to 14.

21. A computer program product comprising instructions which, when executed on a computer, cause the computer to perform the method according to any one of claims 1 to 10, or cause the computer to perform the method according to any one of claims 11 to 14.

Images