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

A communication method, communication device and storage medium Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method, communication device and storage medium. Background Technology

[0002] As wireless cellular networks continue to evolve, orthogonal multiple access (OMA) technology is gradually failing to meet the ever-increasing demands of cellular networks, such as massive access and the capacity requirements resulting from continuous improvements in spectrum efficiency. Meanwhile, the research and application of non-orthogonal multiple access (NOA) technology is attracting increasing attention from industry and academia, with the hope that future wireless cellular networks can effectively address the capacity improvement problem using NOA technology.

[0003] Sparse code multiple access (SCMA) and low density signature (LDS) are two typical non-orthogonal multiple access and transmission technologies with similar principles. These technologies transmit M data streams from one or more users across N subcarriers (M and N are both integers not less than 1), where each data point from each stream is spread across the N subcarriers using sparse spreading. When M is greater than N, these technologies can effectively improve network capacity, including the number of users that can access the system and spectral efficiency.

[0004] In existing SCMA research, constellation point optimization is an important research direction. Current optimization mainly assumes that constellation points are optimized independently and then superimposed linearly. However, this linear superposition method may result in small distances between the superimposed constellation points, leading to poor constellation point distribution performance.

[0005] Summary of the Invention

[0006] This application provides a communication method, communication device, and storage medium to solve the problem of poor distribution performance of superimposed constellation diagrams. It can improve performance by directly optimizing the superimposed constellation diagram and utilizing the superimposed constellation diagram designed with a lattice structure.

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

[0008] Based on the first aspect of this application, by determining the first constellation diagram, the superimposed constellation diagram is directly optimized. Then, mapping is performed based on the optimized constellation diagram, improving the system's noise immunity and distribution performance. Furthermore, since the first constellation diagram is a lattice-structured constellation diagram, the Euclidean distance between constellation points in the constellation diagram is optimized.

[0009] Based on the first aspect of this application, in some possible implementations, the X constellation points of the first constellation map are obtained by segmenting the Y constellation points of the second constellation map using a first window function, wherein the second constellation map is a lattice structure constellation map and Y is a positive integer greater than X.

[0010] In this embodiment, the first constellation map is obtained by dividing a larger constellation map, namely the second constellation map. Therefore, while meeting the requirement for the number of constellation points, the Euclidean distance between each constellation point in the first constellation map is guaranteed, which improves the distribution performance of the superimposed constellation map and thus enhances the link performance of the SCMA or LDS system.

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

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

[0013] Based on the first aspect of this application, in some possible implementations, the first constellation map is composed of X constellation points out of Z constellation points of the third constellation map, the Z constellation points of the third constellation map being obtained by segmenting the Y constellation points of the second constellation map using a first window function, where Z is a positive integer greater than X, and X is determined according to the modulation order and N.

[0014] The first constellation map can be composed of constellation points selected from the third constellation map after segmenting the second constellation map. Therefore, constellation points with better distribution performance in the third constellation map can be selected, thereby optimizing the distribution performance of the first constellation map.

[0015] Based on the first aspect of this application, in some possible implementations, the first constellation map is composed of X constellation points out of Y constellation points in the second constellation map, where Y is a positive integer greater than X.

[0016] Since the first constellation map is obtained by selecting some constellation points from the second constellation map, the distribution performance of the first constellation map can be optimized by selecting constellation points.

[0017] Based on the first aspect of this application, in some possible implementations, the first signal is obtained by mapping X constellation points to a first resource, and the user data streams of N users are mapped to X constellation points.

[0018] In this embodiment, by determining the first constellation diagram, the superimposed constellation diagram is directly optimized, and then mapping is performed based on the optimized constellation diagram, thereby improving the system's noise immunity and distribution performance.

[0019] Based on the first aspect of this application, in some possible implementations, user data streams of N users are mapped to X constellation points based on a first mapping criterion, the first mapping criterion corresponding to a first resource.

[0020] Since different carriers correspond to different constellation diagrams, and their distance distributions are usually different, this is beneficial for improving the mutual information of multi-dimensional constellation diagrams. However, based on the constellation diagrams corresponding to different carriers, resource mapping needs to be achieved according to corresponding mapping criteria.

[0021] Based on the first aspect of this application, in some possible implementations, the first mapping criterion is used to indicate that the minimum Euclidean distance (MED) of the first constellation map is maximized.

[0022] In this embodiment, the user data stream is mapped based on the maximum MED of the first constellation diagram, which helps to improve the system's access performance.

