Communication method and apparatus

Abstract

A communication method and apparatus, relating to the field of communication technology, can reduce the complexity of distributed matching and the implementation complexity of the system. The method includes: a transmitting device acquiring a first sequence, the first sequence comprising K1 bits of a payload bit sequence of length K, the first sequence comprising X second sequences; performing distributed matching on the X second sequences to obtain X third sequences; concatenating the X third sequences to obtain a fourth sequence; and outputting the fourth sequence. Wherein, K1 is a positive integer less than or equal to K, X is a positive integer greater than 1, and the length of the third sequence is determined based on the number of resource units corresponding to the transmission resource and a first value, where the first value is a positive integer.

Description

Technical Field

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

[0002] In communication systems, higher-order modulation refers to mapping a binary bit sequence to a modulation symbol sequence to improve spectral efficiency. Specifically, the transmitting device can cascade a pre-encoder (also called a distribution matcher) before encoding. The pre-encoder performs distribution matching on a portion of the payload bit sequence (mapping the bit sequence to a sequence that follows a specific distribution) to obtain the output sequence. This output sequence ensures that the frequencies of each symbol follow or closely approximate a preset specific distribution, thereby saving transmission power.

[0003] However, the complexity of distribution matching increases with the code length, leading to an increase in the implementation complexity of the system. Summary of the Invention

[0004] This application provides a communication method and apparatus that can reduce the complexity of distributed matching and the implementation complexity of the system.

[0005] 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: acquiring a first sequence, the first sequence comprising K1 bits from a payload bit sequence of length K, the first sequence comprising X second sequences; performing distribution matching on the X second sequences to obtain X third sequences; concatenating the X third sequences to obtain a fourth sequence; and outputting the fourth sequence. Wherein, K1 is a positive integer less than or equal to K, X is a positive integer greater than 1, and the length of the third sequence is determined based on the number of resource units corresponding to the transmission resource and a first value, where the first value is a positive integer.

[0006] Based on the first aspect, when the transmitting device performs distribution matching on some or all bits of the payload bit sequence (i.e., the first sequence), it can divide the first sequence into X second sequences and perform distribution matching on each of the X second sequences. This reduces the complexity of distribution matching and improves communication performance. Furthermore, the transmitting device can determine the length of the third sequence, i.e., the output length of the distribution matching, based on the number of resource units corresponding to the transmission resources and the first value. By limiting the output length of the distribution matching, the complexity of distribution matching can be reduced while improving its performance.

[0007] In one possible design, the total length of the X third sequences is less than or equal to the maximum total output length corresponding to the distribution matching; wherein the maximum total output length is determined based on the number of resource units corresponding to the transmission resources.

[0008] Based on this possible design, when the total length of the X third sequences is equal to the maximum total output length corresponding to the distribution matching, the performance of the distribution matching can be improved while ensuring the shaping effect. When the total length of the X third sequences is less than the maximum total output length corresponding to the distribution matching, the processing complexity can be reduced.

[0009] In one possible design, the first value is the maximum value of the lengths of the X third sequences.

[0010] In one possible design, the first value is any of the following: 1024, 512, 256, 128, 96, 64, 32, or 16.

[0011] Based on the two possible designs mentioned above, the first value can be the maximum distribution matching output length supported by this distribution matching method. When the length of the third sequence is the first value, rate matching is not required, thus reducing the implementation complexity.

[0012] In one possible design, the X third sequences include T third sequences of length 1; where T is a positive integer.

[0013] In one possible design, T equals X, where X is the ratio of the maximum total output length corresponding to the distribution matching to the first value; or, X is the floor result of the ratio of the maximum total output length corresponding to the distribution matching to the first value; wherein, the maximum total output length is determined according to the number of resource units corresponding to the transmission resource.

[0014] Based on this possible design, the lengths of the X third sequences are all the first value, which can support distribution matching of fixed length (i.e., the first value), thus reducing the implementation complexity of distribution matching. Optionally, if the first value is the distribution matching output length supported by this distribution matching method, since the lengths of the X third sequences are all the distribution matching output lengths supported by the distribution matching method, rate matching is not required, further reducing implementation complexity.

[0015] In one possible design, T is less than X, and X is greater than or equal to the rounded-up result of the ratio of the maximum total output length corresponding to the distribution matching to the first value; wherein, the maximum total output length is determined according to the number of resource units corresponding to the transmission resource.

[0016] Based on this possible design, the transmitting device can determine that T is less than X if the ratio of the maximum total output length corresponding to the distribution match to the first value is not a positive integer. Alternatively, it can be described as determining that T is less than X if the remainder after dividing the maximum total output length corresponding to the distribution match by the first value is not 0.

[0017] Additionally, the length excluding the total length of the T third sequences from the maximum total output length corresponding to the distribution matching can be called the first length (or remaining length), which is less than a first value. For this first length, the lengths of the XT third sequences can be determined. The length of each of these XT third sequences is less than the first value. The lengths of different third sequences within these XT sequences can be the same or different, without restriction. This aims to involve as many bits as possible in the distribution matching process, thereby improving its performance.

[0018] In one possible design, the X third sequences also include A third sequences of length 2, where the second value is less than the first value and A is a positive integer.

[0019] Based on this possible design, by determining A third sequences of length 2, more bits can be involved in distribution matching, thereby improving distribution matching performance.

[0020] In one possible design, the X third sequences also include B third sequences of length 3; wherein the third value is different from the second value, the third value is less than the first value, and B is a positive integer.

[0021] Based on this possible design, by determining B third sequences of length 3, more bits can participate in distribution matching, thereby improving distribution matching performance.

[0022] In one possible design, the X third sequences also include XT third sequences, where the length of each of the XT third sequences is less than the first value.

[0023] In one possible design, the total length of the XT third sequences is less than or equal to the first length, which is the difference between the maximum total output length corresponding to the distribution matching and the total length of the T third sequences.

[0024] Based on this possible design, when the total length of the XT third sequences is equal to the first length, more bits can participate in the distribution matching process, improving the distribution matching performance and ensuring the shaping effect.

[0025] In one possible design, the length of each of the XT third sequences belongs to a first set, which includes one or more distribution matching output lengths supported by the current distribution matching method.

[0026] Based on this possible design, the lengths of the XT third sequences are all the distribution matching output lengths supported by this distribution matching method, so rate matching is not required, reducing the implementation complexity.

[0027] In one possible design, the length of the third sequence is determined based on the number of resource units corresponding to the transmission resource, a first value, and a first factor; wherein the first factor is a positive integer.

[0028] In one possible design, the total length of the X third sequences is less than or equal to the maximum total output length corresponding to the distribution matching; wherein the maximum total output length is determined based on the number of resource units corresponding to the transmission resources and a first factor, where the first factor is a positive integer.

[0029] Based on the two possible designs mentioned above, the first factor is used to indicate the number of bits that have undergone distribution matching among the Qm bits corresponding to the modulation symbol. Based on the first factor and the number of resource units corresponding to the transmission resources, the maximum total output length corresponding to the distribution matching can be determined more accurately. Then, the length of the third sequence can be determined based on the maximum total output length and the first value, thereby improving the distribution matching performance.

[0030] In one possible design, the length of the i-th second sequence is determined based on the distribution matching code rate and the length of the i-th third sequence, i = 1, 2, 3, ..., X.

[0031] Based on this possible design, the distributed matching code rate is used to indicate the length correspondence between the distributed matching input sequence and the output sequence. The length of the second sequence can be determined more accurately based on this distributed matching code rate.

[0032] 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: acquiring information to be decoded; determining X fifth sequences based on the information to be decoded; performing inverse distribution matching on the X fifth sequences to obtain X sixth sequences; concatenating the X sixth sequences; and outputting the concatenated result. Wherein, the information to be decoded corresponds to a payload bit sequence of length K, and the length of the fifth sequence is determined based on the number of resource units corresponding to the transmission resource and a first value, where the first value is a positive integer and X is a positive integer greater than 1.

[0033] Based on the second aspect, corresponding to the transmitting device determining X second sequences based on the payload bit sequence and performing distribution matching on each of the X second sequences, the receiving device, during decoding, can determine X fifth sequences based on the information to be decoded and perform inverse distribution matching on each of the X fifth sequences, thereby improving decoding performance. Furthermore, the receiving device can determine the length of the fifth sequence, i.e., the input length of the inverse distribution matching, based on the number of resource units corresponding to the transmission resources and the first value. By limiting the input length of the inverse distribution matching, the complexity of inverse distribution matching can be reduced while improving its performance.

[0034] In one possible design, the total length of the X fifth sequences is less than or equal to the maximum total input length corresponding to the inverse distribution matching; wherein the maximum total input length is determined based on the number of resource units corresponding to the transmission resources.

[0035] Based on this possible design, the performance of inverse distribution matching can be improved when the total length of the X fifth sequences is equal to the maximum total input length corresponding to inverse distribution matching. Conversely, the processing complexity can be reduced when the total length of the X fifth sequences is less than the maximum total input length corresponding to inverse distribution matching.

[0036] In one possible design, the first value is the maximum value of the lengths of the X fifth sequences.

[0037] In one possible design, the first value is any of the following: 1024, 512, 256, 128, 96, 64, 32, or 16.

[0038] Based on the two possible designs mentioned above, the first value can be the maximum inverse distribution matching input length supported by this inverse distribution matching method. When the length of the fifth sequence is the first value, it is not necessary to perform solution rate matching, thus reducing the implementation complexity.

[0039] In one possible design, the X fifth sequences comprise T third sequences of length 1; where T is a positive integer.

[0040] In one possible design, T equals X, where X is the ratio of the maximum total input length corresponding to the inverse distribution matching to the first value; or, X is the floor result of the ratio of the maximum total input length corresponding to the inverse distribution matching to the first value; wherein, the maximum total input length is determined according to the number of resource units corresponding to the transmission resource.

[0041] Based on this possible design, the lengths of the X fifth sequences are all the first value, which can support inverse distribution matching of fixed length (i.e., the first value), thus reducing the implementation complexity of inverse distribution matching. Optionally, if the first value is the inverse distribution matching input length supported by this inverse distribution matching method, since the lengths of the X fifth sequences are all the inverse distribution matching input length supported by the inverse distribution matching method, it is not necessary to perform solution rate matching, further reducing implementation complexity.

