Modulation method and communication apparatus

Abstract

Provided in the present application are a modulation method and a communication apparatus. A first constellation used in the modulation method comprises L constellation points, wherein L=2Qm. The positions of the L constellation points are related to a first set, which comprises M values, wherein M=2m, where m is a positive number less than Qm. The first value to the T1-th value in the first set form an arithmetic progression having a common difference of d1, and the T1-th value to the T2-th value in the first set form an arithmetic progression having a common difference of d2, wherein T1 is greater than 1, T2 is greater than T1 and less than or equal to M, and d1 and d2 are different and are both positive numbers. By means of the modulation method in the embodiments of the present application, the corresponding modulation and demodulation complexity can also be reduced on the basis of improving the overall channel capacity.

Description

Modulation methods and communication devices

[0001] This application claims priority to Chinese Patent Application No. 202510229951.4, filed on February 28, 2025, entitled "Modulation Method and Communication Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more specifically, to a modulation method and a communication apparatus. Background Technology

[0003] Higher-order modulation is a technique used in communication systems to improve spectral efficiency. It uses multiple constellation points in a signal constellation diagram to represent different symbols or bit combinations, thereby increasing the amount of information carried by each symbol. Common higher-order modulations include quadrature amplitude modulation (QAM) and 64QAM. As the modulation order increases, the number of bits that each symbol can represent also increases, thus improving spectral efficiency.

[0004] Currently, constellations can be categorized into uniform and non-uniform constellations. A uniform constellation design refers to a constellation diagram where the spacing between adjacent points is the same. In a uniform constellation diagram, the coordinates of the real (in-phase, I) axis and the imaginary (quadrature, Q) axis are typically arranged in an arithmetic progression. This design ensures that adjacent points in the constellation diagram have the same Euclidean distance (i.e., the distance between points). Conversely, a non-uniform constellation design refers to a constellation diagram where the spacing between adjacent points is not uniform. This design is typically used to optimize certain performance metrics. In a non-uniform constellation diagram, the position and spacing of constellation points may be adjusted according to specific algorithms or optimization objectives.

[0005] Current non-uniform constellations lack fixed structural features, and their complex design leads to high modulation and demodulation complexity. Summary of the Invention

[0006] This application provides a modulation method and a communication device that can reduce the complexity of modulation and demodulation.

