Communication method and device, storage medium and program product

Abstract

The embodiment of the invention provides a communication method and device, a storage medium and a program product, relates to the technical field of communication, and is used for reducing interference between users. The method comprises the following steps: a first node receives capability information sent by a second node, wherein the capability information is used for representing capability supported by the second node; based on the capability information, the first node sends first indication information to the second node, the first indication information is used for indicating a codebook to be used by the second node, the codebook is obtained based on a plurality of user constellation diagrams, and the plurality of user constellation diagrams are obtained by decomposing a superposed constellation diagram.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a communication method, apparatus, storage medium, and program product. Background Technology

[0002] In today's Internet of Things (IoT) and massive machine communication (MMT) fields, base stations need to provide services to a large number of devices or users. These devices often do not require high bandwidth, but there are often a large number of devices that need to be served at the same time. This demand places a heavy burden on current communication systems.

[0003] Current orthogonal frequency division multiple access (OFDMA) technology ensures that scheduled users are orthogonal in the time, frequency, or spatial domains, preventing interference between them and limiting the user capacity of base stations. To address this issue, the industry has proposed non-orthogonal multiple access (NOMA) technology, which significantly increases the user capacity of communication systems. NOMA technology utilizes power and code domain resources, meaning users are no longer orthogonal in the time or frequency domains. Several users share the same frequency or time domain resources, allowing more user information to be transmitted on the same time and frequency domain resources, thus increasing the user capacity of the communication system. However, this also introduces interference between users. Summary of the Invention

[0004] This disclosure provides a communication method, apparatus, storage medium, and program product for reducing interference between users.

[0005] To achieve the above objectives, the present disclosure adopts the following technical solution:

[0006] Firstly, a communication method is provided, the method comprising:

[0007] The first node receives capability information sent by the second node, which is used to characterize the capabilities supported by the second node;

[0008] Based on the capability information, the first node sends a first instruction message to the second node. The first instruction message is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing an overlay constellation diagram.

[0009] Secondly, a communication method is provided, the method comprising:

[0010] The second node sends capability information to the first node. The capability information is used to characterize the capabilities supported by the second node.

[0011] The second node receives the first instruction information sent by the first node. The first instruction information is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing the superimposed constellation diagram.

[0012] Thirdly, a communication device is provided, comprising:

[0013] The receiving unit is used to receive capability information sent by the second node, which is used to characterize the capabilities supported by the second node.

[0014] The sending unit is used to send first indication information to the second node based on capability information. The first indication information is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing the superimposed constellation diagram.

[0015] Fourthly, a communication device is provided, comprising:

[0016] The sending unit is used to send capability information to the first node, and the capability information is used to characterize the capabilities supported by the second node;

[0017] The receiving unit is used to receive the first indication information sent by the first node. The first indication information is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing the superimposed constellation diagram.

[0018] Fifthly, a communication device is provided, comprising: a processor and a memory; the memory storing processor-executable instructions; when the processor is configured to execute the instructions, causing the communication device to implement any of the methods provided in the first or second aspect above.

[0019] A sixth aspect provides a computer-readable storage medium that stores computer instructions that, when executed on a computer, cause the computer to perform any of the methods provided in the first or second aspect.

[0020] In a seventh aspect, a computer program product comprising computer instructions is provided, which, when executed on a computer, causes the computer to perform any of the methods provided in the first or second aspect.

[0021] In this embodiment of the disclosure, the codebook that the first node indicates the second node should use is obtained based on multiple user constellation diagrams. These multiple constellation diagrams are obtained by decomposing an overlay constellation diagram. In other words, in this embodiment of the disclosure, the codebook design order is to first design an overlay constellation diagram to reduce interference between users, design a user constellation diagram under the premise of ensuring minimal interference between users, and then obtain the codebook based on the user constellation diagram, thereby improving the performance of the codebook and reducing interference between users. Attached Figure Description

[0022] The accompanying drawings are provided to further understand the technical solutions of this disclosure and constitute a part of the specification. They are used together with the embodiments of this disclosure to explain the technical solutions of this disclosure and do not constitute a limitation on the technical solutions of this disclosure.

[0023] Figure 1 This is a schematic diagram of a multi-user coded transmission model using SCMA technology provided in an embodiment of the present disclosure;

[0024] Figure 2 A schematic diagram of a factor graph provided in an embodiment of this disclosure;

[0025] Figure 3 This is a schematic diagram of the structure of a communication system provided in an embodiment of the present disclosure;

[0026] Figure 4 A flowchart illustrating a communication method provided in an embodiment of this disclosure;

[0027] Figure 5 This is a schematic diagram of a decomposed and superimposed constellation diagram provided in an embodiment of the present disclosure;

[0028] Figure 6 This is another schematic diagram of a decomposed and superimposed constellation diagram provided in an embodiment of this disclosure;

[0029] Figure 7 This is a schematic diagram of multiple user constellation diagrams that interfere with user use, provided as an embodiment of the present disclosure;

[0030] Figure 8 A flowchart illustrating another communication method provided in an embodiment of this disclosure;

[0031] Figure 9 A schematic diagram of a user constellation provided in an embodiment of this disclosure;

[0032] Figure 10 A comparative diagram of SSMED and CWMED, representing different codebook schemes, is provided for embodiments of this disclosure.

[0033] Figure 11 A schematic diagram comparing the complexity of different demodulation methods provided in this disclosure embodiment;

[0034] Figure 12 A schematic diagram comparing the relationship between the number of iterations and the bit error rate under the MPA algorithm for different codebooks is provided for embodiments of this disclosure;

[0035] Figure 13 This is a schematic diagram illustrating the performance comparison of different codebooks under different signal-to-noise ratios, provided as an embodiment of the present disclosure.

[0036] Figure 14 A schematic diagram illustrating the performance comparison between SCMA codebook and MCB codebook under different overload rates provided in this embodiment of the disclosure;

[0037] Figure 15 This is a schematic diagram of the composition of a communication device provided in an embodiment of the present disclosure;

[0038] Figure 16 A schematic diagram illustrating the composition of another communication device provided in an embodiment of this disclosure;

[0039] Figure 17 This is a schematic diagram of the structure of a communication device provided in an embodiment of this disclosure. Detailed Implementation

[0040] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this disclosure.

[0041] Unless the context otherwise requires, throughout the specification and claims, the term "comprise" and other forms such as the third-person singular "comprises" and the present participle "comprising" are interpreted as open-ended and encompassing, meaning "including, but not limited to." In the description of the specification, terms such as "one embodiment," "some embodiments," "exemplary embodiments," "example," "specific example," or "some examples" are intended to indicate that a particular feature, structure, material, or characteristic associated with that embodiment or example is included in at least one embodiment or example of this disclosure. The illustrative representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics mentioned may be included in any suitable manner in any one or more embodiments or examples.