[0042] In one possible design, T is less than X, and X is greater than or equal to the rounded-up result of the ratio of the maximum total input length corresponding to the inverse distribution matching to the first value; wherein, the maximum total input length is determined according to the number of resource units corresponding to the transmission resource.

[0043] Based on this possible design, the receiving device can determine that T is less than X if the ratio of the maximum total input length corresponding to the inverse distribution matching to the first value is not a positive integer. Alternatively, it can be described as determining that T is less than X if the remainder after dividing the maximum total input length corresponding to the inverse distribution matching by the first value is not 0.

[0044] Furthermore, the length excluding the total length of the T fifth sequences from the maximum total input length corresponding to the inverse distribution matching can be called the first length (or remaining length), which is less than a first value. For this first length, the lengths of the XT fifth sequences can be determined. The length of each of these XT fifth sequences is less than the first value. Different fifth sequences within these XT sequences can have the same length or different lengths, without restriction. This aims to involve as many bits as possible in the inverse distribution matching, thereby improving its performance.

[0045] In one possible design, the X fifth sequences also include A fifth sequences of length 2, where the second value is less than the first value and A is a positive integer.

[0046] Based on this possible design, by determining A fifth sequences of length 2, more bits can participate in distribution matching, thereby improving distribution matching performance.

[0047] In one possible design, the X fifth sequences also include B fifth sequences of length three; wherein the third value is different from the second value, the third value is less than the first value, and B is a positive integer.

[0048] Based on this possible design, by determining B fifth sequences of length three, more bits can participate in distribution matching, thereby improving distribution matching performance.

[0049] In one possible design, the X fifth sequences also include XT fifth sequences, where the length of each of the XT fifth sequences is less than the first value.

[0050] In one possible design, the total length of the XT fifth sequences is less than or equal to the first length, which is the difference between the maximum total length of the input corresponding to the inverse distribution matching and the total length of the T fifth sequences.

[0051] Based on this possible design, when the total length of the XT fifth sequences is equal to the first length, more bits can participate in the inverse distribution matching process, improving the performance of the inverse distribution matching and ensuring the shaping effect.

[0052] In one possible design, the length of each of the XT fifth sequences belongs to a first set, which includes one or more inverse distribution matching input lengths supported by this inverse distribution matching method.

[0053] Based on this possible design, the lengths of the XT fifth sequences are all the inverse distribution matching input lengths supported by this inverse distribution matching method, which can reduce the implementation complexity.

[0054] In one possible design, the length of the fifth sequence is determined based on the number of resource units corresponding to the transmission resource, a first value, and a first factor; wherein the first factor is a positive integer.

[0055] In one possible design, the total length of the X fifth sequences is less than or equal to the maximum total input length corresponding to the inverse distribution matching; wherein, the maximum total input length is determined based on the number of resource units corresponding to the transmission resources and a first factor, where the first factor is a positive integer.

[0056] Based on the two possible designs mentioned above, the first factor is used to indicate the number of bits that have undergone distribution matching among the Qm bits corresponding to the modulation symbol. According to the first factor and the number of resource units corresponding to the transmission resources, the maximum total input length corresponding to the inverse distribution matching can be determined more accurately. Then, the length of the fifth sequence can be determined according to the maximum total input length and the first value, thereby improving the distribution matching performance.

[0057] In one possible design, the length of the i-th sixth sequence is determined based on the distribution matching code rate and the length of the i-th fifth sequence, i = 1, 2, 3, ..., X.

[0058] Based on this possible design, the distributed matching code rate is used to indicate the length correspondence between the distributed matching input sequence and the output sequence. The length of the sixth sequence can be determined more accurately based on this distributed matching code rate.

[0059] Thirdly, this application provides 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.

[0060] For example, the processing module is used to obtain a first sequence, which includes K1 bits from a payload bit sequence of length K. The first sequence includes X second sequences. The processing module is also used to perform distribution matching on the X second sequences to obtain X third sequences, concatenate the X third sequences to obtain a fourth sequence, and output the fourth sequence. Here, K1 is a positive integer less than or equal to K, X is a positive integer greater than 1, and the length of the third sequence is determined based on the number of resource units corresponding to the transmission resource and a first value, where the first value is a positive integer.

[0061] 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.

[0062] Fourthly, this application provides 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.

[0063] For example, the transceiver module is used to acquire the information to be decoded, and the processing module is used to determine X fifth sequences based on the information to be decoded, perform inverse distribution matching on the X fifth sequences to obtain X sixth sequences, concatenate the X sixth sequences, and output the concatenated result. Here, the information to be decoded corresponds to a payload bit sequence of length K, and the length of the fifth sequence is determined based on the number of resource units corresponding to the transmission resources and a first value, where the first value is a positive integer and X is a positive integer greater than 1.

[0064] 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.

[0065] Fifthly, this application provides a communication device comprising one or more processors; the one or more processors being 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.

[0066] 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.

[0067] 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.

[0068] In a sixth aspect, this application provides a communication device including an interface circuit and a logic circuit; the interface circuit is used for inputting and / or outputting information; the logic circuit is used for performing the communication method as described in any one of the first to second aspects, processing and / or generating information based on the information.

[0069] In a seventh aspect, this application provides 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.

[0070] Eighthly, this application provides 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.

[0071] Ninthly, this application provides 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.

[0072] In a tenth aspect, this application provides a chip comprising: a processor coupled to a memory for storing programs or instructions, wherein when the programs or instructions are executed by the processor, a communication method as described in any one of the first to second aspects is executed.

[0073] The technical effects of any of the design methods in aspects five through ten are similar to those in aspects one through two, and will not be elaborated upon further.

[0074] In one aspect, this application provides 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

[0075] Figure 1 A schematic diagram of a probability shaping process provided in an embodiment of this application;

[0076] Figure 2 This is a schematic diagram of constellation distribution provided in an embodiment of this application;

[0077] Figure 3 A schematic diagram of a communication system provided in an embodiment of this application;

[0078] Figure 4 A flowchart of encoding and decoding is provided for embodiments of this application;

[0079] Figure 5 This is a schematic diagram of the composition of a communication device provided in an embodiment of this application;

[0080] Figure 6 A flowchart illustrating a communication method provided in an embodiment of this application;

[0081] Figure 7 A schematic diagram of the length of X third sequences provided in this application embodiment. Figure 1 ;

[0082] Figure 8A schematic diagram of the length of X third sequences provided in this application embodiment. Figure 2 ;

[0083] Figure 9 A schematic diagram of the length of X third sequences provided in this application embodiment. Figure 3 ;

[0084] Figure 10 A schematic diagram of the length of X third sequences provided in this application embodiment. Figure 4 ;

[0085] Figure 11 A schematic diagram of the length of X third sequences provided in this application embodiment. Figure 5 ;

[0086] Figure 12 A flowchart illustrating yet another communication method provided in an embodiment of this application;

[0087] Figure 13 A schematic diagram of a symbol-level AESS provided for an embodiment of this application;

[0088] Figure 14 A schematic diagram of a CCDM provided in an embodiment of this application;

[0089] Figure 15 A schematic diagram of polar code distribution matching provided for an embodiment of this application;

[0090] Figure 16 A schematic diagram of a transmitting device provided in an embodiment of this application;

[0091] Figure 17 A schematic diagram of a receiving device provided in an embodiment of this application;

[0092] Figure 18 A schematic diagram of a communication device provided in an embodiment of this application;

[0093] Figure 19 This is a structural diagram of a communication device provided in an embodiment of this application. Detailed Implementation

[0094] Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described.

[0095] In communication systems, higher-order modulation can improve spectral efficiency. Higher-order modulation refers to mapping multiple bits to the same channel symbol, thereby further enhancing spectral efficiency. Common higher-order modulation schemes include quadrature amplitude modulation (QAM), 64QAM, and 256QAM.

[0096] 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, b1 and b2 are both amplitude bits, and b0, b1, and b2 are sorted from high to low reliability as: b0, b1, b2.

[0097] Table 1. Mapping relationship between bit values ​​and modulation symbols

[0098] b0 1 1 1 1 0 0 0 0 b1 1 1 0 0 0 0 1 1 b2 1 0 0 1 1 0 0 1 x -7 -5 -3 -1 1 3 5 7

[0099] In high-order modulation transmission, transmission performance can be further improved through probabilistic shaping. Since different modulation symbols in high-order modulation may have different energies, average energy can be saved by transmitting more low-energy modulation symbols and fewer high-energy ones. Theoretical analysis shows that for a Gaussian white noise channel, the greatest energy saving occurs when the distribution of transmitted modulation symbols follows a Gaussian distribution. Compared to a uniform distribution, up to 1.53 dB of transmission power can be saved.

[0100] Probabilistic shaping is a common "shaping" technique, and its typical flowchart can be shown as follows: Figure 1 As shown, by cascading a precoder (also known as a distribution matcher (DM)) before the encoder, this precoding or distribution matching can also be called transformation, shaping, or probabilistic shaping, etc., to transform the payload bit sequence (such as u1, u2, ..., u...). K Some or all of the bits in ) Figure 1 The first bit sequence in the sequence is mapped to a sequence that follows a specific distribution (such as...). Figure 1 The second bit sequence in the sequence is encoded using a systematic code to represent the remaining bits in the sequence and payload bit sequence that follow a specific distribution (such as the second bit sequence). Figure 1 The third bit sequence in the sequence is encoded so that the bit sequence that meets the specific distribution appears directly in the encoded sequence. By modulating the encoded sequence, the final modulation symbol can be shaped, saving average energy and reducing transmission power.

[0101] For example, the constellation distribution after "remodeling" can be as follows: Figure 2As shown, the horizontal axis represents the modulation symbol, the vertical axis represents the probability, and the square of the modulation symbol reflects the energy level; 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. Figure 2 It can be seen that the probability of low-energy modulation symbols appearing is higher than that of high-energy modulation symbols, which can save average energy and reduce transmission power.

[0102] However, the complexity of distributed matching increases with the code length, affecting system performance.

[0103] To address the aforementioned technical problems, this application provides a communication method. The method includes: a transmitting device acquiring a first sequence, the first sequence comprising K1 bits from a payload bit sequence of length K, the first sequence comprising X second sequences; performing distribution matching on the X second sequences to obtain X third sequences; concatenating the X third sequences to obtain a fourth sequence; and outputting the fourth sequence. Wherein, K1 is a positive integer less than or equal to K, X is a positive integer greater than 1, and the length of the third sequence is determined based on the number of resource units corresponding to the transmission resource and a first value, where the first value is a positive integer.