[0023] A second aspect of this application provides a communication method. Optionally, the execution subject of this method can be a second device, which can be a terminal device, a component or device applied to the terminal device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the terminal device's functions. Taking a terminal device as an example, in this 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 structure constellation diagram, and X and N are both positive integers. The terminal device obtains the user data stream of a first user based on the X constellation points. The first user is any one of the N users.

[0024] Based on the second aspect of this application, the noise immunity and distribution performance of the system are improved by mapping based on the first constellation diagram. Furthermore, since the first constellation diagram is a lattice-structured constellation diagram, the Euclidean distance between constellation points in the diagram is optimized.

[0025] Based on the second aspect of this application, in some possible implementations, the user data stream of the first user is mapped to M constellation points out of X constellation points, where M is less than X.

[0026] Based on the first or second aspect of this application, in some possible implementations, the lattice-structured constellation diagram is a constellation diagram generated based on Eisenstein integers, or the lattice-structured constellation diagram is a constellation diagram generated based on Gaussian integers.

[0027] Since the first constellation diagram is a lattice structure constellation diagram, it can guarantee the Euclidean distance between each constellation point in the superimposed constellation diagram, thereby improving the system's noise immunity and distribution performance.

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

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

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

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

[0032] By limiting the conditions that the first constellation diagram must satisfy, the distribution performance of the superimposed constellation diagram is improved, thereby enhancing the link performance of the SCMA or LDS system.

[0033] A third aspect of this application provides a communication device, comprising:

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

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

[0036] A fourth aspect of this application provides a communication device, comprising:

[0037] The interface module is used to receive a first signal on the 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 the user data streams of N users. The first constellation diagram is a lattice structure constellation diagram. X and N are both positive integers.

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

[0039] A fifth aspect of this application provides a communication device, which may be a first device or a second device, or a component applied to the first device or the second device (e.g., a processor, chip, or chip system), or a logic module or software (e.g., CU, DU, or RU) capable of implementing all or part of the functions of the first device or the second device. The communication device includes:

[0040] A processor for executing a program that causes the communication device to perform the method as described in the first or second aspect of the foregoing and any possible implementation thereof.

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

[0042] The sixth aspect of this application provides a chip or chip system including at least one processor and a communication interface, the communication interface and at least one processor being interconnected via a line, the at least one processor being used to run computer programs or instructions to perform the communication method described in any of the possible implementations of the first or second aspect.

[0043] The communication interface in the chip can be an input / output interface, pins, or circuits.

[0044] In one possible implementation, the chip or chip system described above in this application further includes at least one memory storing instructions. The memory can be an internal storage unit of the chip, such as a register or cache, or it can be a storage unit of the chip itself, such as a read-only memory or random access memory.

[0045] The seventh aspect of this application provides a communication system, including a communication device that performs the first aspect and any possible implementation thereof, and a communication device that performs the second aspect and any possible implementation thereof.

[0046] An eighth aspect of this application provides a computer-readable storage medium including instructions that, when executed on a computer, cause the computer to perform the method described in the first aspect above, or cause the computer to perform the method described in the second aspect above.

[0047] The ninth aspect of this application provides a computer program product containing instructions that, when run on a computer, cause the computer to perform the method described in the first aspect above, or cause the computer to perform the method described in the second aspect above. Attached Figure Description

[0048] Figure 1 is a schematic diagram of the encoding principle of the transmitting end of an SCMA and LDS technology in an embodiment of this application;

[0049] Figure 2 is a network structure diagram in an embodiment of this application;

[0050] Figure 3 is a schematic diagram of an application scenario of the communication method in this application embodiment;

[0051] Figure 4 is a schematic diagram of an embodiment of a linearly superimposed constellation diagram in this application;

[0052] Figure 5 is a schematic diagram of an embodiment of the communication method in this application;

[0053] Figure 6 is a schematic diagram of an embodiment of the constellation diagram generated based on Eisenstein integers in this application;

[0054] Figure 7 is a schematic diagram of an embodiment of this application that uses a circular window to segment a constellation diagram generated based on Eisenstein integers;

[0055] Figure 8 is a schematic diagram of an embodiment of the present application that uses a rectangular window to segment a constellation diagram generated based on Eisenstein integers;

[0056] Figure 9 is a schematic diagram of an embodiment of a constellation diagram generated based on Gaussian integers in this application;

[0057] Figure 10 is a schematic diagram of an embodiment of the present application that uses a circular window to segment a constellation diagram generated based on Gaussian integers;

[0058] Figure 11 is a schematic diagram of an embodiment of the present application that uses a rectangular window to segment a constellation diagram generated based on Gaussian integers;

[0059] Figure 12 is a schematic diagram of an embodiment of mapping to a first constellation diagram in this application;