[0042] The terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this disclosure, unless otherwise stated, "a plurality of" means two or more.

[0043] In this disclosure, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" or "for example" in this disclosure should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0044] In addition, the use of “based on” implies openness and inclusivity, because processes, steps, calculations or other actions “based on” one or more of the stated conditions or values ​​may in practice be based on additional conditions or values ​​beyond those stated.

[0045] Currently, the mainstream NOMA technologies include sparse code multiple access (SCMA), power domain NOMA (PD-NOMA), and multi-user shared access (MUSA). Figure 1 The diagram shown is a schematic of a multi-user coded transmission model using SCMA technology provided in an embodiment of this disclosure. J users share K resources. Each user (also referred to as user equipment (UE)) is assigned a codebook (CB). Each codebook contains M (modulation order) codewords, and each codeword shares d resources. u K resources; the user selects the corresponding codeword based on the transmitted binary bitstream, and multiple codewords are superimposed and transmitted on K resources, with d transmitted on each resource. r User data; J, d u ,K,d r Satisfying J*d u =d r *K; User capacity overload rate is η = J / K. Figure 1 Data from 3 users was transmitted on each resource, and data from 6 users was transmitted on 4 resources, resulting in a user capacity overload rate of 150%. Here, J represents the number of users, and d... u The number of resources used by each codebook (user), d r K represents the number of users transmitting data on each resource, and K represents the total number of resources. It should be noted that... Figure 1 Rectangles with lines in different directions and rectangles with different numbers of dots represent different resources. The different directions of lines and different numbers of dots in the rectangles are only for distinguishing different resources and have no special meaning. Figure 1 In this context, UN represents user nodes and RN represents resource nodes.

[0046] Figure 2This is a schematic diagram of a factor graph provided in an embodiment of the present disclosure. The factor graph visually illustrates the relationship between user and resource occupancy. If the number of resources occupied by each user and the number of users supported by each resource are both constant values, then... Figure 2 The factor graph shown can be called a regular factor graph. Figure 2 The diagram shows the rule factor diagram corresponding to 4 resource nodes and 6 user nodes.

[0047] SCMA data is typically demodulated using a message passing algorithm (MPA). MPA is an iterative algorithm that passes confidence (messages) between user nodes and resource nodes. After multiple iterations, the probability of a user sending codewords converges and stabilizes, ultimately leading to a decision. The general steps of MPA are as follows:

[0048] (1) Initialize the probability of each codeword being sent to 1 / M. Then, based on the user and resource occupancy relationship in the Tanner graph, each user transmits the soft message containing the symbol for each resource to the occupied resource node. For example, Figure 2 The two dashed lines in the image represent user 1 sending messages to resource 1 and resource 2, respectively.

[0049] (2) According to the received d r Each resource node calculates the confidence level of each codeword sent by a user and sends it to the user node.

[0050] (3) User nodes according to d u Each resource node sends a message, calculates the confidence level of each codeword sent, and sends a message to the resource node.

[0051] After repeating processes (2) and (3) several times, the user node calculates the joint soft message of each codeword on each symbol and selects the codeword with the highest probability as the codeword sent by the user.

[0052] Among them, (2) the message generated based on the received signal is closely related to the constellation diagram superimposed on each resource. If the two points in the superimposed constellation diagram are too close to be distinguished, the unsigned rate of the algorithm will increase and the MPA algorithm will have a large number of iterations.

[0053] The codebook design method in related technologies involves first selecting a user constellation map, then optimizing the Euclidean distance of the superimposed constellation map by rotating the user constellation map and enumerating the rotation angles to improve performance. This design method is relatively complex, and the superimposed constellation map still exhibits the phenomenon of constellation points being too close together, resulting in mediocre codebook performance and interference between users.

[0054] Based on this, embodiments of this disclosure provide a communication method, apparatus, storage medium, and program product. The codebook that the first node indicates the second node should use is obtained based on multiple user constellation diagrams. The multiple constellation diagrams are obtained by decomposing a superimposed constellation diagram. In other words, the generation order of the codebook in this disclosure is different from that in related technologies. In this disclosure, the generation order of the codebook is to first design a superimposed constellation diagram to reduce interference between users, and then design a user constellation diagram under the premise of ensuring that the interference between users is small. The codebook is then obtained based on the user constellation diagram, which improves the performance of the codebook and thus reduces interference between users.

[0055] The embodiments of this disclosure will now be described in conjunction with the accompanying drawings.

[0056] The technical solutions provided in this disclosure can be applied to various mobile communication networks, such as NR mobile communication networks using 5th generation mobile networks (5G), future mobile communication networks (such as 6G wireless communication systems), or multiple communication convergence systems, etc. This disclosure does not limit them.

[0057] In this disclosure, the mobile communication network (including but not limited to 3G, 4G, 5G, and future mobile communication networks, such as 6G) may include network-side devices (e.g., including but not limited to base stations) and receiving-side devices (e.g., including but not limited to terminals). It should be understood that, in this example, for instance, in the downlink, the first communication node (also referred to as the first communication node device, the first node) may be a base station-side device, and the second communication node (also referred to as the second communication node device, the second node) may be a terminal-side device. In some examples, such as in the uplink, the first communication node may also be a terminal-side device, and the second communication node may also be a base station-side device. In some examples, such as in device-to-device communication between the two communication nodes, both the first and second communication nodes may be base stations or terminals. Therefore, whether the first and second nodes are base stations or terminals needs to be determined based on the context.

[0058] Figure 3 The diagram shown is a structural schematic of a communication system provided in an embodiment of this disclosure. Figure 3 As shown, the communication system includes, but is not limited to, a first node 110 and a second node 120. The first node 110 and the second node 120 can transmit and receive wireless signals and perform related interactions.

