Communication method and related apparatus

Abstract

Provided in the present application are a communication method and a communication apparatus, which are applied to the technical field of communications. In the technical solution provided in the present application, a constellation diagram which satisfies a preset relational expression with a linear combination of a plurality of constellation diagrams is used to modulate a bit sequence, so as to obtain a complex-valued modulation symbol. The technical solution of the present application facilitates the satisfaction of transmission requirements of information having different transmission performances.

Description

Communication method and related device

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on February 5, 2024, with application number 202410168745.2 and application name “Communication Methods and Related Devices”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communication technology, and in particular to communication methods and related devices. Background Art

[0003] In the communications field, different information in communication devices has different transmission performance requirements. For example, extended reality (XR), mixed reality (MR), and immersive services have different transmission performance requirements.

[0004] Therefore, how to meet different transmission performance requirements for different information of the same communication device has become a technical problem that needs to be solved urgently. Summary of the Invention

[0005] The present application provides a communication method, a communication device, and a communication system, which help to meet the different transmission performance requirements of different information in the same communication device.

[0006] In a first aspect, the present application provides a communication method, which can be applied to a communication device, and the communication method includes: using a combined constellation diagram to perform m-order modulation on a first bit sequence corresponding to a first channel, the combined constellation diagram and the linear combination of n constellation diagrams satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellation diagrams, and at least two of the n constellation diagrams have different weights in the linear combination.

[0007] The communication device may be a network device or a terminal. The communication device may be called a transmitting end or an encoding end.

[0008] It can be understood that the constellation resulting from the linear combination of n constellations has the following characteristics: the bit sequences corresponding to constellation points in the n constellations with different weights have different distances between the corresponding constellation points in the combined constellation. Complex-valued modulation symbols corresponding to constellation points at different distances have different capabilities to withstand channel fading. In this way, multiple information from the same communication device can be mapped to constellation points at different distances in the combined constellation using constellations with different weights, thereby meeting different transmission performance requirements for these multiple information.

[0009] In some possible implementations, the first bit sequence is an encoded bit sequence, that is, the first bit sequence includes encoded bits.

[0010] In some other possible implementations, the first bit sequence is a bit sequence before encoding. In this implementation, performing m-order modulation on the first bit sequence may include performing m-order modulation on n bit segments or one bit segment obtained by performing m-order modulation on the first bit sequence, where at least two of the n encoded bit segments have different encoding rates.

[0011] Optionally, constellations with larger weights correspond to bit segments with higher code rates. Because constellations with larger weights have larger distances between constellation points, even if a constellation point shifts, the probability of a received constellation point being misjudged is lower. Therefore, when the transmitter performs error correction coding on the bit segments corresponding to constellations with larger weights, the code rate can be higher, or even no coding can be performed, thereby reducing coding complexity.

[0012] From the perspective of the receiving end or the decoding end, it is beneficial to reduce the complexity of encoding and decoding, and reduce the encoding power consumption and decoding power consumption of the communication equipment.

[0013] In some possible implementations of the method, a weight of at least one of the n constellations in the linear combination is associated with a modulation order of at least one other constellation in the n constellations.

[0014] As an example, there is a preset relationship between the weight of at least one constellation diagram in the linear combination and the modulation order of at least one other constellation diagram among the n constellation diagrams, and the weight of the constellation diagram can be determined based on the preset relationship and the modulation order of at least one other constellation diagram.

[0015] In some possible implementations of this method, the weight α of the t-th constellation in the linear combination of the n constellations is t Satisfies the following relationship:

[0016] Where t is an integer, t is greater than or equal to 2, t is less than or equal to n, Q k Indicates the modulation order of the kth constellation among the n constellations.

[0017] In some examples of this implementation, the weight α t The value of can be preset, and the weight α t The value of should satisfy the above relationship.

[0018] In some possible implementations of the method, the n constellation diagrams include a first constellation diagram and a second constellation diagram, the first constellation diagram is a constellation diagram of order 2, and the weight of the second constellation diagram is 2.

[0019] In some examples of this implementation, the first constellation diagram is a quadrature phase shift keying (QPSK) constellation diagram.

[0020] In some examples of this implementation, the second constellation is a QPSK constellation.

[0021] The first constellation is a QPSK constellation. In some examples of this implementation, a mapping expression for the first constellation is (1-2b(4i))+j(1-2b(4i+1)); and a mapping expression for the second constellation is (1-2b(4i+2))+j(1-2b(4i+3)). Here, i is an integer less than or equal to the quotient obtained by dividing the number of bits in the to-be-mapped bit sequence by the modulation order of the constellation. b(x) represents the bit with index x in the to-be-mapped bit sequence, and j represents the imaginary part.

[0022] It is understood that the index sorting direction of the bit combination in this application is the same as the index sorting direction of the bit value, and the starting value is the same. For example, both are sorted from left to right or from right to left according to the bits of the bit sequence to be mapped, and the index of the bit combination and the index of the bit are both numbered starting from 0.

[0023] In some possible implementations of the method, the n constellation diagrams include a first constellation diagram and a second constellation diagram, the first constellation diagram is a constellation diagram of order 4, and the weight of the second constellation diagram is 4.

[0024] In some examples of this implementation, the first constellation diagram is a 16QAM constellation diagram.

[0025] In some examples of this implementation, the second constellation is a QPSK constellation or a 16QAM constellation.

[0026] When the first constellation diagram is a 16-bit quadrature amplitude modulation (QAM) constellation diagram and the second constellation diagram is a QPSK constellation diagram, in some examples of this implementation method, the mapping expression of the first constellation diagram is (1-2b(6i+2))(2-(1-2b(6i+4)))+j(1-2b(6i+3))(2-(1-2b(6i+5))); the mapping expression of the second constellation diagram is (1-2b(6i))+j(1-2b(6i+1)).