[0060] Figure 13 is a schematic diagram of an embodiment of the communication device in this application;

[0061] Figure 14 is a schematic diagram of another embodiment of the communication device in this application;

[0062] Figure 15 is a schematic diagram of another embodiment of the communication device in this application;

[0063] Figure 16 is a schematic diagram of another embodiment of the communication device in this application. Detailed Implementation

[0064] This application provides a communication method, communication device, and storage medium to solve the problem of poor distribution performance of superimposed constellation diagrams. It can improve performance by directly optimizing the superimposed constellation diagram and utilizing the superimposed constellation diagram designed with a lattice structure.

[0065] The embodiments of this application will now be described with reference to the accompanying drawings. Those skilled in the art will recognize that, with technological advancements and the emergence of new scenarios, the technical solutions provided in the embodiments of this application are equally applicable to similar technical problems.

[0066] The terms "first," "second," etc., used in the specification, claims, and drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms are interchangeable where appropriate; this is merely a way of distinguishing objects with the same attributes in the description of embodiments of this application. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion, so that a process, method, system, product, or apparatus that comprises a series of elements is not necessarily limited to those elements, but may include other elements not expressly listed or inherent to those processes, methods, products, or apparatuses.

[0067] First, some technical terms involved in the embodiments of this application will be introduced.

[0068] 1. Orthogonal Multiple Access (OMA) technology:

[0069] Orthogonal multiple access (OMA) is a multiple access technology that utilizes the orthogonality of resources to differentiate access methods for different users. In OMA, each user communicates using an orthogonal channel that is independent of other users' channels and does not interfere with each other, thus allowing concurrent transmission without collisions. In OMA, channel resources are divided into multiple orthogonal parts, each allocated to one 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 to avoid interference between frequency bands by setting guard bands.

[0071] TDMA, based on FDMA, further divides the frequency band into multiple time windows, with each user occupying a specific time window during communication.

[0072] CDMA operates on the principle of spread spectrum technology. It modulates the data, which has a certain signal bandwidth, with a high-speed pseudo-random code whose bandwidth is much larger than the signal bandwidth. This expands the bandwidth of the original data signal before it is modulated by a carrier wave and transmitted. The receiving end uses the exact same pseudo-random code to perform correlation processing with the received bandwidth signal, converting the wideband signal back into the narrowband signal of the original data—a process known as despreading—to achieve information communication.

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

[0074] Non-orthogonal multiple access (NOMA) is an advanced wireless communication technology. Its core idea is that multiple users can share the same time-frequency resources non-orthogonally, thus achieving multiple access in the power domain. NOMA allows multiple users to share the same time-frequency resources non-orthogonally in the power domain. This means that data signals from different users may overlap in time, frequency, or code domains during transmission, but can be 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. These 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. Each data point from each stream is spread across N subcarriers using sparse spreading. When M is greater than N, these technologies can effectively improve network capacity, including the number of users that can access the system and spectral efficiency.

[0076] Figure 1 illustrates a schematic diagram of the encoding principle of a transmitter using SCMA and LDS technologies. There are M = 6 variable nodes and N = 4 functional nodes. Each variable node represents a data stream, and each functional node represents a subcarrier or a resource element (RE). For ease of description, the variable node referred to below is equivalent to the data stream it represents, and the functional node is equivalent to the subcarrier or resource element it represents. M = 6 variable nodes form an SCMA packet or LDS packet, and N = 4 functional nodes form an SCMA coded block or LDS coded block. The lines connecting variable nodes and functional nodes indicate that the data from the variable node, after spread spectrum, will be transmitted as non-zero symbols on that functional node. As can be seen from the figure, the data from each variable node, after spread spectrum, will be transmitted on multiple functional nodes. Furthermore, the data transmitted by each functional node is a superposition of non-zero symbols from multiple variable nodes after spread spectrum. For example, the data s3 of variable node 3, after being spread, will transmit non-zero symbols on functional nodes 1 and 2. The data x2 transmitted by functional node 3 is the superposition of non-zero symbols obtained by spreading the data s2, s4 and s6 of variable nodes 2, 4 and 6 respectively.

[0077] In SCMA and LDS packets, the subcarriers or resource particles on which non-zero symbols are transmitted after spread spectrum are determined by the SCMA feature matrix and the LDS signature matrix, respectively. Both the SCMA feature matrix and the LDS signature matrix have the following forms:

[0078] In this matrix, N rows represent the N functional nodes in an SCMA or LDS coding block, and M columns represent the M variable nodes in an SCMA or LDS block. Although the SCMA feature matrix and LDS signature matrix can be expressed in a general form, they have their own matrix characteristics.

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