[0059] In a wireless communication scenario, the first node 110 and the second node 120 communicate via a wireless channel. For example, the first node 110 may be a base station, and the second node 120 a terminal; the base station and the terminal communicate via a wireless channel. Alternatively, the first node 110 may be a terminal, and the second node 120 a wireless router; the wireless router and the terminal communicate via a wireless channel. Another example is that the first node 110 may be a first base station, and the second node 120 a second base station; the first base station and the second base station communicate via a wireless channel. Yet another example is that the first node 110 may be a first terminal, and the second node 120 a second terminal; the first terminal and the second terminal communicate via a wireless channel. Finally, the first node 110 may be a repeater, and the second node 120 a base station; the base station and the repeater communicate via a wireless channel. Finally, the first node 110 may be a terminal, and the second node 120 a repeater; the repeater and the terminal communicate via a wireless channel. For example, node 110 is a first repeater, and node 120 is a second repeater; the first repeater and the second repeater communicate via a wireless channel. Alternatively, node 110 can be a base station, and node 120 a satellite; the satellite and the base station communicate via a wireless channel. Another example: node 110 can be a satellite, and node 120 a base station; the base station and the satellite communicate via a wireless channel. Yet another example: node 110 can be a terminal, and node 120 a satellite; the satellite and the terminal communicate via a wireless channel. Again, node 110 can be a satellite, and node 120 a terminal; the terminal and the satellite communicate via a wireless channel. Finally, node 110 can be ground equipment, and node 120 can be an aircraft; the aircraft and the ground equipment communicate via a wireless channel. Finally, node 110 can be a first aircraft, and node 120 a second aircraft; the first aircraft and the second aircraft communicate via a wireless channel.

[0060] Unless otherwise specified, the terms "first" node, "second" node, "first" method, "second" method, "first" approach, "second" approach, "first" matrix, "second" matrix, "first" part, and "second" part in this disclosure are used only for descriptive distinction and do not represent a sequential or chronological order.

[0061] In this disclosure, the base station can be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTEA), or an evolved Node B (eNB or eNodeB), a base station device in a 5G network, or a base station in a future communication system (such as 6G). The base station can include various macro base stations, micro base stations, home base stations, wireless remote extensions, reconfigurable intelligent surfaces (RISS), routers, wireless fidelity (WIFI) devices, or various network-side devices such as primary cells and secondary cells.

[0062] In this disclosure, a terminal is a device with wireless transceiver capabilities that can be deployed on land, including indoors or outdoors; on water (such as on ships); and in the air (such as on airplanes, balloons, and satellites). The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. The embodiments of this disclosure do not limit the application scenarios. A terminal may also be referred to as a user, user equipment, access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication device, UE agent, or UE device, etc. The embodiments of this disclosure are not limited to these terms.

[0063] It should be understood that Figure 3 This is an exemplary structural diagram. Figure 3 The communication system shown includes an unlimited number of devices; for example, the number of first nodes and second nodes is unlimited. Furthermore, except... Figure 3 In addition to the equipment shown, Figure 3 The communication system shown may also include other devices, which are not limited thereto.

[0064] Next, as Figure 4 As shown, this disclosure provides a communication method, which is applied to a first node, the first node being one of the above-described communication methods. Figure 3 The method for the first node 110 shown may include the following steps:

[0065] S101, The first node receives the capability information sent by the second node.

[0066] In some embodiments, in order to determine the codebook to be used during data transmission, the second node sends capability information to the first node. This capability information characterizes the capabilities supported by the second node. Accordingly, the first node receives the capability information sent by the second node.

[0067] It should be understood that the codebook design process involves multiple users (i.e., multiple second nodes). During demodulation, each second node needs to know the codebooks of other second nodes and the codebook it should use. This is necessary to employ methods such as MPA, successive interference cancellation (SIC), and minimum mean square error successive interference cancellation (MMSE-SIC) to demodulate the signal. Therefore, the first and second nodes need to coordinate via signaling to determine the codebook the second node should use.

[0068] In some embodiments, the capability information includes the modulation order supported by the second node.

[0069] In some embodiments, the capability information may also include energy supply capacity, environmental disturbance intensity, etc.

[0070] In some embodiments, the capability information is carried in a New Radio Capability (NR_Capability) signaling message. That is, the first node receives an NR_Capability signaling message sent by the second node, and the NR_Capability signaling message includes the capability information of the second node.

[0071] S102. Based on the capability information, the first node sends the first instruction information to the second node.

[0072] In some embodiments, after receiving capability information sent by the second node, the first node groups the second node based on the second node's capability information, service request, energy reserves, and codebook characteristics to determine the codebook group to which the second node belongs. Then, based on the codebook group to which the second node belongs, the first node determines the codebook that the second node should use and sends first indication information to the second node. The first indication information is used to indicate the codebook that the second node should use.

[0073] In some embodiments, the first indication information includes at least one of the following:

[0074] Codebook identifiers;

[0075] The identifier of the codebook group to which the second node belongs;

[0076] The bitmap of the codebook group to which the second node belongs.

[0077] It should be noted that the generation process of the codebook to be used by the second node can be the same on both the first and second node sides, which will not be elaborated further below.

[0078] In some embodiments, the first node and the second node pre-design codebook groups according to the codebook generation process described below. Each codebook group is designed with an overload rate, occupies a different number of resources, and has a different modulation order. Each codebook in the codebook group has a different codebook identifier.

[0079] It should be noted that the second nodes within the same codebook group share the same time-frequency domain resources and the same modulation order. When determining the codebook to be used by the second node, the first node allocates a high-power codebook to the second node with strong power supply or high external interference to improve the transmission performance of the second node, and allocates a low-power codebook to the second node with weak power supply or low interference to improve the endurance of the second node.

[0080] In some embodiments, the codebook used by the second node is obtained based on multiple user constellation diagrams, which are obtained by decomposing an overlay constellation diagram. That is, in this embodiment of the disclosure, the codebook production process is to first determine the overlay constellation diagram, then decompose the overlay constellation diagram to obtain multiple user constellation diagrams, and then generate a codebook based on the multiple user constellation diagrams.

[0081] A constellation diagram, also known as a signal space diagram or signal vector diagram, is a combination of all symbol points of the modulated signal on the IQ plane (the plane formed by the in-phase component I and the quadrature component Q). Each point represents a specific modulation symbol, determined by the I / Q components. By observing the constellation diagram, one can intuitively understand the modulation scheme and signal quality. A user constellation diagram typically refers to the distribution of the modulated signal for a specific user or user group on the IQ plane in a digital communication system. This type of constellation diagram can intuitively show the modulation scheme and signal quality of the user signal. A superimposed constellation diagram, on the other hand, refers to the constellation diagram formed on the IQ plane by superimposing the signals from multiple users or multiple carriers in a multi-user or multi-carrier communication system. In summary, user constellation diagrams and superimposed constellation diagrams are used in codebooks to describe the modulation signal characteristics of a specific user or user group and the signal superposition effect in a multi-user or multi-carrier communication system, respectively.

[0082] In some embodiments, the superimposed constellation diagram includes a quadrature amplitude modulation (QAM) constellation diagram. It should be understood that the degree of inter-user interference is reflected in the distinguishability of constellation points in the superimposed constellation diagram. If constellation points can be perfectly distinguished, then there is no inter-user interference. Because QAM constellation diagrams have uniform distribution characteristics and large distances between constellation points, making them easy to distinguish, this embodiment of the disclosure selects a QAM constellation diagram as a superimposed constellation diagram for each resource to reduce inter-user interference and lower the probability of misjudgment.