[0007] Firstly, a communication method is provided, which can be executed by a first communication device, which is a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to a transmitting device (e.g., a network device, a terminal device), a component used in the transmitting device (e.g., a processor, a chip, or a chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The component used in the transmitting device can be within the transmitting device or can be independent of the transmitting device.

[0008] The method includes: acquiring a first codeword sequence to be transmitted; performing constellation mapping on the first codeword sequence based on a first modulation scheme to obtain a modulation symbol stream, wherein the first modulation scheme corresponds to a first constellation, and the first constellation is based on the modulation order Q. m As determined by the first parameter T1, the first constellation comprises L constellation points, where L = 2. Qm The positions of L constellation points are related to the first set, which contains M values, where M = 2. m m is less than Q m The positive numbers, the first value to the T1th value in the first set are an arithmetic sequence with a common difference of d1, the T1th value to the T2th value in the first set are an arithmetic sequence with a common difference of d2, T1 is greater than 1, T2 is greater than T1 and less than or equal to M, d1 and d2 are different and both are positive numbers; output the modulated symbol stream.

[0009] Based on the above technical solution, on the one hand, the positions of the constellation points in the first constellation are related to the first set, giving the designed first constellation a fixed and clear structural feature, while also allowing for a concise and clear description of the constellation features. On the other hand, constellations designed based on the first set can maintain the same spacing between some adjacent constellation points in the generated constellation, which helps balance the spacing between adjacent constellation points in the constellation diagram, thereby reducing modulation and demodulation complexity. For example, it can reduce the requirements for hardware modulation and demodulation accuracy, especially in terms of error vector magnitude (EVM). Furthermore, compared to uniform constellations, non-uniform constellations can optimize certain performance indicators, such as improving channel capacity, reducing bit error rate, and improving anti-interference performance.

[0010] Secondly, a communication method is provided, which can be executed by a second communication device, which is a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself (e.g., network device, terminal device), a component used in the receiving device (e.g., processor, chip, or chip system), or a logic module or software that can implement all or part of the functions of the receiving device. The component used in the receiving device can be within the receiving device or can be independent of the receiving device.

[0011] The method includes: acquiring a symbol stream to be demodulated; demodulating the bits in the symbol stream to be demodulated based on a first demodulation method to obtain a demodulated sequence, wherein the first demodulation method corresponds to a first constellation based on the modulation order Q. m As determined by the first parameter T1, the first constellation comprises L constellation points, where L = 2. Qm The positions of L constellation points are related to the first set, which contains M values, where M = 2. m m is less than Q m The set contains positive numbers. The first to the T1th values ​​in the first set form an arithmetic sequence with a common difference of d1. The T1th to the T2th values ​​in the first set form an arithmetic sequence with a common difference of d2. T1 is greater than 1, T2 is greater than T1 and less than or equal to M, and d1 and d2 are different and both are positive numbers. Output the demodulated sequence.

[0012] For the beneficial effects of the second aspect, please refer to the description of the first aspect, which will not be repeated here.

[0013] In some implementations of the first or second aspect, T1 is based on Q. m The modulation and coding scheme (MCS) index, code rate, and spectral efficiency are determined.

[0014] In some implementations of the first or second aspect, the position coordinates of the L constellation points include Individual departments and A virtual part, Individual departments and Each virtual part is respectively with Each bit combination corresponds one-to-one. The number of bits in each bit combination is Q. m / 2, The first bit combination in the bit combination and The first real part corresponds to the first bit combination and... The first imaginary part of each imaginary part corresponds to the first real part, and the first imaginary part is equal to the first real part, m = Q.m / 2-1, The M values ​​in the first set and their opposites are: The values ​​of each real part.

[0015] In the above technical solution, a non-uniform QAM constellation can be designed based on the first set. Specifically, the real part (or imaginary part) of the non-uniform QAM constellation is the value in the first set and the opposite of the value in the first set. This simplifies the description of the non-uniform QAM constellation. In addition, some adjacent constellation points in the first constellation have the same interval, which helps to balance the interval between different adjacent constellation points in the constellation diagram, thereby reducing the complexity of modulation and demodulation.

[0016] In some implementations of the first or second aspect, the modulation order Q m The first parameter T1 is the parameter corresponding to the first modulation and coding strategy (MCS). The first MCS corresponds to T1 = k * M, where k = 1 / 2 or 3 / 4.

[0017] In the above technical solution, when the first constellation is a non-uniform QAM constellation, there are two options for T1. With the same M, increasing k (i.e. increasing T1) can improve d1, thereby increasing the minimum distance between constellation points of the first constellation, improving the shaping effect, and enabling better error correction performance under high bit rate or high spectral efficiency.

[0018] In some implementations of the first or second aspect, the position coordinates of the L constellation points include The radius of each concentric circle and An angle, m1 + m2 = Q m , radius and Each bit combination corresponds one-to-one. The number of bits in each bit combination is m1. The first bit combination in the bit combination and The first radius among the radii corresponds to... An angle and Each bit combination corresponds one-to-one. The number of bits in each bit combination is m². The first bit combination in the bit combination and The first angle among the angles corresponds to m = m1. The M values ​​in the first set are The value of the radius of each concentric circle.

[0019] In the above technical solution, an amplitude phase shift keying (APSK) constellation can be designed based on the first set. Specifically, the first set is the value of the radius of multiple concentric circles of the APSK constellation, which can simplify the description of the APSK constellation. In addition, some adjacent constellation points in the first constellation have the same interval, which helps to balance the interval of different adjacent constellation points in the constellation diagram and reduce the complexity of modulation and demodulation.

[0020] In some implementations of the first or second aspect, the modulation order Q m The first parameter T1 is the parameter corresponding to the first modulation and coding strategy (MCS), and T1 = k for the first MCS, where k = 2 or 3.

[0021] In the above technical solution, when the first constellation is an APSK constellation, there are two options for T1. Decreasing T1 can increase d1, increase the minimum distance between constellation points of the first constellation, improve the shaping effect, and achieve better error correction performance at high bit rate or high spectral efficiency.

[0022] In some implementations of the first or second aspect, the k corresponding to each MCS in the MCS mapping relationship where the first MCS is located is the same.

[0023] For example, the MCS mapping relationship can be represented in tabular form (i.e., the MCS mapping relationship is an MCS table), or it can be represented in other forms. The MCS mapping relationship can represent the correspondence between multiple types of MCS parameters of each MCS in multiple MCSs. For example, these multiple types of MCS parameters include MCS index, modulation order, target code rate, spectral efficiency, and first parameter T1.

[0024] In the above technical solution, each MCS has the same k (i.e., the same T), which can reduce the complexity of parameter configuration.

[0025] In some implementations of the first or second aspect, the first value in the first set is d1 / 2.

[0026] In the above technical solution, when the first constellation is a non-uniform QAM constellation, the first value in the first set is d1 / 2, which indicates that the constellation... The smallest positive real part among the real parts is d1 / 2, and the constellation... The largest negative real part in the real part is -d1 / 2, which also makes the interval between the smallest positive real part and the largest negative real part d1. Therefore, in related operations, the demodulation region of this part can be divided into equally spaced regions with other parts. This ensures that the demodulation region of this part is also equally spaced, thus further reducing demodulation complexity and optimizing the performance and effectiveness of the entire technical solution.

[0027] In some implementations of the first or second aspect, the method further includes: obtaining a second parameter c1, wherein the second parameter c1 is the ratio of d2 to d1; determining d1 based on the first parameter T1, the second parameter c1, and M; determining d2 based on d1 and the second parameter c1; and determining a first set based on d1 and d2.

[0028] In the above technical solution, the first constellation is a non-uniform QAM constellation. Therefore, based on energy normalization, the following formula can be obtained.

[0029] It's understandable that dividing M by the left side of the equation in the above formula results in the right side being 1 / 2, indicating that the average of the M values ​​is 1 / 2. For non-uniform QAM constellations, energy normalization means that the average energy of the first constellation is the sum of the average energy of its real and imaginary parts, which is 1. Since the M values ​​in the first set represent the real or imaginary parts of the first constellation, the average energy of the real and imaginary parts of the first constellation is 1 / 2, meaning the right side of the equation is 1 / 2.

[0030] If the first zodiac sign is an APSK sign, then the following formula can be obtained based on energy normalization.

[0031] It's understandable that dividing M by the left side of the equation in the above formula results in 1 on the right side, indicating that the average of the M values ​​is 1. For APSK constellations, energy normalization means that the average energy of the first constellation is 1, which means the average radius of the first constellation is 1. Since the first set represents the radius of the first constellation, the right side of the equation is 1.

[0032] This method provides a specific implementation for determining the first set. By obtaining c1, d2 = c1 * d1 can be substituted into the above formula to obtain the corresponding d1. Knowing d1 and d2, the first set can be determined, thereby determining the corresponding first constellation.

[0033] In some implementations of the first or second aspect, the second parameter c1 is based on Q. m The modulation and coding strategy (MCS) index, code rate, and spectral efficiency are determined.

[0034] In some implementations of the first or second aspect, the second parameter c1 is the parameter corresponding to the first modulation and coding strategy (MCS). The MCS mapping relationship where the first MCS is located includes multiple MCS sets. Each MCS set includes multiple MCSs. The modulation order corresponding to the multiple MCSs is the same. Each MCS set includes multiple MCS subsets. The indices of the MCSs in each MCS subset are consecutive and the corresponding second parameter c1 is the same.

[0035] For example, the MCS mapping relationship can be represented in tabular form (i.e., the MCS mapping relationship is an MCS table), or it can be represented in other forms. The MCS mapping relationship can reflect the correspondence between multiple types of MCS parameters in each MCS in multiple MCSs. For example, the multiple types of MCS parameters include MCS index, modulation order, target code rate, spectral efficiency, and the second parameter c1.

[0036] In the above technical solution, when the modulation order is the same, the optimal constellations corresponding to consecutively indexed MCSs are close, therefore consecutively indexed MCSs can share the same constellation. By configuring the same second parameter c1, multiple consecutively indexed MCSs can share the same constellation, meaning multiple MCSs can share the same modulation and demodulation hardware, eliminating the need to configure different hardware for each MCS. Therefore, constellation sharing can significantly reduce implementation complexity and improve hardware resource utilization. Furthermore, when the modulation order is the same, the MCS with the larger index value corresponds to higher spectral efficiency. Reducing c1 can make d1 and d2 closer together, while also increasing the minimum interval between adjacent constellations, thus improving the shaping effect.

[0037] In some implementations of the first or second aspect, the method further includes: obtaining d1; determining d2 based on the first parameters T1, M and d1; and determining a first set based on d1 and d2.

[0038] The above technical solution provides another specific way to determine the first set. By obtaining d1, d1 can be substituted into the energy normalization formula to obtain d2. Knowing d1 and d2, the first set can be determined, thereby determining the corresponding first constellation.

[0039] In some implementations of the first or second aspect, d1 is based on Q. m The modulation and coding strategy (MCS) index, code rate, and spectral efficiency are determined.

[0040] In some implementations of the first or second aspect, parameter d1 is the parameter corresponding to the first modulation and coding strategy (MCS). The MCS mapping relationship where the first MCS is located includes multiple MCS sets. Each MCS set includes multiple MCSs. The modulation order corresponding to the multiple MCSs is the same. Each MCS set includes multiple MCS subsets. The indices of the MCSs in each MCS subset are consecutive and the corresponding parameter d1 is the same.

[0041] For example, the MCS mapping relationship can be represented in tabular form (i.e., the MCS mapping relationship is an MCS table), or it can be represented in other forms. The MCS mapping relationship can represent the correspondence between multiple types of MCS parameters of each MCS in multiple MCSs. For example, these multiple types of MCS parameters include MCS index, modulation order, target code rate, spectral efficiency, and parameter d1.

[0042] In the above technical solution, when the modulation order is the same, the optimal constellations corresponding to consecutively indexed MCSs are close, therefore consecutively indexed MCSs can share the same constellation. By configuring the same d1, multiple consecutively indexed MCSs can share the same constellation. Sharing the same constellation means that the same modulation and demodulation hardware can be used. Compared to each MCS using a different constellation, this method can reduce implementation complexity. In addition, when the modulation order is the same, the MCS with a larger index value has higher spectral efficiency. Increasing d1 can increase the minimum value of the interval between adjacent constellations, improving the shaping effect.

[0043] In some implementations of the first or second aspect, the modulation order Q m It can be 6, 8, 10, or 12.

[0044] It is understandable that the arithmetic progression of the values ​​in the first set indicates that the first set contains at least 3 values. Furthermore, since M = 2 m Therefore, the first set must contain at least 4 values, since m is less than Q. m Therefore Q m For example, the modulation order Q is an even number greater than or equal to 6. m It refers to 6, 8, 10, or 12 in the above scheme.

[0045] Thirdly, a communication apparatus is provided for performing the method provided by any of the above aspects or their implementations. Specifically, the apparatus may include units and / or modules for performing the method provided by any of the above aspects or their implementations, such as processing units and / or transceiver units.

[0046] In one implementation, the device is either a transmitting device or a receiving device. When the device is a transmitting device or a receiving device, the transceiver unit can be a transceiver, an input / output interface, or a communication interface; the processing unit can be at least one processor. Optionally, the transceiver is a transceiver circuit. Optionally, the input / output interface is an input / output circuit.

[0047] In another implementation, the device is a chip, chip system, or circuit used in a transmitting or receiving device. When the device is a chip, chip system, or circuit used in a transmitting or receiving device, the transceiver unit can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit; the processing unit can be at least one processor, processing circuit, or logic circuit.

[0048] Fourthly, a communication device is provided, comprising: a memory for storing a program; and at least one processor for executing the computer program or instructions stored in the memory to perform the method provided in any of the foregoing aspects or their implementations.

[0049] In one implementation, the device is either a transmitting device or a receiving device.

[0050] In another implementation, the device is a chip, chip system, or circuit used in a transmitting or receiving device.

[0051] Fifthly, a communication device is provided, comprising: at least one processor and a communication interface, wherein the at least one processor is configured to obtain a computer program or instructions stored in a memory via the communication interface to execute the method provided in any of the foregoing aspects or their implementations. The communication interface may be implemented in hardware or software.

[0052] In one implementation, the device also includes the memory. Alternatively, the memory and processor are integrated together.

[0053] Sixthly, a processor is provided for executing the methods provided in the above aspects.

[0054] Unless otherwise specified, or if it does not contradict its actual function or internal logic in the relevant description, the transmission and acquisition / reception operations involved in the processor can be understood as processor output and reception, input and other operations, or as transmission and reception operations performed by radio frequency circuits and antennas. This application does not limit them in this regard.

[0055] In a seventh aspect, a computer-readable storage medium is provided that stores program code for execution by a device, the program code including methods for performing any of the foregoing aspects or their implementations.

[0056] Eighthly, a computer program product containing instructions is provided, which, when run on a computer, causes the computer to perform the method provided in any of the foregoing aspects or their implementations.

[0057] Ninthly, a chip is provided, comprising a processor and a communication interface. The processor reads instructions stored in a memory through the communication interface and executes the methods provided in any of the above aspects or their implementations. The communication interface can be implemented in hardware or software.

[0058] Optionally, as one implementation, the chip also includes a memory storing computer programs or instructions. The processor executes the computer programs or instructions stored in the memory. When the computer programs or instructions are executed, the processor performs the methods provided by any of the above aspects or their implementations. Optionally, the memory and processor are integrated together.

[0059] When the method provided in this application is executed by a chip, this application does not limit the specific number of chips implementing the method. For example, it can be executed by one chip, or by two or more chips. Furthermore, when the number of chips implementing the method is two or more, the chip manufacturers are not limited; they can be from the same manufacturer or different manufacturers.

[0060] In a tenth aspect, a communication system is provided, comprising at least one of the transmitting end device or receiving end device described above. Attached Figure Description

[0061] Figure 1 shows an example of a communication system 100 applicable to the technical solution of this application.

[0062] Figure 2 is a schematic diagram of the basic process of wireless communication.

[0063] Figure 3 is a schematic diagram of a uniform 64QAM constellation.

[0064] Figure 4 is a schematic diagram of a non-uniform 64QAM constellation.

[0065] Figure 5 is a schematic diagram of an example of the 64APSK constellation.

[0066] Figure 6 is a schematic flowchart of the modulation or demodulation method 600 provided in this application.

[0067] Figure 7 is a schematic block diagram of a communication device 1000 provided in an embodiment of this application.

[0068] Figure 8 is a schematic block diagram of the communication device 1100 provided in an embodiment of this application. Detailed Implementation

[0069] To facilitate understanding of the embodiments of this application, the following points will be explained before introducing the embodiments of this application.

[0070] The terms "for indicating" or "instruction" can include both direct and indirect indication, or they can be explicit and / or implicit. The various numerical designations such as "first," "second," etc., are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application, such as distinguishing different messages or different information. The term "protocol" can refer to standard protocols in the field of communications, such as the Long Term Evolution (LTE) protocol, the New Radio (NR) protocol, and related protocols applied to future communication systems; this application does not limit this. Words such as "exemplary," "for example," "exemplarily," and "as (another) example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. The terms "comprising," "including," "having," and variations thereof all mean "including but not limited to," unless otherwise specifically emphasized. "At least one" means one or more, and "more than one" means two or more. "At most one" means one or zero. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and c can mean: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Here, a, b, and c can be single or multiple. Descriptions involving network element A sending messages, information, or data to network element B, and network element B receiving messages, information, or data from network element A, aim to specify which network element the message, information, or data is to be sent to, without specifying whether they are sent directly or indirectly through other network elements. Descriptions such as “when…”, “under…”, “if”, and “if” all indicate that the device will take corresponding actions under certain objective circumstances. They are not time-limited, nor do they require the device to make a judgment action when implementing the action, nor do they imply any other limitations.

[0071] Furthermore, the network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0072] The following describes a communication system to which embodiments of this application can be applied.

[0073] The embodiments of this application can be applied to various communication systems, including but not limited to: 5th generation (5G) systems, LTE systems, Long Term Evolution-Advanced (LTE-A) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, and future communication systems. Furthermore, they can be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), Internet of Things (IoT) communication systems, narrowband Internet of Things (NB-IoT) systems, or other communication systems. Moreover, they can be extended to similar wireless communication systems, such as Wireless-Fidelity (WiFi) and 3GPP-related communication systems, without limitation.