[0104] In this embodiment, when the transmitting device performs distribution matching on some or all bits of the payload bit sequence (i.e., the first sequence), it can divide the first sequence into X second sequences and perform distribution matching on each of the X second sequences. This reduces the complexity of distribution matching and improves communication performance. Furthermore, the transmitting device can determine the length of the third sequence, i.e., the output length of the distribution matching, based on the number of resource units corresponding to the transmission resources and a first value. By limiting the output length of the distribution matching, the complexity of distribution matching can be reduced while improving its performance.

[0105] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0106] 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, a 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.

[0107] 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.

[0108] The following is based on Figure 3 Taking an example, the communication system provided in the embodiments of this application will be described.

[0109] Figure 3 A schematic diagram of a communication system provided in an embodiment of this application is shown below. Figure 3 As shown, the communication system may include at least one terminal device and at least one network device.

[0110] in, Figure 3 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 transmit it to the terminal device via air interface after constellation modulation (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 transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting device, and the network device is the receiving device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting and receiving devices can both be network devices or both be terminal devices, without restriction.

[0111] Figure 3 The terminal equipment in this context 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. Terminal equipment can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0112] For example, Figure 3The terminal device can be a mobile phone, tablet computer, or computer with wireless transceiver capabilities. Terminal devices can also be user stations, mobile stations, remote stations, remote terminal devices, mobile terminal devices, user terminal devices, wireless communication devices, 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 devices, wearable devices, terminal devices 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.

[0113] in, Figure 3 The network equipment in this context 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 configurable within such devices, a logical node or 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 equipment can be either wired or wireless access-enabled.

[0114] 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, baseband 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.

[0115] 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.

[0116] 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).

[0117] 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).

[0118] 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 radioaccess 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 a software module, a hardware module, or a combination of software and hardware modules.

[0119] 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.

[0120] Optionally, in the embodiments of this application, the transmitting device (or source) and the receiving device (or sink) can adopt the following... Figure 4 The process shown involves encoding and decoding. The transmitting device can be... Figure 3 Any terminal device or network device in the communication system shown, the receiving device can also be Figure 3 Any terminal device or network device in the communication system shown.

[0121] In this process, the transmitting device can perform source encoding on its own generated bits to obtain a source bit stream, perform channel encoding on the source bit stream, and then modulate it before transmitting the modulated symbols to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it can demodulate them, then perform channel decoding to recover the source bit stream, and finally perform source decoding to obtain the decoding result.

[0122] In practical implementation, Figure 3 As shown in the figure: various terminal devices and network devices can adopt Figure 5 The shown composition structure, or including Figure 5 The components shown. Figure 5 This is a schematic diagram illustrating the composition of a communication device 500 provided in an embodiment of this application. The communication device 500 can be a terminal device or a chip or system-on-a-chip within a terminal device; it can also be a network device or a chip or system-on-a-chip within a network device. For example... Figure 5 As shown, the communication device 500 includes a processor 501, a transceiver 502, and a communication line 503.

[0123] Furthermore, the communication device 500 may also include a memory 504. The processor 501, memory 504, and transceiver 502 can be connected via a communication line 503.

[0124] The processor 501 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 501 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0125] Transceiver 502 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 networks (WLAN), etc. Transceiver 502 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0126] Communication line 503 is used to transmit information between the components included in communication device 500.

[0127] Memory 504 is used to store instructions. These instructions can be computer programs.

[0128] The memory 504 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, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0129] It should be noted that the memory 504 can exist independently of the processor 501 or can be integrated with the processor 501. The memory 504 can be used to store instructions, program code, or some data, etc. The memory 504 can be located inside or outside the communication device 500, without limitation. The processor 501 is used to execute the instructions stored in the memory 504 to implement the communication method provided in the following embodiments of this application.

[0130] In one example, processor 501 may include one or more CPUs, for example Figure 5 CPU0 and CPU1 in the CPU.

[0131] As an optional implementation, the communication device 500 includes multiple processors, for example, besides Figure 5 In addition to processor 501, it may also include processor 507.

[0132] As an optional implementation, the communication device 500 also includes an output device 505 and an input device 506. For example, the input device 506 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 505 is a device such as a display screen or speaker.

[0133] It should be noted that the communication device 500 can be a desktop computer, laptop computer, network server, mobile phone, tablet computer, wireless terminal, embedded device, chip system, or other device. Figure 5 Equipment with a similar structure. Furthermore... Figure 5 The structural composition shown does not constitute a limitation on the communication device, except... Figure 5In addition to the components shown, the communication device may include more or fewer components than illustrated, or combine certain components, or have different component arrangements.

[0134] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0135] 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.

[0136] The following is combined Figure 3 The communication system shown refers to the following Figure 6 The communication method provided in the embodiments of this application is described below, wherein the sending device can be... Figure 3 Any terminal device or network device in the communication system shown, the receiving device can also be Figure 3 Any terminal device or network device in the communication system shown. The transmitting or receiving device described in the following embodiments may have... Figure 5 The component shown.

[0137] Figure 6 A flowchart of a communication method provided in an embodiment of this application is shown below. Figure 6 As shown, the method may include:

[0138] Step 601: The sending device obtains the first sequence.

[0139] The first sequence may include K1 bits from a payload bit sequence of length K, where K1 is a positive integer less than or equal to K. Alternatively, it can be described as: the first sequence includes K1 bits, or the first sequence includes K1 payload bits.

[0140] 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.

[0141] For example, K can be determined based on the number of resource elements (REs) corresponding to the transmission resource and the spectral efficiency (SE). For instance, K is equal to the product of the number of resource elements corresponding to the transmission resource and the spectral efficiency. The spectral efficiency can be determined from the MCS table based on the modulation and coding scheme (MCS) index.

[0142] The first sequence includes bits that undergo distribution matching (or are described as shaping, forming, probabilistic shaping, or transformation) in the payload bit sequence, and passes through the distribution matching module (or transformation module, distribution matcher, etc.) during the encoding process. This first sequence can also be described as the input sequence of the distribution matching module, and its length K1 can also be described as the input length of the distribution matching module.

[0143] The first sequence can include X second sequences, or can be described as dividing the first sequence into X second sequences. X is a positive integer greater than 1.

[0144] The total length of the X second sequences is K1. The length of the i-th second sequence is determined based on the length of the i-th third sequence, where i = 1, 2, 3, ..., X. The description of the length of the third sequence can be found in the relevant description in step 602 below, and will not be repeated here.

[0145] For example, the length of the i-th second sequence can be determined based on the distribution matching code rate and the length of the i-th third sequence.

[0146] For example, the length of the i-th second sequence Among them, L out,i R represents the length of the i-th third sequence. DM denoted as the distribution matching code rate, and 'a' represents the first factor. The description of this first factor can be found in the relevant description in step 602 below, and will not be repeated here.

[0147] Based on this Or described as

[0148] It is understood that in the embodiments of this application, both the second sequence and the third sequence are bit sequences.

[0149] The distribution matching code rate is used to indicate the length correspondence between the input and output sequences of the distribution matching sequence.

[0150] Optionally, for an MCS index, a corresponding distribution matching code rate can be predefined. When encoding, the transmitting device can determine the corresponding distribution matching code rate based on the MCS index. For the same MCS index, the distribution matching code rate corresponding to that MCS index is less than or equal to the spectral efficiency corresponding to that MCS index.

[0151] It is understandable that, unlike the above method of determining the first sequence based on the payload bit sequence and then determining X second sequences based on the first sequence, it is also possible to directly determine X second sequences based on the payload bit sequence without any restrictions.

[0152] Step 602: The transmitting device performs distribution matching on the X second sequences to obtain X third sequences.

[0153] The second sequence can also be described as a distribution-matched input sequence, and the third sequence can also be described as a distribution-matched output sequence.

[0154] The length of the third sequence can be determined based on the number of resource units corresponding to the transmission resource and the first value. Different third sequences can have the same or different lengths. Optionally, the length of the third sequence can be determined based on the number of resource units corresponding to the transmission resource, the first value, and the first factor. For details, please refer to the detailed description of the lengths of the X third sequences below; it will not be repeated here.

[0155] In the case where the sending device is a network device, its transmission resources can be determined by the network device itself. In the case where the sending device is a terminal device, its transmission resources can be configured by the network device.

[0156] The first value is a positive integer. This first value can be predefined by the communication protocol or determined through negotiation between the sending and receiving devices; there is no restriction. For example, the sending device can send first indication information to the receiving device, which indicates the first value.

[0157] The first value can be the maximum length of the X third sequences. For example, the first value can be the maximum output length of the distribution matching supported by this distribution matching method. For instance, the first value can be any of the following values: 1024, 512, 256, 128, 96, 64, 32, or 16.

[0158] The first factor is a positive integer. It indicates the number of distributed-matched bits out of the Qm bits corresponding to the modulation symbol, where Qm is the modulation order. Alternatively, it can be described as: the first factor equals the product of the number of distributed-matched bit levels among the Qm bits corresponding to the modulation symbol and 2. One bit in the real or imaginary part corresponds to one bit level. The real and imaginary parts of the modulation symbol have the same bit levels; that is, the distributed-matched bit levels among the Qm / 2 bits corresponding to the real part of the modulation symbol are the same as the distributed-matched bit levels among the Qm / 2 bits corresponding to the imaginary part of the modulation symbol. Therefore, the number of distributed-matched bits among the Qm bits corresponding to the modulation symbol is the same as the product of the number of distributed-matched bit levels among the Qm bits corresponding to the modulation symbol and 2. Thus, the first factor equals the product of the number of distributed-matched bit levels among the Qm bits corresponding to the modulation symbol and 2. The first factor can also be described as the DM output length factor.

[0159] Based on the above description, the first factor is an even number; specifically, the first factor is an even number less than Qm.

[0160] Optionally, for the MCS index, a corresponding first factor can be predefined, and the sending device can determine the corresponding first factor based on the MCS index when performing encoding.