[0083] As a possible example, the overlay constellation diagram includes QAM constellation diagrams with dimensions greater than a preset threshold; for example, the overlay constellation diagram is a 64QAM constellation diagram.

[0084] It should be understood that choosing a large-dimensional QAM constellation map as the overlay constellation map for each resource prioritizes ensuring the Euclidean distance of the overlay constellation maps for each resource, thereby further reducing interference between users.

[0085] Taking the 64QAM constellation chart as an example, the following provides an illustrative explanation of how to decompose the overlay constellation chart to obtain multiple user constellation charts.

[0086] For ease of description, let's assume here that K = 4, M = 4, J = 6, and d u =2,d r =3, assume S (1) ,S (2) ,S (3) It is a constellation diagram with three identical dimensions, and the average power satisfies P(S (3) )>=P(S (2) )>=P(S (1) The following codeword matrix helps to describe the codebook design process:

[0087]

[0088] Where CM is the codeword matrix, s (1) ∈S (1) s (2) ∈S (2) s (3) ∈S (3) S (1) S (2) S (3) This is a constellation diagram of users on a single resource. Here, to consider codebook power balance, s... (1) and s (3) To form a codeword, two s (2) This forms a codeword. It's evident that the superimposed constellation diagrams on each resource are identical. This is achieved through the design of S... (1) S (2) S (3) This not only allows the constellation points of the superimposed constellation diagram to be evenly distributed within the IQ plane, but also allows S... (1) S (2) S (3) They are evenly distributed within the IQ plane to increase anti-interference capability.

[0089] Since the messages transmitted in the MPA algorithm are closely related to the superimposed constellation diagram, designing a superimposed constellation diagram with a large minimum Euclidean distance is the first step in designing the codebook. Using the QAM constellation diagram as the superimposed constellation diagram is a relatively ideal choice. The average power of the superimposed constellation diagram is:

[0090]

[0091] Among them, P SC To superimpose the average power of the constellation diagram, P US The average power of the user constellation diagram is given by , D is an intermediate variable, M is the modulation order, and M is the number of codewords in each codebook.

[0092] In some embodiments, the intermediate variable D is obtained based on the following formula.

[0093]

[0094] Where R(.) represents taking the real part of the imaginary number, and I(.) represents taking the imaginary part of the imaginary number.

[0095] The above formula shows that the average power of the superimposed constellation diagram is equal to the average power of all user constellation diagrams on each resource. While ensuring the minimum Euclidean distance remains constant, the power of users can be controlled by controlling the power of the superimposed constellation diagram, thereby improving power efficiency. It can be seen that the total number of constellation points in the superimposed constellation diagram is... Let A = log2Md r If A / 2 is even, then the superimposed constellation diagram is The QAM constellation chart; if A / 2 is odd, then the superimposed constellation chart is A superimposed constellation chart.

[0096] As shown above, taking the 64QAM constellation chart as an example, Figure 5 A schematic diagram of a decomposed superimposed constellation (DCSC) provided for an embodiment of this disclosure is shown below. Figure 5 A 64QAM constellation can be decomposed into a 16QAM constellation (represented by rectangular blocks in the diagram) and a 4QAM constellation. By shifting the 16QAM constellation to the upper left, lower left, upper right, and lower right by √2 / 2 units respectively, the 64QAM constellation (represented by circles in the diagram) can be obtained. Therefore, S (1) ={0.5+0.5j,0.5-0.5j,-0.5+0.5j,-0.5-0.5j}.

[0097] Similarly, Figure 6 This is another schematic diagram of a decomposed and superimposed constellation diagram provided by an embodiment of this disclosure. The 16QAM constellation diagram in the above figure can be decomposed into two 4QAM constellation diagrams, that is, S (1) Decomposing it into two 4QAM constellation diagrams yields S (2) ={1+j,1-j,-1+j,-1-j},S (3) ={2+2j,2+2j,-2-2j,-2+2j};

[0098] The obtained multiple user constellation charts can be as follows Figure 7 As shown, Figure 7 The diagram shows multiple user constellation diagrams that interfere with user operations. Each constellation diagram is a QAM constellation diagram with constellation points evenly distributed in the IQ plane. Moreover, the power of different user constellation diagrams varies significantly.

[0099] Table 1 shows a comparison of the average power of constellation diagrams for different modulation orders and different numbers of interfering users.

[0100] Table 1

[0101]

[0102]

[0103] It should be noted that Table 1 above assumes S (1)The average power is the smallest and is 1; Table 1 only lists the ratio of codebook power that is practical, because as the codebook modulation order increases, the demodulation complexity increases, and as the power difference between different codebooks increases, the smaller codebook has a smaller effect and can be deleted; the embodiments of this disclosure recombine different constellation diagrams on different resources in the codebook to ensure that the average power of the codebooks of different users is as close as possible.

[0104] As shown in the example above, the superimposed constellation chart can be decomposed to obtain multiple user constellation charts.

[0105] As an example, the codebook is obtained by processing multiple user constellation graphs as follows:

[0106] S1. Based on the constellation points in every two user constellation diagrams, obtain multiple constellation point combinations.

[0107] In other words, for every two user constellation diagrams in multiple user constellation diagrams, the constellation points in one user constellation diagram are connected or combined with the constellation points in the other user constellation diagram to obtain a constellation point combination. Then, the constellation points in the first user constellation diagram are replaced with the constellation points in the second user constellation diagram to obtain another constellation point combination. That is, the constellation point pairs are replaced, so that one constellation point in one user constellation diagram is connected or combined with all the constellation points in the second user constellation diagram to obtain multiple constellation point combinations.

[0108] In some embodiments, each pair of user constellation graphs is obtained after load balancing of multiple user constellation graphs.

[0109] In some embodiments, constellation point combinations may also have other names, such as multidimensional codebooks, etc., and this disclosure does not limit them.

[0110] S2. Based on the minimum Euclidean distance between constellation points in each constellation point combination, determine the target constellation point combination from multiple constellation point combinations.

[0111] In some embodiments, the target constellation point combination is the constellation point combination that has the largest minimum Euclidean distance among multiple constellation point combinations.

[0112] Euclidean distance (ED), also known as Euclidean distance, is a commonly used definition of distance, measuring the absolute distance between two points in multidimensional space. In two-dimensional space, Euclidean distance is the distance between the straight line segments of two points; in three-dimensional space, it is the straight-line distance between two points; the minimum Euclidean distance refers to the minimum Euclidean distance between any two points among a given set of points. In this embodiment of the disclosure, the target constellation point combination is defined as the constellation point combination with the largest minimum Euclidean distance among multiple constellation point combinations, which refers to:

[0113] Multiple constellation point combinations: There are multiple combinations consisting of constellation points.

[0114] Euclidean distance between constellation points: For each constellation point combination, the Euclidean distance between any two constellation points can be calculated.

[0115] Minimum Euclidean distance: For each constellation point combination, the minimum Euclidean distance between all pairs of constellation points can be found.

[0116] Maximum minimum Euclidean distance: Among all constellation point combinations, compare the minimum Euclidean distances and find the maximum value.

[0117] Target constellation point combination: The constellation point combination with the largest minimum Euclidean distance value is the target constellation point combination.

[0118] S3. Generate a codebook based on the combination of target constellation points.

[0119] In some embodiments, a codebook is generated based on the combination of target constellation points and a sparse spreading matrix.

[0120] The sparse spreading matrix is ​​a key component of the SCMA system. In an SCMA system, each user's data is spread using a specific sparse spreading sequence, which forms the sparse spreading matrix. A sparse matrix is ​​one in which the number of non-zero elements is much smaller than the number of zero elements. This characteristic allows the SCMA system to utilize spectrum resources more effectively while reducing interference between multiple users.

[0121] Based on the target constellation point combination and the sparse spreading matrix, a codebook is generated. This can be achieved by combining the target constellation point combination with the sparse spreading matrix to generate a constellation matrix. Each element of the constellation matrix is ​​determined by both the constellation diagram corresponding to the user and the elements in the sparse spreading matrix. Each row vector of the constellation matrix corresponds to a user, and each column vector corresponds to a resource block. Through the constellation matrix, user signals can be mapped to different resource blocks, achieving a combination of spreading and modulation. Finally, a codebook is generated based on the constellation matrix.

[0122] For example, enumerating S (1) S (3) We consider all possible constellation points, resulting in multiple constellation point combinations. For each combination, we calculate the minimum Euclidean distance and select the constellation point combination with the largest minimum Euclidean distance as the target constellation point combination. For example, it can be represented by the following formula:

[0123]

[0124] in, C (j,t) Column a, C (j,t) =[s (dr) ,s (dr-1) ,...,s (1) ] T For a combination of multiple constellation points, T = (M!) N-1 Given the size of the constellation point combination, the final codebook is:

[0125] CB (j) =v (j) C (j,*) ;

[0126] Among them, V (j) S is the sparse spreading matrix used by user j, where non-zero elements represent the user's resource usage. Similarly, S is enumerated. (2) S (2) All possible cases of the middle constellation point, i.e., enumerating S. (2) S (2) By combining constellation points, you can obtain other users' codebooks.

[0127] In some embodiments, the codebook design method shown in S1-S3 above can be called the minimum Euclidean distance between codewords (MED, CWMED) codebook design method.

[0128] As another example, the codebook is derived from the linear relationship between constellation points in multiple user constellation graphs.

[0129] The above example obtains the codebook by enumerating the combinations of constellation points in each user's constellation graph. Combined with the above regarding S... (1) S (2) S (3) The description reveals S (1) S (2) S (3)A linear relationship exists. For the same codeword, if the constellation points on different resources are kept linearly related, the design process can be simplified (avoiding enumeration and optimizing the demodulation method). In other words, obtaining the codebook based on the linear relationship of constellation points in multiple user constellation graphs can avoid enumeration and optimize the demodulation method.

[0130] For example, based on the linear relationship between constellation points in multiple user constellation diagrams, the codeword matrix can be transformed as shown in the following formula:

[0131]

[0132] Furthermore, based on the transformed codeword matrix, the resulting codebook can be represented by the following formula:

[0133]

[0134] In some embodiments, when the codebook is obtained based on the linear relationship between constellation points in multiple user constellation graphs, the codebook design method can be called the linearly correlated codebook (LCB) design method.

[0135] The above embodiments decompose the superimposed constellation diagram to obtain multiple user constellation diagrams, and then directly obtain the codebook based on the multiple user constellation diagrams. As another example, in order to improve anti-interference ability and further reduce interference between users, the codebook is obtained by processing the multiple user constellation diagrams as follows:

[0136] Delete the user constellation with the lowest power from multiple user constellation graphs to obtain the deleted user constellation graph; generate a codebook based on the deleted user constellation graph.

[0137] In other words, after obtaining multiple user constellation diagrams, the user constellation diagram with the lowest power in multiple user constellation diagrams is deleted to obtain the deleted user constellation diagram; and then a codebook is generated based on the deleted user constellation diagram.

[0138] For example, the multiple user constellation diagrams S obtained through the above decomposition (1) S (2) S (3) S was discovered (1) S (2) S (3) There is a significant power difference, due to S (1) Power relative to S (3) The power is relatively small, for S (1) and S (3) The performance impact of the resulting codewords is minimal; removing S can be considered. (1) The codeword matrix is ​​now modified as follows:

[0139]

[0140] It should be understood that by deleting the user constellation with the lowest power in multiple user constellation diagrams, optimizing the codeword matrix, reducing the data of interfering users on each resource, reducing the size of the superimposed constellation diagram, increasing the minimum Euclidean distance of the superimposed constellation diagram, and improving the anti-interference capability, the interference between users can be further reduced.

[0141] It should be noted that after deleting the user constellation graph with the lowest power from multiple user constellation graphs, the factor graph becomes an irregular factor graph because each user occupies different resource data, but the number of users d shared on each resource is different. r The value is 2, compared to the d of the original codeword matrix CM. r With a value of 3, the demodulation complexity of MPA is reduced to 1 / 6 of its original value. Considering the reduction in the number of iterations due to the increase in Euclidean distance, the demodulation complexity will be further reduced. At the same time, since the number of interfering users on each resource is reduced, the number of MPA message transmissions can be reduced, thus reducing the MPA detection time complexity.

[0142] The description of generating the codebook based on the deleted user constellation graph can be found in the description of S1-S3 above, and will not be repeated here.

[0143] In some embodiments, when the codebook is generated based on the deleted user constellation graph, the codebook design method can be called the simplified decompose superimposed (SDCSC) codebook design method. When the codebook is generated based on an irregular factor graph, the codebook can be called the simplified MCB (SMCB) codebook and the simplified LCB (LCB) codebook.

[0144] based on Figure 4 In the illustrated embodiment, the codebook that the first node indicates the second node should use is obtained based on multiple user constellation diagrams. These multiple constellation diagrams are obtained by decomposing a superimposed constellation diagram. In other words, the generation order of the codebook in this embodiment differs from that in related technologies. In this embodiment, the generation order of the codebook is to first design a superimposed constellation diagram to reduce interference between users, and then design a user constellation diagram under the premise of ensuring minimal interference between users. The codebook is then obtained based on the user constellation diagram, which improves the performance of the codebook and thus reduces interference between users.

