Communication method and apparatus

Abstract

A communication method and apparatus, relating to the technical field of communications, and capable of simplifying the implementation of precoding, thereby reducing computational complexity. The method comprises: a sending end device performs distribution matching on a first sequence on the basis of normalized energy to obtain a second sequence, and outputs the second sequence, wherein the first sequence comprises K1 bits in a payload bit sequence having a length of K, K1 is a positive integer less than or equal to K, the normalized energy is determined on the basis of a distribution matching code rate, the distribution matching code rate is 2 multiplied by a ratio of the length of a bit sequence before the distribution matching to the length of a symbol sequence after the distribution matching, and both K and K1 are positive integers.

Description

Communication methods and devices This application claims priority to Chinese Patent Application No. 202411856170.X, filed with the State Intellectual Property Office of China on December 16, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology In a communication system, the transmitting device can cascade a pre-encoder (also known as a distribution matcher) before encoding. The pre-encoder performs distribution matching on the information bit sequence (that is, maps part or all of the bit sequence in the information bit sequence to a sequence that follows a specific distribution) to obtain a first sequence. This first sequence follows or is close to a specific distribution, thereby saving transmission power. The transmitting device can perform precoding based on methods such as symbol-level approximate enumerative sphere shaping (AESS) and polar codes. However, existing precoding methods have high computational complexity. Therefore, simplifying the implementation of precoding to reduce computational complexity has become an urgent problem to be solved. Summary of the Invention This application provides a communication method and apparatus that can simplify the implementation of precoding and reduce computational complexity. Firstly, this application provides a communication method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to the transmitting device itself, a component within the transmitting device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The method includes: the transmitting device performing distribution matching on a first sequence based on normalized energy to obtain a second sequence; and outputting the second sequence. The first sequence includes K1 bits from a payload bit sequence of length K, where K1 is a positive integer less than or equal to K; the normalized energy is determined based on the distribution matching code rate, which indicates the length correspondence between the input and output sequences of the distribution matching, where K is a positive integer. Based on the first aspect, the transmitting device can determine the normalized energy according to the distribution matching code rate, and perform distribution matching on the first sequence according to the normalized energy, which can simplify the implementation of distribution matching and reduce computational complexity. One possible implementation is that the transmitting device performs distribution matching on the first sequence based on the normalized energy to obtain a first symbol sequence; and obtains a second sequence based on the first symbol sequence through a first transformation. Based on this possible implementation, the transmitting device can perform distribution matching on the first sequence according to the normalized energy to obtain a first symbol sequence. The symbols in the first symbol sequence can follow or approximate a preset specific distribution, which can save transmission power. In addition, the transmitting device can transform the first symbol sequence into a second sequence based on the first transformation, and then encode and modulate the second sequence to realize data transmission. At the same time, it can reduce the average energy of the modulation symbols and save transmission power. One possible implementation is that the length of the first symbol sequence is determined based on the number of resource elements (REs) corresponding to the transmission resource. One possible implementation is that the length of the first symbol sequence is the product of 2 and a first value, where the first value is less than or equal to the number of REs corresponding to the transmission resource. Based on the two possible implementations mentioned above, the transmitting device can dynamically determine the length of the first symbol sequence according to the quantity of transmission resources, so that the determined first symbol sequence meets the communication requirements, which can improve the reliability of communication, and at the same time improve the flexibility and diversity of determining the length of the first symbol sequence. One possible implementation is that K1 is determined based on the number and distribution of REs corresponding to the transmission resources to match the code rate. One possible implementation is that K1 is the result of rounding down the product of the first value and the distribution matching code rate; wherein the first value is less than or equal to the number of REs corresponding to the transmission resources. Based on the two possible implementations mentioned above, the transmitting device can determine the first value according to the number of REs corresponding to the transmission resources, and determine the length of the first sequence (i.e., K1) according to the first value and the distribution matching code rate, so that the length of the first sequence meets the communication requirements. For example, it can avoid the situation where the transmission resources are insufficient due to the length of the first sequence being too large, and can improve the reliability of communication; at the same time, it can improve the flexibility and diversity of determining the length of the first sequence. One possible implementation is that the length of the second sequence is determined based on the number of REs corresponding to the transmission resources and a first factor; where the first factor is the number of bits that have undergone distribution matching among the Q bits corresponding to the modulation symbol, and Q is a positive integer. In one possible implementation, the length of the second sequence is the result of taking the floor of the product of the first value and the first factor, where the first value is less than or equal to the number of REs corresponding to the transmission resources. Based on this possible implementation, the transmitting device can determine the length of the second sequence according to the number of REs corresponding to the transmission resources and the first factor, so that the length of the second sequence meets the communication requirements. For example, it can avoid the situation where the length of the second sequence is too large, resulting in insufficient transmission resources, and can improve the reliability of communication. At the same time, it can improve the flexibility and diversity of determining the length of the second sequence. One possible implementation is that the transmitting device divides the first sequence into C third sequences based on the normalized energy; and performs distribution matching on the i-th third sequence among the C third sequences to obtain the i-th second symbol sequence; where C is a positive integer and i = 0, 1, ..., C-1. Based on this possible implementation, the longer the first sequence is, the higher the computational complexity of matching the distribution of the first sequence. The sending device can segment the first sequence and perform distribution matching on the segmented sequence (i.e., the third sequence), which can reduce the computational complexity and simplify the implementation. One possible implementation is that the length of the i-th third sequence is determined based on the distribution matching code rate and the length of the i-th second symbol sequence. One possible implementation is that the length of the i-th third sequence is the result of rounding down the ratio of the first product to 2; where the first product is the product of the length of the i-th second symbol sequence and the distribution matching code rate. Based on the two possible implementations mentioned above, the transmitting device can determine the relationship between the length of the i-th third sequence and the length of the i-th second sequence according to the distributed matching code rate. This can ensure that the determined length of the i-th third sequence or the length of the i-th second symbol sequence meets the communication requirements and improves the reliability of communication. At the same time, it can improve the flexibility and diversity of determining the length of the i-th third sequence or the length of the i-th second symbol sequence. One possible implementation is that 2 raised to the power of Li is greater than or equal to the element in the m-th row and n-th column of the first correspondence; where Li is the length of the i-th third sequence; the first correspondence is determined according to the first factor, m is determined according to the length of the i-th second symbol sequence and the normalized energy, and n is the length of the i-th second symbol sequence; the first factor is the number of bits that have undergone distribution matching among the Q bits corresponding to the modulation symbol, where Q is a positive integer. One possible implementation is where m is the integer result of the product of the length of the i-th second symbol sequence and the normalized energy. Based on the two possible implementations mentioned above, another feasible scheme for determining the length of the i-th third sequence and the length of the i-th second symbol sequence is provided, which can improve the flexibility and diversity of determining the length of the i-th third sequence or the length of the i-th second symbol sequence. One possible implementation is that the transmitting device determines an alphabet based on a first factor; and determines a first correspondence based on the alphabet. The alphabet includes the values ​​of symbols in a second symbol sequence. One possible implementation is that the size of the alphabet is 2 raised to the power of p, where p is the ratio of the first factor to 2. Based on the two possible implementations mentioned above, the transmitting device can determine the size of the alphabet (i.e., the number of letters in the alphabet) according to the first factor, and then determine the alphabet so that the determined alphabet meets the distribution matching requirements, which can reduce the average energy of the modulation symbols and save transmission power; at the same time, it can improve the diversity and flexibility of alphabet determination. One possible implementation is that the first correspondence includes the elements of the first m+1 rows and first n+1 columns in a preset correspondence for the alphabet; or, the first correspondence is determined based on the alphabet and the energy corresponding to each letter in the alphabet; wherein the first correspondence includes the elements of the first m+1 rows and n+1 columns, and the element in the first correspondence at the m-th row and n-th column is greater than or equal to 2. Li . Based on this possible implementation, on the one hand, the transmitting device can determine the first correspondence from the preset correspondences corresponding to the alphabet, which can simplify the determination of the first correspondence and reduce computational complexity. On the other hand, the transmitting device can determine the first correspondence based on the alphabet and the energy of the letters in the alphabet, so that the determined first correspondence meets the distribution matching requirements, which can reduce the average energy of the modulation symbols and save transmission power; at the same time, it can improve the diversity and flexibility of alphabet determination. One possible implementation is that the transmitting device performs distribution matching on the i-th third sequence according to the first correspondence to obtain the i-th second symbol sequence, wherein the first correspondence is determined according to the first factor; wherein the first factor is the number of bits that have undergone distribution matching among the Q bits corresponding to the modulation symbol, and Q is a positive integer. Based on this possible implementation, a feasible scheme is provided for distribution matching of the i-th third sequence. One possible implementation is that the average energy per symbol in the first symbol sequence is determined based on the energy of the j-th symbol in the alphabet and the output probability of the j-th symbol; j = 0, 1, 2, ..., 2 p -1, where p is a positive integer. Based on this possible implementation, the transmitting device can determine the average energy of each symbol in the first symbol sequence according to the output probability corresponding to the symbol. Secondly, this application provides a communication method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself, a component within the receiving device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving device. The method includes: the receiving device receiving information to be decoded; wherein the information to be decoded corresponds to a fifth sequence; and performing inverse distribution matching on the fifth sequence according to a normalized energy to obtain a sixth sequence. The normalized energy is determined based on a distribution matching code rate, which indicates the length correspondence between the input and output sequences of the distribution matching, where K is a positive integer. Based on the second aspect, the receiving device can determine the normalized energy according to the distribution matching code rate, and perform inverse distribution matching on the fifth sequence according to the normalized energy, which can simplify the implementation of inverse distribution matching and reduce computational complexity. One possible implementation is that the receiving device performs a first transformation on the fifth sequence to obtain a third symbol sequence; and performs inverse distribution matching on the third symbol sequence according to the normalized energy to obtain a sixth sequence. Based on this possible implementation, the receiving device can perform distributive matching on the fifth sequence according to the normalized energy to obtain the third symbol sequence, and then perform inverse distribution matching on the third symbol sequence to determine the sixth sequence, thereby enabling communication with the transmitting device. One possible implementation is that the length of the third symbol sequence is determined based on the number of REs corresponding to the transmission resources. One possible implementation is that the length of the third symbol sequence is the product of 2 and the first value, where the first value is less than or equal to the number of REs corresponding to the transmission resource. Based on this possible implementation, the receiving device can dynamically determine the length of the third symbol sequence according to the quantity of transmission resources, so that the determined third symbol sequence meets the communication requirements, which can improve the reliability of communication, and at the same time improve the flexibility and diversity of determining the length of the third symbol sequence. One possible implementation is that the length of the fifth sequence is determined based on the number of REs corresponding to the transmission resources and the first factor. One possible implementation is that the length of the fifth sequence is the result of taking the floor of the product of the first value and the distribution matching code rate; wherein the first value is less than or equal to the number of REs corresponding to the transmission resources. Based on the two possible implementations mentioned above, the receiving device can determine the first value according to the number of REs corresponding to the transmission resources, and determine the length of the fifth sequence according to the first value and the distribution matching code rate, so that the length of the fifth sequence meets the communication requirements. For example, it can avoid the situation where the transmission resources are insufficient due to the excessive length of the fifth sequence, and can improve the reliability of communication; at the same time, it can improve the flexibility and diversity of determining the length of the fifth sequence. One possible implementation is that the receiving device performs a second transformation on the fifth sequence to obtain a third symbol sequence; according to the normalized energy, the third symbol sequence is divided into C fourth symbol sequences; the i-th fourth symbol sequence among the C fourth symbol sequences is subjected to inverse distribution matching to obtain the i-th seventh sequence; where i = 0, 1, ..., C-1. One possible implementation is that the receiving device divides the fifth sequence into C ninth sequences based on the normalized energy; performs a second transformation on the i-th ninth sequence among the C ninth sequences to obtain the i-th fourth symbol sequence; and performs inverse distribution matching on the i-th fourth symbol sequence among the C fourth symbol sequences to obtain the i-th seventh sequence; where i = 0, 1, ..., C-1. Based on the two possible implementations mentioned above, the longer the fifth sequence is, the higher the computational complexity of distributive matching for the fifth sequence. On the one hand, the receiving device can segment the fifth sequence, perform a second transformation on the segmented sequence (i.e., the ninth sequence) to obtain the fourth symbol sequence, and then perform distributive matching on the fourth symbol sequence, which can reduce computational complexity and simplify implementation. On the other hand, the receiving device can first perform a second transformation on the fifth sequence to obtain the third symbol sequence, segment the third symbol sequence, and then perform distributive matching on the segmented symbol sequence (i.e., the third symbol sequence), which can reduce computational complexity and simplify implementation. One possible implementation is that the length of the i-th seventh sequence is determined based on the distribution matching code rate and the length of the i-th fourth symbol sequence. One possible implementation is that the length of the i-th seventh sequence is the result of rounding down the ratio of the second product to 2; where the second product is the product of the distribution matching code rate and the length of the i-th fourth symbol sequence. Based on the two possible implementations mentioned above, a feasible scheme for determining the length of the i-th seventh sequence and the length of the i-th fourth symbol sequence is provided. This scheme can ensure that the length of the i-th seventh sequence or the length of the i-th fourth symbol sequence meets the communication requirements and improves the reliability of communication. At the same time, it can improve the flexibility and diversity of determining the length of the i-th seventh sequence or the length of the i-th fourth symbol sequence. One possible implementation, L2 i The power is greater than or equal to the element in the m-th row and n-th column of the first correspondence; where L iis the length of the i-th seventh sequence; the first correspondence is determined according to the first factor, m is determined according to the length of the i-th fourth symbol sequence and the normalized energy, and n is the length of the i-th fourth symbol sequence. One possible implementation is where m is the integer result of the product of the length of the i-th fourth symbol sequence and the normalized energy. Based on this possible implementation, another feasible scheme for determining the length of the i-th seventh sequence and the length of the i-th fourth symbol sequence is provided, which can improve the flexibility and diversity of determining the length of the i-th seventh sequence or the length of the i-th fourth symbol sequence. One possible implementation is that the receiving device determines an alphabet based on a first factor; and determines a first correspondence based on the alphabet. The alphabet includes the values ​​of symbols in a third symbol sequence. One possible implementation is that the size of the alphabet is 2 raised to the power of p, where p is the ratio of the first factor to 2. Based on the two possible implementations mentioned above, the receiving device can determine the size of the alphabet (i.e., the number of letters in the alphabet) according to the first factor, and then determine the alphabet so that the determined alphabet meets the requirements of solution distribution matching, while improving the diversity and flexibility of alphabet determination. One possible implementation is that the first correspondence includes the elements of the first m+1 rows and first n+1 columns in a preset correspondence for the alphabet; or, the first correspondence is determined based on the alphabet and the energy corresponding to each letter in the alphabet; wherein the first correspondence includes the elements of the first m+1 rows and n+1 columns, and the element in the first correspondence at the m-th row and n-th column is greater than or equal to 2. Li Li is the length of the i-th seventh sequence. Based on this possible implementation, on the one hand, the receiving device can determine the first correspondence from the preset correspondences corresponding to the alphabet, which can simplify the determination of the first correspondence and reduce computational complexity. On the other hand, the receiving device can determine the first correspondence based on the alphabet and the energy of the letters in the alphabet, so that the determined first correspondence satisfies the requirements of solution distribution matching, while improving the diversity and flexibility of alphabet determination. One possible implementation is that the receiving device performs inverse distribution matching on the i-th fourth symbol sequence according to the first correspondence relationship to obtain the i-th seventh sequence; wherein the first correspondence relationship is determined according to the first factor. Based on this possible implementation, a feasible scheme is provided for distributive matching of the i-th fourth symbol sequence. Combining the first and second aspects, one possible implementation is that the distributed matching code rate is related to the code rate corresponding to the first MCS index in the modulation and coding scheme (MCS) table, the spectral efficiency (SE) corresponding to the first MCS index, the first factor corresponding to the first MCS index, and the modulation order corresponding to the first MCS index; wherein, the code rate corresponding to the first MCS index is less than or equal to a first threshold, and the first factor is the number of distributed matching bits in the Q bits corresponding to the modulation symbol, where Q is a positive integer. Based on this possible implementation, the distributed matching code rate can be determined according to the code rate, spectral efficiency, first factor, and modulation order corresponding to the first MCS index. This allows the distributed matching code rate to be the same for different MCS indices, simplifying the implementation of the distributed matching code rate and reducing its complexity. Furthermore, when determining the distributed matching code rate, the MCS index corresponding to a code rate less than a first threshold can be used as the first MCS index to ensure decoding is possible at that code rate, thus improving decoding performance. Combining the first and second aspects, one possible implementation is that the code rate corresponding to the first MCS index is the ratio of the second product to the modulation order corresponding to the first MCS index; wherein, the second product is the product of 1024 and the second value, the second value is the sum of the first difference and the first factor corresponding to the first MCS index, and the first difference is the difference between the spectral efficiency corresponding to the first MCS index and the distribution matching code rate. Based on this possible implementation, the distribution matching code rate can be determined. Since the code rate used to determine the distribution matching code rate is less than or equal to the first threshold, normal decoding can be achieved at this code rate. This ensures normal decoding when data is transmitted using the determined distribution matching code rate, thereby improving decoding performance. Combining the first and second aspects, one possible implementation is a distributed matching code rate of any of the following: 1.7, 1.8, or 1.9. Based on this possible implementation, several feasible solutions are provided for distributed matching bitrate, which can increase the range of values ​​for distributed matching bitrate and improve its diversity and flexibility. Combining the first and second aspects, one possible implementation is that the transmitting or receiving device determines the distribution matching code rate from the MCS table based on the MCS index; wherein the MCS index is positively correlated with the distribution matching code rate corresponding to the MCS index. Based on this possible implementation, when the MCS index is low, the spectral efficiency corresponding to the MCS index is low, resulting in a lower required distribution matching code rate; conversely, when the MCS index is high, the spectral efficiency corresponding to the MCS index is high, resulting in a higher required distribution matching code rate. Therefore, as the MCS index increases, the distribution matching code rate can increase, thereby improving the gain of distribution matching. Furthermore, this provides a feasible scheme for determining the distribution matching code rate corresponding to different MCS indices, which can improve the flexibility and diversity of determining the distribution matching code rate corresponding to the MCS index. Combining the first and second aspects, one possible implementation is that the second MCS index is located in the xth first preset interval among X first preset intervals, the third MCS index is located in the (x+1)th first preset interval among X first preset intervals, and the distribution matching code rate corresponding to the second MCS index is less than the distribution matching code rate corresponding to the third MCS index; where x = 1, 2, ..., X, the second MCS index is less than the third MCS index, and the X first preset intervals are consecutive. Combining the first and second aspects, one possible implementation is that at least two MCS indices located in the same first preset interval have the same distribution matching code rate. Based on the two possible implementations described above, the distribution matching code rate corresponding to different MCS indices can be determined according to X first preset intervals, such that the determined distribution matching code rate increases with the increase of the MCS index, thereby improving the gain of distribution matching. Furthermore, the distribution matching code rate corresponding to MCS indices located in the same interval can be made the same, which simplifies the implementation of distribution matching code rate and reduces the complexity of its description. Combining the first and second aspects, one possible implementation is that the first spectral efficiency is located in the y-th second preset interval among Y second preset intervals, the second spectral efficiency is located in the (y+1)-th second preset interval among Y second preset intervals, and the distribution matching code rate corresponding to the first spectral efficiency is less than the distribution matching code rate corresponding to the second spectral efficiency; where y = 1, 2, ..., Y, the first spectral efficiency is less than the second spectral efficiency, and the Y second preset intervals are continuous. Combining the first and second aspects, one possible implementation is that at least two spectral efficiencies located in the same second preset interval correspond to the same distribution matching code rate. Based on the two possible implementations described above, the distribution matching code rate corresponding to different spectral efficiencies can be determined according to Y second preset intervals. This ensures that the determined distribution matching code rate increases with increasing spectral efficiency, thereby improving the gain of the distribution matching. Furthermore, it allows for a more intuitive representation of the relationship between spectral efficiency and the distribution matching code rate. Furthermore, it allows the distribution matching code rate to be the same for spectral efficiencies in the same interval, which simplifies the implementation of the distribution matching code rate and reduces the complexity of its description. Combining the first and second aspects, one possible implementation is that the first factor is either of the following: modulation order - 2, modulation order - 4. Combining the first and second aspects, one possible implementation is that the first factor is the minimum of an even number greater than the distribution matching code rate. Based on the two possible implementations mentioned above, the first factor can be determined according to the modulation order or the distribution matching code rate, which can make the determined first factor meet the communication requirements and improve the flexibility and diversity of the determination of the first factor. Thirdly, embodiments of this application provide a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. The communication device can be the transmitting end device itself, or it can be a chip, chip system, or system-on-a-chip of the transmitting end device, etc. The communication device can execute the functions performed by the transmitting end device through hardware, or it can execute corresponding software through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation. For example, the processing module is used to perform distribution matching on the first sequence according to the normalized energy to obtain the second sequence; wherein, the first sequence includes K1 bits in a payload bit sequence of length K, where K1 is a positive integer less than or equal to K; the normalized energy is determined according to the distribution matching code rate, which is 2 multiplied by the ratio of the length of the bit sequence before distribution matching to the length of the symbol sequence after distribution matching, where K is a positive integer; the transceiver module is used to output the second sequence. Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the first aspect or any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content. Fourthly, embodiments of this application provide a communication device that can be applied to the receiving device described in the second aspect to realize the functions performed by the receiving device. The communication device can be the receiving device itself, or it can be a chip, chip system, or system-on-a-chip of the receiving device. The communication device can execute the functions performed by the receiving device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the functions described above. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation. For example, the transceiver module is used to receive information to be decoded; wherein the information to be decoded corresponds to the fifth sequence; the processing module is used to perform inverse distribution matching on the fifth sequence according to the normalized energy to obtain the sixth sequence; wherein the normalized energy is determined according to the distribution matching code rate, the distribution matching code rate is 2 multiplied by the ratio of the length of the bit sequence before distribution matching to the length of the symbol sequence after distribution matching, and K is a positive integer. Optionally, the transceiver module and processing module of the communication device in the fourth aspect may also perform the corresponding functions in the second aspect or any possible design of the second aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content. Fifthly, embodiments of this application provide a communication device, which includes one or more processors; the one or more processors are configured to run computer programs or instructions, such that when the one or more processors execute the computer instructions or instructions, the communication method described in any one of the first to second aspects is performed. In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information. In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device. In a sixth aspect, embodiments of this application provide a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of the first to second aspects, and to process and / or generate information based on the information. In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the communication method described in any one of the first to second aspects to be performed. Eighthly, embodiments of this application provide a computer program product containing computer instructions that, when run on a computer, causes the communication method described in any one of the first to second aspects to be executed. Ninthly, embodiments of this application provide a computer program that, when run on a computer, causes the communication method described in any one of the first to second aspects to be executed. In a tenth aspect, embodiments of this application provide a chip, including: a processor coupled to a memory for storing programs or instructions, wherein when the program or instructions are executed by the processor, a communication method as described in any one of the first to second aspects is executed. The technical effects of any of the design methods in aspects three through ten are similar to those in aspects one through two, and will not be elaborated upon further. Eleventhly, embodiments of this application provide a communication system that may include communication means for performing the communication as described in the first aspect or any possible design of the first aspect, and communication means for performing the communication as described in the second aspect or any possible design of the second aspect. Attached Figure Description Figure 1 is a schematic diagram of a modulation and shaping process provided in an embodiment of this application; Figure 2 is a schematic diagram of a shaped constellation distribution provided in an embodiment of this application; Figure 3 is a schematic diagram of a fence diagram provided in an embodiment of this application; Figure 4 is a schematic diagram of a communication system provided in an embodiment of this application; Figure 5 is a schematic diagram of encoding and decoding performed by a transmitting end device and a receiving end device according to an embodiment of this application; Figure 6 is a schematic diagram of the structure of a communication device provided in an embodiment of this application; Figure 7 is a flowchart illustrating a communication method provided in an embodiment of this application; Figure 8 is a flowchart illustrating a communication method provided in an embodiment of this application; Figure 9 is a schematic diagram of the structure of a transmitting device provided in an embodiment of this application; Figure 10 is a schematic diagram of the structure of a receiving device provided in an embodiment of this application; Figure 11 is a schematic diagram of another communication device provided in an embodiment of this application; Figure 12 is a schematic diagram of the structure of another communication device provided in an embodiment of this application. Detailed Implementation Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described. Higher-order modulation: Higher-order modulation refers to mapping multiple binary bits to a single modulation symbol to improve spectral efficiency. Common higher-order modulation schemes include quadrature amplitude modulation (QAM), 64QAM, and 256QAM. For example, taking 64QAM as an example, during the mapping process, 6 = log2(64) bits can be mapped to the same modulation symbol. Since the real and imaginary parts are independent of each other, the real and imaginary parts of 64QAM each correspond to an 8-amplitude shift keying (ASK) modulation, that is, 3 bits can be mapped to an 8ASK symbol. As shown in Table 1 below, the bit mapping relationship of 8ASK is given. During the modulation process, the modulation symbol x can be determined according to bits b0, b1, and b2 as the modulation symbol to be transmitted. Among them, b0 is the symbol bit, and b1 and b2 are both amplitude bits. b0, b1, and b2 are sorted from high to low reliability as: b0, b1, b2. Different bit values ​​of b0, b1, and b2 can correspond to different modulation symbols. Table 1 Based on Table 1, taking b0 as 1 and b1 and b2 as 0 as an example, x can be -3; or, taking b0 and b2 as 1 and b1 as 0 as an example, x can be -1. In higher-order modulation, different modulation symbols may have different energies. The average energy can be reduced by sending more low-energy modulation symbols and fewer high-energy modulation symbols, thereby saving transmission power. It is understandable that for a Gaussian white noise channel, the energy saved is greatest when the distribution of modulation symbols in the modulation symbol sequence follows a Gaussian distribution, which can save up to 1.53 dB of transmission power compared to an average distribution. Probabilistic shaping: Probabilistic shaping is a common "shaping" technique that can reshape a first bit sequence of length K1 to obtain a second bit sequence of length N, making the second bit sequence conform to or close to a preset specific distribution, thereby saving transmission power. Here, K1 and N are both positive integers. Specifically, the transmitting device can shape the first bit sequence to obtain a first symbol sequence, and then perform a first transformation based on the first symbol sequence to obtain a second bit sequence. The first transformation can be understood as a symbol-to-bit mapping, that is, one symbol can correspond to one or more bits. In the first symbol sequence, the values ​​of the symbols are contained in the alphabet. The alphabet can be represented by A. For example, the alphabet can be A = {1, 3, 5, 7}. Then, the values ​​of the symbols in the first symbol sequence can be one of 1, 3, 5, or 7. The number of letters in the alphabet (or the size of the alphabet) can be |A|. The alphabet may differ from the set of modulation symbols. The probability shaping flowchart is shown in Figure 1. A precoder (also called a distribution matcher or some kind of transformation) can be cascaded before encoding. This precoder can divide the payload bit sequence into two groups: a first bit sequence and a third bit sequence that has not undergone precoding. The first bit sequence can be... Precoding yields the second bit sequence p0, p1, ..., p N-1 And for the second bit sequence p0, p1, ..., p N-1 The encoded bit sequence is obtained by encoding the third bit sequence, and then the encoded bit sequence is interleaved and modulated to obtain the modulated symbol sequence, and the modulated symbol sequence is output. The shaped constellation distribution is shown in Figure 2. The horizontal axis represents the value of the modulation symbol, and the vertical axis represents the probability of the modulation symbol appearing. The square of the modulation symbol reflects the energy level; that is, the smaller the square of the modulation symbol, the lower the energy, and the larger the square of the modulation symbol, the higher the energy. As can be seen from Figure 2, the probability of low-energy modulation symbols appearing is higher than that of high-energy modulation symbols. Distribution Matcher Based on Symbolic Approximate Enumerated Sphere Shaping (AESS): The pre-encoding result of the distribution matcher of symbolic AESS can be n max Long symbol sequences can be matched with a K1-length bit sequence based on a symbol-level AESS distributed matcher. Perform precoding, and output the precoding result as n. max Long symbol sequence The (n-1)th symbol c n-1 The values ​​of n belong to the alphabet, n = 1, 2, ..., nmax Among them, c n-1 The value of and its energy can satisfy the following formula: Where a is c n-1 The value of E(a) is the energy corresponding to a. For example, when a = 1, the corresponding energy is 0; when a = 3, the corresponding energy is 1; when a = 5, the corresponding energy is 3; and when a = 7, the corresponding energy is 6. also, lexicographical sequence number Satisfy the following formula: Among them, u i for The i-th bit. In a distributed matcher, it can be based on E max +1 row, n max A trellis graph, consisting of elements from column +1, achieves distribution matching. The sequences in the trellis graph are arranged lexicographically. If and only if c i =c′ i When i≤j, c j >c′ j During the encoding process, input and output sequences with the same sequence number correspond to each other, that is... and They correspond to each other. Because the energy of the sequence output by the fence diagram is less than or equal to E... max This can reduce the output sequence (i.e. ) energy. Specifically, in the fence diagram, the elements in column 0 all take the value 0 or 1; any element in column n is equal to the sum of M elements in column (n-1), where M is less than or equal to the size of the alphabet. Taking an alphabet size of 4 as an example, any element in column n is equal to the sum of at most 4 elements in column (n-1). Specifically, the elements in the (n-1)th column and the elements in the nth column can satisfy the following formula: Where T(E,n) is the element in the E-th row and n-th column of the fence diagram, and T(EE(a),n-1) is the element in the EE(a)-th row and n-1-th column of the fence diagram. Based on the above description of the fence diagram, using the alphabet {1,3,5,7}, n max E is 2.max Taking 3 as an example, a 4x3 fence diagram can be determined. Assuming all elements in the 0th column of the fence diagram are 1, according to... The elements in the first and second columns of the fence diagram can be determined, as shown in Figure 3(a). In addition, the above and Equivalent, can be used for Deformation, to obtain To reduce computational complexity. Here, T(E,n) can be determined by w bits (i.e., s0, s1, ..., sw-1) and the exponent t, where t is a positive integer, based on... The determined fence diagram can be shown in Figure 3(b). Based on the above description of the fence diagram and precoding, the initial row number E can be determined, where E is the number of elements in the nth column of the fence diagram that are greater than or equal to... The minimum value of the elements, i.e. Based on the initial row number E, c n-1 The value of can be determined based on the following process: For example, let's assume K is 2. The value is 10, determined based on the above method. It is 31. The bit sequence corresponding to the first transformation can be 0001. In summary, while the transmitting device can perform precoding based on AESS, this precoding method has high computational complexity. Therefore, simplifying the implementation of precoding to reduce computational complexity is an urgent problem to be solved. This application provides a communication method in which a transmitting device performs distribution matching on a first sequence based on normalized energy to obtain a second sequence; and outputs the second sequence. The first sequence includes K1 bits from a payload bit sequence of length K, where K1 is a positive integer less than or equal to K; the normalized energy is determined based on the distribution matching code rate, which indicates the length correspondence between the input and output sequences in the distribution matching, where K is a positive integer. The transmitting device can determine the normalized energy based on the distributed matching code rate and perform distributed matching on the first sequence based on the normalized energy, which simplifies the implementation of distributed matching and reduces computational complexity. The normalized energy is related to determining the initial row label E; for example, the initial row label E can be equal to the product of the normalized energy and the length of the output symbol sequence. The embodiments of this application will now be described in detail with reference to the accompanying drawings. The communication method provided in this application embodiment can be used in any communication system, such as a third-generation partnership project (3GPP) communication system, for example, a long-term evolution (LTE) system; or a fifth-generation (5G) mobile communication system, a hybrid LTE and 5G network system, a new radio (NR) system, an NR vehicle-to-everything (V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an internet of things (IoT) system, a narrowband internet of things (NB-IoT) system, a global system for mobile communications (GSM), an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, and a code division multiple access 2000 system. Access, CDMA2000, Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Enhanced Mobile Broadband (eMBB), Ultra-Reliable and Low-Latency Communication (URLLC), Enhanced Machine-Type Communication (eMTC), and various types of future communication systems are also included. Non-terrestrial network (NTN) systems (such as satellite communication systems) and non-3GPP communication systems are also included without restriction. The communication method provided in this application can be applied to various communication scenarios. For example, it can be applied to one or more of the following communication scenarios: coding of control channels, coding of data channels, etc., without limitation. The communication system provided in the embodiments of this application will be described below using Figure 4 as an example. Figure 4 is a schematic diagram of a communication system provided in an embodiment of this application. As shown in Figure 4, the communication system may include at least one terminal device and at least one network device. In Figure 4, the terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink data and then perform constellation modulation before transmitting it to the terminal device over the air interface (i.e., the network device is the transmitting device, and the terminal device is the receiving device); the terminal device can also use channel coding to encode uplink data and then perform constellation modulation before transmitting it to the network device over the air interface (i.e., the terminal device is the transmitting device, and the network device is the receiving device). It is understandable that when network devices communicate with each other, or when terminal devices communicate with each other, they can also communicate based on channel coding. That is, the sending end device and the receiving end device can both be network devices or both be terminal devices, without restriction. The terminal device in Figure 4 can be a device with wireless transceiver capabilities or a chip or chip system that can be configured on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. The terminal device can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc. For example, the terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiver capabilities. Terminal equipment can also be user stations, mobile stations, remote stations, remote terminal equipment, mobile terminal equipment, user terminal equipment, wireless communication equipment, user agents, user devices, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, processing devices connected to wireless modems, in-vehicle equipment, wearable devices, terminal equipment in the Internet of Things (IoT), home appliances, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in smart cities, wireless terminals in smart homes, vehicles with vehicle-to-vehicle (V2V) communication capabilities, intelligent connected vehicles, and UAV-to-UAV communication. Unmanned aerial vehicles (UAVs) with U2U communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs) are not subject to restrictions. In Figure 4, the network device can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system that can be configured within the aforementioned device, a logical node or logical module, or a function implemented in software. Its main responsibilities include air interface-side wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be either a wired access device or a wireless access device. For example, a network device can consist of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations, such as: satellite base stations, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, base band units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this. In another example, the network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different places; for example, the RRU can be moved remotely to a high-traffic area, while the BBU is located in the central equipment room. The BBU and RRU can also be located in the same equipment room. The BBU and RRU can also be different components under the same rack. In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP). In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH). It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, 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. Based on the above description of the terminal device and network device, optionally, the communication method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal device or network device, without limitation. Optionally, in this embodiment of the application, the transmitting device (or source) and the receiving device (or sink) can use the process shown in Figure 5 below for encoding and decoding. The transmitting device can be any terminal device or network device in the communication system shown in Figure 4, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 4. In this process, the transmitting device performs source coding on its generated bits to obtain a source bit stream. Then, it performs channel coding on the source bit stream, modulates it, and transmits the modulated symbols to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it demodulates them, performs channel decoding to recover the source bit stream, and then performs source decoding to obtain the decoded result. In specific implementation, as shown in Figure 4, each terminal device and network device can adopt the composition structure shown in Figure 6, or include the components shown in Figure 6. Figure 6 is a schematic diagram of the composition of a communication device 600 provided in an embodiment of this application. The communication device 600 can be a terminal device or a chip or system-on-a-chip in a terminal device; it can also be a network device or a chip or system-on-a-chip in a network device. As shown in Figure 6, the communication device 600 includes a processor 601, a transceiver 602, and a communication line 603. Furthermore, the communication device 600 may also include a memory 604. The processor 601, memory 604, and transceiver 602 can be connected via a communication line 603. The processor 601 can be a central processing unit (CPU), a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 601 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation. Transceiver 602 is used to communicate with other devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. Transceiver 602 can be a module, circuit, transceiver, or any device capable of enabling communication. Communication line 603 is used to transmit information between the components included in communication device 600. Memory 604 is used to store instructions. These instructions can be computer programs. The memory 604 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions; it can also be a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions; it can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation. It is understood that the memory 604 can exist independently of the processor 601, or it can be integrated with the processor 601. The memory 604 can be used to store instructions, program code, or some data, etc. The memory 604 can be located inside or outside the communication device 600, without limitation. The processor 601 is used to execute the instructions stored in the memory 604 to implement the communication method provided in the following embodiments of this application. In one example, processor 601 may include one or more CPUs, such as CPU0 and CPU1 in Figure 6. As an optional implementation, the communication device 600 may include multiple processors, for example, in addition to the processor 601 in FIG. 6, it may also include a processor 607. As an optional implementation, the communication device 600 also includes an output device 605 and an input device 606. For example, the input device 606 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 605 is a device such as a display screen or speaker. It is understood that the communication device 600 can be a desktop computer, a laptop computer, a web server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device with a similar structure to that shown in Figure 6. Furthermore, the composition shown in Figure 6 does not constitute a limitation on the communication device; in addition to the components shown in Figure 6, the communication device may include more or fewer components than shown, or combine certain components, or have different component arrangements. In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices. Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation. The communication method provided in the embodiments of this application will be described below with reference to the communication system shown in Figure 4 and Figure 7. The transmitting device can be any terminal device or network device in the communication system shown in Figure 4, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 4. The transmitting or receiving device described in the following embodiments may include the components shown in Figure 6. Figure 7 is a flowchart of a communication method provided in an embodiment of this application. As shown in Figure 7, the method may include the following steps: Step 701: The transmitting device performs distribution matching on the first sequence based on the normalized energy to obtain the second sequence. The first sequence comprises K1 bits from a payload bit sequence of length K, where K1 is a positive integer less than or equal to K. K is a positive integer. The payload bit sequence may include the information bits themselves, and K may be the number of information bits included in the payload bit sequence. Alternatively, the payload bit sequence may include information bits and cyclic redundancy check (CRC) bits, that is, the payload bit sequence may be a CRC-encoded payload bit sequence, and K may be the sum of the number of information bits and the number of CRC bits included in the payload bit sequence. Optionally, K can be determined based on the number of REs corresponding to the transmission resources. The number of REs corresponding to the transmission resources can be understood as the number of REs contained in the resources used to transmit a payload bit sequence of length K (which can be denoted as N). RE For example, K can be the product of the number of REs corresponding to the transmission resources and the spectral efficiency, i.e., K = N. RE *SE, where SE is the spectral efficiency. Distribution matching can also be understood as transformation, distribution matching transformation, shaping, or probabilistic shaping. That is, the transmitting device can use distribution matching to transform a first sequence into a second sequence that follows a specific distribution, thereby reducing the average energy. The length of the first sequence (K1) can be determined based on the number of REs corresponding to the transmission resources and the distribution matching code rate (which can be denoted as R). DM )Sure. The distributed matching code rate indicates the length correspondence between the input and output sequences in a distributed matching sequence. For example, the distributed matching code rate is 2 times the ratio of the length of the bit sequence before distribution matching to the length of the symbol sequence after distribution matching. For instance, if the length of the bit sequence before distribution matching is L... in The length of the symbol sequence after distribution matching can be L. out For example, the distributed matching code rate can be 2*(L) in / L out ), or (2*L in ) / L out . For example, the length of the first sequence can be the result of rounding down the product of a first value and the distribution matching code rate, where the first value is less than or equal to the number of REs corresponding to the transmission resources. It is understood that, unless otherwise specified, the rounding in this application can be rounding up, rounding down, rounding to the nearest integer, or rounding to the nearest integer, without restriction. For example, the length of the first sequence can be This indicates rounding down, where N is the first value. Here, the first value can be understood as the number of symbols that have undergone distribution matching among the number of REs corresponding to the transmission resource (which can be denoted as N). Then, the number of symbols that have not undergone distribution matching among the number of REs corresponding to the transmission resource can be (N). RE -N). Understandably, the sending device can determine the first value based on the number of REs corresponding to the transmission resources, and determine the length of the first sequence (i.e., K1) based on the first value and the distribution matching code rate, so that the length of the first sequence meets the communication requirements. For example, it can avoid the situation where the transmission resources are insufficient due to the length of the first sequence being too large, and can improve the reliability of communication; at the same time, it can improve the flexibility and diversity of determining the length of the first sequence. Optionally, the transmitting device can perform distribution matching on the first sequence based on the normalized energy to obtain a first symbol sequence; further, the transmitting device can obtain a second sequence based on the first symbol sequence through a first transformation. The normalized energy can be determined based on the distributed matching code rate. The specific method for determining the normalized energy is described below and will not be repeated here. The first change can be understood as a symbol-to-bit mapping. Each symbol in the first symbol sequence can correspond to one or more bits. For example, a symbol with a value of 1 can correspond to "01", and a symbol with a value of 3 can correspond to "00". For example, taking the first sequence as 10, assuming that the first symbol sequence obtained by the transmitting device through distribution matching of the first sequence based on the normalized energy is 31, the first transformation can be performed on each symbol in the first symbol sequence to obtain the second sequence, that is, the second sequence can be 0001. It is understood that both the first sequence and the second sequence are bit sequences (i.e., sequences composed of "0" and "1"), and the first symbol sequence is a symbol sequence composed of letters from the alphabet. For example, the alphabet can be {1,3,5,7}, or it can be {1,3}. The alphabet can also include any other arbitrary letters; the above are merely examples and do not limit this application. Understandably, the transmitting device can obtain a first symbol sequence by performing distribution matching on the first sequence based on normalized energy. The symbols in the first symbol sequence can follow or approximate a preset specific distribution, which can save transmission power. In addition, the transmitting device can transform the first symbol sequence into a second sequence based on the first transformation, and then encode and modulate the second sequence to realize data transmission. At the same time, it can reduce the average energy of the modulated symbols and save transmission power. The length of the first symbol sequence can be determined based on the number of REs corresponding to the transmission resources. For example, the length of the first symbol sequence can be the product of a first value and 2. The first value can be referred to the description of the first value above, and will not be repeated here. In the first symbol sequence, the lengths of the real and imaginary parts are respectively equal to the first numerical value. Understandably, the sending device can perform distribution matching on the first sequence to obtain the first symbol sequence. It is understandable that the transmitting device can dynamically determine the length of the first symbol sequence based on the number of REs corresponding to the transmission resources, so that the determined first symbol sequence meets the communication requirements, which can improve the reliability of communication, and at the same time improve the flexibility and diversity of determining the length of the first symbol sequence. The length of the second sequence can be determined based on the first factor (which can be denoted as a) and the number of REs corresponding to the transmission resources. The first factor is the number of distributed-matched bits out of the Q bits corresponding to the modulation symbol. Q is a positive integer. For example, if Q is 6, the first factor can be 4, meaning that the number of unmatched bits out of the 6 bits corresponding to the modulation symbol is 2, and the number of matched bits out of the modulation symbol is 4. For example, the length of the second sequence can be the integer result of the product of the first value and the first factor. For instance, the length of the second sequence can be... This indicates rounding down to the nearest integer. Understandably, the sending device can determine the length of the second sequence based on the number of REs corresponding to the transmission resources and the first factor, so that the length of the second sequence meets the communication requirements. For example, it can avoid the situation where the transmission resources are insufficient due to the length of the second sequence being too large, and can improve the reliability of communication. At the same time, it can improve the flexibility and diversity of determining the length of the second sequence. Step 702: The transmitting device outputs the second sequence; correspondingly, the receiving device receives the decoding information from the transmitting device. Optionally, the transmitting device can encode the bits other than the first sequence in the second sequence and the payload bit sequence of length K to obtain the first encoded bit sequence. For example, the transmitting device can perform polar coding on the bits other than the first sequence in the second sequence and the payload bit sequence of length K, or the transmitting device can perform low-density parity check (LDPC) coding on the bits other than the first sequence in the second sequence and the payload bit sequence of length K, without restriction. Specifically, the transmitting device can concatenate the second sequence and the bits other than the first sequence in the payload bit sequence of length K, and encode the concatenated bit sequence to obtain the first encoded bit sequence. It is understandable that if K is equal to K1, the transmitting device can encode the second sequence to obtain the first encoded bit sequence. Optionally, the transmitting device can perform rate matching on the first coded bit sequence to obtain a rate-matched bit sequence. Optionally, the transmitting device can modulate the rate-matched bit sequence to obtain a modulated symbol sequence; or, the transmitting device can interleave the rate-matched bit sequence to obtain an interleaved bit sequence, and then modulate the interleaved bit sequence to obtain a modulated symbol sequence. It is understandable that the modulation symbol sequence sent by the transmitting device to the receiving device may be affected by noise and other interference when transmitted through the channel. The demodulated information received by the receiving device is a modulation symbol sequence affected by noise and other interference. Optionally, the receiving device can demodulate the information to be demodulated to obtain the information to be decoded. Optionally, if the transmitting device interleaves the rate-matched bit sequence, the receiving device can deinterleave the information to be decoded to obtain a deinterleaved bit sequence, and then de-rate-match the deinterleaved bit sequence to obtain a de-rate-matched bit sequence; otherwise, the receiving device can de-rate-match the information to be decoded to obtain a de-rate-matched bit sequence. Optionally, the receiving device can decode the rate-matched bit sequence to obtain the fifth sequence. The length of the fifth sequence is determined based on the number of REs corresponding to the transmission resources and the first factor. For details, please refer to the description of the length of the second sequence in this application, which will not be repeated here. Step 703: The receiving device performs inverse distribution matching on the fifth sequence based on the normalized energy to obtain the sixth sequence. The length of the sixth sequence can be the result of taking the integer part of the product of the first value and the distribution matching code rate. For details, please refer to the description of the length of the first sequence in this application, which will not be repeated here. Optionally, the receiving device can perform a second transformation on the fifth sequence to obtain a third symbol sequence; furthermore, the receiving device can perform inverse distribution matching on the third symbol sequence based on the normalized energy to obtain a sixth sequence. The length of the third symbol sequence can be determined based on the number of REs corresponding to the transmission resources. For details, please refer to the description of the length of the first symbol sequence in this application, which will not be repeated here. The second transformation can be understood as a bit-to-symbol mapping, which maps one or more bits to a symbol. The second transformation can be understood as the inverse of the first transformation. For example, the receiving device can map one or more bits to a symbol. For instance, taking the example of two bits corresponding to one symbol, the receiving device can map every two bits in the fifth sequence to a symbol, thereby obtaining the third symbol sequence. Optionally, the receiving device can determine the number of bits mapped to a symbol based on the modulation order. For example, with a modulation order of 4, the receiving device can map four bits to one symbol. Based on the communication method shown in Figure 7, the transmitting device can determine the normalized energy according to the distribution matching code rate, and perform distribution matching on the first sequence according to the normalized energy, which can simplify the implementation of distribution matching and reduce computational complexity. Based on the description of spectral efficiency in step 701, optionally, the transmitting device can determine the spectral efficiency corresponding to the MCS index from the first MCS table according to the MCS index. For example, the transmitting device can determine the fourth MCS index based on the transmission resources, determine the spectral efficiency corresponding to the fourth MCS index from the first MCS table, and then determine K based on the spectral efficiency and the number of REs corresponding to the transmission resources. The first MCS table can be shown in Table 2: Table 2 First MCS Table Based on Table 2, bitrate*