[0161] Based on the above description, the total length of the X third sequences is less than or equal to the maximum total output length corresponding to the distribution matching. This maximum total output length can be determined based on the number of resource units corresponding to the transmission resources. For example, the maximum total output length can be determined based on the number of resource units corresponding to the transmission resources and a first factor. For instance, the maximum total output length is equal to the product of the number of resource units corresponding to the transmission resources and the first factor.

[0162] It is understood that in this embodiment, "the maximum total output length corresponding to the distribution matching" is not the same as "the maximum distribution matching output length supported by this distribution matching method". The maximum distribution matching output length supported by this distribution matching method refers to the maximum distribution matching output length supported by this single distribution matching process. This embodiment requires distribution matching for X second sequences, that is, X distribution matchings are required. The sum of the maximum distribution matching output lengths corresponding to these X distribution matchings is the maximum total output length corresponding to the distribution matching.

[0163] In addition, the distribution matching method can support one or more distribution matching output lengths, and the maximum value of the one or more distribution matching output lengths is the maximum distribution matching output length supported by the above distribution matching method.

[0164] Based on the above description, the sending device performs distribution matching on the X second sequences respectively, which can also be described as the sending device performing shaping, transformation, shaping, or probabilistic shaping on the X second sequences respectively.

[0165] Optionally, the sending device may perform distribution matching on the X second sequences respectively based on the first distribution matching method.

[0166] For example, the first distribution matching method can be a distribution matching method based on arithmetic coding, a distribution matching method based on polar codes, a distribution matching method based on low-density parity check code (LDPC) coding, a distribution matching method based on RM codes, a distribution matching method based on convolutional codes, or a distribution matching method based on RS codes, etc., and there is no limitation. The distribution matching process based on the first distribution matching method can be referred to the relevant description below, and will not be repeated here.

[0167] It is understandable that when the transmitting device performs distribution matching on X second sequences, it can use X distribution matching modules (or shaping modules, forming modules, transformation modules, precoding modules, etc.) to perform distribution matching on X second sequences respectively. That is, each distribution matching module performs distribution matching on one second sequence, thereby shortening the processing latency required for distribution matching.

[0168] Alternatively, the sending device can use a distribution matching module to perform distribution matching on each of the X second sequences, thereby reducing the number of distribution matching modules and lowering hardware overhead.

[0169] Alternatively, the sending device can use fewer than X distribution matching modules to perform distribution matching on X second sequences respectively. That is, each distribution matching module can perform distribution matching on one or more second sequences. On the one hand, this can reduce the number of distribution matching modules and reduce hardware overhead. On the other hand, it can also reduce the processing latency required for distribution matching.

[0170] Step 603: The transmitting device concatenates the X third sequences to obtain a fourth sequence and outputs the fourth sequence.

[0171] After determining the fourth sequence, the transmitting device can also perform encoding, rate matching, channel interleaving, scrambling, modulation and other processes to obtain the modulation symbol sequence, and then send the modulation symbol sequence to the receiving device.

[0172] For example, the transmitting device may encode the fourth sequence using any encoding method. For instance, the transmitting device may use any of the following encoding methods: arithmetic encoding, polar code, LDPC encoding, RM code, convolutional code, or RS code, without limitation.

[0173] In the first possible design, the transmitting device can concatenate the fourth and seventh sequences to obtain the eighth sequence, and then perform encoding, rate matching, channel interleaving, scrambling, modulation, and other processing on the eighth sequence to obtain the modulation symbol sequence.

[0174] The seventh sequence may include K-K1 bits from the information bit sequence other than the first sequence.

[0175] Specifically, the transmitting device can use the first possible design for encoding when a seventh sequence exists. Alternatively, it can be described as the transmitting device using the first possible design for encoding when K1 is less than K. Or, it can be described as the transmitting device using the first possible design for encoding when performing distribution matching on a portion of the information bit sequence.

[0176] In the second possible design, the transmitting device can perform encoding, rate matching, channel interleaving, scrambling, modulation, and other processing on the fourth sequence to obtain a modulation symbol sequence, and then send the modulation symbol sequence to the receiving device.

[0177] In this scenario, the transmitting device can employ the second possible design for encoding when K1 equals K. Alternatively, it can be described as the transmitting device employing the second possible design for encoding when the distribution of all bits in the information bit sequence is matched.

[0178] Based on the above Figure 6 The method shown allows the transmitting device to divide the first sequence into X second sequences when performing distribution matching on some or all bits of the payload bit sequence (i.e., the first sequence). Distributing the matching on each of these X second sequences reduces the complexity of the distribution matching process and improves communication performance. Furthermore, the transmitting device can determine the length of the third sequence (i.e., the output length of the distribution matching) based on the number of resource units corresponding to the transmission resources and a first value. By limiting the output length of the distribution matching, the complexity of the distribution matching process can be reduced while simultaneously improving its performance.

[0179] Based on the above Figure 6 The method shown below will be described in detail below regarding the lengths of the X third sequences:

[0180] Among them, for X third sequences, the lengths of any two third sequences can be the same or different, without restriction.

[0181] Specifically, X third sequences can include T third sequences of length equal to the first value, where T is a positive integer.

[0182] In the first possible design: T equals X.

[0183] Case 1: X third sequences include T third sequences of length equal to the first value, where X is the ratio of the maximum total output length corresponding to the distribution matching to the first value.

[0184] Specifically, the transmitting device can determine that T equals X if the ratio of the maximum total output length corresponding to the distribution match to the first value is a positive integer (i.e., X is a positive integer). Alternatively, it can be described as determining that T equals X if the remainder when the maximum total output length corresponding to the distribution match is divided by the first value is 0.

[0185] In Case 1, X third sequences are equivalent to T third sequences of length 1. The total length of these X third sequences is equal to the product of the first value and X. That is, the total output length of the distribution matching is equal to the maximum total output length corresponding to the distribution matching, which can improve the performance of distribution matching and ensure the shaping effect.

[0186] The correspondence between the maximum total output length and the first value can be predefined. When performing distribution matching, the transmitting device can determine the corresponding first value based on the predefined correspondence and the maximum total output length corresponding to this distribution matching, and then determine the lengths of the X third sequences based on the first value. Optionally, different maximum total output lengths can correspond to different first values, or different ranges of maximum total output lengths can correspond to different first values, while different maximum total output lengths within the same range can correspond to the same first value.

[0187] For example, such as Figure 7 As shown, taking the number of resource units corresponding to the transmission resource as 1024 and the first factor as 2 as an example, the maximum total output length corresponding to the distribution matching can be 1024*2=2048. Assuming the first value is 512, the ratio of 2048 to 512 is a positive integer, so we can determine T=X=2048 / 512=4, that is, X third sequences are 4 third sequences with a length of the first value 512.

[0188] In Case 1 above, the lengths of the X third sequences are all the first value, meaning that Case 1 can support distribution matching with a fixed length (i.e., the first value), which can reduce the implementation complexity of distribution matching.

[0189] Optionally, if the first value is the distribution matching output length supported by the current distribution matching method, since the lengths of the X third sequences are all the distribution matching output lengths supported by the distribution matching method, rate matching is not required, thus reducing the implementation complexity.

[0190] Case 2: X third sequences include T third sequences of length equal to the first value, where X is the floor result of the ratio of the maximum total output length corresponding to the distribution matching to the first value.

[0191] Alternatively, it can be described as the difference between the floor of the ratio of the maximum total output length corresponding to the distribution matching to the first value and 1.

[0192] Specifically, the transmitting device can determine that T equals X if the ratio of the maximum total output length corresponding to the distributed matching to the first value is not a positive integer. This X is equal to the floor function of the ratio of the maximum total output length corresponding to the distributed matching to the first value. Alternatively, it can be described as determining that T equals X if the remainder after dividing the maximum total output length corresponding to the distributed matching by the first value is not zero. This X is equal to the floor function of the ratio of the maximum total output length corresponding to the distributed matching to the first value.

[0193] In case 2, X third sequences are equivalent to T third sequences of length 1. The total length of the X third sequences is equal to the product of the first value and X. The total length of the X third sequences is less than the maximum total output length corresponding to the distribution matching, or it can be described as the total output length of the distribution matching (i.e., the total length of the X third sequences) being less than the maximum total output length corresponding to the distribution matching.

[0194] It is understandable that the length other than the total length of the T third sequences in the maximum output length corresponding to the distribution matching can be called the first length (or the remaining length). This first length is less than the first value, and the bits corresponding to the first length do not need to participate in the distribution matching process. That is, the output of the distribution matching does not have the bits corresponding to the first length. The total output length of the distribution matching is the product of the first value and X.

[0195] The correspondence between the maximum total output length and the first value can be predefined. When performing distribution matching, the transmitting device can determine the corresponding first value based on the predefined correspondence and the maximum total output length corresponding to this distribution matching, and then determine the length of the X third sequences based on the first value. For details, please refer to the detailed description in Case 1 above, which will not be repeated here.

[0196] For example, such as Figure 8 As shown, taking a resource unit quantity of 900 corresponding to the transmission resource and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, then it can be determined that... This indicates rounding down, meaning that the X third sequences are 3 third sequences with a length of the first value 512. The first length is 1800 - 512 * 3 = 264. The bits corresponding to these 264 bits do not need to participate in the distribution matching process. That is, the output of the distribution matching does not contain any bits with a length of 264. The total length of the output of the distribution matching is 512 * 3 = 1536.

[0197] In Case 2 above, the lengths of the X third sequences are all the first value, meaning that Case 2 can support distribution matching with a fixed length (i.e., the first value), which can reduce the implementation complexity of distribution matching.

[0198] Optionally, if the first value is the distribution matching output length supported by the current distribution matching method, since the lengths of the X third sequences are all the distribution matching output lengths supported by the distribution matching method, rate matching is not required, thus reducing the implementation complexity.

[0199] In the second possible design: T is less than X.

[0200] Where T can be equal to the floor of the ratio of the maximum total output length corresponding to the distribution matching to the first value, or it can be described as the floor of the ratio of the maximum total output length corresponding to the distribution matching to the first value to the difference between 1 and 1.

[0201] Specifically, the transmitting device can determine that T is less than X if the ratio of the maximum total output length corresponding to the distribution match to the first value is not a positive integer. Alternatively, it can be described as determining that T is less than X if the remainder after dividing the maximum total output length corresponding to the distribution match by the first value is not 0.