[0080] 1) The elements in the SCMA characteristic matrix satisfy r n,m ∈{0,1}, 1≤n≤N, 1≤m≤M. Where, r n,m =1 indicates that the data from variable node m is spread and then transmitted as a non-zero symbol on functional node n. n,m =0 indicates that the data from variable node m is spread and then sent as a zero symbol on functional node n;

[0081] 2) Generally, the number of 0 elements should not be less than the number of 1 elements, thus reflecting the characteristics of sparse coding.

[0082] Matrixes satisfying the above characteristics can be called SCMA feature matrices. Furthermore, we call the columns in the feature matrix SCMA feature sequences, each corresponding to a variable node, reflecting which functional nodes transmit non-zero symbols after the data from that variable node has been spread. Therefore, the SCMA feature matrix can be viewed as a matrix composed of a series of SCMA feature sequences. The columns in the feature matrix can be represented 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. Where r n,m =α*exp(j*β) indicates that the data from variable node m is spread and then transmitted as non-zero symbols on functional node n. n,m =0 indicates that the data from variable node m is spread and then sent as a zero symbol on functional node n;

[0085] 2) Generally, the number of zero elements should not be less than the number of non-zero elements, thus reflecting the characteristics of low-density coding.

[0086] Matrixes satisfying the above characteristics can be called LDS signature matrices. Furthermore, we refer to the columns in the signature matrix as LDS signature sequences, each corresponding to a variable node. Unlike SCMA feature sequences, LDS signature sequences not only reflect which functional nodes transmit non-zero symbols after the data from the corresponding variable node is spread, but are also used for the calculation of those non-zero symbols. Similarly, an LDS signature matrix can be viewed as a matrix composed of a series of LDS signature sequences. The columns in the signature matrix can be represented as follows:

[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 codewords in the codebook have the same number of elements as the corresponding feature sequence or signature sequence;

[0096] Condition 2: The codewords in the codebook have the same non-zero element positions as the corresponding feature sequence or signature sequence.

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

[0098] The corresponding feature sequences or signature sequences are as follows:

[0099] The representation and storage of codebooks generally differ between SCMA (SCMA-based) and LDS (LDS-based) systems. In SCMA systems, codebooks are typically represented and stored directly, such as directly storing the codebook itself or individual codewords within it, or storing non-zero elements. In LDS systems, however, the signature matrix or signature sequence and modulation constellation are usually directly represented and stored. The codebook is indirectly generated from the signature sequence and modulation constellation. A common generation method is to multiply the signature sequence by the constellation points or modulation symbols in the modulation constellation. For example, when using Qm-order modulation, the signature sequence is:

[0100] The codebook used by the corresponding variable node is:

[0101] Where, q i For Q m Constellation points or modulation symbols in a modulated constellation, 1≤i≤Q m Therefore, when using QPSK or 4th-order modulation, the LDS codebook used by variable node 3 in Figure 1 is:

[0102] 3. Constellation Chart:

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

[0104] Please refer to Figure 2. The network architecture on which the communication method in this embodiment is based is briefly described below:

[0105] Figure 2 is a possible, non-limiting system schematic diagram. As shown in Figure 2, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. RAN 100 includes at least one RAN node (110a and 110b in Figure 2, collectively referred to as 110) and at least one terminal (120a-120j in Figure 2, collectively referred to as 120). RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment (not shown in Figure 2). Terminal 120 is wirelessly connected to RAN node 110. RAN node 110 is wirelessly or wired connected to core network 200. The core network equipment in core network 200 and RAN node 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.

[0106] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as a 4G, 5G, or future mobile communication system. RAN 100 can also be an open-radio access network (ORAN), a cloud-radio access network (CRAN), or a wireless fidelity (WiFi) system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0107] RAN node 110, sometimes also referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and is used to help terminals achieve wireless access. Multiple RAN nodes 110 in communication system 10 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, network element 120i in Figure 2 can be a helicopter or drone, which can be configured as a mobile base station. For terminals 120j accessing RAN 100 through network element 120i, network element 120i is a base station; but for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes both referred to as communication devices. For example, network elements 110a and 110b in Figure 2 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal functions.

[0108] In one 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. The RAN node can be a macro base station (as shown in Figure 2, 110a), a micro base station or indoor station (as shown in Figure 2, 110b), a relay node or donor node, or a radio controller in a CRAN scenario. Optionally, the RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of the RAN node in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be equipped with communication modules, circuits, or chips that perform corresponding communication functions. The RAN node can also be configured with program instructions for performing corresponding communication functions, as well as corresponding program instructions. The RAN node in this application can also be a logical node, logical module, or software capable of implementing all or part of the RAN node's functions.