[0074] The communication system applicable to embodiments of this application may include one or more transmitting devices and one or more receiving devices. Optionally, one of the transmitting device and the receiving device may be a terminal device, and the other may be a network device. Optionally, both the transmitting device and the receiving device may be terminal devices. Optionally, both the transmitting device and the receiving device may be network devices.

[0075] Figure 1 is a schematic diagram of a network architecture applicable to an embodiment of this application. Figure 1 illustrates a possible, non-limiting system schematic. As shown in Figure 1, the network architecture includes a radio access network (RAN) 100. RAN 100 includes at least one network device (101a and 101b in Figure 1, collectively referred to as 110) and at least one terminal (102a-102j in Figure 1, collectively referred to as 102). The system architecture may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1). Terminal 102 is wirelessly connected to network device 101. For example, network device 101 is wirelessly or wiredly connected to the core network (not shown in Figure 1). The core network device in the core network and the network device 101 in RAN 100 may be different physical devices, or they may be the same physical device integrating core network logical functions and radio access network logical functions.

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

[0077] The apparatus provided in this application embodiment can be applied to network device 101 or terminal 102. It is understood that Figure 1 only shows one possible communication system architecture that can be applied to this application embodiment, and other devices may also be included in other possible scenarios.

[0078] Network device 101 is a node in the radio access network (RAN), also known as an access network device or an RAN node (or device). Network device 101 assists terminals in achieving wireless access. Multiple network devices 101 in the network architecture shown in Figure 1 can be nodes of the same type or different types. In some scenarios, the roles of network device 101 and terminal 102 are relative. For example, network element 102i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminals 102j accessing RAN 100 through network element 102i, network element 102i is a base station; but for base station 101a, network element 102i is a terminal. Network device 101 and terminal 102 are sometimes referred to as communication devices. For example, network elements 101a and 101b in Figure 1 can be understood as communication devices with base station functions, and network elements 102a-102j can be understood as communication devices with terminal functions.

[0079] In one possible scenario, network equipment can be a base station, an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next-generation NodeB (gNB), a base station in a future mobile communication system, a satellite, or an access point (AP) in a WiFi system, an integrated access and backhaul (IAB) node, or a network device in a mobile switching center non-terrestrial network (NTN) communication system, meaning it can be deployed on high-altitude platforms or satellites. Network equipment can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a wireless controller in a cloud radio access network (CRAN) scenario. Network equipment can also function as a base station in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, and machine-to-machine (M2M) communication. Alternatively, network devices can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, the access network device in vehicle-to-everything (V2X) technology can be a roadside unit (RSU).

[0080] In another possible scenario, multiple network devices collaborate to assist terminals in achieving wireless access, with each network device performing a portion of the base station's functions. For example, network devices can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs). It is understood that network devices can be CU nodes, DU nodes, or devices comprising both CU and DU nodes. Furthermore, CUs can be classified as network devices in the access network (RAN) or the core network (CN), without limitation.

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

[0082] In this embodiment, the form of the network device is not limited. The device used to implement the function of the network device can be the network device itself, or it can be a device that supports the network device in implementing the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device.

[0083] Terminal equipment 102, also known as user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device used to provide voice or data connectivity to users, and can also be an Internet of Things (IoT) device. For example, terminal equipment includes handheld devices with wireless connectivity, vehicle-mounted devices, etc. Currently, terminal devices can include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle devices (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAP UE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), intelligent robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying equipment (such as intelligent robots, hot air balloons, drones, airplanes), etc. Terminal devices can also be vehicle devices, such as vehicle devices, vehicle modules, vehicle chips, on-board units (OBUs) or telematics boxes (T-BOXs). Terminal devices can also be other devices with terminal functions. For example, a terminal device can also be a device that performs terminal functions in D2D communication.

[0084] The embodiments of this application do not limit the form of the terminal device. The device used to implement the functions of the terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of chips, or it can include chips and other discrete devices. All or part of the functions of the terminal device in this application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (such as a cloud platform).

[0085] Optionally, the network architecture provided in this application may also include artificial intelligence (AI) network elements to implement some or all AI-related operations. AI network elements can also be called AI nodes, AI devices, AI entities, AI modules, AI models, or AI units, etc. The AI ​​network elements can be built into network elements within the communication system. For example, an AI network element can be an AI module built into: access network equipment, core network equipment, cloud servers, or operation, administration, and maintenance (OAM) systems to implement AI-related functions. The OAM system can act as the network management system for core network equipment and / or access network equipment. Alternatively, the AI ​​network element can also be a network element independently configured within the communication system. Optionally, the terminal or its built-in chip may also include AI entities to implement AI-related functions.

[0086] Furthermore, the embodiments of this application can be applied to various application scenarios, such as high-throughput scenarios, high-reliability scenarios, low-latency scenarios, high-reliability low-latency scenarios, or low-power scenarios. Among them, high-throughput scenarios can be, for example, enhanced mobile broadband (eMBB) scenarios, high-reliability low-latency scenarios can be, for example, URLLC (ultra-reliable low-latency communication) scenarios, and low-power scenarios can be, for example, M2M scenarios, MTC scenarios, or IoT scenarios.

[0087] Figure 2 is a schematic diagram of the information transmission process. As shown in Figure 2, information is sent from the source and undergoes processing such as source coding, channel coding, modulation, air interface transmission, demodulation, channel decoding, and source recovery before reaching the destination, completing the transmission of information from the source to the destination. The processing shown in the upper layer of Figure 2 (including source coding, channel coding, and modulation) is performed at the sending end device, while the processing shown in the lower layer (including demodulation, channel decoding, and source recovery) is performed at the receiving end device.

[0088] This application primarily relates to the modulation and demodulation processes shown in Figure 2. The modulation or demodulation methods provided in this application can be applied to the various network devices (e.g., base stations) and terminal devices described above, as well as to dedicated network devices or general-purpose devices. Specifically, the modulation scheme is mainly implemented through the channel coding unit (e.g., an encoder or a device supporting the coding device to implement corresponding functions) in these devices; the demodulation scheme is mainly implemented through the channel decoding unit (e.g., a decoder or a device supporting the decoding device to implement corresponding functions) in these devices. Optionally, the functions of the modulation or demodulation device can be implemented using application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), etc., or through software (e.g., program code in memory), or through a combination of both, without limitation.

[0089] The modulation and demodulation processes are described below. The transmitting device modulates the encoded bit sequence (also called a codeword sequence) into a modulation symbol stream, and then transmits the modulation symbol stream. Correspondingly, the receiving device, after receiving the modulation symbol stream, demodulates it to obtain the demodulated sequence. Specifically, modulation refers to the transmitting device performing constellation mapping on the encoded bit sequence according to a constellation diagram to obtain the modulation symbol stream. Demodulation is the reverse process of modulation. Examples of modulation methods include quadrature amplitude modulation (QAM) and amplitude shift keying (ASK) modulation.

[0090] For example, the encoded bit sequence can be mapped to a constellation by referring to a lookup table or according to preset rules to obtain the modulation symbol stream. The following is an illustration using a lookup table. A possible lookup table is shown in Table 1, which is an example of the bit mapping relationship for 8ASK.

[0091] Table 1

[0092] Specifically, when using 8ASK modulation, the encoded bit sequence is divided into groups of three consecutive bits. The values ​​of each group of three bits are the same as one of the bit combinations in Table 1 (i.e., the bit combinations corresponding to b0, b1, and b2). Then, the corresponding modulation symbol X is determined based on the corresponding group of bits b0, b1, and b2, thus obtaining the modulation symbol stream to be transmitted. It should be understood that the values ​​of the modulation symbols in Table 1 (i.e., the magnitude of X) are only examples. In practical applications, X can also be adjusted according to power consumption requirements, such as proportionally amplifying or reducing the multiple X values ​​shown in Table 1.

[0093] It is understandable that the above mapping can also be called the Gray mapping.

[0094] When using QAM modulation (such as 16QAM, 64QAM, 256QAM, etc.), each constellation point in the QAM constellation diagram corresponds to a real part and an imaginary part. For L=2 Qm QAM constellation, where the real and imaginary parts of the constellation points each correspond to Q. m / 2 bits, for example, the real part corresponds to bits Imaginary part corresponding bit 2 Qm The position of each constellation point in the QAM constellation can be determined by... This is obtained by a corresponding bit combination. Specifically, it is based on the Q corresponding to the real and imaginary parts. m / 2 bits can determine the real part Re(x) and imaginary part Im(x) of the corresponding constellation point respectively. That is, the modulation symbol X = Re(x) + j*Im(x), where j is the imaginary symbol.

[0095] Table 2 shows the bit mapping relationship for the 64QAM constellation. If L = 64, then Q... m =6, where the real part and the imaginary part each correspond to 3 bits, the real part corresponds to bits b0, b2, b4, and the imaginary part corresponds to bits b1, b3, b5.

[0096] Table 2

[0097] Figure 3 shows the uniform 64QAM constellation diagram corresponding to u0=1, u1=3, u2=5, and u3=7 in Table 2. It can be seen that the position coordinates of each of the 64 constellation points in Figure 3 correspond to a real part and an imaginary part, and are uniformly distributed. Uniform distribution can be understood as the distance between adjacent constellation points in each row and column being the same.

[0098] Theoretical analysis shows that, in order to improve channel capacity, a uniform constellation can be transformed into a non-uniform constellation, that is, by changing the position coordinates of the constellation points. Two types of non-uniform constellations are introduced below.

[0099] (1) Non-uniform QAM constellation

[0100] Non-uniform QAM constellations are similar to uniform QAM constellations in that their real and imaginary parts have the same mapping method, thus reducing demodulation complexity. Similarly, for L=2... Qm QAM is a non-uniform constellation, where the real and imaginary parts of the constellation points each correspond to Q. m / 2 bits, for example, the real part corresponds to bits Imaginary part corresponding bit 2 Qm The position of each constellation point in the QAM constellation chart can be determined by... This is obtained by a corresponding bit combination. Specifically, it is based on the Q corresponding to the real and imaginary parts. m Two bits can be used to determine the real part Re(x) and imaginary part Im(x) of the corresponding constellation point, that is, the modulation symbol X = Re(x) + j*Im(x). It can be understood that the difference between a non-uniform QAM constellation and a uniform QAM constellation is that the distances between adjacent constellation points in a non-uniform QAM constellation are not exactly the same.