[0027] When the first constellation diagram is a 16QAM constellation diagram and the second constellation diagram is a 16QAM constellation diagram, in some examples of this implementation, the mapping expression of the first constellation diagram is (1-2b(8i+4))(2-(1-2b(8i+6)))+j(1-2b(8i+5))(2-(1-2b(8i+7)); the mapping expression of the second constellation diagram is (1-2b(8i))(2-(1-2b(8i+2)))+j(1-2b(8i+1))(2-(1-2b(8i+3))).

[0028] In some possible implementations of the method, the n constellation diagrams include a first constellation diagram and a second constellation diagram, the first constellation diagram is a constellation diagram of order 6, and the weight of the second constellation diagram is 8.

[0029] In some examples of this implementation, the first constellation is a 64QAM constellation.

[0030] In some examples of this implementation, the second constellation is a 16QAM constellation.

[0031] When the first constellation diagram and the second constellation diagram are respectively 16QAM constellation diagrams, the mapping expression of the first constellation diagram can be (1-2b(10i+4))(4-(1-2b(10i+6)))(2-(1-2b(10i+8)))+j(1-2b(10i+5))(4-(1-2b(10i+7)))(2-(1-2b(10i+9))); the mapping expression of the second constellation diagram is (1-2b(10i))(2-(1-2b(10i+2)))+j(1-2b(10i+1))(2-(1-2b(10i+3))).

[0032] In some possible implementations of the present method, the n constellation diagrams include a first constellation diagram, a second constellation diagram, and a third constellation diagram, the first constellation diagram is a 2nd-order constellation diagram, the second constellation diagram is a 2nd-order constellation diagram, the weight of the second constellation diagram is 2, and the weight of the third constellation diagram is 4.

[0033] In some examples of this implementation, the first constellation is a QPSK constellation.

[0034] In some examples of this implementation, the second constellation is a QPSK constellation.

[0035] In some examples of this implementation, the third constellation is a QPSK constellation.

[0036] When the first constellation diagram is a QPSK constellation diagram, the second constellation diagram is a QPSK constellation diagram, and the third constellation diagram is QPSK, in some examples of this implementation method, the mapping expression of the first constellation diagram is (1-2b(6i+4))+j(1-2b(6i+5)); the mapping expression of the second constellation diagram is (1-2b(6i+2))+j(1-2b(6i+3)), and the mapping expression of the third constellation diagram is (1-2b(6i))+j(1-2b(6i+1)).

[0037] In any of the above implementations including the first constellation diagram, as an example, the weight of the first constellation diagram may be 1.

[0038] In some possible implementations of this method, the linear combination satisfies the following relationship:

[0039] Among them, d' represents the constellation diagram obtained by linear combination, α t represents the weight of the t-th constellation diagram in the linear combination of n constellation diagrams, d1 represents the first constellation diagram in n constellation diagrams, d t Represents the tth constellation among n constellations.

[0040] It is understood that the "±" in the formula can represent a plus sign "+" or a minus sign "-", and you can choose either one. For example, when the sign before each term is a plus sign "+", the above relationship is: For example, if the sign before d1 is a minus sign "-", and the signs before other items are plus signs "+", the above relationship is:

[0041] In some examples of this implementation, n=2, where d1 can be referred to as a first constellation diagram and d2 can be referred to as a second constellation diagram. For some examples of the first constellation diagram, the second constellation diagram, the weight of the first constellation diagram, and the weight of the second constellation diagram, refer to the above content.

[0042] In some examples of this implementation, n=3, where d1 can be referred to as a first constellation diagram, d2 can be referred to as a second constellation diagram, and d3 can be referred to as a third constellation diagram. For some examples of the first constellation diagram, the second constellation diagram, the third constellation diagram, the weight of the first constellation diagram, the weight of the second constellation diagram, and the weight of the third constellation diagram, refer to the aforementioned content.

[0043] In some possible implementations of this method, the combined constellation diagram and the linear combination satisfy the following relationship: d = S × d'

[0044] Wherein, d' represents the linear combination, d represents the combined constellation diagram, and S represents the power normalization factor of the linear combination.

[0045] In some possible implementations of the method, the method further includes: receiving first information, where the first information indicates the linear combination.

[0046] In this implementation, the linear combination can be indicated by the communication peer through the first information to the communication device currently performing modulation, so that the modulation and demodulation at both ends remain consistent, thereby ensuring the reliability of communication.

[0047] In some possible implementations of the method, the method further includes: sending first information, where the first information indicates the linear combination.

[0048] In this implementation, the linear combination can be indicated to the communication peer by the communication device currently performing modulation through the first information, so that the modulation and demodulation at both ends remain consistent, thereby ensuring the reliability of communication.

[0049] In some possible implementations of the method, the linear combination may be pre-defined in a communication standard, and the linear combination may be pre-configured in the communication device based on the communication standard.

[0050] In some possible implementations of the method, the method further includes: sending second information, where the second information indicates a combined constellation diagram.

[0051] In this implementation, the communication device sends the second information, which helps the receiving end to learn the combined constellation diagram, and then can perform demodulation based on the combined constellation diagram, so as to achieve the effect of consistent modulation at the transmitting end and demodulation at the receiving end.

[0052] In some possible implementations of the method, the method further includes: receiving second information, where the second information indicates a combined constellation diagram.

[0053] In this implementation, the communication device receives the second information, can obtain the combined constellation diagram, and can then perform modulation based on the combined constellation diagram, thereby achieving the effect of consistent modulation at the transmitting end and demodulation at the receiving end.

[0054] In the above two implementations, the transmitter and receiver can uniformly combine the constellation diagram through information interaction, thereby improving the flexibility of communication and further improving the communication performance.

[0055] In some possible implementations of this method, the combined constellation diagram may be preset. For example, the combined constellation diagram may be preset by a communication standard. In this implementation, the receiving end and the transmitting end do not need to exchange information used to determine the combined constellation diagram, thereby reducing signaling overhead.

[0056] In a second aspect, the present application provides a communication method, the method comprising: obtaining a complex-valued modulation symbol corresponding to a first channel; performing m-order demodulation on the complex-valued modulation symbol according to a combined constellation diagram, wherein the combined constellation diagram and a linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations, and at least two of the n constellations have different weights in the linear combination. Alternatively, the method comprises: obtaining a complex-valued modulation symbol corresponding to a first channel, wherein the first channel comes from another device; the complex-valued modulation symbol is obtained by performing m-order modulation on the first bit sequence according to the combined constellation diagram, wherein the combined constellation diagram and a linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations.

[0057] The communication device may be a network device or a terminal. The communication device may be called a receiving end or a decoding end.

[0058] The combined constellation diagram in this method can refer to the combined constellation diagram in the first aspect and will not be described in detail here. This method can help meet the different transmission performance requirements of different information in the same communication device. In addition, this method can also reduce the decoding complexity of the communication device. For example, the decoding complexity of the bits corresponding to the constellation diagram with a larger weight in the bit segment modulated using the combined constellation diagram can be lower than the decoding complexity of the bits corresponding to the constellation diagram with a smaller weight. In fact, some bits do not need to be decoded. It is understandable that all possible implementation methods of the first aspect can be applied to the second aspect.

[0059] In a third aspect, the present application provides a communication device. The communication device may include a module corresponding to each of the methods / operations / steps / actions described in the first aspect, and the module may be implemented as a hardware circuit, software, or a combination of hardware circuit and software.

[0060] In one design, the apparatus may include a processing module and a communication module, wherein the communication module is configured to perform the sending and receiving actions in the method described in the first aspect above, and the processing module is configured to perform the processing-related actions in the method described in the first aspect above.

[0061] In one design, the device may be a terminal, or a device, module, circuit or chip configured in the terminal, or a device that can be used in conjunction with the terminal.

[0062] In one design, the device may be a network device, or a device, module, circuit or chip configured and arranged in the network device, or a device that can be used in conjunction with the network device.

[0063] In a fourth aspect, the present application provides a communication device. The communication device may include a module corresponding to each of the methods / operations / steps / actions described in the second aspect, and the module may be implemented as a hardware circuit, software, or a combination of hardware circuit and software.

[0064] In one design, the apparatus may include a processing module and a communication module, wherein the communication module is configured to perform the sending and receiving actions in the method described in the second aspect above, and the processing module is configured to perform the processing-related actions in the method described in the second aspect above.

[0065] In one design, the device may be a terminal, or a device, module, circuit or chip configured in the terminal, or a device that can be used in conjunction with the terminal.

[0066] In one design, the device may be a network device, or a device, module, circuit or chip configured and arranged in the network device, or a device that can be used in conjunction with the network device.

[0067] In a fifth aspect, a device is provided, comprising a processor and a storage medium, wherein the storage medium stores instructions, and when the instructions are executed by the processor, the method in the first aspect or any possible implementation of the first aspect is implemented.

[0068] In a sixth aspect, a device is provided, comprising a processor and a storage medium, wherein the storage medium stores instructions, and when the instructions are executed by the processor, the method in the second aspect or any possible implementation of the second aspect is implemented.

[0069] In a seventh aspect, a device is provided, comprising a processing circuit, wherein the processing circuit is used to process data and / or information so that the method in the first aspect or any possible implementation manner of the first aspect is implemented.

[0070] The processing circuit may include one or more processors, or all or part of the circuitry in one or more processors for processing functions.

[0071] Optionally, the device may further include a memory, the memory being used to store programs or instructions, and the processor being used to run the programs or instructions so that the method in the first aspect or any possible implementation manner of the first aspect is implemented.

[0072] Optionally, the device may further include the transceiver circuit, or an input / output interface.

[0073] In an eighth aspect, a device is provided, comprising a processing circuit, wherein the processing circuit is used to process data and / or information so that the method in the second aspect or any possible implementation manner of the second aspect is implemented.

[0074] The processing circuit may include one or more processors, or all or part of the circuitry in one or more processors for processing functions.

[0075] Optionally, the device may further include a memory, the memory being used to store programs or instructions, and the processor being used to run the programs or instructions so that the method in the second aspect or any possible implementation manner of the second aspect is implemented.

[0076] Optionally, the device may further include the transceiver circuit, or an input / output interface.

[0077] In a ninth aspect, a chip is provided, comprising a processing circuit, wherein the processing circuit is configured to run a program or instruction so that the method in the first aspect or any possible implementation manner of the first aspect is implemented.

[0078] Optionally, the chip may further include a memory for storing programs or instructions.

[0079] Optionally, the chip may further include a transceiver circuit, or an input / output interface.

[0080] In a tenth aspect, a chip is provided, comprising a processing circuit, wherein the processing circuit is configured to run a program or instruction so that the method in the second aspect or any possible implementation manner of the second aspect is implemented.

[0081] Optionally, the chip may further include a memory for storing programs or instructions.

[0082] Optionally, the chip may further include a transceiver circuit, or an input / output interface.

[0083] In an eleventh aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium includes instructions, and when the instructions are executed by a processor, the method in the first aspect or any possible implementation of the first aspect is implemented.

[0084] In a twelfth aspect, a computer-readable storage medium is provided, wherein the computer-readable storage medium includes instructions, and when the instructions are executed by a processor, the method in the second aspect or any possible implementation of the second aspect is implemented.

[0085] In a thirteenth aspect, a computer program product is provided, comprising computer program code or instructions, which, when executed, enables the method in the first aspect or any possible implementation of the first aspect to be implemented.

[0086] In a fourteenth aspect, a computer program product is provided, comprising computer program code or instructions, which, when executed, enables the method in the second aspect or any possible implementation of the second aspect to be implemented.

[0087] In a fifteenth aspect, a communication system is provided, which includes an apparatus for executing the first aspect or any possible implementation of the first aspect, and / or includes an apparatus for executing the second aspect or any possible implementation of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0088] FIG1 is a schematic diagram of a communication system applicable to an embodiment of the present application;

[0089] FIG2 is a schematic diagram of a communication system applicable to an embodiment of the present application;

[0090] FIG3 is an exemplary flow chart of a communication method according to an embodiment of the present application;

[0091] FIG4 is a schematic diagram of obtaining a first bit sequence applicable to an embodiment of the present application;

[0092] FIG5 is a schematic diagram of a modulation method applicable to an embodiment of the present application;

[0093] FIG6 is a combination example diagram of a fourth-order combination constellation diagram according to an embodiment of the present application;

[0094] FIG7 is a combination example diagram of a sixth-order combination constellation diagram according to an embodiment of the present application;

[0095] FIG8 is a diagram illustrating an example of an eighth-order constellation diagram according to an embodiment of the present application;

[0096] FIG9 is a combination example diagram of a sixth-order combination constellation diagram according to another embodiment of the present application;

[0097] FIG10 is an exemplary flow chart of a communication method according to an embodiment of the present application;

[0098] FIG11 is an exemplary structural diagram of a communication device of the present application;

[0099] FIG12 is another exemplary structural diagram of the communication device of the present application. DETAILED DESCRIPTION

[0100] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0101] To facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that the words "first" and "second" do not limit the quantity or execution order, and the words "first" and "second" do not necessarily mean different.

[0102] It should be noted that in the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this application as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0103] In the embodiments of the present application, "at least one" refers to one or more, and "more" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple.

[0104] The technical solution provided in this application can be applied to communication networks such as the 3rd Generation Partnership Project (3GPP), ZigBee, long-range radio (Lora), Bluetooth (BT), and wireless fidelity (Wi-Fi).

[0105] The technical solutions provided in this application can be applied to various communication systems, such as: fifth generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, wireless local area networks (WLAN) systems, satellite communication systems, future communication systems, such as sixth generation (6G) mobile communication systems, or a fusion system of multiple systems. The technical solutions provided in this application can also be applied to device to device (D2D) communication, vehicle-to-everything (V2X) communication, machine to machine (M2M) communication, machine type communication (MTC), and Internet of Things (IoT) communication systems or other communication systems.

[0106] A device in a communication system can send signals to or receive signals from another device. The signals may include information, signaling, or data. The term "device" may also be replaced by an entity, a network entity, a communication device, a communication module, a node, a communication node, and the like. This disclosure uses devices as examples for description. For example, a communication system may include at least one terminal device and at least one network device. The network device may send downlink signals to the terminal device, and / or the terminal device may send uplink signals to the network device. It is understood that the terminal device in this disclosure may be replaced by the first device, and the network device may be replaced by the second device, with both devices performing the corresponding communication methods in this disclosure.