[0109] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with each RAN node performing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-CPs, CU-UPs, or radio units (RUs). CUs and DUs can be configured separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0110] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0111] A terminal can be a device or module that accesses the aforementioned communication system and has corresponding communication functions. A terminal can also be called a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart homes, smart offices, smart wearables, intelligent transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, transportation vehicles with wireless communication capabilities, communication modules, etc. The embodiments of this application do not limit the device form of the terminal. Terminals typically contain communication modules, circuits, or chips that perform corresponding communication functions. Terminals can also be configured with program instructions for performing corresponding communication functions.

[0112] Furthermore, the embodiments of this application can also be applied to other future communication technologies. The network architecture and service scenarios described in this application are for the purpose of more clearly illustrating the technical solutions of this application, and do not constitute a limitation on the technical solutions provided in this application. As those skilled in the art will understand, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided in this application are also applicable to similar technical problems.

[0113] Figure 3 illustrates an application scenario applicable to an embodiment of this application. Terminal devices 302, 303, 304, and 305 are connected to network device 301. Network device 301 overlays information sent to multiple terminal devices onto the same resource. For example, network device 301 overlays information sent to terminal devices 302, 303, and 304 onto the same carrier, with the information of each terminal device mapped to the same constellation diagram in the form of symbol points.

[0114] As shown in Figure 4, since the constellation diagrams corresponding to multiple terminal devices are superimposed in a linear manner, the Euclidean distance between the symbol points in the superimposed constellation diagram is uncertain, which may lead to the Euclidean distance between the symbol points being too small, resulting in poor constellation point distribution performance.

[0115] Based on this, this application provides a method. Referring to Figure 5, a communication method in this application includes:

[0116] 501. Obtain the first signal based on X constellation points of the first constellation diagram;

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

[0118] The network device maps the user data streams of N users onto constellation points of the first constellation diagram, and then maps these constellation points onto the first resource to obtain the first signal. The first constellation diagram is one of the constellation diagrams generated from a superimposed hybrid constellation of constellation diagrams with quadrature amplitude modulation (QAM) or regular hexagonal structures. The set consisting of vertices of uniform squares or vertices and center points of uniform hexagons is called a lattice structure. The first constellation diagram includes X constellation points, where X is determined based on the modulation order and the number of users N using the first resource, i.e., X = M. N Where M is the modulation order and N is the number of users utilizing the first resource. This first constellation diagram can be designed in several ways, which are explained below:

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

[0120] Where z is an integer, w is a function of z. For example, when z takes the value 1 or -1, the coordinates are... or

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

[0122] Optionally, the network device segments the Y constellation points in the second constellation diagram using a first window function to obtain X constellation points, forming the first constellation diagram. A window function is a mathematical function used to truncate signals to reduce spectral energy leakage. The basic definition of a window function is: to reduce spectral energy leakage, different functions can be used to truncate signals; these truncation functions are called window functions, or simply windows.

[0123] For example, the first window function can be a circular window, as shown in Figure 7. The first constellation diagram shown in Figure 7 can be considered as dividing the Y constellation points in the second constellation diagram shown in Figure 6 using a circular window to obtain X constellation points. These X constellation points form the first constellation diagram shown in Figure 7. As another example, the first window function can be a rectangular window, as shown in Figure 8. The first constellation diagram shown in Figure 8 can be considered as dividing the Y constellation points in the second constellation diagram shown in Figure 6 using a rectangular window to obtain X constellation points. These X constellation points form the first constellation diagram shown in Figure 8. The first window function can also be other shapes, such as hexagons, but this is not limited here.

[0124] Optionally, after the network device segments the Y constellation points in the second constellation diagram using a first window function, it obtains Z constellation points. These Z constellation points form the third constellation diagram. From the Z constellation points in the third constellation diagram, X constellation points are selected to form the first constellation diagram.

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

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

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

[0128] Optionally, the network device uses a first window function to segment the Y constellation points in the second constellation diagram to obtain X constellation points, which together form the first constellation diagram. For example, the first window function can be a circular window, as shown in Figure 10. The first constellation diagram shown in Figure 10 can be considered as segmenting the Y constellation points in the second constellation diagram shown in Figure 9 using a circular window to obtain X constellation points. These X constellation points form the first constellation diagram shown in Figure 10. As another example, the first window function can be a rectangular window, as shown in Figure 11. The first constellation diagram shown in Figure 11 can be considered as segmenting the Y constellation points in the second constellation diagram shown in Figure 9 using a rectangular window to obtain X constellation points. These X constellation points form the first constellation diagram shown in Figure 11. The first window function can also be other shapes, such as hexagons, but this is not limited here.

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

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