[0145] Furthermore, in this embodiment, a large-dimensional QAM constellation graph is selected as the superimposed constellation graph for each resource, prioritizing the Euclidean distance of the superimposed constellation graphs on each resource to reduce interference between users. Then, the constellation graphs interfering with users are designed by decomposing the superimposed constellation graphs. Finally, multi-dimensional codewords are designed using enumeration or linear correlation methods, leading to the design of the codebook, thus improving the performance of the SCMA system. Moreover, by deleting constellation graphs with lower power in the user constellation graphs, the minimum Euclidean distance of the superimposed constellation graphs under unit power is further increased, reducing interference between users.

[0146] The above describes the process of generating the codebook that the first node instructs the second node to use. In some embodiments, after receiving the first instruction information, the second node performs data transmission based on the codebook indicated by the first instruction information. Before the second node is powered off or deactivated, the second node sends a second instruction information to the first node. The second instruction information is used to instruct the release of the codebook. Accordingly, the first node receives the second instruction information sent by the second node, and in response to the second instruction information, deletes the second node from the codebook group to which the second node belongs, and updates or modifies the bitmap of the codebook group.

[0147] In some embodiments, the second indication information is carried in an uplink dedicated control channel message (UL_DCCH_Message).

[0148] In some embodiments, after the first node deletes the second node from the codebook group to which the second node belongs and updates the bitmap of the codebook group, the first node sends a third indication message to the second node. The third indication message is used to indicate that the bitmap update or modification of the codebook group is complete.

[0149] In some embodiments, the third indication information is carried in a radio resource control (RRC) reconfiguration message.

[0150] The above embodiments are illustrative of a communication method provided by this disclosure from the perspective of a first node. In some embodiments, such as... Figure 8 As shown in the embodiments of this disclosure, a communication method is provided for a second node, and the method may include the following steps:

[0151] S201, The second node sends capability information to the first node.

[0152] Among them, capability information is used to characterize the capabilities supported by the second node.

[0153] In some embodiments, after the second node connects to the first node, it sends capability information to the first node.

[0154] For a description of capability information, please refer to the above. Figure 4 The corresponding descriptions in the illustrated embodiments are not repeated here.

[0155] S202, The second node receives the first instruction information sent by the first node.

[0156] The first indication information is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing the superimposed constellation diagram.

[0157] In some embodiments, the first indication information includes at least one of the following:

[0158] Codebook identifiers;

[0159] The identifier of the codebook group to which the second node belongs;

[0160] The bitmap of the codebook group to which the second node belongs.

[0161] In some embodiments, the overlay constellation diagram includes a quadrature amplitude modulation constellation diagram. For example, the overlay constellation diagram includes a 64QAM constellation diagram.

[0162] As an example, the codebook is obtained by processing multiple user constellation graphs by the second node as follows:

[0163] X1. Based on the constellation points in every two user constellation graphs, multiple constellation point combinations are obtained.

[0164] In some embodiments, every two user constellation diagrams are obtained after load balancing of the plurality of user constellation diagrams.

[0165] X2. Based on the minimum Euclidean distance between constellation points in each constellation point combination, determine the target constellation point combination from multiple constellation point combinations.

[0166] In some embodiments, the target constellation point combination is the constellation point combination that has the largest minimum Euclidean distance among multiple constellation point combinations.

[0167] X3. Generate a codebook based on the combination of target constellation points.

[0168] In some embodiments, a codebook is generated based on the combination of target constellation points and a sparse spreading matrix.

[0169] The descriptions of X1-X3 can be found in the descriptions of S1-S3 above, and will not be repeated here.

[0170] As another example, the codebook is obtained by processing multiple user constellation graphs as follows:

[0171] Delete the user constellation with the lowest power from multiple user constellation charts to obtain the user constellation chart after deletion;

[0172] A codebook is generated based on the deleted user constellation graph.

[0173] As another example, the codebook is derived from the linear relationship between constellation points in multiple user constellation graphs.

[0174] For descriptions of codebooks derived from deleted user constellation graphs or from linear relationships between constellation points in multiple user constellation graphs, please refer to the above. Figure 4 The corresponding descriptions in the illustrated embodiments are not repeated here.

[0175] based on Figure 8 In the illustrated embodiment, the codebook that the first node indicates the second node should use is obtained based on multiple user constellation diagrams. These multiple constellation diagrams are obtained by decomposing a superimposed constellation diagram. In other words, the generation order of the codebook in this embodiment differs from that in related technologies. In this embodiment, the generation order of the codebook is to first design a superimposed constellation diagram to reduce interference between users, and then design a user constellation diagram under the premise of ensuring minimal interference between users. The codebook is then obtained based on the user constellation diagram, which improves the performance of the codebook and thus reduces interference between users.

[0176] In some embodiments, after receiving the first indication information, the second node initializes the demodulation algorithm based on the first indication information. The demodulation algorithm includes the MPA algorithm and the successive interference cancellation (SIC) algorithm. Initializing the MPA algorithm requires generating a factor map based on the codebook bitmap, while initializing the SIC algorithm requires determining the high-power signals to be demodulated and eliminated preferentially based on the codebook power.

[0177] In some embodiments, before the second node is powered off or deactivated, the second node sends a second instruction message to the first node, the second instruction message being used to instruct the release of the codebook.

[0178] The second instruction information may also have other names, such as codebook release information, etc., and this disclosure does not limit this.

[0179] In some embodiments, the second node receives third indication information sent by the first node, the third indication information being used to indicate that the bitmap update or modification of the code group is complete.

[0180] The descriptions of the first to third instruction information can be found in the above embodiments, and will not be repeated here.

[0181] In some embodiments, the second node can perform user detection after receiving the first indication information. Compared with the codebook designed by the simplified decompose superimposed (SDCSC) method, the codebook design method of the communication method provided in this disclosure reduces the complexity of MPA demodulation due to the reduction in users superimposed on resource nodes. However, since MPA is still an iterative algorithm, its complexity remains relatively high. Based on the characteristics of the designed codebook and serial interference cancellation, embodiments of this disclosure propose two linear detection methods.

[0182] 1. Multi-user detection based on SIC.

[0183] For the codebook designed in this embodiment, the superimposed user power on each resource has significant differences. Other low-power signals can be regarded as interference. For the detection of the highest power signal, the received signal can be regarded as:

[0184] y k =s k +g k +n k k = {1, 2, ..., K};