[0107] In an embodiment of the present application, the terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.

[0108] The terminal device may be a device that provides voice / data, such as a handheld device or vehicle-mounted device with a wireless connection function. At present, some examples of terminals are: mobile phones, tablet computers, laptop computers, PDAs, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, wearable devices, terminal devices in 5G networks or future evolved public land mobile communication networks (PLMNs). The terminal devices in the PLMN network, the devices in the ZigBee network, the devices in the Lora network, the Bluetooth slave (BT slave), the low-power Bluetooth BLE slave, the Wi-Fi station (STA), etc. are not limited in the embodiments of the present application.

[0109] As an example and not a limitation, in the embodiment of the present application, the terminal device may also be a wearable device. Wearable devices may also be called wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not only hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0110] A terminal device can also be a terminal device in an IoT system, also known as an IoT node. IoT is a crucial component of future information technology development. Its primary technical feature is connecting objects to the network through communication technologies, thereby enabling intelligent networks that interconnect humans and machines, and objects and things. Connections can be achieved through both broadband and narrowband technologies. IoT technology, for example, uses narrowband (NB) technology to achieve massive connections, deep coverage, and power-saving terminals. IoT technologies include reflective communication, spread spectrum, and ultra-wideband (UWB), which are not detailed here.

[0111] In the embodiments of the present application, the device for realizing the function of the terminal device can be a terminal device, or a device capable of supporting the terminal device to realize the function, such as a chip system, which can be installed in the terminal device or used in combination with the terminal device. In the embodiments of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices. In the embodiments of the present application, only the terminal device is used as an example for description, and the embodiments of the present application are not limited to the solutions of the embodiments of the present application.

[0112] The network device in the embodiments of the present application may be a device for communicating with a terminal device, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects a terminal device to a wireless network.

[0113] The radio access network (RAN) device in this application is a device with wireless transceiver functions. The radio access network device can provide wireless communication function services and can access the terminal device to the wireless network. The radio access network can also be referred to as an access network device or a network device. The network device in the embodiment of the present application can refer to a radio access network (RAN) node (or device) used in a cellular network (or mobile network) to access the terminal device to the wireless network, and can also be a zigbee base station, a master Bluetooth (BT master), a master low-power Bluetooth (bluetooth low energy master, BLE master), a Lora base station, or a Wi-Fi access point.

[0114] A base station may broadly cover various names as follows, or replace the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, secondary station, multi-standard radio (motor slide retainer, MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), radio unit (RU), positioning node, etc. A base station may be a macro base station, a micro base station, a relay node, a donor node, or the like, or a combination thereof. A base station may also refer to a communication module, modem, or chip configured within the aforementioned devices or apparatuses. A base station may also be a mobile switching center, a device that performs base station functions in D2D, V2X, or M2M communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. A base station may support networks with the same or different access technologies. Optionally, a RAN node may also be a server, a wearable device, a vehicle, or an onboard device. For example, the access network device in vehicle-to-everything (V2X) technology may be a roadside unit (RSU). The embodiments of this application do not limit the specific technology or device form factor employed by the network device. In some deployments, the network device referred to in the embodiments of this application may include a CU, a DU, or both a CU and a DU, or a control plane CU node (central unit-control plane (CU-CP)), a user plane CU node (central unit-user plane (CU-UP)), and a DU node. For example, the network device may include a gNB-CU-CP, a gNB-CU-UP, and a gNB-DU.

[0115] In some deployments, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes implementing portions of the base station's functionality. For example, a RAN node can be a CU, DU, CU-CP, CU-UP, or RU. The CU and DU can be separate or included in the same network element, such as the BBU. The RU can be included in a radio frequency device or radio unit, such as an RRU, AAU, or RRH.

[0116] The RAN node may support one or more types of fronthaul interfaces, with different fronthaul interfaces corresponding to DUs and RUs with different functions. If the fronthaul interface between the DU and the RU is a common public radio interface (CPRI), the DU is configured to implement one or more baseband functions, and the RU is configured to implement one or more radio frequency functions. If the fronthaul interface between the DU and the RU is another type of interface, relative to the CPRI, some of the downlink and / or uplink baseband functions, such as precoding, digital beamforming (BF), or one or more of inverse fast Fourier transform (IFFT) / cyclic prefix (CP) for downlink, are moved from the DU to the RU for implementation; and for uplink, one or more of digital beamforming (BF), or fast Fourier transform (FFT) / cyclic prefix (CP) removal, are moved from the DU to the RU for implementation. In one possible implementation, the interface may be an enhanced common public radio interface (eCPRI). In the eCPRI architecture, the division between the DU and RU is different, corresponding to different types (category, Cat) of eCPRI, such as eCPRI Cat A, B, C, D, E, and F.

[0117] Taking eCPRI Cat A as an example, for downlink transmission, based on layer mapping, the DU is configured to implement layer mapping and one or more functions preceding it (i.e., one or more of coding, rate matching, scrambling, modulation, and layer mapping). Other functions after layer mapping (e.g., resource element (RE) mapping, digital beamforming (BF), or one or more of inverse fast Fourier transform (IFFT) / cyclic prefix (CP) addition) are moved to the RU for implementation. For uplink transmission, based on RE demapping, the DU is configured to implement demapping and one or more functions preceding it (i.e., one or more of decoding, rate matching, descrambling, demodulation, inverse discrete Fourier transform (IDFT), channel equalization, and RE demapping). Other functions after demapping (e.g., one or more of digital BF or fast Fourier transform (FFT) / CP removal) are moved to the RU for implementation. It is understandable that for the functional description of DU and RU corresponding to various types of eCPRI, reference can be made to the eCPRI protocol, which will not be described in detail here.

[0118] In one possible design, the processing unit for implementing baseband functions in the BBU is called a baseband high layer (BBH) unit, and the processing unit for implementing baseband functions in the RRU / AAU / RRH is called a baseband low layer (BBL) unit.

[0119] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0120] In the embodiments of the present application, the device for implementing the functions of the network device can be a network device; it can also be a device that can support the network device to implement the functions, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module. The device can be installed in the network device or used in conjunction with the network device. In the embodiments of the present application, only the device for implementing the functions of the network device is used as an example to illustrate, and does not constitute a limitation on the solutions of the embodiments of the present application.

[0121] The network device and / or terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on the water surface; it can also be deployed on aircraft, balloons and satellites in the air. The embodiments of this application do not limit the scenarios in which the network device and the terminal device are located. In addition, the terminal device and the network device can be hardware devices, or they can be software functions running on dedicated hardware, software functions running on general-purpose hardware, such as virtualization functions instantiated on a platform (e.g., a cloud platform), or entities including dedicated or general-purpose hardware devices and software functions. This application does not limit the specific forms of the terminal device and the network device.

[0122] The technical solutions provided in the embodiments of this application can be applied to channel coding and decoding between communication devices. Channel coding and decoding between communication devices can include: channel coding and decoding between network devices and terminals, channel coding and decoding between network devices, and channel coding and decoding between terminals. In the embodiments of this application, the term "channel coding and decoding" can also be shortened to "coding," and the term "coding" can also be described as "channel coding and decoding," "network coding," "external code," and "source-channel joint coding and decoding."

[0123] Figure 1 is a schematic diagram of a communication system applicable to the method of an embodiment of the present application. As shown in Figure 1 , the communication system 100 may include at least two communication devices, such as the communication device 110 and the communication device 120 shown in Figure 1 .

[0124] Communication devices can wirelessly communicate using air interface resources. Air interface resources may include at least one of time domain resources, frequency domain resources, code resources, and space resources. Any communication device may be a network device or a terminal device. For example, communication device 110 is a network device, and communication device 120 is a terminal device or a network device; or, communication device 110 is a terminal device, and communication device 120 is a terminal device or a network device. A network device may also be referred to as a base station device.

[0125] The communication device 110 and the communication device 120 can communicate via a wireless link. The communication devices in the communication system, for example, the communication device 110 and the communication device 120 can communicate via a multi-antenna technology.

[0126] As an example, a single communication device may communicate with a single or multiple communication devices, such as transmitting data or control signaling to a single or multiple communication devices, and / or multiple communication devices may simultaneously transmit data or control signaling for a single communication device.

[0127] Figure 2 is a schematic diagram of another communication system applicable to the method of an embodiment of the present application. As shown in Figure 2, communication device 210 includes a processor 211, a memory 212, and a transceiver 213. Transceiver 213 includes a transmitter 2131, a receiver 2132, and an antenna 2133. Communication device 220 includes a processor 221, a memory 222, and a transceiver 223. Transceiver 223 includes a transmitter 2231, a receiver 2232, and an antenna 2233.

[0128] Any one of the communication device 210 and the communication device 220 may be a network device or a terminal device.

[0129] The processor 211 , the memory 212 , and the transceiver 213 communicate with each other through an internal connection path, and the processor 221 , the memory 222 , and the transceiver 223 communicate with each other through an internal connection path.

[0130] The receiver 2132 may be configured to receive transmission control information via the antenna 2133, and the transmitter 2131 may be configured to send transmission feedback information to the communication device 220 via the antenna 2133. The transmitter 2231 may be configured to send transmission control information to the network device 210 via the antenna 2233, and the receiver 2232 may be configured to receive the transmission feedback information sent by the network device 210 via the antenna 2233.

[0131] It should be noted that Figures 1 and 2 are simplified schematic diagrams for ease of understanding. In actual applications, the communication system may include more communication devices. The embodiments of the present application do not limit the number of communication devices included in the communication system.

[0132] The communication system to which the technical solutions of the embodiments of the present application apply may further include other network elements or entities. As an example, the communication system to which the technical solutions of the embodiments of the present application apply may further include a core network, which may include one or more of the following entities: an access and mobility management function (AMF) entity, a session management function (SMF) entity, a unified data management (UDM) network element, or a user plane function (UPF) entity, etc.

[0133] Among them, the AMF entity can also be called access and mobility management function, access and mobility management equipment, access and mobility management network element, access management equipment or mobility management equipment, which is mainly used for mobility management and access management.