[0131] It should be understood that the first constellation diagram determined based on method 1 or method 2 above 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 the 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 the vertical axis, or about the horizontal axis, or about the origin.

[0134] Condition 3: The minimum Euclidean distance (MED) of X constellation points in the first constellation map is greater than the second preset value. Euclidean distance is also known as Euclidean distance.

[0135] In this embodiment of the application, the performance of the constellation diagram is optimized by designing the superimposed constellation diagram, thereby improving the link performance of the SCMA or LDS system.

[0136] After determining the first constellation map, the network device maps the user data stream to X constellation points in the first constellation map. Specifically, the data sent to each user can be represented by a sequence of bits b. j The representation is as follows: j represents the bit sequence string that user j needs to receive, and there is a total of N users' data.

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

[0138] Among them, E s B is the energy of the transmitted signal, B is the information in bits sent to N users, and h is the energy of the transmitted signal. j Let n be the channel between the network device and the j-th user. j Let g(.) represent the noise for the j-th user, and g(.) denote the function mapping used to map the information bits sent to N users into constellation points in a superimposed hybrid constellation based on lattice codes.

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

[0140] As an example, the mapping criterion could be a first mapping criterion used to indicate the maximum MED of the first constellation diagram. As shown in Figure 12, the input bitstream for each user is b... j Each carrier will have N user data streams superimposed on it, denoted as This will be further mapped to constellation points s on the k-th carrier. k Let B = [b1, b2, ..., bn] be the input bits for all users. J The data stream transmitted via superimposed carrier waves is denoted as s = [s1, s2, ... s]. K The entire mapping process is denoted as s = f NL-SCMA (B). The MED of superimposed codewords can be represented as:

[0141] In this embodiment of the application, by determining the first constellation map, the superimposed constellation map is directly optimized, and then mapping is performed based on the optimized constellation map, thereby optimizing the Euclidean distance between constellation points in the constellation map and improving the noise immunity and distribution performance of the system.

[0142] 502. Send the first signal;

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

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

[0145] 503. Obtain the user data stream of the first user based on X constellation points;

[0146] Step 502 can be performed by the terminal device or by its modules (e.g., processor, chip, chip system, circuit, etc.). Taking the terminal device as an example, the terminal device performs the user data stream of the first user based on X constellation points.

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

[0148] As an example, the M constellation points can be pre-configured by network devices or protocols, or the network devices can send a first signaling to indicate the M constellation points before sending the first signal; the specifics are not limited here.