[0101] Figure 4 shows the non-uniform 64QAM constellation diagram corresponding to u0 = 0.5, u1 = 1.6, u2 = 3.3, and u3 = 5.8 in Table 2. It can be seen that the position coordinates of each of the 64 constellation points in Figure 4 correspond to a real part and an imaginary part, and are non-uniformly distributed. This non-uniform distribution can be understood as the distances between adjacent constellation points in each row and column of the 64 constellation points not being exactly the same.

[0102] (2) APSK constellation

[0103] In a In the APSK constellation, the constellation points are distributed on R concentric circles of different radii. The l-th concentric circle contains n constellation points at equal intervals, where 0 ≤ l ≤ R⁻¹. Furthermore, the constellation points on different concentric circles are distributed along rays originating from the origin. Assume... The number of constellation points on each concentric circle is: Then m1 + m2 = Q m For example, for The APSK constellation has a radius r and an angle θ corresponding to m1 bits and m2 bits respectively. The position of each constellation point in the APSK constellation diagram can be determined by a set of bits corresponding to the radius r and the angle θ. Specifically, the radius r and angle θ of the corresponding constellation point can be determined based on the bits corresponding to the radius and the angle, that is, the modulation symbol X = r*exp(jθ) = r*cos(θ) + j*r*sin(θ), where j is the imaginary number.

[0104] Tables 3 and 4 are the tables corresponding to the bit mapping relationship of the 64APSK constellation mentioned above. If L = 64, then Q... m =6. Taking m1=2 and m2=4 as an example, the radius corresponds to 2 bits, which are b0 and b1 in Table 3. The angle θ corresponds to 3 bits, which are b2, b3, b4 and b5 in Table 4.

[0105] Table 3

[0106] Table 4

[0107] Figure 5 shows the 64 APSK constellation diagram corresponding to r0 = 0.5, r1 = 0.8, r2 = 1.1, and r3 = 1.4 in Table 3. It can be seen that the position coordinates of each of the 64 constellation points in Figure 5 correspond to a radius r and an angle θ, and they are non-uniformly distributed. This non-uniform distribution can be understood as the distances between any two adjacent constellation points with the same angle not being exactly the same.

[0108] Current non-uniform constellations lack fixed characteristics, potentially leading to complex constellation shapes and high modulation / demodulation complexity. Therefore, this application provides a modulation and demodulation method that improves channel capacity while reducing modulation and demodulation complexity.

[0109] The modulation or demodulation methods provided in this application are described in detail below.

[0110] Figure 6 is a schematic flowchart of the modulation or demodulation method 600 provided in this application. The method includes the following steps.

[0111] It is understood that method 600 can be executed by a transmitting device and a receiving device. Unless otherwise specified, a device (transmitting device, receiving device) can refer to a device, a component used in a device (e.g., a processor, chip, or chip system), or a logic module or software that can implement all or part of the device's functions. The component used in the device can be within the device or can be independent of the device.

[0112] S610, the transmitting device acquires the first codeword sequence to be transmitted.

[0113] It is understood that the first codeword sequence to be transmitted is the encoded bit sequence. For example, the encoding method can be polar coding, low-density parity check (LDPC) coding, or Reed-Muller (RM) coding, and this application does not limit it to any particular method.

[0114] The following example illustrates a specific implementation method for determining the first codeword sequence.

[0115] 1) Determine the MCS index and obtain the corresponding parameters, such as the modulation order Q. m And spectral efficiency Se.

[0116] 2) Based on the number N of resource elements (REs) reThe number of bits of information to be encoded, K, is determined by the spectral efficiency Se, where K = N. re *Se.

[0117] 3) Based on the modulation order Q m Determine the code length E, where E = N re *Q m .

[0118] 4) Encode the K bits of information to be encoded to obtain e0, e1, e2, ... e E-1 For e0, e1, e2, ... e E-1 Interleaving yields f0, f1, f2, ... f E-1 (i.e., a column of the first codeword sequence), where f0, f1, f2, ... f E-1 It can be used as a constellation map. For example, interweaving can be row-column interweaving, which is an interweaving pattern of rows and columns.

[0119] S620, the transmitting device modulates the first codeword sequence based on the first modulation method to obtain a modulated symbol stream.

[0120] The first modulation scheme corresponds to the first constellation, which is based on the modulation order Q. m It is determined by the first parameter T1. For example, the modulation order Q... m It can be 6, 8, 10, or 12.

[0121] Specifically, the first constellation includes L constellation points, where L = 2 Qm The positions of these L constellation points are related to the first set, which contains M values, where M = 2. m m is less than Q m The positive numbers, the first value to the T1th value in the first set are an arithmetic sequence with a common difference of d1, the T1th value to the T2th value in the first set are an arithmetic sequence with a common difference of d2, T1 is greater than 1, T2 is greater than T1 and less than or equal to M, d1 and d2 are different and both are positive numbers.

[0122] This application does not limit the method of determining the first value in the first set, and the first value is greater than 0. For example, the first value in the first set can be pre-configured or randomly selected. As an example, the first value in the first set is pre-configured as d1 / 2.

[0123] The following explanation addresses the case where T2 is less than or equal to M, representing the first set of cases.

[0124] Example 1: When T2 equals M, the first value to the T1st value in the first set is an arithmetic sequence with a common difference of d1, and the T1st value to the T2th value in the first set is an arithmetic sequence with a common difference of d2 (that is, the first set only corresponds to two common differences, d1 and d2).

[0125] Based on Example 1, if the first value in the first set is d1 / 2, then specifically, the i-th value among the first to the T1-th values ​​in the first set is d1 / 2+i*d1, 0≤i≤T1-1, and the j-th value among the T1+1-th to the M-th values ​​in the first set is (T1-1 / 2)d1+j*d2, 1≤j≤M-T1.

[0126] Example 2; When T2 is not equal to M, the first set may correspond to S common differences, where S is greater than 2. The S common differences are d1, d2, ..., dS, where the first to the T1th values ​​in the first set have a common difference of d1, the T1th to the T2th values ​​in the first set have a common difference of d2, ..., the T1th to the T2th values ​​in the first set have a common difference of dS. S-1 The value up to the Tth S The value is a tolerance of dS.

[0127] In this application, T1, T2, ..., TS can be replaced with T1, T2, ..., T S The details of the places mentioned later will not be repeated.

[0128] Based on Example 2, if the first value in the first set is d1 / 2, then specifically, the i1th value among the first to T1th values ​​in the first set is d1 / 2 + i1*d1, 0≤i1≤T1-1, and the T1th value in the first set... s-1 The value up to the Tth s The i-th value among the n values ​​is

[0129] The following examples illustrate the first constellation and the relationship between the first constellation and the first set.

[0130] 1) The first constellation is a non-uniform QAM constellation.

[0131] The position coordinates of the L constellation points of a non-uniform QAM constellation include Individual departments and The virtual part. Among them, Individual departments and Each virtual part is respectively with Each bit combination corresponds one-to-one. The number of bits in each bit combination is Q. m / 2, The first bit combination in the bit combination and The first real part corresponds to the first bit combination and... The first imaginary part corresponds to the first real part, and the first imaginary part is equal to the first real part.

[0132] In this scenario, m = Q m / 2-1, The first constellation The real part (or the first constellation) (each imaginary part) is in the first set The values ​​and the first set The opposite of a number.

[0133] For example, the L=64 constellation points of a non-uniform QAM constellation include... Individual departments and The 64 constellation points can be represented by 8 imaginary parts, 8 real parts, and any combination of the 8 imaginary parts. Each of the 8 real parts corresponds one-to-one with one of the 8 possible bit combinations, and the number of bits in each of these combinations is Q. m / 2 = 3; these 8 imaginary parts also correspond one-to-one with 8 bit combinations, and the number of bits in each of the 8 bit combinations corresponding to the 8 imaginary parts is also Q. m / 2 = 3.

[0134] Suppose that the bit combination corresponding to the real and imaginary parts of any constellation point among the 64 constellation points can be {b0 b1 b2 b4 b3 b5}. Divide {b0 b1 b2 b4 b3 b5} into two groups, each containing 3 bits. One group corresponds to the real part Re(x) of the position coordinates of the constellation point, and the other group corresponds to the imaginary part Im(x) of the position coordinates of the constellation point. As shown in Table 2, for any constellation point among the 64 constellation points, the bit combination {b0 b2 b4} corresponds to the real part Re(x) of the position coordinates of that constellation point, and {b1 b3 b5} corresponds to the imaginary part Im(x) of the position coordinates of that constellation point. Then, the values ​​of the eight real parts are the eight values ​​corresponding to the eight bit combinations of {b0 b2 b4} in Table 2 (the eight values ​​are {-u3,-u2,-u1,-u0,u0,u1,u2,u3}). Similarly, the values ​​of the eight imaginary parts are the eight values ​​corresponding to the eight bit combinations of {b1 b3 b5} in Table 2 (the eight values ​​are {-u3,-u2,-u1,-u0,u0,u1,u2,u3}). Where L = 64 corresponds to 4 in the first set (i.e.,...). The values ​​are {u0, u1, u2, u3}. Alternatively, it can be understood that when L = 64, the real part {-u3, -u2, -u1, -u0, u0, u1, u2, u3} is the opposite of the four values ​​in the first set. Or, it can be understood that when L = 64, the imaginary part {-u3, -u2, -u1, -u0, u0, u1, u2, u3} is the opposite of the four values ​​in the first set.

[0135] 2) The first constellation is the APSK constellation.

[0136] The coordinates of the L constellation points of the APSK constellation include The radius of each concentric circle and An angle, m1 + m2 = Q m .in, The radius of the concentric circles and Each bit combination corresponds one-to-one. The number of bits in each bit combination is m1. The first bit combination in the bit combination and The radius corresponds to the radius of the first concentric circle among the radii of the concentric circles. An angle and Each bit combination corresponds one-to-one. The number of bits in each bit combination is m². The first bit combination in the bit combination and The first angle corresponds to the first angle among the angles.

[0137] For example, m = m1, Among them, the first set The number is The value of the radius of the concentric circles. For example, as shown above, m1 + m2 = Q. m If L = 64, then m1 + m2 = 6. For example, m1 = 2, m2 = 4. Another example, m1 = 3, m2 = 3. Yet another example, m1 = 4, m2 = 2.

[0138] For example, the first value in the first set is d1 / 2.