[0134] Optionally, the AMF entity can also be used to implement other functions of the mobility management entity (MME) in addition to session management. For example, the AMF entity can be used for lawful interception, access authorization (or authentication), user equipment registration, mobility management, tracking area update process, reachability detection, session management network element selection, mobility state transition management, etc.

[0135] The SMF entity is mainly used for the management of session-related services, such as session establishment.

[0136] UDM network elements are mainly used to process terminal device identification, access authentication, registration, and mobility management.

[0137] The UPF entity is located between the user access layer and the control layer, and its main function is to provide user panel services.

[0138] The network elements or entities in the above core network may have other names, which are not limited in this application.

[0139] To better understand the technical solutions of the embodiments of the present application, the following describes some related concepts. A signal can be decomposed into a set of relatively independent components: an in-phase component and a quadrature component. The in-phase component can be denoted as the I component, and the quadrature component can be denoted as the Q component. These two components are orthogonal and mutually independent. For example, the signal can be represented as a binary sequence, which can contain at least one bit.

[0140] A signal decomposed into I and Q components can be represented by the complex number I+jQ, which can also be called the complex-valued modulation symbol corresponding to the signal. Based on this complex number representation, the signal can be mapped to points on the complex plane with the I and Q axes as coordinate axes. These points are called constellation points. The projection of the signal onto the I axis is the I component, i.e., the coordinates of the constellation point on the I axis. The projection of the signal onto the Q axis is the Q component, i.e., the coordinates of the constellation point on the Q axis. The I axis can be called the real axis, and the Q axis can be called the imaginary axis.

[0141] In this embodiment, the relational expression capable of mapping a signal to a corresponding complex-valued modulation symbol can also be understood as a modulation relational expression between the signal and the complex-valued modulation symbol, or an expression of a mapping relation between the signal and the complex-valued modulation symbol. A diagram representing the mapping relation between the signal and the complex-valued modulation symbol using constellation points on a complex plane can be called a constellation diagram.

[0142] FIG3 is a flow chart of a communication method according to an embodiment of the present application. The method may include S310 and S320. The method may be performed by an encoding device, which may also be referred to as a communication device.

[0143] The encoding device may be a communication device, or a chip, chip system, processor, or processing circuit used in a communication device. Examples of the communication device include a network device or terminal, or a chip, chip system, processor, or processing circuit used in a network device or terminal. When the communication device executes the method during a communication process, it may be referred to as a transmitting end, or in other words, the communication device may execute the method when acting as a transmitting end.

[0144] S310: Acquire a first bit sequence corresponding to a first channel.

[0145] The first channel may be a control channel or a data channel. The first channel may be a logical channel or a physical channel. The first channel is a channel between an encoding device or a communication device to which the encoding device belongs and another communication device.

[0146] It can be understood that the first channel can be an uplink channel, a downlink channel or a side link (SL).

[0147] When the first channel is an uplink channel, the first channel may be an uplink control channel or an uplink data channel. An example of the first channel being an uplink control channel is a physical uplink control channel (PUCCH). An example of the first signal being an uplink data channel is a physical uplink shared channel (PUSCH).

[0148] When the first channel is a downlink channel, the first channel can be a broadcast channel, a downlink control channel, or a downlink data channel. An example of a downlink control channel is a physical downlink control channel (PDCCH). An example of a downlink data channel is a physical downlink shared channel (PDSCH).

[0149] The first bit sequence corresponding to the first channel can be understood as a bit sequence transmitted in the first channel, a bit sequence carried by the first channel, or a bit sequence of the first channel. The first bit sequence includes at least one bit.

[0150] All contents of the first channel correspond to the same terminal.

[0151] Figure 4 illustrates another exemplary implementation of obtaining a first bit sequence corresponding to a first channel. As shown in Figure 4 , a transport block (TB) may be segmented to obtain code blocks (CBs); a cyclic redundancy check (CRC) is then added to the CBs to obtain the first bit sequence.

[0152] S320. Perform m-order modulation on the first bit sequence according to the combined constellation diagram, where the combined constellation diagram and the linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations, and at least two of the n constellations have different weights in the linear combination.

[0153] The combined constellation diagram refers to a constellation diagram that satisfies a preset relationship with a linear combination of n constellations.

[0154] The linear combination of n constellations can be understood as: scaling each of the n constellations to obtain n scaled constellations corresponding to each other; and performing addition or subtraction on each of the n scaled constellations. The scaling ratio of each constellation can be referred to as the scaling factor of the constellation or the weight of the constellation in the linear combination. The present application does not limit the addition or subtraction to each constellation. The operations performed on different constellations may be the same or different. In one possible implementation, one of the n scaled constellations performs an addition operation, and the other performs a subtraction operation. Whether the operation corresponding to each constellation is an addition operation or a subtraction operation determines the rotation angle of the constellation in the combined constellation.

[0155] It is understandable that some of the n constellation diagrams may not be scaled, and these constellation diagrams may be considered to be scaled with a ratio of 1, that is, the scaling factor or weight is 1.

[0156] The combined constellation diagram may also be called a layered constellation diagram or an n-layer constellation diagram. If the scaling factors of the n constellations are sorted from smallest to largest, in some implementations, the layer of each constellation diagram in the n constellations may be represented by the sequence number of its scaling factor.

[0157] The constellation diagram can be replaced by an expression that maps one or more bits to complex-valued modulation symbols.

[0158] M-order modulation refers to mapping m bits into a complex-valued modulation symbol.

[0159] Assume that the n constellations are numbered, and the numbers are integers from 1 to n. The modulation order of the constellation numbered k is recorded as Q k In some implementations, the scaling factor α of the constellation numbered t among the n constellations is t Satisfies the following relationship:

[0160] Among them, Q k The relationship here is in the form of a formula as an example. It can be understood that the above relationship can also be in other forms, such as a table or a string.

[0161] In some implementations, the value of t ranges from 2 to n.

[0162] In some implementations, the scaling factor of one or more of the n constellations is 1.

[0163] In some implementations, the linear combination satisfies the following relationship:

[0164] Among them, d' represents the constellation diagram obtained by linear combination of n constellations, α t Indicates the scaling factor of the tth constellation diagram among n constellation diagrams, d1 indicates the first constellation diagram among n constellation diagrams, d t Represents the tth constellation among n constellations.

[0165] Optionally, in the above relationship, the scaling factor α of any constellation diagram is t Can be positive or complex.

[0166] Optionally, in the above relationship, the operation of any constellation diagram can be replaced by a minus sign.

[0167] In some implementations, the combined constellation diagram and the constellation diagram obtained by linearly combining n constellations satisfy the following relationship: d = S × d'

[0168] Wherein, d' represents a constellation diagram obtained by linearly combining n constellation diagrams, d represents a combined constellation diagram, and S represents a power normalization factor of the constellation diagram obtained by linearly combining n constellation diagrams.

[0169] When n is equal to 2, the relationship between the combined constellation diagram and the two constellation diagrams satisfies the following equation: d = β (α × d2 + d1)

[0170] Where β represents a power normalization factor, d1 represents one constellation, d2 represents the other constellation, α represents the weight of d2, and d represents the combined constellation. Optionally, the operator for d1 can be replaced with a minus sign. Optionally, the operator for d2 can be replaced with a minus sign.

[0171] Figure 5(a) illustrates an example of an implementation of m-order modulation of a first bit sequence based on a combined constellation diagram. As shown in Figure 5(a), error correction coding is performed on the first bit sequence to obtain a second bit sequence; m-order modulation is then performed on the second bit sequence based on the combined constellation diagram. The second bit sequence herein may also be referred to as a coded bit segment.

[0172] In this embodiment, another implementation of performing m-order modulation on the first bit sequence based on the combined constellation diagram is shown in (b) of FIG5 . The first bit sequence is segmented to obtain g bit segments, where g is a positive integer. These g bit segments are sequentially recorded as the first bit segment, the second bit segment, ..., and the g-th bit segment. These g bit segments are input into g encoders and encoded to obtain g coded bit segments corresponding to the g bit segments. These g coded bit segments are sequentially recorded as the first coded bit segment, the second coded bit segment, ..., and the g-th coded bit segment. The g coded bit segments are modulated in m-order using the combined constellation diagram to obtain complex-valued modulation symbols. The g coded bit segments satisfy a preset relationship with the n constellations, where g is a positive integer less than or equal to n.

[0173] As an example, g equals n, and these n coded bit segments correspond one-to-one to these n constellation diagrams. That is, the first bit sequence is segmented to obtain n bit segments, where n is a positive integer, and these n bit segments are sequentially recorded as the first bit segment, the second bit segment, ..., and the nth bit segment; these n bit segments are input into n encoders and encoded to obtain n coded bit segments corresponding to these n bit segments, and these n coded bit segments are sequentially recorded as the first coded bit segment, the second coded bit segment, ..., and the nth coded bit segment; these n coded bit segments are modulated to an mth order using the combined constellation diagram to obtain complex-valued modulation symbols.

[0174] When encoding these n bit segments, in some implementations, only p of the bit segments may be encoded separately, resulting in p coded bit segments corresponding to the p bit segments. At least one of the p coded bit segments has a coding rate less than 1, where p is a positive integer less than or equal to n. Furthermore, np bit segments are not encoded. These np bit segments can be considered as np coded bit segments that have been encoded and have a coding rate of 1. These np coded bit segments and the previous p coded bit segments constitute n coded bit segments. It is understood that the coding rates of these p coded bit segments may all be the same, or may be partially the same and partially different, or may all be different (i.e., any two of them are different).

[0175] When encoding these n bit segments, in some other implementations, these n bit segments can be encoded separately to obtain n coded bit segments corresponding one-to-one to these n bit segments, the coding rate of each of these n coded bit segments is less than or equal to 1, and the coding rates of at least two of the coded bit segments are different.

[0176] In this embodiment, an example of a code rate is the ratio of the number of bits before encoding to the number of bits after encoding. For example, if the number of bits before encoding is A and the number of bits after encoding is B, the code rate is the quotient of A divided by B, where A and B are positive integers. An example of such coding is channel coding.