[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 this application has been described above. The communication device in the embodiments of this application is described below. Referring to Figure 13, the communication device 1300 can be used to execute the process performed by the network device in the embodiment shown in Figure 5. For details, please refer to the relevant descriptions in the foregoing method embodiments. The communication device 1300 can be a network device, a component or device applied to a network device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of a network device.

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

[0152] The processing module 1302 is used for data processing. The interface module 1301 can implement corresponding communication functions. The interface module 1301 can also be called a communication interface or a communication module.

[0153] Optionally, the communication device 1300 may further include a storage module, which can be used to store program code, program instructions and / or data. The processing module 1302 can read the instructions and / or data in the storage module so that the communication device 1300 can implement the aforementioned method embodiments.

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

[0155] Optionally, interface module 1301 may include a sending module and a receiving module. The sending module is used to perform the sending operation in the above method embodiments. The receiving module is used to perform the receiving operation in the above method embodiments.

[0156] It should be noted that the communication device 1300 may include a transmitting module but not a receiving module. Alternatively, the communication device 1300 may include a receiving module but not a transmitting module. Specifically, it depends on whether the above-described scheme performed by the communication device 1300 includes both transmitting and receiving actions. For example, the communication device 1300 is used to perform the actions performed by the network device in the embodiment shown in Figure 5. For details, please refer to the relevant descriptions in the embodiment shown in Figure 5; these will not be elaborated upon here.

[0157] For example, the communication device 1300 is used to execute the following scheme:

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

[0159] Interface module 1301 is used to send a first signal on the first resource.

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

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

[0162] The following is another structural schematic diagram of the communication device according to an embodiment of this application. Referring to Figure 14, the communication device can be used to execute the process performed by the terminal device in the embodiment shown in Figure 5. For details, please refer to the relevant description in the foregoing method embodiments.

[0163] The communication device 1400 includes an interface module 1401. Optionally, a processing module 1402.

[0164] The processing module 1402 is used for data processing. The interface module 1401 can implement corresponding communication functions. The interface module 1401 can also be called a communication interface or a communication module.

[0165] Optionally, the communication device 1400 may further include a storage module, which can be used to store program code, program instructions and / or data. The processing module 1402 can read the instructions and / or data in the storage module so that the communication device 1400 can implement the aforementioned method embodiments.

[0166] The communication device 1400 can be used to perform the actions performed by the terminal device in the above method embodiments. For example, it can be a terminal device, a communication module within a terminal device, or a circuit or chip within a terminal device responsible for communication functions. The communication device 1400 can be a terminal device or a component configurable on a terminal device. The processing module 1402 is used to perform processing-related operations on the terminal device side in the above method embodiments. The interface module 1401 is used to perform reception-related operations on the terminal device side in the above method embodiments.

[0167] Optionally, interface module 1401 may include a sending module and a receiving module. The sending module is used to perform the sending operation in the above method embodiments. The receiving module is used to perform the receiving operation in the above method embodiments.

[0168] It should be noted that the communication device 1400 may include a transmitting module but not a receiving module. Alternatively, the communication device 1400 may include a receiving module but not a transmitting module. Specifically, it depends on whether the above-described scheme executed by the communication device 1400 includes both transmitting and receiving actions. For example, the communication device 1400 is used to execute the actions performed by the terminal device in the embodiment shown in Figure 5. For details, please refer to the relevant descriptions in the embodiment shown in Figure 5; these will not be elaborated upon here.

[0169] For example, the communication device 1400 is used to execute the following scheme:

[0170] Interface module 1401 is used to receive 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 structure constellation diagram. X and N are both positive integers.

[0171] Processing module 1402 is used to obtain the user data stream of the first user based on X constellation points, where the first user is any one of the N users.

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

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

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

[0175] The following describes a communication device provided in an embodiment of this application. Please refer to Figure 15, which is a schematic diagram of the structure of a communication device provided in an embodiment of this application. The communication device can be a network device or a terminal device in the above method embodiments, or it can be a chip, chip system, or processor that supports the network device or terminal device in implementing the above methods. This communication device can be used to implement the methods described in the above method embodiments, and for details, please refer to the description in the above method embodiments.

[0176] The communication device may include one or more processors 1501, which are connected to a memory 1502, an input / output unit 1503, and a bus 1504. The processor 1501 may be a general-purpose processor or a dedicated processor, such as a baseband processor or a central processing unit (CPU). The baseband processor can be used to process communication protocols and communication data, while the CPU can be used to control the communication device (e.g., base station, baseband chip, terminal, terminal chip, DU or CU, etc.), execute software programs, and process data from the software programs.

[0177] Optionally, the communication device may include one or more memories 1502, which may store instructions that can be executed on the processor 1501 to cause the communication device to perform the methods described in the above method embodiments. Optionally, the memories 1502 may also store data. The processor 1501 and the memories 1502 may be provided separately or integrated together.

[0178] Optionally, the communication device may also include a transceiver and an antenna. A transceiver, also called a transceiver unit, transceiver, or transceiver circuit, is used to implement transmission and reception functions. A transceiver may include a receiver and a transmitter; the receiver, also called a receiver circuit, is used to implement the receiving function; the transmitter, also called a transmitter or transmitting circuit, is used to implement the transmitting function.

[0179] In another possible design, the processor 1501 may include a transceiver for implementing receive and transmit functions. For example, the transceiver may be a transceiver circuit, an interface, or an interface circuit. The transceiver circuit, interface, or interface circuit for implementing receive and transmit functions may be separate or integrated. The aforementioned transceiver circuit, interface, or interface circuit may be used for reading and writing code / data, or it may be used for transmitting or relaying signals.

[0180] In another possible design, the processor 1501 may optionally store instructions that, when executed, cause the communication device to perform the methods described in the above method embodiments. The instructions may be stored in the processor 1501; in this case, the processor 1501 may be implemented in hardware.

[0181] In another possible design, the communication device may include a circuit that can perform the sending or receiving or communication functions of the network device or terminal device in the aforementioned method embodiments. The processor and transceiver described in this application embodiment can be implemented on integrated circuits (ICs), analog ICs, radio frequency integrated circuits (RFICs), mixed-signal ICs, application-specific integrated circuits (ASICs), printed circuit boards (PCBs), electronic devices, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductors (CMOS), n-type metal-oxide-semiconductor (NMOS), p-type metal oxide semiconductors (PMOS), bipolar junction transistors (BJTs), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

[0182] The communication device described in the above embodiments can be a network device or a terminal device, but the scope of the communication device described in the embodiments of this application is not limited thereto, and the structure of the communication device is not limited to FIG15. The communication device can be a standalone device or part of a larger device. For example, the communication device can be:

[0183] (1) Independent integrated circuit IC, or chip, or chip system or subsystem;

[0184] (2) A collection of one or more ICs, optionally including a storage component for storing data and instructions;

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

[0186] (4) Modules that can be embedded in other devices;

[0187] (5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handheld devices, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, etc.

[0188] (6) Others, etc.

[0189] For communication devices that can be chips or chip systems, please refer to the schematic diagram of the chip structure shown in Figure 16. The chip 1600 shown in Figure 16 includes a processor 1601 and an interface 1602. Optionally, it may also include a memory 1603. The number of processors 1601 can be one or more, and the number of interfaces 1602 can be multiple.

[0190] For cases where the chip is used to implement the functions of the network device or terminal device in the embodiments of this application:

[0191] The interface 1602 is used to receive or output signals;

[0192] The processor 1601 is used to perform data processing operations of network devices or terminal devices.

[0193] It is understood that some optional features in the embodiments of this application can be implemented independently in certain scenarios without relying on other features, such as the current solution on which they are based, to solve the corresponding technical problems and achieve the corresponding effects. Alternatively, they can be combined with other features as needed in certain scenarios. Correspondingly, the communication device given in the embodiments of this application can also implement these features or functions, which will not be elaborated here.

[0194] It should be understood that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor described above can be a general-purpose 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, or discrete hardware components.

[0195] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but 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 synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0196] This application also provides a computer-readable storage medium including instructions that, when executed on a computer, cause the computer to perform the methods described in the foregoing embodiments.

[0197] This application also provides a computer program product containing instructions that, when run on a computer, cause the computer to perform the methods described in the foregoing embodiments.

[0198] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0199] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection between apparatuses or units through some interfaces, and may be electrical, mechanical, or other forms.

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