[0202] Based on this, the transmitting device can determine T third sequences with the first value as their length, according to the maximum total output length corresponding to the distribution matching, based on the first value.

[0203] Additionally, the length excluding the total length of the T third sequences from the maximum total length corresponding to the distribution matching can be called the first length (or the remaining length), which is less than the first value. The lengths of the XT third sequences can be determined by referring to case 3 or case 4 below. The length of each of the XT third sequences is less than the first value. The lengths of different third sequences within the XT third sequences can be the same or different, without restriction.

[0204] Case 3: X third sequences include T third sequences of length 1 and A third sequences of length 2; the second sequence is less than the first sequence.

[0205] Where A equals XT.

[0206] In the first example, A can be equal to 1, that is, X third sequences include T third sequences of length 1 and 1 third sequence of length 2.

[0207] The second value can be equal to the first length, or the second value can be less than the first length.

[0208] When the second value equals the first length, the X third sequences include T third sequences of length 1 and 1 third sequence of length 1. The total length of the X third sequences equals the maximum total output length corresponding to the distribution matching, which improves the performance of distribution matching and ensures the shaping effect. Furthermore, if the second value is not a distribution matching output length supported by this distribution matching method, rate matching is required. If the second value is a distribution matching output length supported by this distribution matching method, rate matching is not required, reducing implementation complexity.

[0209] For example, such as Figure 9 As shown in (a), taking a transmission resource with 900 resource units and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, then it can be determined that... This indicates rounding down. The first length is 1800 - 512 * 3 = 264, meaning that the X third sequences include three third sequences with a length of 512 and one third sequence with a length of 264.

[0210] When the second value is less than the first length, the total length of the X third sequences is less than the maximum total output length corresponding to the distribution matching. In this case, bits corresponding to lengths other than the total length of the X third sequences in the maximum total output length corresponding to the distribution matching do not need to participate in the distribution matching process; that is, the output of the distribution matching does not contain bits corresponding to that length. Optionally, the second value can be the distribution matching output length supported by this distribution matching method, thereby eliminating the need for rate matching and reducing implementation complexity.

[0211] For example, such as Figure 9 As shown in (b), taking a resource unit quantity of 900 corresponding to the transmission resource and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 1800 - 512 * 3 = 264. Assuming the second value is 256, then the X third sequences include three third sequences with a length of 512 and one third sequence with a length of 256. The remaining 1800 - 512 * 3 - 256 = 8 bits do not need to participate in the distribution matching process. That is, the output of the distribution matching does not contain any bits with a length of 8. The total length of the output of the distribution matching is 512 * 3 + 256 = 1792.

[0212] In the second example, A can be greater than 1, that is, X third sequences include T third sequences of length 1 and A third sequences of length 2.

[0213] The first length can be a positive integer multiple of the second value, or the first length can not be a positive integer multiple of the second value.

[0214] When the first length is a positive integer multiple of the second value, the product of A and the second value equals the first length. The X third sequences include T third sequences of length 1 and A third sequences of length 2. The total length of the X third sequences equals the maximum total output length corresponding to the distribution matching, which improves the performance of distribution matching and ensures the shaping effect. Furthermore, if the second value is not a distribution matching output length supported by this distribution matching method, rate matching is required. If the second value is a distribution matching output length supported by this distribution matching method, rate matching is not required, reducing implementation complexity.

[0215] For example, such as Figure 10 As shown in (a), taking a resource unit quantity of 900 corresponding to the transmission resource and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 1800 - 512 * 3 = 264. Assuming the second value is 132, then the X third sequences include 3 third sequences with a length of the first value of 512 and 2 third sequences with a length of 132.

[0216] If the first length is not a positive integer multiple of the second value, the product of A and the second value is less than the first length, and the total length of the X third sequences is less than the maximum total output length corresponding to the distribution matching. In this case, bits corresponding to lengths other than the total length of the X third sequences in the maximum total output length corresponding to the distribution matching do not need to participate in the distribution matching process; that is, the output of the distribution matching does not contain bits corresponding to that length. Optionally, the second value can be the distribution matching output length supported by this distribution matching method, thus eliminating the need for rate matching and reducing implementation complexity.

[0217] For example, such as Figure 10 As shown in (b), taking a resource unit quantity of 900 corresponding to the transmission resource and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 1800 - 512 * 3 = 264. Assuming the second value is 128, then the X third sequences include 3 third sequences with a length of 512 and 2 third sequences with a length of 128. The remaining 1800 - 512 * 3 - 128 * 2 = 8 bits do not need to participate in the distribution matching process. That is, the output of the distribution matching does not contain any bits with a length of 8. The total length of the output of the distribution matching is 512 * 3 + 128 * 2 = 1792.

[0218] Optionally, in case 3 above, if the first value is the distribution matching output length supported by the current distribution matching method, since the lengths of the T third sequences are all the distribution matching output lengths supported by the distribution matching method, it is not necessary to perform rate matching on the T third sequences, thus reducing the implementation complexity.

[0219] Case 4: X third sequences include T third sequences of length 1, A third sequences of length 2, and B third sequences of length 3; the second sequence is less than the first sequence, the third sequence is less than the first sequence, and the second sequence is different from the third sequence.

[0220] Where A+B=XT.

[0221] In the first example, (A * second value) + (B * third value) = first length.

[0222] In this case, the total length of the X third sequences is equal to the maximum total output length corresponding to the distribution matching, which can improve the performance of distribution matching and ensure the shaping effect.

[0223] Optionally, the second value can be any value less than the first value, or the second value can be the distribution matching output length supported by this distribution matching method. If the second value is not a distribution matching output length supported by this distribution matching method, rate matching is required. If the second value is a distribution matching output length supported by this distribution matching method, rate matching is not required, reducing implementation complexity.

[0224] Optionally, the third value can be any value less than the first value, or it can be the distribution matching output length supported by this distribution matching method. If the third value is not a distribution matching output length supported by this distribution matching method, rate matching is required. If the third value is a distribution matching output length supported by this distribution matching method, rate matching is not required, reducing implementation complexity.

[0225] For example, such as Figure 11As shown in (a), taking a resource unit quantity of 900 corresponding to the transmission resource and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 1800 - 512 * 3 = 264. Assuming the second value is 128 and the third value is 8, then the X third sequences include 3 third sequences with a length of 512, 2 third sequences with a length of 128, and 1 third sequence with a length of 8.

[0226] In the second example, (A * second value) + (B * third value) < first length.

[0227] In this case, the total length of the X third sequences is less than the maximum total output length corresponding to the distribution matching. In this case, bits corresponding to lengths other than the total length of the X third sequences in the maximum total output length corresponding to the distribution matching do not need to participate in the distribution matching process; that is, the output of the distribution matching does not contain bits corresponding to that length.

[0228] Optionally, the second value can be any value less than the first value, or the second value can be the distribution matching output length supported by this distribution matching method. If the second value is not a distribution matching output length supported by this distribution matching method, rate matching is required. If the second value is a distribution matching output length supported by this distribution matching method, rate matching is not required, reducing implementation complexity.

[0229] Optionally, the third value can be any value less than the first value, or it can be the distribution matching output length supported by this distribution matching method. If the third value is not a distribution matching output length supported by this distribution matching method, rate matching is required. If the third value is a distribution matching output length supported by this distribution matching method, rate matching is not required, reducing implementation complexity.

[0230] For example, such as Figure 11 As shown in (b), taking a resource unit quantity of 900 corresponding to the transmission resource and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 900*2=1800. Assuming the first value is 512, the ratio of 1800 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 1800 - 512 * 3 = 264. Assuming the second value is 128 and the third value is 64, the X third sequences include 3 third sequences with a length of 512, 1 third sequence with a length of 128, and 2 third sequences with a length of 64. The remaining 1800 - 512 * 3 - 128 - 64 * 2 = 8 bits do not need to participate in the distribution matching process. That is, the output of the distribution matching does not contain any bits with a length of 8. The total length of the output of the distribution matching is 512 * 3 + 128 + 64 * 2 = 1792.

[0231] Optionally, in case 4 above, if the first value is the distribution matching output length supported by the current distribution matching method, since the lengths of the T third sequences are all the distribution matching output lengths supported by the distribution matching method, it is not necessary to perform rate matching on the T third sequences, thus reducing the implementation complexity.

[0232] Based on the above description, Case 3 is illustrated using the length of XT third sequences including the second value, and Case 4 is illustrated using the length of XT third sequences including both the second and third values. It is understood that the length of the XT third sequences is not limited to the aforementioned second and third values. The lengths of different third sequences within the XT sequences can be the same or different, without restriction. The total length of the XT third sequences is less than or equal to the difference between the maximum total output length corresponding to the distribution matching and the total length of the T third sequences; that is, the total length of the XT third sequences is less than or equal to the aforementioned first length.

[0233] Based on this, the length of the X third sequences can be determined by referring to case 5 below. Case 3 or case 4 above can be understood as an example of case 5 below.

[0234] Case 5: X third sequences include T third sequences of length 1 and XT third sequences.

[0235] In this process, for each of the XT third sequences, the length of each third sequence is less than the first value, and any two third sequences can have the same length or different lengths. The total length of the XT third sequences is less than or equal to the first length. When the total length of the XT third sequences is equal to the first length, more bits can participate in the distribution matching process, improving the distribution matching performance and ensuring the shaping effect.

[0236] Optionally, for the XT third sequences, the length of each third sequence can belong to a first set. This first set can include multiple elements with different values, each element being a positive integer less than a first value. That is, the first set can be predefined, and the sending device can determine the length of the XT third sequences based on the first set when determining their lengths, thus reducing implementation complexity.

[0237] For example, the first set may include one or more distribution matching output lengths supported by this distribution matching method. For instance, taking the first value as 512, the first set could be {256, 128, 64, 32, 16, 8}. Based on this, the lengths of the T third sequences and the lengths of the XT third sequences are both distribution matching output lengths supported by this distribution matching method, eliminating the need for rate matching and reducing implementation complexity.

[0238] For example, taking a transmission resource with 1000 resource units and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 1000*2=2000. Assuming the first value is 512, the ratio of 2000 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 2000 - 512 * 3 = 464. Assuming the first set is {256, 128, 64, 32, 16, 8}, the X third sequences can include 3 third sequences with a length of the first value 512, 1 third sequence with a length of 256, 1 third sequence with a length of 128, 1 third sequence with a length of 64, and 1 third sequence with a length of 16.