[0139] For example, L = 64, m = m1 = Q m / 2-1, then m1=2, m2=4. Specifically, the L=64 constellation points of the APSK constellation correspond to 4 concentric circle radii and 16 angles. Any combination of the 4 concentric circle radii and 16 angles can represent these 64 constellation points. Each of the 4 concentric circle radii corresponds one-to-one with one of the 4 bit combinations. The number of bits in each of the 4 bit combinations corresponding to the 4 concentric circle radii is (Q... m / 2-1)=2; These 16 angles also correspond one-to-one with 16 bit combinations, and the number of bits in each of the 16 bit combinations corresponding to the 16 angles is also (Q m (2 + 1) = 4.

[0140] Suppose that the bit combination corresponding to the radius and angle of any constellation point among the 64 constellation points can be {b0 b1 b2 b4 b3 b5}. Divide {b0 b1 b2 b4 b3 b5} into two groups. The first group contains 2 bits and the second group contains 4 bits. The first group corresponds to the radius r of the position coordinate of the constellation point, and the second group corresponds to the angle θ of the position coordinate of the constellation point. As shown in Tables 3 and 4, for any constellation point among the 64 constellation points, the radius r corresponding to the position coordinates of the constellation point is {b0 b1}, and the angle θ corresponding to the position coordinates of the constellation point is {b2 b3 b4 b5}. Then, the radii of the four concentric circles are the four values ​​corresponding to the four bit combinations of {b0 b1} in Table 3 (the four values ​​are {r0, r1, r2, r3}). Similarly, the 16 angles are the 16 values ​​corresponding to the 16 bit combinations of {b2 b3 b4 b5} in Table 4. Wherein, when L = 64, the four values ​​in the first set are the values ​​of {r0, r1, r2, r3}.

[0141] For example, L = 64, m = m1 = 3, m2 = 3. Specifically, the L = 64 constellation points of the APSK constellation correspond to 8 concentric circle radii and 8 angles. Any combination of these 8 concentric circle radii and 8 angles can represent all 64 constellation points. Each of the 8 concentric circle radii corresponds one-to-one with 8 possible bit combinations, and each of these combinations contains 3 bits. Similarly, each of the 8 angles also corresponds one-to-one with 8 possible bit combinations, and each of these combinations also contains 3 bits.

[0142] Suppose that the bit combination corresponding to the radius and angle of any constellation point among the 64 constellation points can be {b0 b1 b2 b4 b3 b5}. Divide {b0 b1 b2 b4 b3 b5} into two groups: the first group contains 3 bits, and the second group contains 3 bits. The first group corresponds to the radius r of the constellation point's position coordinates, and the second group corresponds to the angle θ of the constellation point's position coordinates. For example, in the bit combination {b0 b1 b2} corresponding to any constellation point among the 64 constellation points, {b0 b1 b2} corresponds to the radius r of the constellation point's position coordinates, and {b3 b4 b5} corresponds to the angle θ of the constellation point's position coordinates. Then, the radii of the above 8 concentric circles are the 8 values ​​corresponding to the 8 bit combinations of {b0 b1 b2}; similarly, the 8 angles are the 8 values ​​corresponding to the 8 bit combinations of {b3 b4 b5}. Wherein, when L = 64, the 8 values ​​in the first set are the values ​​of the radii of the 8 concentric circles.

[0143] The following is an example of how to determine the first set.

[0144] Method 1: Here, we describe it as T1 equals M. The parameters for determining the first set, besides the first parameter T1, also include the second parameter c1, where c1 is the ratio of d2 to d1, i.e., c1 = d2 / d1. The first set can then be determined using the following steps.

[0145] 1) Since the average energy of the first constellation is 1, d1 can be obtained based on energy normalization.

[0146] For example, if the first value in the first set is d1 / 2, then specifically, the i-th value among the first to the T1-th values ​​in the first set is d1 / 2+i*d1, 0≤i≤T1-1, and the j-th value among the T1+1-th to the M-th values ​​in the first set is (T1-1 / 2)d1+j*d2, 1≤j≤M-T1.

[0147] If the first zodiac sign is a non-uniform QAM sign, then, based on energy normalization, the following formula can be obtained:

[0148] It's understandable that dividing M by the left side of the equation in the above formula results in the right side being 1 / 2, indicating that the average of the M values ​​is 1 / 2. For non-uniform QAM constellations, energy normalization means that the average energy of the first constellation is the sum of the average energy of its real and imaginary parts, which is 1. Since the M values ​​in the first set represent the real or imaginary parts of the first constellation, the average energy of the real and imaginary parts of the first constellation is 1 / 2, meaning the right side of the equation is 1 / 2.

[0149] Based on the above formula, it can be deduced that d1 satisfies the following formula:

[0150] If the first zodiac sign is an APSK sign, then, according to energy normalization, the following formula can be obtained:

[0151] It's understandable that dividing M by the left side of the equation in the above formula results in 1 on the right side, indicating that the average of the M values ​​is 1. For APSK constellations, energy normalization means that the average energy of the first constellation is 1, which means the average radius of the first constellation is 1. Since the first set represents the radius of the first constellation, the right side of the equation is 1.

[0152] Based on the above formula, it can be deduced that d1 satisfies the following formula:

[0153] 2) Based on the second parameters c1 and d1, d2 can be obtained.

[0154] 3) Determine the first set based on d1 and d2.

[0155] Optionally, the first parameter T1 is based on the MCS index and Q. m At least one of the following is determined: bit rate, spectral efficiency, etc.

[0156] One example is that T1 can be determined based on the MCS index.

[0157] Another example could be based on Q. m Determine T1. Furthermore, if multiple identical Q exist... m In scenarios where T1 exists, it can be further determined based on the code rate and / or spectral efficiency. In one implementation, for scenarios with multiple identical Q values... m In this scenario, multiple different second parameters T1 and bitrate thresholds can be pre-configured, with multiple different first parameters T1 associated with the bitrate thresholds. For example, for a Q... m Three different first parameters T1 and two bitrate thresholds can be pre-configured (e.g., first bitrate and second bitrate, where the first bitrate is less than the second bitrate). When the required bitrate for encoding is less than or equal to the first bitrate, the first T1 of the three first parameters T1 is used; when the required bitrate for encoding is greater than the first bitrate and less than or equal to the second bitrate, the second T1 of the three first parameters T1 is used; and when the required bitrate for encoding is greater than the second bitrate, the third T1 of the three first parameters T1 is used. In another implementation, for the existence of multiple identical Q... m In this scenario, multiple different first parameters T1 and spectrum thresholds can be pre-configured, with each different first parameter T1 associated with a spectrum threshold. Further details will not be provided here.

[0158] For example, the first parameter T1 and the second parameter c1 of the first set are determined to be the parameters corresponding to the first MCS. If the first constellation is a non-uniform QAM constellation, then the T1 corresponding to an MCS in the MCS mapping relationship of the first MCS is equal to k times the M of that MCS, where k = 1 / 2 or 3 / 4. In one implementation, the k corresponding to each MCS in the MCS mapping relationship of the first MCS is the same. For example, if k = 3 / 4, then the T1 corresponding to any MCS in the MCS mapping relationship of the first MCS is fixed as T1 = 3M / 4. Having the same k for all MCS can reduce the complexity of parameter configuration. For example, the first parameter T1 and the second parameter c1 of the first set are determined to be the parameters corresponding to the first MCS. If the first constellation is an APSK constellation, then the T1 corresponding to an MCS in the MCS mapping relationship of the first MCS is 2 or 3. In one implementation, the T1 corresponding to each MCS in the MCS mapping relationship of the first MCS is the same.

[0159] It is understood that the MCS mapping relationship can reflect the correspondence between multiple types of MCS parameters in each MCS. For example, the above MCS mapping relationship can be represented in tabular form (i.e., the MCS mapping relationship is an MCS table), or it can be represented in other forms, which are not limited in this application. Further details will not be elaborated upon in subsequent sections. For example, the multiple types of MCS parameters involved in the MCS mapping relationship described here may include the MCS index, modulation order, target code rate, spectral efficiency, and the first parameter T1.

[0160] Optionally, the second parameter c1 is based on the MCS index and Q. m At least one of the following is determined: bit rate, spectral efficiency, etc.

[0161] One example is that the second parameter c1 can be determined based on the MCS index.

[0162] Another example could be based on Q. m Determine the second parameter c1. Furthermore, in the presence of multiple identical Q... m In scenarios where the code rate and / or spectral efficiency exist, the second parameter c1 can be further determined. In one implementation, for scenarios with multiple identical Q... m In this scenario, multiple different second parameters c1 and bitrate thresholds can be pre-configured, with each different second parameter c1 associated with a bitrate threshold. Another implementation addresses the presence of multiple identical Q parameters. m In this scenario, multiple different second parameters c1 and spectral thresholds can be pre-configured, with each different second parameter c1 associated with a spectral threshold. Further details will not be provided here.

[0163] For example, the first parameter T1 and the second parameter c1 of the first set are determined to be the parameters corresponding to the first MCS. The MCS mapping relationship containing the first MCS includes multiple MCS sets, and each MCS set includes multiple MCSs, all of which have the same modulation order. Each MCS set can also be divided into multiple MCS subsets, where the indices of the MCSs in each MCS subset are consecutive and their corresponding second parameter c1 is the same. For example, the various types of MCS parameters involved in the MCS mapping relationship described here may include MCS index, modulation order, target code rate, spectral efficiency, and second parameter c1.

[0164] The following example illustrates the first parameter T1 and the second parameter c1 in the MCS table where the first MCS is located, using the specific first constellation as an example.

[0165] 1) The first constellation is a non-uniform QAM constellation. Tables 5 and 6 are examples of the MCS tables corresponding to the first constellation.

[0166] Example 1: The MCS table containing the first MCS is shown in Table 5. In this table, the T1 corresponding to each MCS is fixed as T1 = k * M, where k = 3 / 4. In Table 5, different MCSs can share the same constellation. For example, MCS indices 11 to 14 share the constellation when c1 = 3 / 2, and MCS indices 15 to 18 share the constellation when c1 = 4 / 3. This can be understood as the Q corresponding to two MCSs... m If T1 and c1 are the same, then their corresponding first sets are the same, and therefore their corresponding constellations are also the same. Different MCSs sharing the same constellation can reduce the number of constellations used by different MCSs, further reducing implementation complexity. Additionally, when the modulation order is the same, the MCS with the larger index value has higher spectral efficiency. By reducing c1, d1 and d2 can be made closer, and the minimum interval between adjacent constellations can be increased, improving the shaping effect.