[0201] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0202] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0203] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented, in whole or in part, as 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 part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., high-density digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

Claims

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

2. The method of claim 1, wherein, The lattice-structured constellation diagram is a constellation diagram generated based on Eisenstein integers, or the lattice-structured 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: The total energy of the X constellation points is less than a first preset value; The X constellation points are symmetrical; or, The minimum Euclidean distance MED of the X constellation points is greater than the 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 segmenting the Y constellation points of the 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 map is composed of X constellation points from the Z constellation points of the third constellation map. The Z constellation points of the third constellation map are obtained by segmenting the Y constellation points of the second constellation map using a first window function. Z is a positive integer greater than X, and X is determined according to the modulation order and N.

7. The method according to any one of claims 1 to 3, characterized in that, The first constellation diagram is composed of X constellation points from the Y constellation points of the second constellation diagram, where 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 the 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, 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.

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

11. A communication method, comprising: include: A first signal is received 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 structure constellation diagram. X and N are both positive integers. The user data stream of the first user is obtained based on the X constellation points, where the first user is any one of the N users.

12. The method of claim 11, wherein, The lattice-structured constellation diagram is a constellation diagram generated based on Eisenstein integers, or the lattice-structured 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: The total energy of the first constellation diagram is less than the first preset value; The constellation points in the first constellation diagram are symmetrical; or, The minimum Euclidean distance (MED) of the first constellation diagram is greater than the 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 out of the X constellation points, where M is less than X.

15. A communications device, characterized by include: The processing module is used to obtain a first signal based on X constellation points of a first constellation diagram, wherein X is determined according to the modulation order and the number of users N on the first resource, the first constellation diagram is a lattice structure constellation diagram, and both X and N are positive integers; An interface module is used to send the first signal on the first resource.

16. A communications device, characterized by include: An interface module is used to receive 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 structure constellation diagram. X and N are both positive integers. The processing module is used to obtain the user data stream of the first user based on the X constellation points, wherein the first user is any one of the N users.

17. A communications device, characterized by include: A processor for executing a program that causes the communication device to perform the method as described in any one of claims 1 to 10.

18. A communications device, characterized by include: A processor for executing a program that causes the communication device to perform the method as described in any one of claims 11 to 14.

19. A communication system, characterized by include: A communication device for performing any of the methods described in steps 1 to 10, and a communication device for performing any of the methods described in claims 11 to 14.

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

21. A computer program product comprising instructions that, when run on a computer, causes the computer to perform the method as claimed in any one of claims 1 to 10, or causes the computer to perform the method as claimed in any one of claims 11 to 14.

Images