[0177] Optionally, B may be greater than A, equal to A, or less than A. When B is greater than A, the code rate is greater than 1; when B is equal to A, the code rate is equal to 1; and when B is less than A, the code rate is less than 1. If A bits are not encoded and B bits are the same as A bits, it can be understood that A bits are encoded with a code rate of 1.

[0178] Generally speaking, the higher the code rate, the better the transmission reliability of the encoded bits, but the larger the amount of encoded bits; the lower the code rate, the worse the transmission reliability of the encoded bits, but the smaller the amount of encoded bits.

[0179] When modulating the n coded bit segments using the combined constellation, in some implementations, the n coded bit segments are combined into a bit sequence, which is then modulated to an mth order using the combined constellation. This implementation can be understood as consecutively numbering the indices of the bits in the n coded bit segments. For ease of description, this bit sequence may be referred to as a second bit sequence or a coded bit segment.

[0180] One way to combine these n coded bit segments into a bit sequence is as follows: number these n constellations in ascending order of their weights. The numbers are integers from 1 to n. The constellation with a larger weight has a larger number. The modulation order of the constellation numbered k is denoted by Q. k ; Number the n coded bit segments in ascending order according to their code rates, where the numbers are integers from 1 to n, and the constellation with a larger code rate has a larger number; according to the ascending order of the numbers of the n coded bit segments, take out a specified number of bits from the n coded bit segments in a specified direction and combine them together, and repeat this step to obtain a second bit sequence, wherein the number of bits taken out each time from each coded bit segment is equal to the modulation order of the corresponding constellation, the constellation corresponding to each coded bit segment is the same as the number of the coded bit segment, and the specified direction can be from left to right or from right to left.

[0181] As an example, n is equal to 2, the modulation order of the first constellation is 2, the modulation order of the second constellation is 2, the first coded bit segment contains "011010011010", and the second coded bit segment can be "011011010101", and the first bit "0" and the second bit "1" of the first coded bit segment are taken from right to left (because the modulation order of the first constellation is 2, so 2 bits are taken at a time), and the first bit "1" and the second bit "0" of the second coded bit segment are taken. ” (Because the modulation order of the second constellation diagram is 2, 2 bits are taken at a time), and the bit sequence "0110" is obtained; the bit-taking operation is repeated a second time, and the third bit "0" and the fourth bit "1" of the first bit segment are taken out, and the third bit "1" and the fourth bit "0" of the first bit segment are taken out, and combined with the bit sequence obtained last time to obtain a new bit sequence "01100110"; and so on, the second bit sequence "010110101110010101100110" can be obtained.

[0182] If the second bit sequence includes coded bits at multiple code rates, when modulating the second bit sequence using a combined constellation, in some implementations, coded bits with higher code rates may be mapped using a constellation with a larger scaling factor. This is because constellations with larger scaling factors correspond to different bit sequences with greater distances in the combined constellation, reducing the probability of decoding errors at the receiving end and better ensuring transmission performance.

[0183] In this embodiment, when n is equal to 2, the first example of the mapping relationship of the combined constellation diagram is as follows: d2 = (1-2b(4i)) + j(1-2b(4i+1)) d1 = (1-2b(4i+2)) + j(1-2b(4i+3))

[0184] Among them, the two mapping expressions of the two constellations are d2 and d1 respectively; d represents the combined constellation, and the modulation order is 4; the scaling factor of the constellation corresponding to d2 is 2, the operation sign is plus, and the modulation order is 2; the scaling factor of the constellation corresponding to d1 is 1, the modulation order is 2, and the operation sign is minus; is the power normalization factor of the combined constellation diagram; i is an integer, starting from 0, until i is the smallest integer less than h or equal to h, where h is equal to the quotient of the number of bits contained in the second bit sequence divided by 4; b(·) represents the bit in the second bit sequence whose index is the value in the brackets.

[0185] When the second bit sequence uses the combined constellation diagram in this example for 4th-order modulation mapping, as an example, the second bit sequence can include coded bits of two coding rates. Because the scaling factor d2 is greater than the scaling factor d1, the coded bits of the two coding rates can be modulated in 2nd order using d2, while the coded bits of the lower coding rate can be modulated in 2nd order using d1.

[0186] Figure 6 shows an example of a combined constellation diagram in this example. Figure 6(a) shows the constellation diagram corresponding to d2, which can be called a QPSK constellation diagram; Figure 6(b) shows the constellation diagram corresponding to d1, which can be called a QPSK constellation diagram; and Figure 6(c) shows the combined constellation diagram, which can be called a 16QAM constellation diagram.

[0187] Alternatively, in this example, the operator symbol of the constellation diagram d2 can be replaced by a minus sign. Alternatively, in the above example, the operator symbol of the constellation diagram d1 can be replaced by a plus sign.

[0188] The second example of the combined constellation diagram when n is equal to 2 is as follows: d2 = (1-2b(6i)) + j(1-2b(6i+1)) d1 = (1-2b(6i+2))(2-(1-2b(6i+4))) + j(1-2b(6i+3))(2-(1-2b(6i+5)))

[0189] Among them, the two constellations are d2 and d1; d represents the combined constellation, the modulation order is 6; the scaling factor of constellation d2 is 4, the operation sign is plus, and the modulation order is 2; the scaling factor of constellation d1 is 1, the modulation order is 4, and the operation sign is plus; is the power normalization factor of the constellation point in the combined constellation diagram; i is an integer, starting from 0, until i is the smallest integer less than h or equal to h, where h is equal to the quotient of 6 divided by the number of bits contained in the second bit sequence; b(·) represents the bit in the second bit sequence whose index is the value in the brackets.

[0190] When the second bit sequence uses the combined constellation diagram in this example for 6-order modulation mapping, as an example, the second bit sequence can include coded bits of two coding rates. Because the scaling factor d2 is greater than the scaling factor d1, the coded bits of the two coding rates can be modulated at 2-order using d2, and the coded bits of the lower coding rate can be modulated at 4-order using d1.

[0191] Figure 7 is an example diagram of a combined constellation diagram in this example. This combined constellation diagram may also be called a 64QAM constellation diagram.

[0192] Optionally, in the above example, the operation symbol of the constellation diagram d2 may be a minus sign. Optionally, in the above example, the operation symbol of the constellation diagram d1 may be a minus sign.

[0193] The third example of the combined constellation diagram when n is equal to 2 is as follows: d2 = (1-2b(8i))(2-(1-2b(8i+2)))+j(1-2b(8i+1))(2-(1-2b(8i+3))) d1 = (1-2b(8i+4))(2-(1-2b(8i+6)))+j(1-2b(8i+5))(2-(1-2b(8i+7)))

[0194] Among them, the two constellations are d2 and d1; d represents the combined constellation, the modulation order is 8; the scaling factor of constellation d2 is 4, the operation symbol is plus, and the modulation order is 4; the scaling factor of constellation d1 is 1, the modulation order is 4, and the operation symbol is plus; is the power normalization factor of the constellation point in the combined constellation diagram; i is an integer, starting from 0, until i is the smallest integer less than h or equal to h, where h is equal to the quotient of 8 divided by the number of bits contained in the second bit sequence; b(·) represents the bit in the second bit sequence whose index is the value in the brackets.

[0195] When the second bit sequence uses the combined constellation diagram in this example for 8-level modulation mapping, as an example, the second bit sequence can include coded bits of two coding rates. Because the scaling factor d2 is greater than the scaling factor d1, the coded bits of the two coding rates can be modulated with 4-level modulation using d2, while the coded bits of the lower coding rate can be modulated with 4-level modulation using d1.

[0196] Figure 8 is an example diagram of the combined constellation diagram in this example. This combined constellation diagram can also be called a 256QAM constellation diagram.

[0197] Optionally, in the above example, the operation symbol of the constellation diagram d2 may be a minus sign. Optionally, in the above example, the operation symbol of the constellation diagram d1 may be a minus sign.

[0198] The fourth example of the combined constellation diagram when n is equal to 2 is as follows: d2 = (1-2b(10i))(2-(1-2b(10i+2))) + j(1-2b(10i+1))(2-(1-2b(10i+3))) d1 = (1-2b(10i+4))(4-(1-2b(10i+6)))(2-(1-2b(10i+8))) + j(1-2b(10i+5))(4-(1-2b(10i+7)))(2-(1-2b(10i+9)))

[0199] Among them, the two constellations are d2 and d1 respectively; d represents the combined constellation, the modulation order is 10; the scaling factor of constellation d2 is 8, the operation symbol is plus, and the modulation order is 4; the scaling factor of constellation d1 is 1, the modulation order is 6, and the operation symbol is plus; is the power normalization factor of the constellation point in the combined constellation diagram; i is an integer, starting from 0, until i is the smallest integer less than h or equal to h, where h is equal to the quotient of 10 divided by the number of bits contained in the second bit sequence; b(·) represents the bit in the second bit sequence whose index is the value in the brackets.

[0200] When the second bit sequence uses the combined constellation diagram in this example for 10th-order modulation mapping, as an example, the second bit sequence can include coded bits of two coding rates. Because the scaling factor d2 is greater than the scaling factor d1, the coded bits of the two coding rates can be modulated with 4th-order modulation using d2, and the coded bits of the lower coding rate can be modulated with 6th-order modulation using d1.

[0201] Alternatively, in the above example, the operator symbol of the constellation diagram d2 can be replaced by a minus sign. Alternatively, in the above example, the operator symbol of the constellation diagram d1 can be replaced by a minus sign.

[0202] In this embodiment, when n is equal to 2, of the two constellation diagrams, the constellation diagram with a smaller scaling factor can be called an inner constellation diagram, and the constellation diagram with a larger scaling factor can be called an outer constellation diagram.

[0203] When n is equal to 3, the first example of the mapping relationship of the combined constellation diagram is as follows: d3 = (1-2b(6i)) + j(1-2b(6i+1)) d2 = (1-2b(6i+2)) + j(1-2b(6i+3)) d1 = (1-2b(6i+4)) + j(1-2b(6i+5))