[0167] Table 5

[0168] Q m Taking 6, M=4, T1=3M / 4=3, c1=4 / 3 as an example, we calculate d1=0.2921, d2=0.3894, then the first set is {0.1460,0.4381,0.7302,1.1196}, that is, the real or imaginary part of the corresponding non-uniform 64QAM constellation includes {-1.1196,-0.7302,-0.4381,-0.1460,0.1460,0.4381,0.7302,1.1196}.

[0169] It is understood that the calculation precision of d1 and d2 in the above example is merely illustrative. For example, the calculation precision of d1 and d2 could also be two or five decimal places, without limitation. As an example, the calculation precision of d1 and d2 can be predetermined or determined based on actual needs.

[0170] It is also understandable that the second parameter c1 can be placed in the MCS table or in other tables (such as the first table), without limitation.

[0171] It can also be understood that when the second parameter c1 is placed in the first table, a corresponding correspondence needs to be defined.

[0172] For example, in the first table, an MCS index corresponds to a second parameter c1.

[0173] For example, in the first table, a modulation order Q m This corresponds to at least one second parameter c1. As mentioned earlier, a modulation order Q m When multiple second parameters c1 are involved, one second parameter c1 can be determined based on the actual required code rate and / or spectral efficiency. These multiple second parameters c1 are related to preset code rate thresholds and / or preset spectral efficiency thresholds. For example, when the modulation order is 6 in the first table, the corresponding two second parameters c1 are 3 / 2 and 4 / 3. A preset spectral efficiency threshold of 3.6094 can be used in the first table. When the actual required code rate is less than or equal to 3.6094, 3 / 2 is selected; when the actual required spectral efficiency is greater than 3.6094, 4 / 3 is selected. Similarly, when the modulation order is 10 in the first table, the corresponding two second parameters c1 are 13 / 6 and 11 / 6. A preset code rate threshold of 7.1602 can be used in the first table. When the actual required code rate is less than or equal to 7.1602, 13 / 6 is selected; when the actual required code rate is greater than 7.1602, 11 / 6 is selected.

[0174] Example 2: The MCS table containing the first MCS is shown in Table 6. It can be seen that Table 6 adds a column to Table 5 to indicate the parameter T1 corresponding to the MCS. It can be seen that when the MCS index is less than or equal to 14, T1 = M / 2; when the MCS number is greater than or equal to 15, T1 = 3M / 4. When the modulation order is the same, the MCS with the larger index value corresponds to higher spectral efficiency. Increasing T1 can increase the minimum spacing between adjacent constellations, improving the shaping effect.

[0175] Table 6

[0176] It is understandable that the first parameter T1 and the second parameter c1 can be placed in the MCS table or in a new table, without any restrictions.

[0177] This is understandable. When the first parameter T1 and the second parameter c1 are placed in other tables (such as the second table), the corresponding correspondence needs to be defined.

[0178] For example, in the second table, a set of parameters corresponds to an MCS index, which includes a first parameter T1 and a second parameter c1.

[0179] For example, in the second table, a modulation order Q m There is at least one set of parameters, and each set of parameters includes a first parameter T1 and a second parameter c1. As mentioned earlier, a modulation order Q m In the case of multiple sets of parameters, one set of parameters can be determined based on the actual required bit rate and / or spectral efficiency. Among them, multiple sets of parameters are related to preset bit rate thresholds and / or preset spectral thresholds.

[0180] 2) The first constellation is an APSK constellation. Tables 7 and 8 are examples of the MCS tables corresponding to the first constellation.

[0181] Example 1: The MCS table containing the first MCS is shown in Table 7. In this table, each MCS has a fixed T1 value; specifically, T1 = 2. Different MCSs in Table 7 can share the same constellation. For example, MCS indices 11 to 18 share the constellation when c1 = 3 / 2, and MCS indices 19 to 24 share the constellation when c1 = 1 / 2.

[0182] Table 7

[0183] Q m Taking a case with M=6, T1=2, and c1=2 / 3 as an example, we calculate d1=0.5126 and d2=0.3417. Then the first set is {0.2563, 0.7689, 0.1107, 1.4524}, which means that the radii of the four concentric circles of the corresponding APSK constellation are {0.2563, 0.7689, 0.1107, 1.4524}.

[0184] Example 2: The MCS table containing the first MCS is shown in Table 8. It can be seen that Table 8 adds a column to Table 7 to indicate the parameter T1 corresponding to the MCS. For example, when the MCS index is 11 to 18, i.e., the modulation order is 6, the MCS index is less than or equal to 16, T1 = 3; when the MCS index is greater than or equal to 17, T1 = 2. When the MCS index is 19 to 24, i.e., the modulation order is 8, the MCS index is less than or equal to 22, T1 = 3; when the MCS index is greater than or equal to 23, T1 = 2. It can be understood that when the modulation order is the same, the MCS with the larger index value corresponds to higher spectral efficiency. By decreasing T1, the minimum value of the adjacent constellation spacing can be increased, improving the shaping effect.

[0185] Table 8

[0186] The following example illustrates how to determine the first set using the condition that T2 is not equal to M.

[0187] Similar to Method 1, the parameters for determining the first set include not only T1, T2, ... TS, but also c1, c2, ..., c S-1 Where c1, c2, ..., c S-1 Let d2, ..., dS be the ratios of d1 to d2. Then, the first set can be determined by the following steps.

[0188] As described in S620, when T2 is not equal to M, the first set corresponds to S common differences, where S is greater than 2. These S common differences are d1, d2, ..., dS. The first value to the T1th value in the first set forms an arithmetic sequence with a common difference of d1. The T1th value to the T2th value in the first set forms an arithmetic sequence with a common difference of d2, ..., the T1th value in the first set forms an arithmetic sequence with a common difference of dS. S-1 The value up to the Tth S A series of arithmetic numbers with a common difference of dS.

[0189] Based on Example 2, if the first value in the first set is d1 / 2, then specifically, the i1th value among the first to T1th values ​​in the first set is d1 / 2 + i1*d1, 0≤i1≤T1-1, and the T1th value in the first set... S-1 The value up to the Tth S The i-th value among the n values ​​is

[0190] If the first zodiac sign is a non-uniform QAM sign, then, based on energy normalization, the following formula can be obtained:

[0191] Based on energy normalization, the following formula can be obtained:

[0192] If the first zodiac sign is an APSK sign, then, according to energy normalization, the following formula can be obtained:

[0193] Based on the above formula, the corresponding d1 can be solved. Then, based on the parameters c1, ..., c S-1 We can obtain d2, ..., dS. Finally, based on d1, d2, ..., dS, we can determine the first set.

[0194] It is understandable that the method for determining any T value among T1, T2, ..., Ts can also refer to the method for determining T1 in Method 1. c1, c2, ..., c S-1 The method for determining any value of c can also refer to the method for determining c1 in Method 1, which will not be repeated here.

[0195] Method 2: Here, we describe it as T1 equal to M. The parameters for determining the first set, besides the first parameter T1, also include d1. Therefore, this method can determine the first set through the following steps.

[0196] 1) Since the average energy of the first constellation is 1, d2 can be obtained based on energy normalization.

[0197] For example, if the first value in the first set is d1 / 2, then specifically, the i-th value among the first to the T1-th values ​​in the first set is d1 / 2+i*d1, 0≤i≤T1-1, and the j-th value among the T1+1-th to M-th values ​​in the first set is (T1-1 / 2)*d1+j*d2, 1≤j≤M-T1.

[0198] If the first zodiac sign is a non-uniform QAM sign, then, based on energy normalization, the following formula can be obtained:

[0199] Based on the above formula, we can solve for d2, which satisfies the following formula:

[0200] If the first zodiac sign is an APSK sign, then, according to energy normalization, the following formula can be obtained:

[0201] Based on the above formula, we can solve for d2, which satisfies the following formula:

[0202] 2) Determine the first set based on d1 and d2.

[0203] Optionally, the first parameter T1 is based on the MCS index and Q. m The first parameter T1 is determined by at least one of the following: bit rate and spectral efficiency. The method for determining the first parameter T1 is described in Method 1 and will not be repeated here.

[0204] Optionally, parameter d1 is based on MCS index, Q m At least one of the following is determined: bit rate, spectral efficiency, etc.

[0205] One example is that parameter d1 can be determined based on the MCS index.

[0206] Another example could be based on Q. m Determine the parameter d1. Furthermore, in the presence of multiple Q... m In scenarios where multiple Q values ​​exist, parameter d1 can be further determined based on the code rate and / or spectral efficiency. In one implementation, for scenarios with multiple Q values... m In this scenario, multiple different parameters d1 and bitrate thresholds can be pre-configured, with each different parameter d1 associated with a bitrate threshold. Another implementation addresses the presence of multiple Q... m In this scenario, multiple different parameters d1 and spectral thresholds can be pre-configured, with each different parameter d1 associated with a spectral threshold. Related examples will not be elaborated here.

[0207] For example, the first parameter T1 and parameter d1 of the first set are determined to be the parameters corresponding to the first MCS. The MCS mapping relationship containing the first MCS includes multiple MCS sets, and each MCS set includes multiple MCSs, all of which have the same modulation order. Each MCS set can also be divided into multiple MCS subsets, where the indices of the MCSs in each MCS subset are consecutive and their corresponding d1 values ​​are the same. For example, the various types of MCS parameters involved in the MCS mapping relationship described here may include MCS index, modulation order, target code rate, spectral efficiency, and parameter d1.

[0208] The following example illustrates the MCS table containing the first MCS, using the specific first constellation as an example.

[0209] 1) The first constellation is a non-uniform QAM constellation. Tables 9 and 10 are examples of the MCS tables corresponding to the first constellation.

[0210] Example 1: The MCS table containing the first MCS is shown in Table 9. In this table, the T1 corresponding to each MCS can be fixed as T1 = k * M, where k = 3 / 4. In Table 9, different MCSs can share the same constellation. For example, MCS indices 11 to 14 share the constellation at d1 = 0.2843, and MCS indices 15 to 18 share the constellation at d1 = 0.2921. This can be understood as the Q corresponding to two MCSs... mIf T1 and d1 are the same, then their corresponding first sets are the same, and therefore their corresponding constellations are also the same. Different MCSs sharing the same constellation can reduce the number of constellations used by different MCSs, further reducing implementation complexity. When the modulation order is the same, the MCS with the larger index value has higher spectral efficiency. Increasing d1 can increase the minimum interval between adjacent constellations, improving the shaping effect.