[1024] It can be determined based on spectral efficiency and modulation order, i.e., code rate *

[1024] can satisfy the following formula: (1024*SE) / Q, where SE is the spectral efficiency and Q is the modulation order. For example, 120 = 1024*0.2344 / 2, or 193 = 1024*0.377 / 2. It is understood that spectral efficiency can also be determined by other MCS tables, such as the second MCS table and the third MCS table described below, and this application does not limit this. Based on the description of the first symbol sequence in step 701, optionally, the average energy per symbol corresponding to the first symbol sequence can be determined based on the energy corresponding to the j-th letter in the alphabet and the output probability corresponding to the j-th letter, where j = 0, 1, 2, ..., 2. p -1, where p is the ratio of the first factor to 2. The output probability corresponding to the j-th letter is the probability that the j-th letter appears in the symbol sequence after distribution matching. The first factor can be referred to in the description of the first factor in this application, and will not be repeated here. For example, taking the alphabet {1,3,5,7} as an example, the energy corresponding to the j-th letter can be: Let 'a' be the value of the j-th letter. When a = 1, its corresponding energy can be 0; when a = 3, its corresponding energy can be 1; when a = 5, its corresponding energy can be 3; and when a = 7, its corresponding energy can be 6. Assuming that the output probability of the letters in the alphabet is [0.666, 0.284, 0.048, 0.002], we can determine that the average energy per symbol in the first symbol sequence is 0.44 (i.e., 0.44 = 0 * 0.666 + 1 * 0.284 + 3 * 0.048 + 6 * 0.002). The output probability corresponding to the j-th letter can be used to determine the average energy per symbol in the first symbol sequence, or it can be used for demodulation. For example, the output probability corresponding to a letter in the alphabet can be multiplied by the channel transition probability to obtain the posterior probability corresponding to the letter in the alphabet, and then demodulation can be performed based on the posterior probability. Based on the communication method shown in Figure 7, the sending device can reduce computational complexity by segmenting the first sequence and performing distribution matching on each segmented sequence. The specific steps can be seen in Figure 8. Based on the above description of normalized energy, the normalized energy can optionally be determined based on the distributed matching code rate. Specifically, the normalized energy can be associated with the length of the bit sequence before allocation matching and the length of the symbol sequence after distribution matching. The length of the bit sequence before allocation matching can be determined based on the distribution matching code rate. The specific determination method can refer to the description of the length of the first sequence above, or the description of the length of the i-th third sequence below. The determination method of the length of the symbol sequence after distribution matching can refer to the description of the length of the first symbol sequence above, or the description of the length of the i-th second symbol sequence below. For example, 2 raised to the power of L1 is greater than or equal to the element in the t-th row and s-th column of the second correspondence; where L1 is the length of the bit sequence before allocation and matching. Where t can be determined based on the length of the symbol sequence after distribution matching (denoted as L2) and the normalized energy. For example, t can satisfy the following formula: E represents normalized energy. Where s is the length of the symbol sequence after distribution matching. For example, s can satisfy the following formula: s = L2. The second correspondence can be the elements in the first t+1 rows and first s+1 columns of the preset correspondence for the alphabet; or, the second correspondence can include the elements in the first t+1 rows and s+1 columns. The alphabet can be determined based on the first factor. The preset correspondence of the alphabet can be referred to the description of the preset correspondence of the alphabet in step 802 above, which will not be repeated here. The specific description of determining the second correspondence can be referred to the description of the first correspondence below, and will not be repeated here. It is understandable that the transmitting device can determine the length of the bit sequence before allocation matching and the length of the symbol sequence after distribution matching based on the distribution matching code rate, and determine the normalized energy by using the element in the t-th row and s-th column of the second correspondence that is greater than or equal to 2 to the power of L1. Step 801: The transmitting device divides the first sequence into C third sequences based on the normalized energy. The sum of the lengths of the C third sequences can be the length of the first sequence. The length of the first sequence can be determined by referring to the description of the length of the first sequence in step 701, which will not be repeated here. Step 802: The transmitting device performs distribution matching on the i-th third sequence among the C third sequences to obtain the i-th second symbol sequence. Where i = 0, 1, ..., C-1. The sum of the lengths of the C second symbol sequences is the length of the first symbol sequence. The determination of the length of the first symbol sequence can be referred to the description of the length of the first symbol sequence in step 701, and will not be repeated here. Optionally, the transmitting device can concatenate C second symbol sequences to obtain a first symbol sequence; further, the transmitting device can obtain a second sequence based on the first symbol sequence through a first transformation. Alternatively, the transmitting device can obtain an i-th eighth sequence based on the i-th second symbol sequence through a first transformation, and then concatenate C eighth sequences to obtain the second sequence. The sum of the lengths of the C eighth sequences is the length of the second sequence. The determination of the length of the second sequence can be referred to the description of the length of the second sequence in step 701, and will not be repeated here. Optionally, the length of the i-th third sequence can be determined by the relationship between the length of the i-th third sequence and the length of the i-th second symbol sequence. For example, the length of the i-th third sequence can be determined based on the distribution matching code rate and the length of the i-th second symbol sequence. For instance, the length of the i-th third sequence can be the result of rounding down the ratio of a first product to 2, where the first product is the product of the length of the i-th second symbol sequence and the distribution matching code rate. The length of the i-th third sequence can satisfy the following formula: L in,i Let L be the length of the i-th third sequence. out,i R is the length of the i-th second symbol sequence. DM For distributed matching bitrate, L out,i R DM That is, the first product. The transmitting device can determine the length of each of the C third sequences and the length of each of the C second symbol sequences based on the relationship between the length of the i-th third sequence and the length of the i-th second symbol sequence, as well as the length of the first sequence and the length of the second symbol sequence. Understandably, the transmitting device can determine the relationship between the length of the i-th third sequence and the length of the i-th second sequence based on the distributed matching code rate. This ensures that the determined length of the i-th third sequence or the length of the i-th second symbol sequence meets the communication requirements, thereby improving the reliability of communication. At the same time, it can enhance the flexibility and diversity of determining the length of the i-th third sequence or the length of the i-th second symbol sequence. Optionally, the length of the i-th third sequence can be determined based on the normalized energy. Specifically, 2 of L in,i The power is greater than or equal to the element in the m-th row and n-th column of the first correspondence, L in,i Let be the length of the i-th third sequence. Where m is determined based on the length of the i-th second symbol sequence and the normalized energy. For example, m can be the integer result of the product of the length of the i-th second symbol sequence and the length of the normalized energy. For instance, m can satisfy the following formula: L out,i Let E be the length of the i-th second symbol sequence, and E be the normalized energy. Where n is the length of the i-th second symbol sequence. For example, n can satisfy the following formula: n = L out,i . The first correspondence can be understood as the fence diagram mentioned above. The first correspondence can include elements in m+1 rows and n+1 columns, and any element in the first correspondence is determined based on the sum of one or more elements in the preceding column. For example, the length of the third sequence and the element in the m-th row and n-th column of the first correspondence can satisfy the following formula: Where T(m,n) represents the element in the m-th row and n-th column of the first correspondence. n = L out,i . Optionally, the first correspondence can be determined based on the first factor. Specifically, the sending device can determine the alphabet based on the first factor. In this alphabet, the size is 2 raised to the power of p, where p is the ratio of the first factor to 2. For example, if the first factor is 4, p can be 2, and the size of the alphabet can be 2 raised to the power of 2, i.e., 4. Therefore, the alphabet includes four letters, so the alphabet could be {1, 3, 5, 7}. Alternatively, if the first factor is 2, p can be 1, and the size of the alphabet can be 2 raised to the power of 1, i.e., 2. Therefore, the alphabet includes two letters, so the alphabet could be {1, 3}. Understandably, the transmitting device can determine the size of the alphabet (i.e., the number of letters in the alphabet) based on the first factor, and then determine the alphabet so that the determined alphabet meets the distribution matching requirements, which can reduce the average energy of the modulation symbols and save transmission power; at the same time, it can improve the diversity and flexibility of alphabet determination. Furthermore, the sending device can determine the first correspondence based on the alphabet. This application provides two embodiments for determining the first correspondence: In a first possible embodiment, the transmitting device can determine a first correspondence based on the alphabet and the energy corresponding to each letter in the alphabet. For example, the energy corresponding to the letter 'a' in the alphabet could be... In the first correspondence, all elements in column 0 are either 0 or 1. The elements in column u-1 and column u of the first correspondence can satisfy the following formula: T(V,u) represents the element in the V-th row and u-th column of the first correspondence, and T(VE(a),u-1) represents the element in the VE(a)-th row and u-1-th column of the first correspondence. Based on the first possible embodiment, the transmitting device can determine a first correspondence based on the alphabet and the energy of the letters in the alphabet, so that the determined first correspondence meets the distribution matching requirements, which can reduce the average energy of the modulation symbols and save transmission power; at the same time, it can improve the diversity and flexibility of alphabet determination. In a second possible embodiment, the sending device can determine the first m+1 rows and first n+1 columns as the first correspondence from the preset correspondence of the alphabet. The preset correspondences for different alphabets are different, and the preset correspondences for different alphabets can include M. max Line N max The elements of the column, M max and N max M can be a preset positive integer. max Greater than or equal to m, N max If n is greater than or equal to n, the determination of the preset correspondence of the alphabet can be referred to the determination of the first correspondence in the first possible embodiment described above, and will not be elaborated here. Based on the second possible embodiment, the sending device can determine the first correspondence from the preset correspondence of the alphabet, which can simplify the implementation of determining the first correspondence and reduce the computational complexity. Based on the two possible embodiments described above, the transmitting device can determine the first correspondence based on the alphabet, and then perform distribution matching on the i-th third sequence according to the first correspondence to obtain the i-th second symbol sequence. Similarly, the transmitting device can determine the first correspondence based on the alphabet, and then perform distribution matching on the first sequence according to the first correspondence to obtain the first symbol sequence. The specific distribution matching process can be referred to the above description of c. n-1 The determination of the value of is not elaborated here. Step 803: The transmitting device outputs the second sequence; correspondingly, the receiving device receives the information to be decoded. Step 803 can be referred to the description of step 702 above, and will not be repeated here. Understandably, the receiving device can decode the information to be decoded to obtain the fifth sequence. Optionally, the receiving device may perform distributive matching on the fifth sequence according to steps 804a-806a, or it may perform distributive matching on the fifth sequence according to steps 804b-806b. Step 804a: The receiving device performs a second transformation on the fifth sequence to obtain the third symbol sequence. The second transformation can be referred to the description of the second transformation above, and will not be repeated here. The length of the third symbol sequence can be determined based on the number of REs corresponding to the transmission resources. The specific method for determining the length of the third sequence can be found in the description of the length of the first symbol sequence in this application, and will not be repeated here. Step 805a: The receiving device divides the third symbol sequence into C fourth symbol sequences based on the normalized energy. The sum of the lengths of the C fourth symbol sequences is equal to the length of the third symbol sequence. Step 806a: The receiving device performs inverse distribution matching on the i-th fourth symbol sequence among the C fourth symbol sequences to obtain the i-th seventh sequence. The receiving device can cascade C seventh sequences to obtain the sixth sequence. The sum of the lengths of the C seventh sequences is the length of the sixth sequence. The determination of the length of the sixth sequence can be found in the description of the length of the sixth sequence in step 703, and will not be repeated here. Optionally, the receiving device can determine the length of the i-th fourth symbol sequence by the relationship between the length of the i-th fourth symbol sequence and the length of the i-th seventh sequence. For example, the length of the i-th seventh sequence can be related to the distribution matching code rate and the length of the i-th fourth symbol sequence. For instance, the length of the i-th seventh sequence can be the result of rounding down the ratio of the second product to 2, where the second product is the product of the distribution matching code rate and the length of the i-th fourth symbol sequence. For example, the length of the i-th seventh sequence can satisfy the following formula: L in,i Let L be the length of the i-th seventh sequence. out,i R is the length of the i-th fourth symbol sequence. DM For distributed matching bitrate, L out,i R DM That is, the second product. It is understandable that the receiving device can determine the length of the i-th fourth symbol sequence based on the relationship between the length of the i-th fourth symbol sequence and the length of the i-th seventh sequence, as well as the length of the third symbol sequence and the length of the sixth sequence. Optionally, the length of the i-th fourth symbol sequence can be determined based on the normalized energy. Specifically, 2 of L in,i The power is greater than or equal to the element in the m-th row and n-th column of the first correspondence, L in,i Let be the length of the i-th seventh sequence. Where m is determined based on the length of the i-th fourth symbol sequence and the normalized energy. For example, m can be the integer result of the product of the length of the i-th fourth symbol sequence and the length of the normalized energy. For instance, m can satisfy the following formula: L out,i Let E be the length of the i-th fourth symbol sequence and E be the normalized energy. Where n is the length of the i-th fourth symbol sequence. For example, n can satisfy the following formula: n = L out,i . The first correspondence can be referred to in the above description of the first correspondence, and will not be repeated here. Step 804b: The receiving device divides the fifth sequence into C ninth sequences based on the normalized energy. The sum of the lengths of the C ninth sequences is the length of the fifth sequence. The determination of the length of the fifth sequence can be referred to the description of the length of the fifth sequence in step 702, and will not be repeated here. Step 805b: The receiving device performs a second transformation on the i-th ninth sequence among the C ninth sequences to obtain the i-th fourth symbol sequence. Step 806b: The receiving device performs inverse distribution matching on the i-th fourth symbol sequence to obtain the i-th seventh sequence. The relationship between the length of the i-th fourth symbol sequence and the length of the i-th seventh sequence can be found in the description of the relationship between the length of the i-th fourth symbol sequence and the length of the i-th seventh sequence in step 806a, and will not be repeated here. Based on the communication method shown in Figure 8, the longer the length of the first sequence, the higher the complexity of distribution matching for the first sequence. The sending device can divide the first sequence into C second sequences by segmentation, and perform rate matching for each of the C second sequences separately, which can reduce the computational complexity and simplify the implementation. Based on the communication methods shown in Figures 7 and 8, the transmitting device can perform distribution matching on the first sequence to obtain the second sequence; or, the transmitting device can segment the first sequence and perform distribution matching on the segmented sequences respectively to obtain the second sequence. This application does not limit this. Based on the above description of the first factor, optionally, the transmitting or receiving device may determine the first factor according to one or more of the following implementations: In the first possible implementation, the first factor can be an even number less than the modulation order. For example, the first factor can be any of the following: modulation order - 2, modulation order - 4. The modulation order can be determined based on the transmission resources. Based on the first possible implementation, the corresponding first factor can be determined for different modulation orders. When the modulation orders corresponding to multiple MCS indices are different, the first factor corresponding to multiple MCS indices can be different. In the second possible implementation, the first factor can be the minimum of an even number greater than the distributed matching code rate. For example, with a distributed matching code rate of 2, the first factor could be 4. Based on the second possible implementation, the corresponding first factor can be determined for different distribution matching code rates. When the distribution matching code rates corresponding to multiple MCS indices are different, the first factor corresponding to multiple MCS indices can be different. Based on the first and second possible implementations, the first factor can be determined according to the modulation order or the distribution matching code rate, which can make the determined first factor meet the communication requirements and improve the flexibility and diversity of the determination of the first factor. In the third possible implementation, the first factor can be determined from the MCS table based on the MCS index. When multiple MCS indices correspond to the same modulation scheme, the first factor corresponding to these multiple MCS indices can be the same. For example, if multiple MCS indices correspond to a modulation order of 64QAM, the first factor corresponding to these multiple MCS indices can be the same; or, if multiple MCS indices correspond to a modulation order of 256QAM, the first factor corresponding to these multiple MCS indices can be the same. In the fourth possible implementation, the first factor can be determined from the MCS table based on the MCS index, and the first factor can be the same for different MCS indices. For example, the first factor can be 4. In the fifth possible implementation, the first factor can be determined from the MCS table based on the MCS index. The first factor corresponding to the MCS index can be determined based on the modulation order corresponding to the MCS index, and the first factors corresponding to multiple MCS indices can be different. For example, the first factor corresponding to the MCS index can be any of the following: the modulation order corresponding to the MCS index - 2, or the modulation order corresponding to the MCS index - 4. Based on the third, fourth, and fifth possible implementations, the first factor can be determined from the MCS table using the MCS index, which simplifies the implementation and reduces computational complexity. Based on the above description of the distributed matching code rate, optionally, the transmitting or receiving device can determine the distributed matching code rate corresponding to the MCS index in the MCS table according to the MCS index. This application provides two possible designs to determine the distributed matching code rate corresponding to different MCS indices in the MCS table. In the first possible design, the distributed matching code rates corresponding to different MCS indices can be the same; in the second possible design, at least two of the multiple MCS indices are different. The first possible design is described in detail below: The required distribution matching code rate varies depending on the modulation scheme. When the distribution matching code rate is the same for different MCS indices, the distribution matching code rate can be less than or equal to the minimum required distribution matching code rate for different modulation schemes. For example, in the case of 16QAM modulation, the distribution matching code rate can be less than 2; in the case of 16QAM modulation, the distribution matching code rate can be less than 4, thus making the distribution matching code rate for different MCS indices less than 2. For example, the distributed matching code rate can be one or more of the following: 1.7, 1.8, or 1.9. In addition, if the code rate is too high, the LDPC code may not be able to be decoded. The first MCS index can be determined in the MCS table, such that the code rate corresponding to the first MCS index is less than or equal to the first threshold. The distribution-matched code rate can be determined by the code rate corresponding to the first MCS index, the spectral efficiency corresponding to the first MCS index, the first factor corresponding to the first MCS index, and the relationship between the modulation order corresponding to the first MCS index and the distribution-matched code rate. For example, the first threshold could be 22 / 23. For example, the code rate corresponding to the first MCS index can be the ratio of the second product to the modulation order corresponding to the first MCS index; wherein, the second product is the product of 1024 and the second value, the second value is the sum of the first difference and the first factor corresponding to the first MCS index, and the first difference is the difference between the spectral efficiency and the distribution-matched code rate corresponding to the first MCS index. For example, the relationship between code rate, spectral efficiency, first factor, modulation order, and distribution-matched code rate can satisfy the following formula: R*