[0204] Among them, the three mapping relationships corresponding to the three constellations are d3, d2 and d1 respectively; d represents the combined constellation, and the modulation order is 6; the scaling factor of the constellation corresponding to d3 is 4, the operation sign is plus, and the modulation order is 2; the scaling factor of the constellation corresponding to d2 is 2, the operation sign is plus, and the modulation order is 2; the scaling factor of the constellation corresponding to d1 is 1, the modulation order is 2, and the operation sign is plus; is the power normalization factor of the combined constellation diagram; i is an integer, starting from 0, until i is the smallest integer less than h or equal to h, where h is equal to the quotient of the number of bits contained in the second bit sequence divided by 4; b(·) represents the bit in the second bit sequence whose index is the value in the brackets.

[0205] When the second bit sequence uses the combined constellation diagram in this example for 6-order modulation mapping, as an example, the second bit sequence can include coded bits of three coding rates. Because the scaling factor of d3 is greater than the scaling factor of d2, and the scaling factor of d2 is greater than the scaling factor of d1, among the coded bits of the three coding rates, the coded bit with the highest coding rate can be modulated in 2-order using d3, the coded bit with the middle coding rate can be modulated in 2-order using d2, and the coded bit with the lowest coding rate can be modulated in 2-order using d1.

[0206] Figure 9 is an example diagram of the combined constellation diagram in this example, which can also be called a 64QAM constellation diagram.

[0207] Optionally, in this example, the operator symbol of constellation diagram d2 can be replaced by a minus sign. Optionally, in the above example, the operator symbol of constellation diagram d1 can be replaced by a minus sign. Optionally, in the above example, the operator symbol of constellation diagram d3 can be replaced by a minus sign.

[0208] In the aforementioned examples of mapping relationships of the combined constellation diagrams, in some implementations, all bits in the second bit sequence are numbered consecutively.

[0209] When modulating the n coded bit segments using the combined constellation, in some implementations, the n coded bit segments are each numbered consecutively. Optionally, the n bit segments correspond one-to-one to the n constellations, and the index of the bit combination in the mapping relationship corresponding to each constellation is the bit combination index in the corresponding bit segment. As an example, the n bit segments include at least two bit segments with different code rates, wherein the constellation corresponding to the bit segment with the higher code rate has a greater weight in the linear combination.

[0210] The mapping relationship of the combined constellation diagram when the index segments of the bits in the n coded bit segments restart to be numbered continuously is introduced below.

[0211] In this embodiment, when n is equal to 2, the fifth example of the mapping relationship of the combined constellation diagram is as follows: d1 = (1-2b1 (2i)) + j (1-2b1 (2i + 1)) d2 = (1-2b2 (2i)) + j (1-2b2 (2i + 1))

[0212] The parameters in this example differ from those in the first example when n is 2 in that b1(·) represents the bit in the first bit segment whose index is the value in parentheses, and b2(·) represents the bit in the second bit segment whose index is the value in parentheses. The bit rate of the second bit segment can be greater than the bit rate of the first bit segment.

[0213] Alternatively, in this example, the operator symbol of the constellation diagram d2 can be replaced by a minus sign. Alternatively, in the above example, the operator symbol of the constellation diagram d1 can be replaced by a plus sign.

[0214] When n is equal to 2, the sixth example of the combined constellation diagram is as follows: d1 = (1-2b1(4i))(2-(1-2b1(4i+2)))+j(1-2b1(4i+1))(2-(1-2b1(4i+3))) d2 = (1-2b2(2i))+j(1-2b2(2i+1))

[0215] The parameters in this example differ from those in the second example when n is 2 in that b1(·) represents the bit in the first bit segment whose index is the numeric value in parentheses, and b2(·) represents the bit in the second bit segment whose index is the numeric value in parentheses. The bit rate of the second bit segment can be greater than the bit rate of the first bit segment.

[0216] Optionally, in the above example, the operation symbol of the constellation diagram d2 may be a minus sign. Optionally, in the above example, the operation symbol of the constellation diagram d1 may be a minus sign.

[0217] When n is equal to 2, the seventh example of the combined constellation diagram is as follows: d1 = (1-2b1(4i))(2-(1-2b1(4i+2)))+j(1-2b1(4i+1))(2-(1-2b1(4i+3))) d2 = (1-2b2(4i))(2-(1-2b2(4i+2)))+j(1-2b2(4i+1))(2-(1-2b2(4i+3)))

[0218] The parameters in this example differ from those in the third example when n is 2 in that b1(·) represents the bit in the first bit segment whose index is the numeric value in parentheses, and b2(·) represents the bit in the second bit segment whose index is the numeric value in parentheses. The bit rate of the second bit segment can be greater than the bit rate of the first bit segment.

[0219] Optionally, in the above example, the operation symbol of the constellation diagram d2 may be a minus sign. Optionally, in the above example, the operation symbol of the constellation diagram d1 may be a minus sign.

[0220] When n is equal to 2, the eighth example of the combined constellation diagram is as follows: d1 = (1-2b1(6i))(4-(1-2b1(6i+2)))(2-(1-2b1(6i+4))) + j(1-2b1(6i+1))(4-(1-2b1(6i+3)))(2-(1-2b1(6i+5))) d2 = (1-2b2(4i))(2-(1-2b2(4i+2))) + j(1-2b2(4i+1))(2-(1-2b2(4i+3)))

[0221] The parameters in this example differ from those in the fourth example when n is 2 in that b1(·) represents the bit in the first bit segment whose index is the numeric value in parentheses, and b2(·) represents the bit in the second bit segment whose index is the numeric value in parentheses. The bit rate of the second bit segment can be greater than the bit rate of the first bit segment.

[0222] Alternatively, in the above example, the operator symbol of the constellation diagram d2 can be replaced by a minus sign. Alternatively, in the above example, the operator symbol of the constellation diagram d1 can be replaced by a minus sign.

[0223] When n is equal to 3, the second example of the mapping relationship of the combined constellation diagram is as follows: d1=(1-2b1(2i))+j(1-2b1(2i+1)) d2=(1-2b2(2i))+j(1-2b2(2i+1)) d3=(1-2b3(2i))+j(1-2b3(2i+1))

[0224] The parameters in this example differ from those in the first example when n is 3 in that b1(·) represents the bit indexed by the numeric value in parentheses in the first bit segment, b2(·) represents the bit indexed by the numeric value in parentheses in the second bit segment, and b3(·) represents the bit indexed by the numeric value in parentheses in the third bit segment. The bit rate of the third bit segment can be greater than that of the second bit segment, and the bit rate of the second bit segment can be greater than that of the first bit segment.

[0225] Optionally, in this example, the operator symbol of constellation diagram d2 can be replaced by a minus sign. Optionally, in the above example, the operator symbol of constellation diagram d1 can be replaced by a minus sign. Optionally, in the above example, the operator symbol of constellation diagram d3 can be replaced by a minus sign.

[0226] In order to better understand the technical solution of modulation by combining constellation diagrams provided in this application, it is introduced below with examples.

[0227] In one example, the second bit sequence includes "010110101110010101100110", the bit indexes are numbered consecutively from right to left, and the bit indexes are numbered starting from 0, and the combined constellation diagram is the first combined constellation diagram example when n is equal to 2. The modulation order of the combined constellation diagram is 4, and the number of bits of the second bit sequence is 24. Therefore, i starts at 0 and increases by 1 successively, and can take a maximum value of 5. The bits indexed 4i and 4i+1 can be coded bits with the same code rate, for example, they can be bits in the same coded bit segment; the bits indexed 4i+2 and 4i+3 can be coded bits with the same code rate, for example, they can be bits in the same coded bit segment. The code rate of the bits indexed 4i and 4i+1 can be greater than the code rate of the bits indexed 4i+2 and 4i+3.

[0228] Among them, when i is 0, b(4i) represents the bit with index 0 in the second bit sequence, that is, the first bit "0" from the right; b(4i+1) represents the bit with index 1 in the second bit sequence, that is, the second bit "1" from the right; b(4i+2) represents the bit with index 2 in the second bit sequence, that is, the third bit "1" from the right; b(4i+3) represents the bit with index 3 in the second bit sequence, that is, the fourth bit "0" from the right.

[0229] Therefore, when i is equal to 0, the calculation process of d is as follows: d2=(1-2b(4i))+j(1-2b(4i+1))=(1-2×0)+j(1-2×1)=1-j d1=(1-2b(4i+2))+j(1-2b(4i+3))=(1-2×1)+j(1-2×0)=-1+j

[0230] That is, the real part of the modulation symbol after the bit combination "0110" is mapped without power normalization is "3" and the imaginary part is "-3", which is exactly consistent with the coordinate position of the constellation point where "0110" is located as shown in Figure 4.

[0231] In another example, the first coded bit segment is "011011010101", and the second coded bit segment is "011010011010", the code rate of the first bit segment is greater than the code rate of the second bit segment, and the indexes of the bits in the two coded bit segments are segmented and restarted continuously. The combined constellation diagram is the fifth combined constellation diagram example when n is equal to 2.

[0232] Among them, when i is equal to 0, for the first bit segment, b1(2i) represents the bit with index 0, that is, the first bit "1" from the right; b1(2i+1) represents the bit with index 1, that is, the second bit "0" from the right; for the second bit segment, b2(2i) is the bit with index 0, that is, the first bit "0" from the right; b2(2i+1) represents the bit with index 1, that is, the second bit "1" from the right.

[0233] Therefore, when i is equal to 0, the calculation process of d is as follows: d1=(1-2b1(2i))+j(1-2b1(2i+1))=(1-2×1)+j(1-2×0)=-1+j d2=(1-2b2(2i))+j(1-2b2(2i+1))=(1-2×0)+j(1-2×1)=1-j

[0234] That is, the real part of the modulation symbol after the bit combination "0110" is mapped without power normalization is "3" and the imaginary part is "-3", which is exactly consistent with the coordinate position of the constellation point where "0110" is located as shown in Figure 4.