[0185] Prioritize detecting signals from high-power users. k Then from the received signal y k Subtract high-power signal s k The system sequentially detects the signals of the next highest and lowest power users from the remaining signals until all users' signals have been detected or the system detects its own signal.

[0186] 2. Multi-user detection based on MMSE-SIC.

[0187]

[0188] When generating a codebook based on the deleted user constellation graph, the received signal can be simplified to:

[0189] y = Qs + n

[0190] =Qs+n

[0191] =Wx + W′x′ + n;

[0192] =Wx+g+n

[0193] ≈Wx+n′

[0194] Where W is the equivalent channel matrix. Since the power of the first K users is relatively high and the power of the last two users is relatively low, the signals of the last two users can be regarded as interference. The signals of the first 4 users are demodulated first, and then the demodulated signals of the first 4 users are subtracted from the received signal. Then the second highest power signal is detected in the remaining signal.

[0195] Figure 9 The diagram shown is a user constellation diagram used in an embodiment of this disclosure. Figure 10 The diagram shows a comparison of SSMED and CWMED with different codebook schemes. Figure 11 The diagram shows a comparison of the complexity of different demodulation methods. Figure 12 The diagram shows a comparison of the number of iterations and bit error rate under different codebooks in the MPA algorithm. (See also...) Figure 12 The embodiments disclosed herein use the MPA algorithm, which can achieve faster and better performance than other current solutions with the same number of iterations; the final performance can be achieved in just two iterations.

[0196] Figure 13 The diagram shows a performance comparison of different codebooks at different signal-to-noise ratios. (See also...) Figure 13 The performance of the same codebook under different demodulation methods allows users to choose different terminal demodulation methods according to their own performance requirements.

[0197] Figure 14 The diagram shows a performance comparison between the SCMA codebook and the MCB codebook under different overload rates. (See also...) Figure 14 Under different overload rates, the codebook provided in this embodiment can still achieve good performance even with an overload rate as high as 250% (the number of users increases by 2.5 times).

[0198] It should be noted that the above Figures 9 to 14 The parameters shown are merely logical examples and have no practical reference value.

[0199] The foregoing primarily describes the solution provided in this disclosure from the perspective of the interaction between various nodes. It is understood that each node, such as the first node or the second node, includes corresponding hardware structures and / or software modules to perform the aforementioned functions. Those skilled in the art should readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments disclosed herein, this disclosure can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0200] This disclosure embodiment can divide the first node or the second node into functional modules according to the above method embodiment. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one functional module. The integrated module can be implemented in hardware or software. It should be noted that the module division in this disclosure embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the example of dividing each functional module according to each function.

[0201] Figure 15 This is a schematic diagram illustrating the composition of a communication device provided in an embodiment of this disclosure. Figure 15 As shown, the communication device 30 includes a receiving unit 301 and a transmitting unit 302.

[0202] The communication device 30 can be the first node or a chip within the first node. When the communication device 30 is used to implement the functions of the first node in the above embodiments, each unit is specifically used to implement the following functions.

[0203] The receiving unit 301 is used to receive capability information sent by the second node, the capability information being used to characterize the capabilities supported by the second node;

[0204] The sending unit 302 is used to send first indication information from the first node to the second node based on capability information. The first indication information is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing the superimposed constellation diagram.

[0205] In some embodiments, the sending unit 302 is specifically used to obtain multiple constellation point combinations based on constellation points in every two user constellation maps; determine a target constellation point combination from the multiple constellation point combinations based on the minimum Euclidean distance between constellation points in each constellation point combination; and generate a codebook based on the target constellation point combination.

[0206] In some embodiments, the transmitting unit 302 is specifically used to generate a codebook based on the target constellation point combination and the sparse spreading matrix.

[0207] In some embodiments, the sending unit 302 is specifically used to delete the user constellation diagram with the lowest power among multiple user constellation diagrams to obtain a deleted user constellation diagram; and to generate a codebook based on the deleted user constellation diagram.

[0208] In some embodiments, the receiving unit 301 is further configured to receive second indication information sent by the second node, the second indication information being used to indicate the release of the codebook; in response to the second indication information, the second node is deleted from the codebook group to which the second node belongs, and the bitmap of the codebook group is updated.

[0209] Figure 16 This is a schematic diagram illustrating the composition of another communication device provided in an embodiment of this disclosure. (See diagram below.) Figure 16 As shown, the communication device 40 includes a transmitting unit 401 and a receiving unit 402.

[0210] The communication device 40 can be the second node or a chip within the second node. When the communication device 40 is used to implement the functions of the second node in the above embodiments, each unit is specifically used to implement the following functions.

[0211] The sending unit 401 is used to send capability information to the first node, and the capability information is used to characterize the capabilities supported by the second node;

[0212] The receiving unit 402 is used to receive the first indication information sent by the first node. The first indication information is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams. The multiple user constellation diagrams are obtained by decomposing the superimposed constellation diagram.

[0213] In some embodiments, the receiving unit 402 is specifically configured to obtain multiple constellation point combinations based on constellation points in every two user constellation maps; determine a target constellation point combination from the multiple constellation point combinations based on the minimum Euclidean distance between constellation points in each constellation point combination; and generate a codebook based on the target constellation point combination.

[0214] In some embodiments, the receiving unit 402 is specifically used to generate a codebook based on the target constellation point combination and the sparse spreading matrix.

[0215] In some embodiments, the receiving unit 402 is specifically used to delete the user constellation diagram with the lowest power among multiple user constellation diagrams to obtain a deleted user constellation diagram; and to generate a codebook based on the deleted user constellation diagram.

[0216] In some embodiments, the sending unit 401 is further configured to send second indication information to the first node, the second indication information being used to indicate the release codebook.

[0217] It should be noted that, Figure 15 or Figure 16 The units within can also be called modules; for example, a transmitting unit can be called a transmitting module. Additionally, in... Figure 15 or Figure 16 In the embodiments shown, the names of the various units may not be the same as those shown in the figures. For example, the transmitting unit may also be called the communication unit, and the receiving unit may also be called the communication unit.

[0218] Figure 15 or Figure 16If the various units in the present disclosure are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of this disclosure, in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, 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.) or processor to execute all or part of the steps of the methods of the various embodiments of this disclosure. Storage media for storing computer software products include 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.

[0219] When the communication device 30 or communication device 40 implements the functions of the integrated module in hardware, this disclosure provides a schematic diagram of the structure of a communication device. For example... Figure 17 As shown, the communication device 50 includes: a processor 502, a communication interface 503, and a bus 504. Optionally, the communication device 50 may also include a memory 501.

[0220] Processor 502 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with this disclosure. Processor 502 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with this disclosure. Processor 502 may also be a combination that implements computing functions, such as including one or more microprocessor combinations, a combination of a DSP and a microprocessor, etc.