[1024] = 1024 * (SE-R) DM +a) / Q. Where R is the code rate, a is the first factor, and R DM Here, SE is the distributed matching code rate, Q is the spectral efficiency, and Q is the modulation order. Based on the first possible design, this application provides a second MCS table. Taking a first factor of 4 as an example, the distribution matching code rate corresponding to different MCS indices in the second MCS table is 1.8, as shown in Table 3: Table 3 Second MCS Table Unlike the first MCS table, the code rate corresponding to the MCS index in the second MCS table is different from that in the first MCS table. The first MCS table can be used for data transmission without distribution matching before encoding. The code rate can be related to the modulation order Q and the spectral efficiency SE, that is, the code rate can satisfy the following formula: R*

[1024] = 1024 * SE / Q. If distribution matching is performed before encoding, that is, mapping a uniform bit sequence (where the number of "0"s and "1"s is close) to a non-uniform bit sequence (where the number of "0"s and "1"s differs significantly), it will lead to an increase in the code rate. In other words, the code rate *

[1024] will be greater than 1024*SE / Q. The first MCS table mentioned above is no longer applicable to data transmission for distribution matching before encoding. The second MCS table can be used for data transmission for distribution matching before encoding. In addition, when the modulation order is 2, the first sequence is not distributed and matched. At this time, the code rate for distributed matching does not exist, and the code rate corresponding to the modulation order 2 in the second MCS table is the same as the code rate corresponding to the modulation order 2 in the first MCS table. The content shown in Table 3 above is only an example. The parameters in the second MCS table are not unique and can also be other values. For example, the first factor can be determined according to the modulation order. Optionally, if the distribution matching code rate is the same for different MCS indices, the second MCS table may not include the distribution matching code rate column. For example, the second MCS table may also be as shown in Table 4: Table 4 Second MCS Table Based on the first possible design, the distributed matching code rate can be determined according to the code rate, spectral efficiency, first factor, and modulation order corresponding to the first MCS index. This allows the distributed matching code rate to be the same for different MCS indices, simplifying the implementation of the distributed matching code rate and reducing its complexity. Furthermore, when determining the distributed matching code rate, the MCS index corresponding to a code rate less than a first threshold can be used as the first MCS index to ensure decoding is possible at that code rate, thus improving decoding performance. In the second possible design, the MCS index in the MCS table and the distribution matching code rate corresponding to the MCS index can be positively correlated. Under the same modulation scheme, the spectral efficiency corresponding to a low MCS index is lower and the required distribution matching code rate is lower, while the spectral efficiency corresponding to a high MCS index is higher and the required distribution matching code rate is higher. Therefore, as the MCS index increases, the distribution matching code rate can be increased, which can improve the distribution matching gain. For example, in the case of 64QAM modulation, the distribution-matched code rate corresponding to the MCS index increases with the increase of the MCS index. Alternatively, in the case of 256QAM modulation, the distribution-matched code rate corresponding to the MCS index increases with the increase of the MCS index. Based on the second possible design, this application proposes two possible implementations: In the first possible implementation, X first preset intervals can be predefined. The X first preset intervals are consecutive. It is assumed that the second MCS index is located in the xth first preset interval among the X first preset intervals, and the third MCS index is located in the (x+1)th first preset interval among the X first preset intervals. The distribution matching code rate corresponding to the second MCS index is less than the distribution matching code rate corresponding to the third MCS index. Where x = 1, 2, ..., X, the second MCS index is less than the third MCS index. For example, X+1 values ​​can be predefined, such as X0 <X1<X2<…<X X Then, the first preset interval can be [X0, X1), the second preset interval can be [X1, X2), the third preset interval can be [X2, X3), ..., the Xth preset interval can be [X... X- 1,X X Alternatively, the first preset interval can be (X0, X1], the second preset interval can be (X1, X2], the third preset interval can be (X2, X3], ..., the Xth preset interval can be (X0, X1], ... X-1 ,X X ]. For example, taking the first preset interval as [5,7) and the second preset interval as [7,11), assuming the second MCS index is 6 and the third MCS index is 8, the distribution matching code rate corresponding to the MCS index 6 can be less than the distribution matching code rate corresponding to the MCS index 8. Optionally, the X first preset intervals can also be discontinuous. For example, if X is 2, the first preset interval can be [X0, X1], and the second preset interval can be [X2, X3], where X1 and X2 are not equal. Among them, at least two MCS indices located in the same first preset interval have the same distribution matching code rate. For example, taking the first preset interval as [5,7), the distribution matching code rate corresponding to MCS index 5 and the distribution matching code rate corresponding to MCS index 6 can be the same. Based on the first possible design, the transmitting or receiving device can determine the distribution-matched code rate corresponding to different MCS indices according to X first preset intervals. Under the same modulation scheme, the distribution-matched code rate corresponding to the MCS index increases with the increase of the MCS index, which can improve the distribution-matching gain. In addition, the distribution-matched code rate corresponding to the MCS indices located in the same interval can be the same, which can simplify the implementation of the distribution-matched code rate and reduce the complexity of the distribution-matched code rate description. In the second possible implementation, Y second preset intervals can be predefined. The Y second preset intervals are continuous. The first spectral efficiency is located in the y-th second preset interval among the Y second preset intervals, and the second spectral efficiency is located in the (y+1)-th second preset interval among the Y second preset intervals. The distribution matching code rate corresponding to the first spectral efficiency is less than the distribution matching code rate corresponding to the second spectral efficiency. Where y = 1, 2, ..., Y, the first spectral efficiency is less than the second spectral efficiency. For example, Y+1 values ​​can be predefined, such as Y0 <Y1<Y2<…<Y Y Then, the first second preset interval can be [Y0, Y1), the second first preset interval can be [Y1, Y2), the third first preset interval can be [Y2, Y3), ..., the Xth first preset interval can be [Y0, Y1). Y- 1,Y Y Alternatively, the first second preset interval can be (Y0, Y1], the second first preset interval can be (Y1, Y2], the third first preset interval can be (Y2, Y3], ..., the Xth first preset interval can be (Y0, Y1], ... Y-1 ,Y Y ]. For example, taking the first second preset interval as [1.4766, 1.9141) and the second preset interval as [1.9141, 2.7305) as an example, assuming the first spectral efficiency is 1.4766 and the second spectral efficiency is 1.9141, the distribution matching code rate corresponding to the first spectral efficiency can be less than the distribution matching code rate corresponding to the second spectral efficiency. Optionally, the Y second preset intervals can also be discontinuous. For example, with Y = 2, the first preset interval can be [Y0, Y1], and the second preset interval can be [Y2, Y3], where X1 and X2 are not equal. Among them, at least two spectral efficiencies located in the same second preset interval have the same distribution matching code rate. For example, taking the first preset interval as [1.4766, 1.9141) as an example, the distribution matching code rate corresponding to the spectral efficiency of 1.4766 and the distribution matching code rate corresponding to the spectral efficiency of 1.6953 can be the same. Based on the second possible implementation, the transmitting or receiving device can determine the distribution-matched code rate corresponding to different spectral efficiencies according to Y second preset intervals. Under the same modulation scheme, the distribution-matched code rate corresponding to the spectral efficiency increases with the increase of spectral efficiency, which can improve the gain of distribution matching. In addition, the relationship between spectral efficiency and distribution-matched code rate can be represented more intuitively. Furthermore, it can make the distribution-matched code rate corresponding to the spectral efficiency in the same interval the same, which can simplify the implementation of distribution-matched code rate and reduce the complexity of distribution-matched code rate description. Based on the second possible design, this application provides a third MCS table, which is shown in Table 5: Table 5. Third MCS Table As can be seen from Table 5, with the increase of the MCS index, the distribution matching code rate corresponding to the MCS index increases. Based on the above description of normalized energy, the first factor, and the distribution-matching code rate, optionally, given a fixed MCS index, the distribution-matching code rate and the first factor corresponding to the MCS index can be determined, and thus the normalized energy corresponding to the MCS index can be determined. For example, taking a first factor of 4, the distribution-matching code rate and normalized energy corresponding to different MCS indices are shown in Table 6 below: Table 6 shows the correspondence between normalized energy, first factor, and distribution-matched code rate. In Table 6, the normalized energy can also be expressed as the product of the normalized energy and the third value, which can be the length of the symbol sequence after distribution matching. For example, taking a third value of 64 as an example, the distribution matching code rate, first factor, and normalized energy corresponding to different MCS indices can be shown in Table 7 below: Table 7 shows the correspondence between normalized energy, first factor, and distribution-matched code rate. It is understandable that the two tables above are just examples, and the normalized energy values ​​corresponding to different MCS indices can change with the distribution matching code rate or the value of the first factor. Based on the above description of normalized energy, first factor, distributed matched code rate, and output probability, this application provides a fourth MCS table. The fourth MCS table may include, in addition to modulation order, code rate, and spectral efficiency, distributed matched code rate, first factor, normalized energy, and output probability. The transmitting device can determine one or more of the following from the fourth MCS table based on the MCS index: the code rate corresponding to the MCS index, the distributed matched code rate corresponding to the MCS index, the modulation order corresponding to the MCS index, the first factor corresponding to the MCS index, the normalized energy corresponding to the MCS index, the output probability corresponding to the MCS index, or the spectral efficiency corresponding to the MCS index. For example, taking a first factor of 4, the fourth MCS table may be as shown in Tables 8 and 9: Table 8. Fourth MCS Table Table 9. Fourth MCS Table It is understandable that the sending or receiving device can determine the MCS index based on the transmission resources, and determine the required parameters from the fourth MCS table based on the MCS index to execute the communication method shown in Figure 7 or Figure 8, which can reduce computational complexity and simplify implementation. The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships. It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application. The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. With each functional module divided according to its corresponding function, Figure 9 shows a transmitting device 90. The transmitting device 90 can perform the actions performed by the transmitting device in the methods shown in Figures 7 to 8. All relevant content of each step involved in the above method embodiments can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here. The transmitting device 90 may include a transceiver module 901 and a processing module 902. Exemplarily, the transmitting device 90 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 90 is a communication device, the transceiver module 901 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 902 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 90 is a component having the aforementioned transmitting device functions, the transceiver module 901 may be a radio frequency unit; the processing module 902 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 90 is a chip system, the transceiver module 901 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 902 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 901 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 902 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit). For example, the transceiver module 901 can be used to execute all the transceiver operations performed by the transmitting device in the embodiments shown in Figures 7 and 8, and / or to support other processes for the technology described herein; the processing module 902 can be used to execute all operations other than the transceiver operations performed by the transmitting device in the embodiments shown in Figures 7 and 8, and / or to support other processes for the technology described herein. Figure 10 shows a receiving device 100, which can perform the actions performed by the receiving device in the methods shown in Figures 7 and 8 above. All relevant content of each step involved in the above method embodiments can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiments, which will not be repeated here. The receiving device 100 may include a transceiver module 1001 and a processing module 1002. For example, the receiving device 100 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions. When the receiving device 100 is a communication device, the transceiver module 1001 may be a transceiver, which may include an antenna and radio frequency circuits; the processing module 1002 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 100 is a component having the aforementioned receiving device functions, the transceiver module 1001 may be a radio frequency unit; the processing module 1002 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 100 is a chip system, the transceiver module 1001 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1002 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1001 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1002 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit). For example, the transceiver module 1001 can be used to execute all the transceiver operations performed by the receiving device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein; the processing module 1002 can be used to execute all operations other than the transceiver operations performed by the receiving device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein. As another possible implementation, the transceiver module 901 in Figure 9 can be replaced by a transceiver unit that integrates the functions of the transceiver module 901; the processing module 902 can be replaced by a processor that integrates the functions of the processing module 902. Furthermore, the transmitting end device 90 shown in Figure 9 may also include a memory. Alternatively, the transceiver module 1001 in Figure 10 can be replaced by a transceiver unit that integrates the functions of the transceiver module 1001; the processing module 1002 can be replaced by a processor that integrates the functions of the processing module 1002. Furthermore, the receiving end device 100 shown in Figure 10 may also include a memory. Alternatively, when the processing module 902 is replaced by a processor and the transceiver module 901 is replaced by a transceiver, the transmitting end device 90 involved in the embodiments of this application can also be the communication device 110 shown in FIG11. Or, when the processing module 1002 is replaced by a processor and the transceiver module 1001 is replaced by a transceiver, the receiving end device 100 involved in the embodiments of this application can also be the communication device 110 shown in FIG11. The processor can be logic circuit 1101, and the transceiver can be interface circuit 1102. Furthermore, the communication device 110 shown in Figure 11 may also include a memory 1103. The memory 1103 can exist independently of the processor or be integrated with it. The memory 1103 can be used to store instructions, program code, or some data. The memory 1103 can be located inside or outside the communication device 110, without limitation. This application also provides a communication device, as shown in FIG12. This communication device can be applied to the methods shown in any of the embodiments of FIG7 to FIG8. As shown in FIG12, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the sending or receiving device involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device. In one example, the communication device functions as a transmitting device or is a chip applied within a transmitting device, and executes the steps performed by the transmitting device in the above method embodiments. The transceiver module is used to specifically execute the transmitting and / or receiving actions performed by the transmitting device in any of the embodiments of Figures 7 and 8, for example, supporting the transmitting device in performing other processes of the technology described herein. The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the transmitting device in performing other processes of the technology described herein. To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus. The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to execute the methods involved in any of the embodiments shown in Figures 7 and 8. Further, the processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is mainly responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is mainly responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and conversions. The registers are mainly responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS), an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an in-chip storage module, such as registers or caches. Storage modules can also be external to the chip, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc. This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments. This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments. This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output. The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more. Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus. It is understood that in this application, "at least one (item)" refers to one or more. "More than one" refers to two or more. "At least two (items)" refers to two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) 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 (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action to be taken when the action is taken, nor do they imply any other limitations. In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding. In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source. Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above. In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms. The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. 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 can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit. If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor 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.

Claims

1. A communication method characterized by comprising: The method comprises: performing distribution matching on the first sequence according to the normalized energy to obtain a second sequence; wherein the first sequence comprises K1 bits in a payload bit sequence with a length of K, and K1 is a positive integer less than or equal to K; and K is a positive integer; outputting the second sequence.

2. The method of claim 1, wherein, The performing distribution matching on the first sequence according to the normalized energy to obtain a second sequence comprises: performing distribution matching on the first sequence according to the normalized energy to obtain a first symbol sequence; obtaining the second sequence by performing a first transformation on the first symbol sequence.

3. The method of claim 2, wherein: a length of the first symbol sequence is determined according to a number of resource elements (REs) corresponding to a transmission resource.

4. The method of any one of claims 1-3, wherein: K1 is a result of rounding a product of a first value and a distribution matching code rate; wherein the first value is less than or equal to the number of REs corresponding to the transmission resource.

5. The method of any one of claims 1-4, wherein: a length of the second sequence is determined according to the number of REs corresponding to the transmission resource and a first factor; wherein the first factor is a number of bits in Q bits corresponding to a modulation symbol that are subjected to the distribution matching, and Q is a positive integer.

6. The method according to any one of claims 1 to 5, characterized in that, The performing distribution matching on the first sequence comprises: dividing the first sequence into C third sequences according to the normalized energy; wherein C is a positive integer; performing distribution matching on an i-th third sequence of the C third sequences to obtain an i-th second symbol sequence; wherein i = 0, 1, …, C-1.

7. The method of claim 6, wherein: a length of the i-th third sequence is determined according to the distribution matching code rate and a length of the i-th second symbol sequence.

8. The method of claim 7, wherein: the length of the i-th third sequence is a result of rounding a ratio of a first product and 2; wherein the first product is a product of the length of the i-th second symbol sequence and the distribution matching code rate.

9. The method of any one of claims 6-8, wherein: 2 of L i an element in the mth row and the nth column in the first correspondence relationship; wherein, the L i is a length of the ith third sequence; the first correspondence relationship is determined according to a first factor, the m is determined according to a length of the ith second symbol sequence and the normalized energy, and the n is a length of the ith second symbol sequence; the first factor is a number of bits in Q bits corresponding to a modulation symbol that are subjected to distribution matching, and Q is a positive integer.

10. The method of claim 9, wherein, The m is determined according to the length of the i-th second symbol sequence and the normalized energy, comprising: the m is a result of rounding a product of the length of the i-th second symbol sequence and the normalized energy.

11. The method according to claim 9 or 10, characterized in that, The first correspondence is determined according to a first factor, comprising: determining an alphabet according to the first factor; wherein the alphabet comprises values of symbols in the second symbol sequence; determining the first correspondence according to the alphabet.

12. The method of claim 11, wherein: a size of the alphabet is 2 raised to the power of p, and p is a ratio of the first factor and 2.

13. The method of claim 11 or 12, wherein: The first correspondence includes elements in the first m+1 rows and the first n+1 columns in a preset correspondence corresponding to the alphabet. The first correspondence is determined according to the alphabet and energy corresponding to letters in the alphabet; wherein the first correspondence includes m+1 rows and n+1 columns of elements, and an element in the mth row and the nth column in the first correspondence is greater than or equal to 2 Li .

14. The method according to any one of claims 6-13, characterized in that, The distribution matching on the i-th third sequence in the C third sequences to obtain an i-th second symbol sequence includes: According to the first correspondence, the i-th third sequence is distribution matched to obtain the i-th second symbol sequence, wherein the first correspondence is determined according to the first factor; wherein the first factor is the number of bits in Q bits corresponding to a modulation symbol that are distribution matched, and Q is a positive integer.

15. The method of any one of claims 1-14, wherein The distribution matched code rate corresponds to a code rate of a first MCS index in a modulation and coding strategy (MCS) table, a spectral efficiency of the first MCS index, a first factor of the first MCS index, and a modulation order of the first MCS index; wherein the code rate of the first MCS index is less than or equal to a first threshold, and the first factor is the number of bits in Q bits corresponding to a modulation symbol that are distribution-matched, and Q is a positive integer.

16. The method of claim 15, wherein The code rate of the first MCS index is a ratio of a second product to a modulation order of the first MCS index; wherein the second product is a product of 1024 and a second value, and the second value is a sum of a first difference and a first factor of the first MCS index, and the first difference is a difference between the spectral efficiency of the first MCS index and the distribution matched code rate.

17. The method of claim 15 or 16, wherein The distribution matched code rate is any one of 1.7, 1.8, or 1.

9.

18. The method according to any one of claims 1 to 17, characterized in that, The method further includes: Determining the distribution matched code rate from the MCS table according to the MCS index; wherein the MCS index is positively correlated with the distribution matched code rate corresponding to the MCS index.

19. The method of claim 18, wherein, The second MCS index is located in an x-th first preset interval of X first preset intervals, and the third MCS index is located in an x+1-th first preset interval of the X first preset intervals, The distribution matched code rate corresponding to the second MCS index is less than the distribution matched code rate corresponding to the third MCS index; wherein x = 1, 2, …, X, the second MCS index is less than the third MCS index, and the X first preset intervals are consecutive.

20. The method of claim 18 or 19, wherein The distribution matched code rates corresponding to at least two MCS indexes located in the same first preset interval are the same.

21. The method according to any one of claims 18-20, characterized by, A first spectral efficiency is located in a y-th second preset interval of Y second preset intervals, and a second spectral efficiency is located in a y+1-th second preset interval of the Y second preset intervals, The distribution matched code rate corresponding to the first spectral efficiency is less than the distribution matched code rate corresponding to the second spectral efficiency; wherein y = 1, 2, …, Y, the first spectral efficiency is less than the second spectral efficiency, and the Y second preset intervals are consecutive.

22. The method of any of claims 18-21, wherein, at least two spectrum efficiencies corresponding to the same second preset interval have the same distribution matched code rate.

23. The method of any of claims 2-22, wherein, The average energy per symbol corresponding to the first symbol sequence is determined according to the energy corresponding to the jth symbol in the alphabet and the output probability corresponding to the jth symbol; j=0, 1, 2, …, 2 p -1, and p is a positive integer.

24. A method of communication, comprising: comprises: receiving to-be-coded information; wherein the to-be-coded information corresponds to a fifth sequence; performing inverse distribution matching on the fifth sequence according to normalized energy to obtain a sixth sequence; wherein the normalized energy is determined according to a distribution matched code rate.

25. The method of claim 24, wherein, performing a second transform on the fifth sequence to obtain a third symbol sequence; performing inverse distribution matching on the third symbol sequence according to the normalized energy to obtain the sixth sequence.

26. The method of claim 25, wherein, The inverse distribution matching on the third symbol sequence comprises: dividing the third symbol sequence into C fourth symbol sequences according to the normalized energy; performing inverse distribution matching on an i-th fourth symbol sequence of the C fourth symbol sequences to obtain an i-th seventh sequence; wherein i = 0, 1, …, C-1.

27. A communications device, characterized by The communication device comprises at least one processor; the at least one processor is configured to run a computer program or instructions, so that the communication method as claimed in any of claims 1-23 is executed, or so that the communication method as claimed in any of claims 24-26 is executed.

28. The communication apparatus according to claim 27, wherein, The communication device further comprises a memory configured to store the computer program or instructions.

29. A communications device, characterized by The communication device comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to execute the communication method as claimed in any of claims 1-23, or execute the communication method as claimed in any of claims 24-26, process and / or generate the information according to the information.

30. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions or programs, when the computer instructions or programs are run on a computer, so that the communication method as claimed in any of claims 1-23 is executed, and / or so that the communication method as claimed in any of claims 24-26 is executed.

31. A computer program product, characterised in that, The computer program product comprises computer instructions; when part or all of the computer instructions are run on a computer, so that the communication method as claimed in any of claims 1 -23 is executed, and / or so that the communication method as claimed in any of claims 24 - 26 is executed.

Images