[0211] Table 9

[0212] Example 2: The MCS table containing the first MCS is shown in Table 10. It can be seen that Table 10 adds a column to Table 9 to indicate the parameter T1 corresponding to the MCS. For example, when the MCS index is less than or equal to 14, T1 = M / 2; when the MCS number is greater than or equal to 15, T1 = 3M / 4. When the modulation order is the same, the MCS with a larger index value has higher spectral efficiency. By increasing T1, the minimum value of the interval between adjacent constellations can be increased, thereby improving the shaping effect.

[0213] Table 10

[0214] Q m Taking 6, M=4, T1=M / 2=2, d1=0.2510 as an example, we calculate d2=0.3765, then the first set is {0.1255,0.3765,0.7529,1.1294}, that is, the real or imaginary part of the corresponding non-uniform 64QAM constellation includes {-1.1294,-0.7529,-0.3765,-0.1255,0.1255,0.3765,0.7529,1.1294}.

[0215] It is understood that the precision of d1 and d2 in the above example is merely illustrative. For example, the precision of d1 and d2 can be two decimal places, or it can be five decimal places; there is no limitation. As an example, the precision of d1 and d2 can be predetermined, or it can be determined based on actual needs.

[0216] 2) The first constellation is an APSK constellation. Tables 11 and 12 are examples of the MCS tables corresponding to the first constellation.

[0217] Example 1: The MCS table containing the first MCS is shown in Table 11. In this table, the T1 value corresponding to each MCS is a fixed value; specifically, T1 = 2. Different MCSs in Table 11 can share the same constellation. For example, MCS indices 11 to 18 share the constellation with d1 = 0.5126, and MCS indices 19 to 24 share the constellation with d1 = 0.3907.

[0218] Table 11

[0219] Example 2: The MCS table containing the first MCS is shown in Table 12. It can be seen that Table 12 adds a column to Table 11 to indicate the parameter T1 corresponding to the MCS. For example, when the MCS index is 11 to 18 (i.e., modulation order 6), the MCS index is less than or equal to 16, T1 = 3; when the MCS index is greater than or equal to 17, T1 = 2. When the MCS index is 19 to 24 (i.e., modulation order 8), the MCS index is less than or equal to 22, T1 = 3; when the MCS index is greater than or equal to 23, T1 = 2. When the modulation order is the same, the MCS with the larger index value corresponds to higher spectral efficiency. By decreasing T1, the minimum spacing between adjacent constellations can be increased, improving the shaping effect.

[0220] Table 12

[0221] Q m Taking a case with M=6, T1=3, and d1=0.4551 as an example, we calculate d2=0.3414. Then the first set is {0.2276, 0.6827, 1.1378, 1.4791}, which means that the radii of the four concentric circles of the corresponding APSK constellation are {0.2276, 0.6827, 1.1378, 1.4791}.

[0222] It is understandable that, in actual use, Tables 5 to 12 can be used with some rows and / or some columns of the corresponding tables.

[0223] It can also be understood that, as mentioned above, the tables shown in Tables 5 to 12 are not the only form to represent the mapping relationship between the parameters in the table header. Any form that can reflect the mapping relationship between at least two or more parameters in the table header is within the scope of protection of this application.

[0224] The following example illustrates how to determine the first set using the condition that T2 is not equal to M.

[0225] Similar to Method 2, the parameters for determining the first set include not only T1, T2, ... TS, but also any (S-1) values ​​from d1, d2, ..., dS. The first set can then be determined using the following steps.

[0226] As described in S620, when T2 is not equal to M, the first set corresponds to S common differences, where S is greater than 2. The S common differences are d1, d2, ..., dS. The first value to the T1th value in the first set is an arithmetic sequence with common difference d1. The T1th value to the T2th value in the first set is an arithmetic sequence with common difference d2, ..., the T1th value in the first set is an arithmetic sequence with common difference d2.S-1 The value up to the Tth S The values ​​form an arithmetic sequence with a common difference of dS. If the first value in the first set is d1 / 2, then specifically, the i1th value among the first to T1th values ​​in the first set is d1 / 2 + i1*d1, 0 ≤ i1 ≤ T1-1, and the Tth value in the first set... S-1 The is-th value among the values ​​from the first value to the Ts-th value is

[0227] If the first zodiac sign is a non-uniform QAM sign, then, based on energy normalization, the following formula can be obtained:

[0228] Based on energy normalization, the following formula can be obtained:

[0229] If the first zodiac sign is an APSK sign, then, according to energy normalization, the following formula can be obtained:

[0230] For example, if all of d1, d2, ..., dS except dS are known, then dS can be solved using the above formula. Then, the first set can be determined based on the parameters d1, d2, ..., dS.

[0231] It is understandable that the method for determining any T value among T1, T2, ... TS can also refer to the method for determining T1 in Method 2. The method for determining any d value among d1, d2, ... dS, except for dS, can also refer to the method for determining d1 in Method 2, and will not be repeated here.

[0232] It is understandable that after determining the first constellation, modulating the first codeword sequence yields the channel symbol X, and subsequently, the modulated symbol stream to be transmitted. For example, modulating the first codeword sequence can be achieved by performing a Gray mapping or other mapping (e.g., a natural mapping) on ​​the first codeword sequence according to the first constellation diagram.

[0233] For example, the first codeword sequence is f0, f1, f2, ... f in S610. E-1 For example, each Q in the first codeword sequence m A group of consecutive bits is divided into several groups. For example, a group of consecutive bits in the first codeword sequence is... Then, based on each group Q m By performing Gray mapping or other mappings on the values ​​of each bit, the corresponding modulation symbol X can be determined, thereby obtaining the modulation symbol stream to be transmitted.

[0234] Alternatively, the channel symbol X can be normalized by multiplying each channel symbol X by the same normalization factor η, so that the average energy of the channel symbol to be transmitted is 1.

[0235] For example, the normalization factor mentioned above Where, x l To represent different channel symbols, x l It can be

[0236] S630, the transmitting device outputs the aforementioned modulated symbol stream and sends the modulated symbol stream to the receiving device. Correspondingly, the receiving device receives the symbol stream to be demodulated.

[0237] It is understandable that the symbol stream to be demodulated can refer to the symbol stream received by the receiving device after the modulated symbol stream output by the transmitting device is transmitted through the channel.

[0238] S640, the receiving device demodulates the above-mentioned symbol stream to be demodulated based on the first demodulation method to obtain the demodulated sequence.

[0239] Specifically, the first demodulation method corresponds to the first constellation. For details about the first constellation, please refer to the description of the transmitting device, which will not be repeated here.

[0240] It is understandable that the first demodulation method can be the inverse operation of the first modulation method in S620, and the bit information of each channel symbol can be obtained through demodulation.

[0241] S650, the receiving device outputs the demodulated sequence.

[0242] The demodulated sequence output by the receiving device can be further decoded, and the decoding method can be the inverse operation of the encoding method.

[0243] It is understood that the steps in the above figures are merely illustrative and are not intended to be strictly limited. Furthermore, the sequence numbers of the processes described above do not imply a specific order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0244] It is also understood that some optional features in the various embodiments of this application may not depend on other features in some scenarios, or may be combined with other features in some scenarios, without limitation.

[0245] The method embodiments provided in this application have been described in detail above with reference to Figures 1 to 6. The apparatus embodiments of this application will now be described with reference to Figures 7 and 8. It is understood that, in order to implement the functions in the above embodiments, the apparatuses in Figures 7 and 8 include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. It is understood that the technical features described in the above method embodiments are also applicable to the following apparatus embodiments.

[0246] Figures 7 and 8 are schematic diagrams of possible apparatus structures provided in embodiments of this application. These apparatuses can be used to implement the functions of the transmitting or receiving apparatus in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments.

[0247] Figure 7 is a schematic block diagram of a communication device 1000 provided in an embodiment of this application. As shown in Figure 7, the device 1000 may include a communication unit 1010 and a processing unit 1020. The communication unit 1010 can communicate with the outside world, and the processing unit 1020 is used for data processing. The communication unit 1010 may also be referred to as a communication interface or a transceiver unit.

[0248] In one possible design, the device 1000 can implement the steps or processes corresponding to those performed by the transmitting device in the above method embodiments, wherein the processing unit 1020 is used to perform processing-related operations of the transmitting device in the above method embodiments, and the communication unit 1010 is used to perform transmission-related operations of the transmitting device in the above method embodiments.

[0249] In another possible design, the device 1000 can implement the steps or processes corresponding to those executed by the receiving device in the above method embodiments, wherein the communication unit 1010 is used to perform reception-related operations of the receiving device in the above method embodiments, and the processing unit 1020 is used to perform processing-related operations of the receiving device in the above method embodiments.

[0250] It is understood that the device 1000 here is embodied in the form of a functional unit. The term "unit" here can refer to an application-specific integrated circuit (ASIC), electronic circuitry, a processor (e.g., a shared processor, a proprietary processor, or a group processor, etc.) and memory for executing one or more software or firmware programs, integrated logic circuitry, and / or other suitable components supporting the described functions. In an alternative example, those skilled in the art will understand that the device 1000 may specifically be the transmitting end device in the above embodiments, used to execute the various processes and / or steps corresponding to the transmitting end device in the above method embodiments; or, the device 1000 may specifically be the receiving end device in the above embodiments, used to execute the various processes and / or steps corresponding to the receiving end device in the above method embodiments. To avoid repetition, further details are omitted here.

[0251] The apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the transmitting device in the above-described method, or the apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the receiving device in the above-described method. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (e.g., the transmitting unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver), and other units, such as processing units, can be replaced by a processor, respectively executing the transmission and reception operations and related processing operations in each method embodiment.