[0221] Communication interface 503 is used to connect to other devices via a communication network. This communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0222] The memory 501 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), disk storage medium or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto.

[0223] In one possible implementation, the memory 501 can exist independently of the processor 502. The memory 501 can be connected to the processor 502 via a bus 504 and is used to store instructions or program code. When the processor 502 calls and executes the instructions or program code stored in the memory 501, it can implement the communication method provided in the embodiments of this disclosure.

[0224] In another possible implementation, the memory 501 can also be integrated with the processor 502.

[0225] Bus 504 can be an extended industry standard architecture (EISA) bus, etc. Bus 504 can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 17 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0226] Through the above description of the implementation methods, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the first node or the second node can be divided into different functional modules to complete all or part of the functions described above.

[0227] This disclosure also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be executed by computer instructions instructing related hardware. The program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can also be an external storage device for the first or second node, such as a pluggable hard drive, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the first or second node. Further, the computer-readable storage medium can include both internal storage units of the first or second node and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the first or second node. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0228] This disclosure also provides a computer program product comprising a computer program that, when run on a computer, causes the computer to perform any of the communication methods provided in the above embodiments.

[0229] Although this disclosure has been described herein in conjunction with various embodiments, those skilled in the art will understand and implement other variations of the disclosed embodiments by reviewing the accompanying drawings, the disclosure, and the appended claims in carrying out the claimed disclosure. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude a plurality. A single processor or other unit can implement several functions listed in the claims. While different dependent claims may recite certain measures, this does not mean that these measures cannot be combined to produce a good effect.

[0230] Although this disclosure has been described in conjunction with specific features and embodiments, it will be apparent that various modifications and combinations can be made therein without departing from the spirit and scope of this disclosure. Accordingly, this specification and drawings are merely exemplary illustrations of the disclosure as defined by the appended claims and are to be considered as covering any and all modifications, variations, combinations, or equivalents within the scope of this disclosure. It is obvious that those skilled in the art can make various alterations and modifications to this disclosure without departing from its spirit and scope. Thus, this disclosure is also intended to include any such modifications and modifications that fall within the scope of the claims of this disclosure and their equivalents.

[0231] The above are merely specific embodiments of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. A communication method, characterized in that, The method includes: The first node receives capability information sent by the second node, the capability information being used to characterize the capabilities supported by the second node; Based on the capability information, the first node sends a first instruction to the second node. The first instruction is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing an overlay constellation diagram.

2. The method according to claim 1, characterized in that, The superimposed constellation diagram includes an orthogonal amplitude modulation constellation diagram.

3. The method according to claim 1, characterized in that, The codebook is obtained by processing the multiple user constellation diagrams as follows: Based on the constellation points in every two user constellation diagrams, multiple combinations of constellation points are obtained; A target constellation point combination is determined from the plurality of constellation point combinations based on the minimum Euclidean distance between constellation points in each constellation point combination; The codebook is generated based on the target constellation point combination.

4. The method according to claim 3, characterized in that, The target constellation point combination is the constellation point combination with the largest minimum Euclidean distance among the multiple constellation point combinations.

5. The method according to claim 3, characterized in that, The process of generating the codebook based on the target constellation point combination includes: The codebook is generated based on the target constellation point combination and the sparse spreading matrix.

6. The method according to claim 3, characterized in that, Each pair of user constellation diagrams is obtained after load balancing of the multiple user constellation diagrams.

7. The method according to claim 1, characterized in that, The codebook is obtained by processing the multiple user constellation diagrams as follows: Delete the user constellation with the lowest power from the multiple user constellation charts to obtain the deleted user constellation chart; The codebook is generated based on the deleted user constellation graph.

8. The method according to claim 1, characterized in that, The codebook is obtained based on the linear relationship between constellation points in the multiple user constellation diagrams.

9. The method according to claim 1, characterized in that, The first indication information includes at least one of the following: The identifier of the codebook; The identifier of the codebook group to which the second node belongs; The bitmap of the codebook group to which the second node belongs.

10. The method according to claim 1, characterized in that, The method further includes: The first node receives a second indication message sent by the second node, the second indication message being used to indicate the release of the codebook; In response to the second instruction information, the second node is deleted from the codebook group to which the second node belongs, and the bitmap of the codebook group is updated.

11. A communication method, characterized in that, The method includes: The second node sends capability information to the first node, the capability information being used to characterize the capabilities supported by the second node; The second node receives a first indication message sent by the first node. The first indication message is used to indicate the codebook that the second node should use. The codebook is obtained based on multiple user constellation diagrams, which are obtained by decomposing an overlay constellation diagram.

12. The method according to claim 11, characterized in that, The superimposed constellation diagram includes an orthogonal amplitude modulation constellation diagram.

13. The method according to claim 11, characterized in that, The codebook is obtained by processing the multiple user constellation diagrams as follows: Based on the constellation points in every two user constellation diagrams, multiple combinations of constellation points are obtained; A target constellation point combination is determined from the plurality of constellation point combinations based on the minimum Euclidean distance between constellation points in each constellation point combination; The codebook is generated based on the target constellation point combination.

14. The method according to claim 13, characterized in that, The target constellation point combination is the constellation point combination with the largest minimum Euclidean distance among the multiple constellation point combinations.

15. The method according to claim 13, characterized in that, The process of generating the codebook based on the target constellation point combination includes: The codebook is generated based on the target constellation point combination and the sparse spreading matrix.

16. The method according to claim 13, characterized in that, Each pair of user constellation diagrams is obtained after load balancing of the multiple user constellation diagrams.

17. The method according to claim 11, characterized in that, The codebook is obtained by processing the multiple user constellation diagrams as follows: Delete the user constellation with the lowest power from the multiple user constellation charts to obtain the deleted user constellation chart; The codebook is generated based on the deleted user constellation graph.

18. The method according to claim 11, characterized in that, The codebook is obtained based on the linear relationship between constellation points in the multiple user constellation diagrams.

19. The method according to claim 11, characterized in that, The first indication information includes at least one of the following: The identifier of the codebook; The identifier of the codebook group to which the second node belongs; The bitmap of the codebook group to which the second node belongs.

20. The method according to claim 11, characterized in that, The method further includes: The second node sends a second indication message to the first node, the second indication message being used to indicate the release of the codebook.

21. A communication device, characterized in that, include: Memory and processor; Memory and processor are coupled; The memory is used to store instructions that can be executed by the processor; When the processor executes the instructions, it performs the method as described in any one of claims 1 to 20.

22. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 20.

23. A computer program product, characterized in that, The computer program product includes computer instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 20.

Images