[0239] Alternatively, the first length can be represented as a binary length consisting of "0" and "1", and the lengths of the XT third sequences can be determined based on the positions of the "1"s in this binary length.

[0240] For example, the length of the XT third sequences is the number of binary bits with a coefficient of 1 in the binary length, where XT is equal to the number of "1"s included in the binary length.

[0241] For example, taking a transmission resource with 1000 resource units and a first factor of 2 as an example, the maximum total output length corresponding to the distribution matching can be 1000*2=2000. Assuming the first value is 512, the ratio of 2000 to 512 is not a positive integer, which can be determined. This indicates rounding down. The first length is 2000 - 512 * 3 = 464, which corresponds to a binary length of 111010000. XT equals 4, and the lengths of the four third sequences are 2... 8 =256, 27 =128, 2 6 =64, 2 4 =16, meaning that X third sequences can include 3 third sequences with a length of the first value 512, 1 third sequence with a length of 256, 1 third sequence with a length of 128, 1 third sequence with a length of 64, and 1 third sequence with a length of 16.

[0242] Optionally, the first set mentioned above can also be used in combination with the binary length, that is, the length of the XT third sequences is not only determined by the binary length mentioned above, but also belongs to the first set.

[0243] It is understandable that if the length of the third sequence, determined by the binary length, does not belong to the first set, then there may be no third sequence of that length.

[0244] For example, if the lengths of the third sequences determined by the binary length are 256, 128, 64, and 16 respectively, and assuming the first set is {256, 128, 64, 32}, then the lengths of the XT third sequences can be determined to be 256, 128, and 64, and XT equals 3.

[0245] Optionally, when determining the length of the X third sequences, the transmitting device may use any one of the above-mentioned cases 1 to 4 to determine the length of the X third sequences, thereby improving the flexibility of the method for determining the length of the X third sequences.

[0246] For example, the transmitting device may determine, based on a first value and a first length, which method to use to determine the length of the X third sequences, as described below:

[0247] In the first possible design, if the first value is greater than or equal to the first threshold, the length of the X third sequences is determined by method one; or, if the first length is less than or equal to the second threshold, the length of the X third sequences is determined by method two; or, if the first value is less than the first threshold and the first length is greater than the second threshold, the length of the X third sequences is determined by method three.

[0248] In Method 1, the X third sequences include T third sequences of length denoted by a first value, and one third sequence of length denoted by a first length. Based on Method 1, the transmitting device can determine the lengths of the X third sequences by referring to the relevant description of the first example in Case 3 above.

[0249] It is understandable that, when the first length is equal to 0, this method one can also be understood as X third sequences including T third sequences with a length of the first value. Based on this method one, the sending device can determine the length of the X third sequences by referring to the relevant description of the above situation 1.

[0250] In Method 2, X third sequences include T third sequences of length denoted by a first value. Based on Method 2, the transmitting device can determine the length of the X third sequences by referring to the relevant descriptions of Case 1 or Case 2 above.

[0251] In Method 3, the X third sequences include T third sequences of length denoted by the first value and XT third sequences. The lengths of these XT third sequences can be the same or different. The lengths of the X third sequences include the different distribution matching output lengths supported by this distribution matching method. Based on Method 3, the sending device can determine the lengths of the X third sequences by referring to the relevant descriptions of Method 3 or Method 4 above.

[0252] Optionally, the first threshold can be predefined by the communication protocol, or it can be determined through negotiation between the sending and receiving devices, without limitation. For example, the first threshold can be 128.

[0253] Similarly, the second threshold can be predefined by the communication protocol, or it can be determined through negotiation between the sending and receiving devices, without restriction. For example, the second threshold can be 64.

[0254] Optionally, the second threshold can be less than the first threshold.

[0255] Of the three methods mentioned above, method one is the most complex, method three is the least complex, and method two is the simplest. When the sending device has strong processing power, the first threshold value can be smaller to make it easier for the sending device to use method one, allowing more bits to participate in the distribution matching process, improving distribution matching performance, and ensuring shaping effect. When the sending device has weak processing power, the second threshold value can be larger to make it easier for the sending device to use method two, reducing processing complexity.

[0256] Understandably, for the comparison process between the first value and the first threshold, "greater than or equal to" can be replaced with "greater than", and correspondingly, "less than" can be replaced with "less than or equal to". Similarly, for the comparison process between the first length and the second threshold, "less than or equal to" can be replaced with "less than", and correspondingly, "greater than" can be replaced with "greater than or equal to".

[0257] In the second possible design, if the first length is greater than the second threshold and the first value is greater than the first threshold, the length of the X third sequences is determined by method one; or, if the first length is less than or equal to the second threshold, the length of the X third sequences is determined by method two; or, if the first length is greater than the second threshold and the first value is less than or equal to the first threshold, the length of the X third sequences is determined by method three.

[0258] The descriptions of Method 1, Method 2, Method 3, the first threshold, and the second threshold can refer to the relevant descriptions in the first possible design above, and will not be repeated here.

[0259] Understandably, for the comparison process between the first value and the first threshold, "greater than" can be replaced with "greater than or equal to", and correspondingly, "less than or equal to" can be replaced with "less than". Similarly, for the comparison process between the first length and the second threshold, "less than or equal to" can be replaced with "less than", and correspondingly, "greater than" can be replaced with "greater than or equal to".

[0260] In the third possible design, if the first length is less than or equal to the second threshold, the length of the X third sequences is determined by method two; or, if the first length is greater than the second threshold, the length of the X third sequences is determined by method three.

[0261] The descriptions of Method 2, Method 3, and the second threshold can refer to the relevant descriptions in the first possible design above, and will not be repeated here.

[0262] Understandably, in the process of comparing the first length with the second threshold, "less than or equal to" can be replaced with "less than", and correspondingly, "greater than" can be replaced with "greater than or equal to".

[0263] Optionally, the method for determining the lengths of the X third sequences can be specified in advance in the communication protocol. Alternatively, the sending device can determine the method for determining the lengths of the X third sequences itself and instruct the receiving device to do so. For example, the sending device can send a second indication message to the receiving device, which instructs the sending device on the method for determining the lengths of the X third sequences.

[0264] Based on the above description, the transmitting device can determine the lengths of the X second sequences according to the lengths of the X third sequences, referring to step 601 above, determine the X second sequences according to the payload information bits, perform distribution matching on the X second sequences respectively according to step 602 above to obtain X third sequences, and concatenate the X third sequences according to step 603 above to obtain a fourth sequence, which is then output. After determining the fourth sequence, the transmitting device can also perform encoding, rate matching, channel interleaving, scrambling, modulation, and other processing to obtain a modulation symbol sequence, and send the modulation symbol sequence to the receiving device. Correspondingly, the receiving device can receive the decoding information from the transmitting device, and refer to the following... Figure 12 The method shown is used for decoding.

[0265] Figure 12A flowchart of a communication method provided in an embodiment of this application is shown below. Figure 12 As shown, the method includes:

[0266] Step 1201: The receiving device obtains the information to be decoded.

[0267] 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 information to be decoded received by the receiving device is the modulation symbol sequence affected by noise and other interference.

[0268] The information to be decoded corresponds to a payload bit sequence of length K.

[0269] Step 1202: The receiving device determines X fifth sequences based on the information to be decoded.

[0270] The length of the fifth sequence is determined by the number of resource units corresponding to the transmission resource and the first value, where the first value is a positive integer and X is a positive integer greater than 1.

[0271] In this process, the transmitting device determines the modulation symbol sequence based on X third sequences through encoding, rate matching, channel interleaving, scrambling, and modulation. The receiving device then demodulates, descrambles, deinterleaves, de-rates, and decodes the information to be decoded to obtain X fifth sequences. These X fifth sequences can also be understood as the decoding results of the aforementioned X third sequences.

[0272] The receiving device can determine the length of the X fifth sequences using the same method as the sending device for determining the length of the X third sequences. It is understood that the length of the i-th fifth sequence is the same as the length of the i-th third sequence. The description of the length of the X fifth sequences can refer to the description of the length of the X third sequences described above, and will not be repeated here.

[0273] Among them, the total length of the X fifth sequences is less than or equal to the maximum total input length corresponding to the inverse distribution matching; the maximum total input length is determined according to the number of resource units corresponding to the transmission resources. The description of the maximum total input length can refer to the aforementioned description of the maximum total output length corresponding to the distribution matching, and will not be repeated here.

[0274] Among them, X fifth sequences include T third sequences of length 1; T is a positive integer.

[0275] In one possible design, T equals X, where X is the ratio of the maximum total length of the input corresponding to the inverse distribution matching to the first value; or, X is the floor result of the ratio of the maximum total length of the input corresponding to the inverse distribution matching to the first value.

[0276] In another possible design, T is less than X, and X is greater than or equal to the rounded-up result of the ratio of the maximum total input length corresponding to the inverse distribution matching to the first value.

[0277] Among them, the X fifth sequences also include A fifth sequences of length 2; where the second value is less than the first value, and A is a positive integer.

[0278] Among them, the X fifth sequences also include B fifth sequences of length three; wherein the third value is different from the second value, the third value is less than the first value, and B is a positive integer.

[0279] Alternatively, the X fifth sequences may also include XT fifth sequences, each of which has a length less than the first value.

[0280] Wherein, the total length of the XT fifth sequences is less than or equal to the first length, which is the difference between the maximum total length of the input corresponding to the inverse distribution matching and the total length of the T fifth sequences.

[0281] Optionally, the length of each of the XT fifth sequences belongs to the first set, which includes one or more inverse distribution matching input lengths supported by this inverse distribution matching method.

[0282] Optionally, the length of the fifth sequence is determined based on the number of resource units corresponding to the transmission resource, the first value, and the first factor; wherein the first factor is a positive integer.

[0283] Optionally, the total length of the X fifth sequences is less than or equal to the maximum total length of the input corresponding to the inverse distribution matching; wherein, the maximum total length of the input is determined based on the number of resource units corresponding to the transmission resource and the first factor, and the first factor is a positive integer.

[0284] Step 1203: The receiving device performs inverse distribution matching on the X fifth sequences to obtain X sixth sequences.