[0252] Furthermore, the aforementioned communication unit can also be a transceiver circuit (e.g., it may include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit. In the embodiments of this application, the device in FIG7 can be the receiving end device or the transmitting end device in the foregoing embodiments, or it can be a chip or a chip system, such as a system on chip (SoC). The communication unit can be an input / output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. No limitations are imposed here.

[0253] Figure 8 is a schematic block diagram of a communication device 1100 provided in an embodiment of this application. The device 1100 includes a processor 1110 and a transceiver 1120. The processor 1110 and the transceiver 1120 communicate with each other through an internal connection path. The processor 1110 is used to execute instructions to control the transceiver 1120 to send and / or receive signals.

[0254] Optionally, the device 1100 may further include a memory 1130, which communicates with the processor 1110 and the transceiver 1120 via an internal connection path. The memory 1130 stores instructions, and the processor 1110 can execute the instructions stored in the memory 1130. In one possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the transmitting device in the above method embodiments. In another possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the receiving device in the above method embodiments.

[0255] Optionally, the memory 1130 may be integrated into the processor 1110.

[0256] In one possible scenario, device 1100 includes at least one processor with integrated memory, and other memory besides the memory integrated on the processor.

[0257] It is understood that device 1100 can specifically be the transmitting device or receiving device in the above embodiments, or it can be a chip or chip system. Correspondingly, transceiver 1120 can be the transceiver circuit of the chip, which is not limited here. Specifically, device 1100 can be used to execute the various steps and / or processes corresponding to the transmitting device or receiving device in the above method embodiments.

[0258] Optionally, the memory 1130 may include read-only memory and random access memory, and provide instructions and data to the processor. The memory may include non-volatile random access memory. For example, the memory may also store device type information. The processor 1110 may be used to execute instructions stored in the memory, and when the processor 1110 executes instructions stored in the memory, the processor 1110 is used to perform the various steps and / or processes of the method embodiments corresponding to the transmitting or receiving devices described above.

[0259] In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software. The steps of the method disclosed in the embodiments of this application can be directly implemented by a hardware processor, or by a combination of hardware and software modules in the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, detailed descriptions are omitted here.

[0260] It should be noted that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by the integrated logic circuitry in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, digital signal processing (DSP), ASIC, field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The processor in the embodiments of this application can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above methods.

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

[0262] Optionally, the memory (e.g., 1130) in the embodiments of this application may be integrated into the processor (e.g., 1110).

[0263] In addition, this application also provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, cause the operations and / or processes performed by the sending or receiving device in the various method embodiments of this application to be executed.

[0264] This application also provides a computer program product, which includes computer program code or instructions. When the computer program code or instructions are run on a computer, the operations and / or processes performed by the sending end device or the receiving end device in the various method embodiments of this application are executed.

[0265] Furthermore, this application also provides a chip including a processor. A memory for storing a computer program is provided independently of the chip, and the processor is used to execute the computer program stored in the memory, such that operations and / or processes performed by a transmitting or receiving device in any method embodiment are executed.

[0266] Furthermore, the chip may also include a communication interface. The communication interface may be an input / output interface or an interface circuit, etc. Furthermore, the chip may also include a memory.

[0267] In addition, this application also provides a communication system, including the transmitting end device and the receiving end device in the embodiments of this application.

[0268] It should also be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0269] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for example, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual coupling or direct coupling or communication connection may be through some interfaces; the indirect coupling or communication connection of devices or units may be electrical, mechanical, or other forms. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, the functional units in the various embodiments of this application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

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

[0271] It is understood that the term "embodiment" used throughout the specification means that a specific feature, structure, or characteristic related to an embodiment is included in at least one embodiment of this application. Therefore, various embodiments throughout the specification do not necessarily refer to the same embodiment. Furthermore, these specific features, structures, or characteristics can be combined in any suitable manner in one or more embodiments.

[0272] It can also be understood that in this application, "when," "if," and "if" all refer to the network element making corresponding processing under certain objective circumstances, and are not time-limited, nor do they require the network element to make a judgment when it is implemented, nor do they mean that there are other limitations.

[0273] It can also be understood that in the various embodiments of this application, "B corresponding to A" means that B is associated with A, and B can be determined based on A. However, it can also be understood that determining B based on A does not mean that B is determined solely based on A; B can also be determined based on A and / or other information.

Claims

1. A modulation method, characterized in that, include: Obtain the first codeword sequence to be transmitted; Based on the first modulation scheme, constellation mapping is performed on the first codeword sequence to obtain a modulation symbol stream, wherein... The first modulation method corresponds to the first constellation, which is based on the modulation order Q. m Determined by the first parameter T1, The first constellation comprises L constellation points, where L = 2 Qm The positions of the L constellation points are related to a first set, which includes M values, where M = 2. m The m is less than the Q m The positive numbers, the first value to the T1th value in the first set are an arithmetic sequence with a common difference of d1, the T1th value to the T2th value in the first set are an arithmetic sequence with a common difference of d2, the T1th value is greater than 1, the T2th value is greater than the T1th value and less than or equal to M, the d1th value and the d2th value are different and both are positive numbers; Output the modulation symbol stream.

2. A demodulation method, characterized in that, include: Obtain the symbol stream to be demodulated. The bits in the symbol stream to be demodulated are demodulated using the first demodulation method to obtain the demodulated sequence, wherein... The first demodulation method corresponds to the first constellation based on the modulation order Q. m Determined by the first parameter T1, The first constellation comprises L constellation points, where L = 2 Qm The positions of the L constellation points are related to a first set, which includes M values, where M = 2. m The m is less than the Q m The positive numbers, the first value to the T1th value in the first set are an arithmetic sequence with a common difference of d1, the T1th value to the T2th value in the first set are an arithmetic sequence with a common difference of d2, T1 is greater than 1, T2 is greater than T1 and less than or equal to M, d1 and d2 are different and both are positive numbers; output the demodulated sequence.

3. The method according to claim 1 or 2, characterized in that, The T1 is based on the Q. m The modulation and coding strategy (MCS) index, code rate, and spectral efficiency are determined.

4. The method according to any one of claims 1 to 3, characterized in that, The position coordinates of the L constellation points include Individual departments and The imaginary part, the Each real part and the aforementioned Each virtual part is respectively with Each bit combination corresponds one-to-one. The number of bits in each bit combination is Q. m / 2, the The first bit combination in the bit combination and the The first real part corresponds to the first real part in each real part, and the first bit combination is with the... The first imaginary part corresponds to the first real part, and the first imaginary part is equal to the first real part. The m = Q m / 2-1, the aforementioned The M values ​​in the first set and their opposites are the... The values ​​of each real part.

5. The method according to any one of claims 1 to 4, characterized in that, The modulation order Q m The first parameter T1 is the parameter corresponding to the first modulation and coding strategy (MCS), where T1 = k * M and k = 1 / 2 or 3 / 4.

6. The method according to any one of claims 1 to 3, characterized in that, The position coordinates of the L constellation points include The radius of each concentric circle and An angle, m1 + m2 = Q m , The radius and Each bit combination corresponds one-to-one. The number of bits in each bit combination is m1. The first bit combination in the bit combination and the The first radius among the radii corresponds to... The An angle and Each bit combination corresponds one-to-one. The number of bits in each bit combination is m2. The first bit combination in the bit combination and the The first angle corresponds to one of the angles. The m = m1, the The M values ​​in the first set are the The value of the radius of each concentric circle.

7. The method according to claim 6, characterized in that, The modulation order Q m The first parameter T1 is the parameter corresponding to the first modulation and coding strategy (MCS), where T1 = k for the first MCS, and k = 2 or 3.

8. The method according to claim 5 or 7, characterized in that, The k corresponding to each MCS in the MCS mapping relationship where the first MCS is located is the same.

9. The method according to any one of claims 1 to 8, characterized in that, The first value in the first set is d1 / 2.

10. The method according to any one of claims 1 to 9, characterized in that, The method further includes: Obtain the second parameter c1, where c1 is the ratio of d2 to d1; The d1 is determined based on the first parameter T1, the second parameter c1, and the M. The d2 is determined based on the d1 and the second parameter c1; The first set is determined based on d1 and d2.

11. The method according to claim 10, characterized in that, The second parameter c1 is based on Q m The modulation and coding strategy (MCS) index, code rate, and spectral efficiency are determined.

12. The method according to any one of claims 1 to 11, characterized in that, The second parameter c1 is the parameter corresponding to the first modulation and coding strategy (MCS). The MCS mapping relationship where the first MCS is located includes multiple MCS sets. Each of the multiple MCS sets includes multiple MCSs, and all of these multiple MCSs correspond to the same modulation order. Each MCS set includes multiple MCS subsets, and the indices of the MCSs in each MCS subset are consecutive and the corresponding second parameter c1 is the same.

13. The method according to any one of claims 1 to 9, characterized in that, The method further includes: Obtain the d1; The d2 is determined based on the first parameter T1, the M, and the d1. The first set is determined based on d1 and d2.

14. The method according to any one of claims 1 to 9 or 13, characterized in that, The d1 is based on the Q. m The modulation and coding strategy (MCS) index, code rate, and spectral efficiency are determined.

15. The method according to any one of claims 1 to 9, or 13 or 14, characterized in that, d1 is the parameter corresponding to the first modulation and coding strategy (MCS). The MCS mapping relationship where the first MCS is located includes multiple MCS sets. Each of the multiple MCS sets includes multiple MCSs, and all of these multiple MCSs correspond to the same modulation order. Each MCS set includes multiple MCS subsets, and the indices of the MCSs in each MCS subset are consecutive and their corresponding d1 values ​​are the same.

16. The method according to any one of claims 1 to 15, characterized in that, The modulation order Q m It can be 6, 8, 10, or 12.

17. A communication device, characterized in that, It includes modules or units for performing the method of any one of claims 1 or 3 to 16, or it includes modules or units for performing the method of any one of claims 2 to 16.

18. A communication device, characterized in that, The device includes at least one processor and an interface circuit, the interface circuit being configured to receive signals from other communication devices besides the communication device and transmit them to the processor or to send signals from the processor to other communication devices besides the communication device, the processor being configured to implement the method as described in any one of claims 1 to 3 to 16, or to implement the method as described in any one of claims 2 to 16, through logic circuits and / or executing code instructions.

19. The communication device according to claim 18, characterized in that, The communication device is a chip or chip system.

20. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions that, when executed, cause the method as described in any one of claims 1 to 3 to 16 to be implemented, or cause the method as described in any one of claims 2 to 16 to be implemented.

21. A computer program product, characterized in that, Includes a computer program that, when run, causes the method as claimed in any one of claims 1 or 3 to 16 to be implemented, or causes the method as claimed in any one of claims 2 to 16 to be implemented.

22. A communication system, characterized in that, It includes a communication device for performing the method as described in any one of claims 1 to 16, and a communication device for performing the method as described in any one of claims 2 to 16.

Images