[0235] It can be understood that the constellation obtained by the linear combination of n constellations has the following characteristics: among these n constellations, it is assumed that these n constellations are numbered, the numbers are integers from 1 to n, and the modulation order of the constellation numbered k is recorded as Q k , assuming that the bits in the bit sequence corresponding to the constellation points in the combined constellation diagram are numbered from right to left with 1 as the starting value, then the bits in the bit sequence corresponding to the constellation points in the linear combination constellation diagram are numbered from Start to The sequence of bits is the bit sequence corresponding to the constellation point in the constellation diagram numbered f; and the larger the absolute value of the scaling factor of the constellation diagram numbered f is, the larger the number of bits in the linear combination constellation diagram numbered from Start to The greater the distance between two constellation points with different bit sequences, the greater the numbering Start to The stronger the bit sequence is in terms of its ability to resist channel fading. represents the sum of the modulation orders from constellation numbered 1 to constellation numbered f-1, Represents the sum of the modulation orders of the constellation diagram numbered 1 to the constellation diagram numbered f.

[0236] Because the number from Start to The greater the distance of the bit sequence, the stronger the ability of the bit sequence to resist channel fading. Therefore, information with higher transmission performance can be mapped to the bit sequence with a larger distance in the combined constellation diagram through the corresponding constellation diagram, thereby meeting the information transmission performance.

[0237] Furthermore, since the numbering Start to The greater the distance between the bit sequences, the stronger the ability of the bit sequence to resist channel fading. Therefore, by using encoders with different code rates to segmentally encode the first bit sequence and mapping the coded bit segments with higher code rates to the bit sequences with larger distances in the combined constellation through the corresponding constellation diagram for transmission, the ability of the information encoded with higher code rates to resist channel fading can still be guaranteed. In addition, the coding with higher code rates can also reduce the coding complexity, thereby reducing the power consumption of the coding end.

[0238] Taking Figure 6 as an example, the modulation order of the constellation diagram shown in Figure 6(a) is 2, and the modulation order of the constellation diagram shown in Figure 6(b) is 2; each constellation point in Figure 6(c) corresponds to 4 bits. If these 4 bits are numbered 1, 2, 3, and 4 from right to left, the sequences "00", "01", "10", and "11" formed by the bits numbered 1 and 2 among these 4 bits are the bit sequences corresponding to the constellation points in the constellation diagram shown in Figure 6(a), and the sequences "00", "01", "10", and "11" formed by the bits numbered 3 and 4 among these 4 bits are the bit sequences corresponding to the constellation points in the constellation diagram shown in Figure 6(b).

[0239] The scaling factor of the constellation diagram shown in Figure 6(a) in the combined constellation diagram is 2, and the scaling factor of the constellation diagram shown in Figure 6(b) in the combined constellation diagram is 1, that is, the scaling factor of the constellation diagram shown in Figure 6(a) in the combined constellation diagram is greater than the scaling factor of the constellation diagram shown in Figure 6(b) in the combined constellation diagram. Therefore, the distance between the two constellation points numbered 3 and 4 in the combined constellation diagram, where the bit sequences are different and the bit sequences numbered 1 and 2 are the same, is greater than the distance between the two constellation points numbered 1 and 2 in the combined constellation diagram, where the bit sequences are different and the bit sequences numbered 3 and 4 are the same.

[0240] For example, in FIG6(c), if the distance between the constellation point whose last two bits (i.e., bits numbered 1 and 2) are “00” and whose first two bits (i.e., bits numbered 3 and 4) are 10 and the constellation point whose last two bits (i.e., bits numbered 1 and 2) are “01” and whose first two bits (i.e., bits numbered 3 and 4) are 10 is recorded as the first distance, and the distance between the constellation point whose first two bits (i.e., bits numbered 3 and 4) are “00” and whose last two bits (i.e., bits numbered 1 and 2) are 10 and the constellation point whose last two bits (i.e., bits numbered 3 and 4) are “01” and whose first two bits (i.e., bits numbered 1 and 2) are 10 is recorded as the second distance, the first distance is smaller than the second distance.

[0241] Due to the influence of noise, the constellation points received by the receiver may shift. The greater the distance between constellation points, the lower the probability of incorrectly determining a constellation point, even if the constellation points shift. The lower the probability of incorrectly determining a constellation point at the receiver, the lower the coding complexity required for error correction coding at the transmitter.

[0242] From the above content, it can be seen that the method in the present application uses a combined constellation diagram that satisfies a preset relationship with a linear combination of n constellation diagrams to perform m-order modulation on the first bit sequence corresponding to the first channel. The increase in the distance between the bit sequences at the same position in the constellation point can reduce the probability of the complex-valued modulation symbols obtained by modulation being judged incorrectly at the receiving end, thereby providing support for reducing the coding complexity of the communication device as the transmitting end, which is conducive to reducing the coding power consumption of the communication device.

[0243] In this embodiment, the mapping relationship of the constellation diagrams in the n constellation diagrams can be compatible with the mapping relationship in the existing protocol. For example, it can be compatible with the mapping relationship related to the constellation diagram in the NR protocol 38.211.

[0244] Regarding these n constellations, in some implementations, these n constellations can be determined by the communication device itself. In this case, the communication device as the encoding end can send indication information to the communication device as the decoding end, indicating these n constellations, so that the encoding and decoding of both parties are consistent.

[0245] In other implementations, the n constellation diagrams may be indicated by information received by the communication device from other communication devices.

[0246] In some other implementations, the n constellations may be predefined in a communication protocol, and the communication device may configure these constellations according to the definition of the communication protocol.

[0247] Regarding the weights of the n constellations, in some implementations, the weights of the n constellations may be determined by the communication device itself. In this case, the communication device acting as the encoding end may send an instruction to the communication device acting as the decoding end, indicating the weights of the n constellations, so as to ensure consistency in encoding and decoding between the two parties.

[0248] In some other implementations, the weights of the n constellation diagrams may be indicated by information received by the communication device from other communication devices.

[0249] In some other implementations, the weights of the n constellations may be predefined in the communication protocol, and the communication device may configure these constellations according to the definition of the communication protocol.

[0250] Regarding the linear combination, in some implementations, the communication device may determine the linear combination based on the acquired n constellation diagrams and weights. In this implementation, the communication device may also send information to other communication devices to indicate the linear combination.

[0251] In other implementations, the linear combination may be defined by a communication protocol, and the communication device may configure the linear combination based on the definition of the communication protocol.

[0252] If the communication protocol defines multiple linear combinations, in some implementations, the communication device may determine a linear combination to be used from the multiple linear combinations based on demand. Optionally, the communication device may indicate its selected linear combination to other communication devices.

[0253] In still other implementations, the linear combination may be indicated by information received by the communication device from other communication devices.

[0254] Regarding the combined constellation, in some implementations, after the communication device obtains the linear combination, it can determine the combined constellation based on the linear combination. The relationship between the linear combination and the combined constellation can refer to the relationship satisfied by d in the above content.

[0255] In other implementations, the combined constellation diagram may be defined by a communication protocol, and the communication device may configure the combined constellation diagram based on the definition of the communication protocol.

[0256] If the communication protocol defines multiple combined constellations, in some implementations, the communication device may determine the combined constellation to be used from the multiple combined constellations based on demand. Optionally, the communication device may indicate the selected combined constellation to other communication devices.

[0257] In other implementations, the combined constellation diagram may be indicated by information received by the communication device from other communication devices.

[0258] It can be understood that the other communication devices mentioned above can be communication devices serving as decoding ends, so that the encoding and decoding of both parties can be consistent.

[0259] Figure 10 is a flow chart of a communication method according to an embodiment of the present application. The method may include S1010 and S1020. The method may be executed by a decoding device, which may also be referred to as a communication device.

[0260] The decoding device may be a communication device, or a chip, chip system, processor, or processing circuit used in a communication device. Examples of the communication device include a network device or terminal, or a chip, chip system, processor, or processing circuit used in a network device or terminal. When the communication device executes the method during a communication process, it may be referred to as a receiving end, or in other words, the communication device may execute the method when acting as a receiving end.

[0261] S1010: Obtain a complex-valued modulation symbol corresponding to a first channel, where the first channel comes from another device.

[0262] For the relevant meaning of the first channel, please refer to the content in the embodiment shown in FIG3 , which will not be described in detail here.

[0263] The complex-valued modulation symbol corresponding to the first channel can be understood as the complex-valued modulation symbol transmitted in the first channel or the complex-valued modulation symbol carried by the first channel or the complex-valued modulation symbol of the first channel.

[0264] In one possible implementation, the complex-valued modulation symbol is obtained by performing m-order modulation on the first bit sequence according to a combined constellation diagram, the combined constellation diagram and the linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations.

[0265] Furthermore, the method may further include:

[0266] S1020, performing m-order demodulation on the complex-valued modulation symbol according to the combined constellation diagram, the combined constellation diagram and the linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations, and at least two of the n constellations have different weights in the linear combination.

[0267] In this embodiment, the process of performing m-th order demodulation on the complex-valued modulation symbols based on the combined constellation diagram to obtain a bit sequence can be regarded as the inverse process of modulating the bit sequence based on the combined constellation diagram in the embodiment shown in FIG. 3 .

[0268] For example, assuming that the complex-valued modulation symbol corresponding to the first channel is recorded as I1+jQ1, then find the constellation point whose projection on the I axis is I1 and whose projection on the Q axis is Q1 from the combined constellation diagram, and the bit sequence corresponding to the constellation point is the bit sequence obtained by demodulation.

[0269] In this embodiment, after performing m-th-order demodulation on the complex-valued modulation symbols to obtain a bit sequence, the bit sequence may be decoded.

[0270] As shown in the description of the combined constellation diagram in the embodiment shown in FIG3 , the constellation points received by the receiver may shift due to the influence of noise. A larger distance between constellation points reduces the probability of incorrectly determining a received constellation point, even if the constellation points shift. The lower the probability of incorrectly determining a constellation point at the receiver, the lower the coding complexity can be when the transmitter performs error correction coding, and accordingly, the decoding complexity at the decoder is also reduced.

[0271] It should be understood that, in this application, indication includes direct indication (also known as explicit indication) and implicit indication. Direct indication of information A refers to including information A; implicit indication of information A refers to indicating information A through the correspondence between information A and information B and the direct indication of information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured.