[0285] The receiving device performs inverse distribution matching on X fifth sequences, which can also be described as the receiving device performing inverse transformation, inverse shaping, or inverse transformation, or inverse shaping, or inverse probabilistic shaping on X fifth sequences.

[0286] Optionally, corresponding to the distribution matching performed by the transmitting device based on the first distribution matching method, the receiving device may perform inverse distribution matching on each of the X fifth sequences based on the first inverse distribution matching method.

[0287] For example, the first inverse distribution matching method can be an inverse distribution matching method based on polar codes, an inverse distribution matching method based on LDPC coding, an inverse distribution matching method based on RM codes, an inverse distribution matching method based on convolutional codes, an inverse distribution matching method based on RS codes, an inverse distribution matching method based on arithmetic coding, etc., without limitation.

[0288] Optionally, the length of the i-th sixth sequence is determined based on the distributed matching code rate and the length of the i-th fifth sequence, where i = 1, 2, 3, ..., X. The description of the length of the sixth sequence can be referenced in the preceding description of the second sequence, and will not be repeated here.

[0289] It is understandable that when the receiving device performs inverse distribution matching on X fifth sequences, it can use X inverse distribution matching modules (or inverse shaping modules, inverse shaping modules, inverse transform modules, inverse precoding modules, etc.) to perform inverse distribution matching on X fifth sequences respectively. That is, each inverse distribution matching module performs inverse distribution matching on one fifth sequence, thereby shortening the processing latency required for inverse distribution matching.

[0290] Alternatively, the receiving device can use an inverse distribution matching module to perform inverse distribution matching on each of the X fifth sequences, thereby reducing the number of inverse distribution matching modules and lowering hardware overhead.

[0291] Alternatively, the receiving device can use fewer than X inverse distribution matching modules to perform inverse distribution matching on X fifth sequences respectively. That is, each inverse distribution matching module can perform inverse distribution matching on one or more fifth sequences. On the one hand, this can reduce the number of inverse distribution matching modules and reduce hardware overhead. On the other hand, it can also reduce the processing latency required for inverse distribution matching.

[0292] Step 1204: The receiving device concatenates the X sixth sequences and outputs the concatenation result.

[0293] The receiving device can determine the final decoding result based on the concatenation of X sixth sequences.

[0294] Based on the above Figure 12 The method shown corresponds to the transmitting device determining X second sequences based on the payload bit sequence and performing distribution matching on each of the X second sequences. Similarly, during decoding, the receiving device can determine X fifth sequences based on the information to be decoded and perform inverse distribution matching on each of the X fifth sequences, thus improving decoding performance. Furthermore, the receiving device can determine the length of the fifth sequences, i.e., the input length of the inverse distribution matching, based on the number of resource units corresponding to the transmission resources and a first value. By limiting the input length of the inverse distribution matching, the complexity of inverse distribution matching can be reduced while improving its performance.

[0295] Based on the above description, the following uses arithmetic coding and polar coding as examples to illustrate distribution matching:

[0296] Among these methods, the distribution matching process based on arithmetic coding experiences a rapid increase in complexity as the code length grows. Therefore, when using arithmetic coding for distribution matching, the first numerical value can be relatively small (e.g., 64, 96, or 128) to reduce implementation complexity. This applies to both methods one and two described above.

[0297] In the polar code-based distribution matching process, the first value can reuse the coding length supported by the NR standard (such as 1024, 512, etc.), which is applicable to methods one and three above. Alternatively, the first value can also be smaller (such as 128, etc.), which is applicable to methods one and two above.

[0298] In the first possible design, symbolic approximate enumerative sphere shaping (AESS) can be used for distribution matching. This symbolic AESS can be understood as a type of distribution matching based on arithmetic coding.

[0299] Among them, symbolic AESS can directly generate a length of n max The alphabetical sequence. For example, in the alphabet A = {1 3 5 7}, the normalized energy corresponding to the letter 'a' is E(a) = (a 2 -1) / 8, that is, the energies corresponding to {1 3 5 7} are {0 1 36}, which can be stored with a length of n. max Energy less than or equal to E max A trellis structure composed of approximately the number of letter sequences can achieve a distribution matching effect. Using n... max =2,E max For example, if the value is 3, the number of rows and columns of the trellis are E. max +1 and n max +1, the element T(E,n) in the E-th row and n-th column represents a length of n. max -n is an approximation of a letter sequence with energy not exceeding E, where the last column of the Trellis algorithm consists entirely of 1s. The elements in the nth column of the Trellis algorithm can be obtained by summing no more than |A| elements in the (n+1)th column, where |A| is the size of the alphabet. Specifically... For example, if the sum is T(E,n) can be Therefore, T(E,n) can be represented by w bits (s0,…,s). w-1 The exponent t is determined.

[0300] For example, with n max =2,Emax For example, with a value of 3, an ESS example could be as follows: Figure 13 As shown in (a) above, w can be equal to 1, and the corresponding AESS example can be as follows: Figure 13 As shown in (b) of the diagram.

[0301] In the second possible design, finite-precision arithmetic coding can be used for distribution matching.

[0302] In arithmetic coding-based distribution matching, B candidate output letter sequences divide [0,1) into B disjoint intervals [b...]. j ,b j+1 ), 0 = b0 ≤ b1 … ≤ b B =1, [b j ,b j+1 ) is the interval corresponding to the j-th sequence, and the K-bit encoded input sequence. Arranged in dictionary order, for example If u i =v i ,i≤j,u j >v j , A real number between [0, 1] Where i is The lexicographical index, for example, the lexicographical order of 10 is 2, corresponding to the real value 2 / 4, is used to encode the input sequence. Corresponding encoded output sequence If and only if The corresponding real number is The corresponding interval [b j ,b j+1 )middle.

[0303] In the third possible design, a constant-composition-distribution matcher (CCDM) can be used for distribution matching.

[0304] CCDM is a distribution matcher based on arithmetic coding, whose output sequence has fixed components, such as an ordered alphabet A = {a0 = 0, a1 = 1}, a i This represents the i-th symbol in the alphabet of the DM output sequence. For example, such as... Figure 14As shown, the components of the 5-character long sequence c = {1,0,0,0,0} are: the number of letters of type 0 (0) is m0 = 4, and the number of letters of type 1 (1) is m1 = 1. The number of each letter in the CCDM encoded output sequence is fixed and is called the target component. For example, other 5-character long sequences with the same components as {1,0,0,0,0} include {0,1,0,0,0}, {0,0,1,0,0}, {0,0,0,1,0}, and {0,0,0,0,1}. The number of sequences with the same components... CCDM output letter sequence of length n Arranged in lexicographical order, with each interval having the same length. B is the number of sequences in the same component, such as Figure 14 As shown, the lexicographical order of 00100 is 2, corresponding to the interval [2 / 5, 3 / 5].

[0305] The corresponding interval width can be calculated recursively. Representative sequence Corresponding interval width in, For c s The number of corresponding letters in the components, for c s The corresponding number of letters.

[0306] This is called the first ratio in finite-precision CCDM. Preserve w-bit precision, for example w = 2 (retain 2 significant figures)

[0307] In the fourth possible design, polar codes can be used for distribution matching.

[0308] Wherein, DM refers to the bits of S uniformly random bits. Mapped to E biased bits Bias refers to The number of bits 0 and bits 1 are different.

[0309] Polar codes can be used as distributed matchers, for example, when E = N, N is the mother code length, and the set of sequence numbers is selected. Where s is the input length for distribution matching, Place the first bit sequence in In other words For the first bit sequence (e.g.) Figure 15 (The set of numbers is filled with bits of pattern 1) ( Figure 15The bits filled with pattern 2 (also called auxiliary bits) are a set of bits with different values. For example, E = N = 4, s = 3. By placing u0 = c0 = 1, u1 = c1 = 1, and u2 = c2 = 1, we obtain u3 = 1, thus obtaining...

[0310] It should be noted that the various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict, 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.

[0311] 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.

[0312] 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 should readily recognize that, based on the algorithm 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.

[0313] 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. It should be noted that 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.

[0314] When dividing each function into modules according to its corresponding function. Figure 16 A transmitting device 160 is shown, which can perform the above-described... Figures 6 to 15The actions performed by the transmitting device in the illustrated embodiments, and all related content of each step involved in the above method embodiments, can be referenced from 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.

[0315] The transmitting device 160 may include a transceiver module 1601 and a processing module 1602. Exemplarily, the transmitting device 160 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 160 is a communication device, the transceiver module 1601 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1602 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 160 is a component having the aforementioned transmitting device functions, the transceiver module 1601 may be a radio frequency unit; the processing module 1602 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 160 is a chip system, the transceiver module 1601 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1602 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 1601 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1602 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0316] For example, transceiver module 1601 can be used to perform... Figures 6 to 15 In the illustrated embodiment, all transmit and receive operations performed by the transmitting device, and / or other processes used to support the techniques described herein; the processing module 1602 can be used to perform Figures 6 to 15 The embodiments shown include all operations performed by the transmitting device other than the sending and receiving operations, and / or other processes used to support the techniques described herein.

[0317] Figure 17 A receiving device 170 is shown, which can perform the above-described actions. Figures 6 to 15 The actions performed by the receiving device in the illustrated embodiments, and all related content of each step involved in the above method embodiments, can be referenced from 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.

[0318] The receiving device 170 may include a transceiver module 1701 and a processing module 1702. Exemplarily, the receiving device 170 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions applied in a communication device. When the receiving device 170 is a communication device, the transceiver module 1701 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1702 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 170 is a component having the aforementioned receiving device functions, the transceiver module 1701 may be a radio frequency unit; the processing module 1702 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 170 is a chip system, the transceiver module 1701 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1702 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 1701 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1702 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0319] For example, transceiver module 1701 can be used to perform... Figures 6 to 15 In the illustrated embodiment, all transmit and receive operations performed by the receiving device, and / or other processes used to support the techniques described herein; processing module 1702 can be used to perform Figures 6 to 15 The embodiments shown include all operations performed by the receiving device other than the transmit and receive operations, and / or other processes used to support the techniques described herein.