[0272] It should be understood that, in this application, information C is used to determine information D, which includes both information D being determined solely based on information C and information D being determined based on information C and other information. Furthermore, information C can also be used to determine information D indirectly, for example, where information D is determined based on information E, and information E is determined based on information C.

[0273] This application also provides an apparatus that can be installed in or used in conjunction with a communication device to enable the communication device to implement the functions implemented by the communication device in any of the aforementioned embodiments. For example, the apparatus can be a chip system. A chip system can be composed of a chip or can include a chip and other discrete components. In another example, the apparatus can be a computer program product. The communication device can be a terminal or a network device.

[0274] FIG11 is a schematic diagram of the structure of a communication device according to an embodiment of the present application. As shown in FIG11 , the device 1100 may include a processing module 1101 and a communication module 1102 .

[0275] As a first example, the apparatus 1100 can be used to implement the communication method implemented by the communication apparatus in the embodiment shown in FIG3. For example, the processing module 1101 is used to implement the processing-related steps such as acquisition and modulation performed by the communication apparatus in S310 to S320, and the communication module 1102 is used to implement the sending and / or receiving steps performed by the communication apparatus in S310 to S320.

[0276] As a second example, the apparatus 1100 can be used to implement the communication method implemented by the communication apparatus in the embodiment shown in Figure 10. For example, the processing module 1101 is used to implement the processing-related steps such as acquisition and modulation performed by the communication apparatus in steps S1010 to S1020, and the communication module 1102 is used to implement the sending and / or receiving steps performed by the communication apparatus in steps S1010 to S1020.

[0277] Figure 12 is a schematic diagram of the structure of a communication device provided in yet another embodiment of the present application. As shown in Figure 12, the device 1200 includes a processing circuit 1201 and a communication circuit 1202. The processing circuit 1201 and the communication circuit 1202 are coupled to each other.

[0278] It can be understood that the processing circuit may be one or more processors, or may be all or part of the circuits of the processing functions in one or more processors.

[0279] It is understandable that the communication circuit 1202 may be a transceiver or an input / output interface.

[0280] Optionally, the apparatus 1200 may further include a memory 1203 for storing instructions executed by the processing circuit 1201 or storing input data required by the processing circuit 1201 to run instructions or storing data generated after the processing circuit 1201 runs instructions.

[0281] It is understandable that the memory 1203 may be located outside the processing circuit 1201 , or inside the processing circuit 1201 .

[0282] As an example, the processing circuit 1201 is used to implement the functions of the processing module 1101 , and the communication circuit 1202 is used to implement the functions of the communication module 1102 .

[0283] As an example, the apparatus 1200 may be a communication device, or a chip used in a communication device.

[0284] When the device 1200 is a communication device, the communication circuit can be a transceiver; when the device 1200 is a chip, the communication circuit can be an input / output circuit, a bus, a pin or other type of communication interface, wherein the input circuit in the input / output circuit can be used for receiving and the output interface can be used for sending.

[0285] Some embodiments of the present application also provide a computer-readable storage medium, which includes computer instructions. When the computer instructions are executed on a processor, the method implemented by the communication device in any of the above embodiments can be implemented.

[0286] In some embodiments of the present application, a communication system is also provided, which can implement the method implemented by the communication device in any of the above embodiments.

[0287] It is understood that the processor in the embodiments of the present application can be the following devices or all or part of the circuits in the following devices used for processing functions: a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor can be a microprocessor or any conventional processor.

[0288] The method steps in the embodiments of the present application can be implemented by hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, register, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in a chip, such as an application-specific integrated circuit (ASIC), or a chip system, such as a system on a chip (SOC). In addition, the chip or chip system can be located in a network device or a terminal device. Of course, the processor and the storage medium can also be present in a network device or a terminal device as discrete components.

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

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

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

Claims

1. A communication method, characterized in that: The method comprises: Obtaining a first bit sequence corresponding to a first channel; The first bit sequence is modulated in m-th order according to the combined constellation diagram, the combined constellation diagram and the linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations, and at least two of the n constellations have different weights in the linear combination.

2. The method according to claim 1, characterized in that The first bit sequence is an encoded bit sequence.

3. The method according to claim 1, characterized in that The first bit sequence is a bit sequence before encoding.

4. The method according to claim 3, characterized in that The performing m-order modulation on the first bit sequence according to the combined constellation diagram includes: The n bit segments or one bit segment obtained by encoding the first bit sequence are subjected to m-order modulation, and at least two of the n coded bit segments have different coding rates.

5. The method according to any one of claims 1 to 4, characterized in that The weight of at least one of the n constellations in the linear combination is associated with the modulation order of one or more constellations other than the at least one constellation among the n constellations.

6. The method according to any one of claims 1 to 4, characterized in that The weight α of the t-th constellation diagram in the n constellations in the linear combination t Satisfies the following relationship: Where t is an integer, t is greater than or equal to 2, t is less than or equal to n, Q k represents the modulation order of the kth constellation among the n constellations.

7. The method according to any one of claims 1 to 6, characterized in that The n constellation diagrams include a first constellation diagram and a second constellation diagram, The first constellation diagram is a constellation diagram of order 2, and the weight of the second constellation diagram is 2; or, The first constellation diagram is a 4-order constellation diagram, and the weight of the second constellation diagram is 4; or, The first constellation diagram is a 6-order constellation diagram, and the weight of the second constellation diagram is 8.

8. The method according to any one of claims 1 to 6, characterized in that The n constellation diagrams include a first constellation diagram, a second constellation diagram and a third constellation diagram, the first constellation diagram is a 2nd-order constellation diagram, the second constellation diagram is a 2nd-order constellation diagram, the weight of the second constellation diagram is 2, and the weight of the third constellation diagram is 4.

9. The method according to any one of claims 1 to 8, characterized in that The linear combination satisfies the following relationship: Alternatively, the linear combination satisfies the following relationship: Where d' represents the linear combination, α t represents the weight of the t-th constellation diagram in the linear combination of the n constellation diagrams, d1 represents the first constellation diagram in the n constellation diagrams, d t represents the tth constellation diagram among the n constellation diagrams.

10. The method according to any one of claims 1 to 9, characterized in that The combined constellation diagram and the linear combination satisfy the following relationship: d = S * d' Wherein, d' represents the linear combination, d represents the combined constellation diagram, and S represents the power normalization factor of the linear combination.

11. The method according to any one of claims 1 to 10, characterized in that The method further comprises: First information is received or sent, where the first information indicates the linear combination.

12. The method according to any one of claims 1 to 10, characterized in that The linear combination is preset.

13. The method according to any one of claims 1 to 12, characterized in that The method further comprises: Second information is sent or received, where the second information indicates the combined constellation diagram.

14. The method according to any one of claims 1 to 12, characterized in that The combined constellation diagram is preset.

15. A communication method, characterized in that: The method comprises: Obtaining a complex-valued modulation symbol corresponding to the first channel; The complex-valued modulation symbols are demodulated in mth order according to the combined constellation diagram, the combined constellation diagram and the linear combination of n constellations satisfy a preset relationship, m and n are both integers greater than 1, the modulation order of the combined constellation diagram is m and is equal to the sum of the modulation orders of the n constellations, and at least two of the n constellations have different weights in the linear combination.

16. The method according to claim 15, characterized in that The weight of at least one of the n constellations in the linear combination is associated with the modulation order of one or more constellations other than the at least one constellation among the n constellations.

17. The method according to claim 16, characterized in that The weight α of the t-th constellation diagram in the n constellations in the linear combination t Satisfies the following relationship: Where t is an integer, t is greater than or equal to 2, t is less than or equal to n, Q k represents the modulation order of the kth constellation among the n constellations.

18. The method according to any one of claims 15 to 17, characterized in that The n constellation diagrams include a first constellation diagram and a second constellation diagram, The first constellation diagram is a constellation diagram of order 2, and the weight of the second constellation diagram is 2; or, The first constellation diagram is a 4-order constellation diagram, and the weight of the second constellation diagram is 4; or, The first constellation diagram is a 6-order constellation diagram, and the weight of the second constellation diagram is 8.

19. The method according to any one of claims 15 to 17, characterized in that The n constellation diagrams include a first constellation diagram, a second constellation diagram and a third constellation diagram, the first constellation diagram is a 2nd-order constellation diagram, the second constellation diagram is a 2nd-order constellation diagram, the weight of the second constellation diagram is 2, and the weight of the third constellation diagram is 4.

20. The method according to any one of claims 15 to 19, characterized in that The linear combination satisfies the following relationship: Alternatively, the linear combination satisfies the following relationship: Where d' represents the linear combination, α t represents the weight of the t-th constellation diagram in the linear combination of the n constellation diagrams, d1 represents the first constellation diagram in the n constellation diagrams, d t represents the tth constellation diagram among the n constellation diagrams.

21. The method according to any one of claims 15 to 20, characterized in that The combined constellation diagram and the linear combination satisfy the following relationship: d = S * d' Wherein, d' represents the linear combination, d represents the combined constellation diagram, and S represents the power normalization factor of the linear combination.

22. The method according to any one of claims 15 to 21, characterized in that The method further comprises: First information is received or sent, where the first information indicates the linear combination.

23. The method according to any one of claims 15 to 22, characterized in that The linear combination is preset.

24. The method according to any one of claims 15 to 23, characterized in that The method further comprises: Send or transmit second information, wherein the second information indicates the combined constellation diagram.

25. The method according to any one of claims 15 to 23, characterized in that The combined constellation diagram is preset.

26. A communication device, characterized in that: The method comprises a functional module for implementing the method according to any one of claims 1 to 14, or a functional module for implementing the method according to any one of claims 15 to 25.

27. A communication device, characterized in that: include: one or more processors and communication circuitry, The communication circuit is used for the communication device to perform at least one of inputting or outputting signals; the one or more processors are used to implement the method as described in any one of claims 1 to 14, or the one or more processors are used to implement the method as described in any one of claims 15 to 25.

28. A communication system, characterized in that: The invention comprises a communication device for implementing the method according to any one of claims 1 to 14 and a communication device for implementing the method according to any one of claims 15 to 25.

Images