[0320] As another feasible approach Figure 16 The transceiver module 1601 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1601; the processing module 1602 can be replaced by a processor, which can integrate the functions of the processing module 1602. Furthermore, Figure 16 The transmitting device 160 shown may also include a memory. Alternatively, Figure 17 The transceiver module 1701 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1701; the processing module 1702 can be replaced by a processor, which can integrate the functions of the processing module 1702. Furthermore, Figure 17 The receiver device 170 shown may also include a memory.

[0321] Alternatively, when the processing module 1602 is replaced by a processor and the transceiver module 1601 is replaced by a transceiver, the transmitting end device 160 involved in the embodiments of this application can also be... Figure 18The communication device 180 shown. Alternatively, when the processing module 1702 is replaced by a processor and the transceiver module 1701 is replaced by a transceiver, the receiving end device 170 involved in the embodiments of this application can also be Figure 18 The communication device 180 shown.

[0322] The processor can be logic circuit 1801, and the transceiver can be interface circuit 1802. Furthermore, Figure 18 The communication device 180 shown may also include a memory 1803.

[0323] This application also provides a communication device, such as... Figure 19 As shown, this communication device can be applied to the above-mentioned... Figures 6 to 15 In the illustrated embodiments, as Figure 19 As shown, 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.

[0324] In one example, the communication device acts as a transmitting device or is a chip applied in a transmitting device, and performs the steps executed by the transmitting device in the above method embodiments. The transceiver module is used for specific execution. Figures 6 to 15 The sending and / or receiving actions performed by the sending device in any of the embodiments herein may include, for example, other processes that support the sending device in performing the techniques described herein. The processing module may be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the sending device in performing other processes of the techniques described herein.

[0325] 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.

[0326] 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.

[0327] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to perform... Figures 6 to 15 The method involved in any of the embodiments shown is further described below. The processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is primarily responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is primarily responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and translations. The registers are primarily 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 a register or cache. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0328] It should be noted that the functions of the processor and interface can be implemented through hardware design, software design, or a combination of both; no restrictions are imposed here.

[0329] 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.

[0330] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0331] 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.

[0332] It should be noted that the terms "first" and "second," etc., 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.

[0333] 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.

[0334] It should be understood that in this application, "at least one (item)" means one or more. "More than one" means two or more. "At least two (items)" means 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 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.

[0335] 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.

[0336] 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.

[0337] 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.

[0338] In the several embodiments provided in this application, it should be understood that 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 mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0339] 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.

[0340] 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.

[0341] 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 in that, include: Obtain a first sequence; wherein the first sequence includes X second sequences, the first sequence including K1 bits of a payload bit sequence of length K, where K1 is a positive integer less than or equal to K; and X is a positive integer greater than 1. The distribution matching of the X second sequences is performed to obtain X third sequences; wherein the length of the third sequence is determined according to the number of resource units corresponding to the transmission resources and a first value, wherein the first value is a positive integer; The X third sequences are concatenated to obtain a fourth sequence, which is then output.

2. The method according to claim 1, characterized in that, The total length of the X third sequences is less than or equal to the maximum total output length corresponding to the distribution matching; wherein, the maximum total output length is determined according to the number of resource units corresponding to the transmission resource.

3. The method according to claim 1 or 2, characterized in that, The first value is the maximum length of the X third sequences.

4. The method according to any one of claims 1-3, characterized in that, The first value is any of the following: 1024, 512, 256, 128, 96, 64, 32, or 16.

5. The method according to any one of claims 1-4, characterized in that, The X third sequences include T third sequences of length equal to the first value; where T is a positive integer.

6. The method according to claim 5, characterized in that, The T is equal to the X, where X is the ratio of the maximum total output length corresponding to the distribution matching to the first value; or, X is the floor result of the ratio of the maximum total output length corresponding to the distribution matching to the first value. The maximum total output length is determined based on the number of resource units corresponding to the transmission resource.

7. The method according to claim 5, characterized in that, T is less than X, and X is greater than or equal to the rounded-up result of the ratio of the maximum total output length corresponding to the distribution matching to the first value; The maximum total output length is determined based on the number of resource units corresponding to the transmission resource.

8. The method according to claim 7, characterized in that, The X third sequences further include A third sequences of length denoted by a second value; wherein the second value is less than the first value, and A is a positive integer.

9. The method according to claim 8, characterized in that, The X third sequences further include B third sequences of length three; wherein the third value is different from the second value, the third value is less than the first value, and B is a positive integer.

10. The method according to claim 7, characterized in that, The X third sequences further include XT third sequences, and the length of each of the XT third sequences is less than the first value.

11. The method according to claim 10, characterized in that, The total length of the XT third sequences is less than or equal to the first length, where the first length is the difference between the maximum total output length corresponding to the distribution matching and the total length of the T third sequences.

12. The method according to claim 10 or 11, characterized in that, The length of each of the XT third sequences belongs to the first set, which includes one or more distribution matching output lengths supported by the current distribution matching method.

13. The method according to any one of claims 1-12, characterized in that, The length of the third sequence is determined based on the number of resource units corresponding to the transmission resource, the first value, and the first factor; wherein the first factor is a positive integer.

14. The method according to any one of claims 1-13, characterized in that, The total length of the X third sequences is less than or equal to the maximum total output length corresponding to the distribution matching; wherein, the maximum total output length is determined based on the number of resource units corresponding to the transmission resource and a first factor, and the first factor is a positive integer.

15. The method according to any one of claims 1-14, characterized in that, The length of the i-th second sequence is determined based on the distribution matching code rate and the length of the i-th third sequence, i = 1, 2, 3, ..., X.

16. A communication method, characterized in that, Obtain the information to be decoded; the information to be decoded corresponds to a payload bit sequence of length K; Based on the information to be decoded, X fifth sequences are determined; wherein, the length of the fifth sequence is determined according to the number of resource units corresponding to the transmission resource and a first value, the first value being a positive integer, and X being a positive integer greater than 1; By performing inverse distribution matching on the X fifth sequences, X sixth sequences are obtained; Concatenate the X sixth sequences and output the concatenation result.

17. The method according to claim 16, characterized in that, The total length of the X fifth sequences is less than or equal to the maximum total input length corresponding to the inverse distribution matching; wherein, the maximum total input length is determined according to the number of resource units corresponding to the transmission resource.

18. The method according to claim 16 or 17, characterized in that, The first value is the maximum length of the X fifth sequences.

19. The method according to any one of claims 16-18, characterized in that, The first value is any of the following: 1024, 512, 256, 128, 96, 64, 32, or 16.

20. The method according to any one of claims 16-19, characterized in that, The X fifth sequences include T third sequences of length equal to the first value; where T is a positive integer.

21. The method according to claim 20, characterized in that, The T is equal to the X, where X is the ratio of the maximum total length of the input corresponding to the inverse distribution matching to the first value; or, X is the floor result of the ratio of the maximum total length of the input corresponding to the inverse distribution matching to the first value. The maximum total input length is determined based on the number of resource units corresponding to the transmission resource.

22. The method according to claim 20, characterized in that, The T is less than the X, and the X is greater than or equal to the rounded-up result of the ratio of the maximum total input length corresponding to the inverse distribution matching to the first value; The maximum total input length is determined based on the number of resource units corresponding to the transmission resource.

23. The method according to claim 22, characterized in that, The X fifth sequences further include A fifth sequences of length denoted by a second value; wherein the second value is less than the first value, and A is a positive integer.

24. The method according to claim 23, characterized in that, The X fifth sequences further include B fifth sequences of length three; wherein the third value is different from the second value, the third value is less than the first value, and B is a positive integer.

25. The method according to claim 22, characterized in that, The X fifth sequences further include XT fifth sequences, and the length of each of the XT fifth sequences is less than the first value.

26. The method according to claim 25, characterized in that, The total length of the XT fifth sequences is less than or equal to the first length, which is the difference between the maximum total length of the input corresponding to the inverse distribution matching and the total length of the T fifth sequences.

27. The method according to claim 25 or 26, characterized in that, The length of each of the XT fifth sequences belongs to the first set, which includes one or more inverse distribution matching input lengths supported by this inverse distribution matching method.

28. The method according to any one of claims 16-27, characterized in that, The length of the fifth sequence is determined based on the number of resource units corresponding to the transmission resource, the first value, and the first factor; wherein the first factor is a positive integer.

29. The method according to any one of claims 16-28, characterized in that, The total length of the X fifth sequences is less than or equal to the maximum total input length corresponding to the inverse distribution matching; wherein, the maximum total input length is determined based on the number of resource units corresponding to the transmission resource and a first factor, and the first factor is a positive integer.

30. The method according to any one of claims 16-29, characterized in that, The length of the i-th sixth sequence is determined by the distribution matching code rate and the length of the i-th fifth sequence, i = 1, 2, 3, ..., X.

31. A communication device, characterized in that, include: A processing module is used to obtain a first sequence; wherein the first sequence includes X second sequences, the first sequence includes K1 bits of a payload bit sequence of length K, where K1 is a positive integer less than or equal to K; and X is a positive integer greater than 1. The processing module is further configured to perform distribution matching on the X second sequences respectively to obtain X third sequences; wherein the length of the third sequence is determined according to the number of resource units corresponding to the transmission resources and a first value, wherein the first value is a positive integer; The processing module is also used to concatenate the X third sequences to obtain a fourth sequence and output the fourth sequence.

32. A communication device, characterized in that, include: The transceiver module is used to acquire information to be decoded; the information to be decoded corresponds to a payload bit sequence of length K; The processing module is configured to determine X fifth sequences based on the information to be decoded; wherein the length of the fifth sequence is determined based on the number of resource units corresponding to the transmission resources and a first value, the first value being a positive integer and X being a positive integer greater than 1; The processing module is also used to perform inverse distribution matching on the X fifth sequences to obtain X sixth sequences; The processing module is also used to concatenate the X sixth sequences and output the concatenation result.

33. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the communication method as described in any one of claims 1-15 to be executed, or cause the communication method as described in any one of claims 16-30 to be executed.

34. A communication device, characterized in that, The communication device 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 claims 1-15, or to execute the communication method as described in any one of claims 16-30, and to process and / or generate the information based on the information.

35. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the communication method as described in any one of claims 1-15 to be executed, or cause the communication method as described in any one of claims 16-30 to be executed.

36. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the communication method as described in any one of claims 1-15 to be executed, or cause the communication method as described in any one of claims 16-30 to be executed.

Images