Communication method and communication device

Abstract

The embodiment of the invention provides a communication method and a communication device, and the method comprises the steps: receiving indication information used for indicating a first index, determining a first value from a coding strategy set according to the first index, and enabling the first value to be a spectrum efficiency and / or a quantized value of the spectrum efficiency. The set of coding strategies is composed of a first value and a first index. A first codeword is transmitted, the first codeword being determined according to a number of resource elements (REs), NREs, and a first value, the NREs relating to symbols to be transmitted. According to the method, the first value is determined from multiple groups of corresponding relations in the coding strategy set through the first index, and the first code word is determined and sent according to the first value and the NRE. The first code word sent by the application is determined according to the first value and the NRE, the first value is from the coding strategy set, and the first code word does not relate to the pre-configured modulation order, that is, the system does not need to pre-configure the corresponding modulation order, so that the operation complexity of the system can be reduced.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of channel coding, and more specifically, to a communication method and a communication device. Background Art

[0002] Modulation and coding scheme (MCS) is a commonly used technology in wireless communication technology. For example, before a terminal device sends an uplink data channel (such as a physical uplink shared channel (PUSCH)) to a network device, the terminal device needs to determine the MCS used by the PUSCH. The MCS is used to indicate the modulation order and coding rate corresponding to the data channel. The terminal device determines the redundant coding scheme and modulation scheme used for the data carried by the PUSCH based on the MCS. It can be seen that the existing MCS system presets the modulation order and coding rate of the data channel during the communication process.

[0003] The existing MCS includes information such as the modulation order and the code rate corresponding to the modulation order calculated in advance by the system. The system's pre-calculation of the modulation order will cause greater computational complexity. At the same time, due to the fixed modulation order, extremely low code rates may occur during the coding and modulation process, causing coding losses to affect channel capacity allocation. Summary of the invention

[0004] The embodiment of the present application provides a communication method, which can avoid the system from pre-calculating the modulation order and reduce the complexity of the system.

[0005] In a first aspect, a communication method is provided, the method comprising: receiving indication information, the indication information being used to indicate a first index in a coding strategy set, the coding strategy set being composed of the first index and a first value, the coding strategy set comprising a plurality of groups of correspondences, each group of correspondences in the plurality of groups of correspondences being used to describe the first index and the first value, the first value being a spectrum efficiency and / or a quantized value of the spectrum efficiency; determining the first value corresponding to the first index according to the first index; sending a first codeword, the first codeword being based on the number N of resource units RE RE and the first value determines the number N of the resource units RE Related to the symbol to be sent.

[0006] It should be understood that the coding strategy set is composed of a first index and a first value, and there is a correspondence between the first index and the first value. The coding strategy set includes multiple groups of correspondences, each of which is used to describe the first index and the first value.

[0007] According to the method of the present application, the indication information is received and the first index in the coding strategy indicated by the indication information is used to determine the first value corresponding to the first index. RE Determine and send the first codeword. Compared with the prior art, this method determines the modulation order and code rate corresponding to the MCS index from the MCS through the MCS index, and further encodes the symbols to be sent according to the modulation order and code rate. The method provided by the present application avoids the system from pre-calculating the modulation order and reduces the complexity of the system.

[0008] In combination with the first aspect, in some possible implementations, the number of information bits corresponding to the first codeword is equal to the number N of the resource units RE. RE Related to the number of flows.

[0009] In conjunction with the first aspect, in some possible implementations, the number of information bits corresponding to the first codeword satisfies:

[0010] N info =N RE *R s *v,

[0011] Among them, N RE represents the number of resource units RE, Rs is determined according to R and Qm, R represents the code rate, Qm represents the number of bits in the modulation symbol, and v represents the number of streams.

[0012] In combination with the first aspect, in some possible implementations, the first codeword is the number N of resource units RE. RE and the first value is determined, comprising:

[0013] The first codeword is based on the number N of the resource units RE RE , the first value and the second modulation order are determined, the second modulation order is determined by adjusting the first modulation order M according to a third sequence, and the third sequence is based on the number N of the resource units RE RE , the first sequence and k non-pre-frozen bits determine,

[0014] The first sequence corresponds to the number of symbols N and the first modulation order M, and the resource unit RE is used to modulate the first sequence (NN RE ) symbols are pre-frozen to obtain a second sequence, and the third sequence is determined by selecting the k non-pre-frozen bits from the second sequence in descending order of reliability.

[0015] Based on the above technical solution, the first codeword is based on the number N of resource units RERE , determined by the first value and the second modulation order. The second scheduling order is obtained by adjusting the first scheduling order. The first scheduling order is the scheduling order of the first sequence pre-configured by the system. It can be seen that the scheduling order used to determine the first codeword in the present application does not need to be pre-calculated by the system. The first scheduling order corresponding to the first sequence pre-configured by the system can be adjusted to obtain a suitable second scheduling order, thereby reducing the complexity of the system pre-calculation, and ensuring that a suitable scheduling order is selected to encode and modulate the symbols to be sent, thereby improving the encoding and decoding performance.

[0016] In combination with the first aspect, in some possible implementations, the second modulation order is determined by adjusting the first modulation order M according to the third sequence, including:

[0017] The m modulation orders corresponding to the k first bits in the third sequence do not satisfy the first condition, the second modulation order is m' modulation order, the m' modulation orders are the modulation orders corresponding to the k second bits in the fourth sequence, and the m' modulation orders satisfy the first condition, wherein the fourth sequence is determined based on the k information bits and m, the k second bits correspond to the k information bits, m' is less than m, the k first bits correspond to the k information bits, m is less than or equal to M, and m is a positive integer.

[0018] Based on the above technical solution, the k information bits are respectively carried on the bit positions corresponding to the k first bits in the third sequence, wherein the second modulation order is further determined by judging whether the m modulation orders corresponding to the k first bits meet the first condition. When the m modulation orders do not meet the first condition, the fourth sequence is determined according to the k information bits and the modulation order m of the third sequence. The fourth sequence may be a sequence obtained after pre-freezing the bit positions corresponding to the lowest layer or the highest layer of the bit reliability in the m modulation orders of the third sequence, or the fourth sequence may be a sequence obtained after pre-freezing the bit positions corresponding to the lowest layer or the highest layer of the bit reliability in the modulation orders corresponding to other sequences (such as the fifth sequence). The k information bits correspond to the k second bits in the fourth sequence, and the k second bits correspond to the m' modulation orders in the fourth sequence, and the m' modulation orders meet the first condition, and the m' is further used as the second modulation order.

[0019] The fifth sequence may be a sequence obtained after pre-freezing the bit positions corresponding to the lowest layer or the highest layer of bit reliability in the m modulation orders of the third sequence, or the fifth sequence may be a sequence obtained after pre-freezing the bit positions corresponding to the lowest layer or the highest layer of bit reliability in the modulation orders corresponding to other sequences (e.g., the sixth sequence). The modulation order corresponding to the fifth sequence does not meet the first condition, and the modulation order corresponding to the sixth sequence does not meet the first condition.

[0020] In combination with the first aspect, in some possible implementations, determining a fourth sequence according to the k information bits and the m includes:

[0021] The fourth sequence is obtained by pre-freezing the bits corresponding to the lowest layer or the highest layer of bit reliability in the m" modulation orders by the fifth sequence, the fifth sequence is determined according to the k information bits and m, the k third bits in the fifth sequence correspond to the k information bits, the k third bits correspond to the m" modulation orders, and the m" modulation orders do not meet the first condition,

[0022] Wherein, m" is less than M, and m" is a positive integer.

[0023] Based on the above technical solution, the m' modulation orders corresponding to the fourth sequence meet the first condition, that is, before determining the sequence corresponding to the modulation order that meets the first condition, the method can cyclically determine whether the modulation order corresponding to the obtained sequence meets the first condition. If not, the bits corresponding to the lowest or highest layer of bit reliability corresponding to the sequence are pre-frozen to obtain a new sequence. The modulation order corresponding to the new sequence is then determined until the modulation order meets the first condition. For example, if the m' modulation order corresponding to the fourth sequence meets the first condition, the m' is used as the second modulation order for coding and modulating the symbols to be sent.

[0024] In conjunction with the first aspect, in some possible implementations, the first condition includes:

[0025] In the modulation orders where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or,

[0026] The k information bits are located at bit positions corresponding to the same modulation order.

[0027] It should be understood that the first condition includes that the number of k information bits included in the bit position corresponding to each modulation order is greater than or equal to the first threshold, and / or the k information bits are in the same modulation order, for example, m'=1.

[0028] Based on the above technical solution, by judging the first condition, the appropriate modulation order can be selected according to the code length and code rate corresponding to each modulation order, thereby avoiding the coding loss of a lower code rate affecting the allocation of channel capacity and improving the coding performance.

[0029] In combination with the first aspect, in some possible implementations, the second modulation order is determined by adjusting the first modulation order M according to the third sequence, including:

[0030] The m modulation orders corresponding to the k first bits in the third sequence meet the first condition, and the second modulation order is the m modulation order,

[0031] Among them, the k first bits correspond to the k information bits, m is less than M, m is a positive integer, and the first condition includes: in the modulation order where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, the k information bits are located at the bit positions corresponding to the same modulation order.

[0032] Based on the above technical solution, the k information bits are respectively carried at the bit positions corresponding to the k first bits in the third sequence, wherein it is determined whether the m modulation orders corresponding to the k first bits meet the first condition, and the second modulation order is further determined. When the m modulation orders meet the first condition, m is used as the second modulation order.

[0033] In combination with the first aspect, in some possible implementations, when the first modulation order M is the modulation order of a first quadrature amplitude modulation QAM, the first modulation order M is used to determine the number of constellation points of the first QAM, and the number of constellation points of the first QAM satisfies: A=2 2M ;

[0034] When the second modulation order is the modulation order of the second QAM, the second modulation order is used to determine the number of constellation points of the second QAM, and the number of constellation points of the second QAM satisfies a=2 2*第二调制阶数 .

[0035] In conjunction with the first aspect, in some possible implementations, the multiple groups of correspondences included in the encoding strategy set correspond to one or more of the following items:

[0036] First Index Spectral efficiency x1024 Spectral efficiency 0 256 0.2500 1 320 0.3125 2 400 0.3906 3 496 0.4844 4 608 0.5938 5 736 0.7188 6 880 0.8594 7 1040 1.0156 8 1216 1.1875 9 1408 1.3750 10 1616 1.5781 11 1840 1.7969 12 2096 2.0469 13 2360 2.3047 14 2632 2.5703 15 2912 2.8438 16 3200 3.1250 17 3496 3.4141 18 3800 3.7109 19 4112 4.0156 20 4428 4.3242 21 4749 4.6367 22 5072 4.9531 23 5400 5.2734 24 5732 5.5977 25 6068 2.9258 26 6408 6.2578

[0037] In a second aspect, a communication device is provided, which includes: a transceiver unit, used to receive indication information, wherein the indication information is used to indicate a first index in a coding strategy set, wherein the coding strategy set is composed of the first index and a first value, and the coding strategy set includes multiple groups of correspondences, each group of correspondences in the multiple groups of correspondences is used to describe the first index and the first value, and the first value is a spectrum efficiency and / or a quantized value of the spectrum efficiency; a processing unit, used to determine the first value corresponding to the first index according to the first index; the transceiver unit is also used to send a first codeword, wherein the first codeword is based on the number N of resource units RE. RE and the first value determines the number N of the resource units RE Related to the symbol to be sent.

[0038] It should be understood that the transceiver unit is also called a communication unit.

[0039] In conjunction with the second aspect, in some possible implementations, the number of information bits corresponding to the first codeword is equal to the number N of the resource units RE. RE Related to the number of flows.

[0040] In conjunction with the second aspect, in some possible implementations, the number of information bits corresponding to the first codeword satisfies:

[0041] N info =N RE *R s *v

[0042] Among them, N RE represents the number of resource units RE, Rs is determined according to R and Qm, R represents the code rate, Qm represents the number of bits in the modulation symbol, and v represents the number of streams.

[0043] In conjunction with the second aspect, in some possible implementations, the first codeword is determined according to the resource unit RE and the first value, including:

[0044] The first codeword is based on the number N of the resource units RE RE , the first value and the second modulation order are determined, the second modulation order is determined by adjusting the first modulation order M according to a third sequence, and the third sequence is based on the number N of the resource units RE RE , the first sequence and k non-pre-frozen bits determine,

[0045] The first sequence corresponds to the number of symbols N and the first modulation order M, and the resource unit RE is used to modulate the number of symbols N in the first sequence. REThe bits corresponding to the k symbols are pre-frozen to obtain a second sequence, and the third sequence is determined by selecting the k non-pre-frozen bits from the second sequence in descending order of reliability.

[0046] In conjunction with the second aspect, in some possible implementations, the second modulation order is determined by adjusting the first modulation order M according to the third sequence, including:

[0047] The m modulation orders corresponding to the k first bits in the third sequence do not satisfy the first condition, the second modulation order is m' modulation orders, the m' modulation orders are the modulation orders corresponding to the k second bits in the fourth sequence, and the m' modulation orders satisfy the first condition,

[0048] The fourth sequence is determined according to the k information bits and m, the k second bits correspond to the k information bits, m' is less than m, the k first bits correspond to the k information bits, m is less than or equal to M, and m is a positive integer.

[0049] In conjunction with the second aspect, in some possible implementations, the fourth sequence is determined according to the k information bits and the m, including:

[0050] The fourth sequence is obtained by pre-freezing the bits corresponding to the lowest layer or the highest layer of bit reliability in the m" modulation orders by the fifth sequence, the fifth sequence is determined according to the k information bits and m, the k third bits in the fifth sequence correspond to the k information bits, the k third bits correspond to the m" modulation orders, and the m" modulation orders do not meet the first condition,

[0051] Wherein, m" is less than M, and m" is a positive integer.

[0052] In conjunction with the second aspect, in some possible implementations, the first condition includes:

[0053] In the modulation orders where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or,

[0054] The k information bits are located at bit positions corresponding to the same modulation order.

[0055] In conjunction with the second aspect, in some possible implementations, the second modulation order is determined by adjusting the first modulation order M according to the third sequence, including:

[0056] The m modulation orders corresponding to the k first bits in the third sequence meet the first condition, and the second modulation order is m modulation orders,

[0057] Among them, the k first bits correspond to the k information bits, m is less than M, m is a positive integer, and the first condition includes: in the modulation order where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, the k information bits are located at the bit positions corresponding to the same modulation order.

[0058] In conjunction with the second aspect, in some possible implementations, the second modulation order is determined by adjusting the first modulation order M according to the third sequence, including:

[0059] When the m modulation orders corresponding to the k first bits in the third sequence meet the first condition, the m are used as the second modulation order,

[0060] Among them, the k first bits correspond to the k information bits, m is less than M, m is a positive integer, and the first condition includes: in the modulation order where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, the k information bits are located at the bit positions corresponding to the same modulation order.

[0061] In combination with the second aspect, in some possible implementations, when the first modulation order M is the modulation order of a first quadrature amplitude modulation QAM, the first modulation order M is used to determine the number of constellation points of the first QAM, and the number of constellation points of the first QAM satisfies: A=2 2M ;

[0062] When the second modulation order is the modulation order of the second QAM, the second modulation order is used to determine the number of constellation points of the second QAM, and the number of constellation points of the second QAM satisfies a=2 2*第二调制阶数 .

[0063] In conjunction with the second aspect, in some possible implementations, the multiple groups of correspondences included in the encoding strategy set correspond to one or more of the following items:

[0064] First Index Spectral efficiency x1024 Spectral efficiency 0 256 0.2500 1 320 0.3125 2 400 0.3906 3 496 0.4844 4 608 0.5938 5 736 0.7188 6 880 0.8594 7 1040 1.0156 8 1216 1.1875 9 1408 1.3750 10 1616 1.5781 11 1840 1.7969 12 2096 2.0469 13 2360 2.3047 14 2632 2.5703 15 2912 2.8438 16 3200 3.1250 17 3496 3.4141 18 3800 3.7109 19 4112 4.0156 20 4428 4.3242 21 4749 4.6367 22 5072 4.9531 23 5400 5.2734 24 5732 5.5977 25 6068 2.9258 26 6408 6.2578

[0065] In a third aspect, a communication device is provided, which has the function of implementing the method in the first aspect or any possible implementation of the first aspect. The function can be implemented by hardware, or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the above functions.

[0066] In a fourth aspect, a communication device is provided, comprising a processor and a memory. Optionally, a transceiver may also be included. The memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory, and control the transceiver to send and receive signals, so that the communication device performs the method in the first aspect or any possible implementation of the first aspect.

[0067] In a fifth aspect, a communication device is provided, comprising a processor and a communication interface, wherein the communication interface is used to receive data and / or information and transmit the received data and / or information to the processor, and the processor processes the data and / or information, and the communication interface is also used to output the data and / or information processed by the processor, so that the method in the first aspect, or any possible implementation of the first aspect, is executed.

[0068] In a sixth aspect, a computer-readable storage medium is provided, wherein computer instructions are stored in the computer-readable storage medium. When the computer instructions are executed on a computer, the method in the first aspect, or any possible implementation in this aspect, is executed.

[0069] In a seventh aspect, a computer program product is provided, the computer program product comprising a computer program code, which, when executed on a computer, enables the method in any possible implementation of the first aspect, or any aspect of this aspect, to be executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0070] Figure 1 It is a schematic diagram of the system architecture of a communication system applicable to the technical solution of the present application.

[0071] Figure 2 It is a schematic diagram of a modulated signal.

[0072] Figure 3 It is a schematic diagram of the MLC process of m-order modulation.

[0073] Figure 4 It is a simulation diagram of serial demodulation and parallel demodulation.

[0074] Figure 5 It is a process diagram of a communication method provided in an embodiment of the present application.

[0075] Figure 6 This is a schematic diagram of a process for determining a modulation order provided by the present application.

[0076] Figure 7 It is a simulation diagram of BLER=0.01.

[0077] Figure 8 A schematic block diagram of a communication device 800 provided in the present application.

[0078] Fig. 9 A schematic structural diagram of a communication device 900 provided in this application. DETAILED DESCRIPTION

[0079] The technical solution in this application will be described below in conjunction with the accompanying drawings.

[0080] The technical solutions of the embodiments of the present application can be applied to various communication systems, including but not limited to: satellite communication systems, the 5th generation (5G) systems, long term evolution (LTE) systems (LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems), etc. The technical solutions provided in the present application can also be applied to future communication systems, such as the sixth generation mobile communication system. In addition, it can also be applied to device to device (D2D) communication, vehicle-to-everything (V2X) communication, machine to machine (M2M) communication, machine type communication (MTC), and Internet of Things (IoT) communication systems or other communication systems, etc., which are not limited in this article.

[0081] Figure 1 The schematic diagram of the system architecture of the communication system applicable to the technical solution of the present application is shown in FIG. The communication system may include one or more network devices and one or more terminal devices.

[0082] Exemplarily, the terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device. The terminal device in the embodiment of the present application may refer to a device that provides voice and / or data connectivity to a user, and may be used to connect people, objects and machines, such as a handheld device with wireless connection function, a vehicle-mounted device, etc. The terminal device in the embodiment of the present application can be a mobile phone, a tablet computer, a laptop computer, a PDA, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. Optionally, UE can be used to act as a base station. For example, UE can act as a scheduling entity, which provides side link signals between UEs in V2X or D2D, etc.

[0083] In the embodiment of the present application, the device for realizing the function of the terminal can be a terminal, or a device capable of supporting the terminal to realize the function, such as a chip system or a chip, which can be installed in the terminal. In the embodiment of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0084] Exemplarily, the network device may be a device with wireless transceiver functions, which may be a device that provides wireless communication function services, and is usually located on the network side, including but not limited to the next generation base station (gNodeB, gNB) in the fifth generation (5G) communication system, the base station in the sixth generation (6G) mobile communication system, the base station in the future mobile communication system or the access node in the wireless fidelity (Wi-Fi) system, the evolved node B (eNB) in the long term evolution (LTE) system, the radio network controller (RNC), the node B (NB), the base station controller (BSC), the home base station (for example, home evolved NodeB, or home Node B, HNB), the base band unit (BBU), the transmission reception point (TRP), the transmitting point (TP), the base transceiver station (BTS), etc. In a network structure, the network device may include a centralized unit (CU) node, or a distributed unit (DU) node, or a RAN device including a CU node and a DU node, or a RAN device including a control plane CU node and a user plane CU node, and a DU node, or the network device may also be a wireless controller, a relay station, a vehicle-mounted device, and a wearable device in a cloud radio access network (CRAN) scenario. In addition, the base station may be a macro base station, a micro base station, a relay node, a donor node, or a combination thereof. The base station may also refer to a communication module, a modem, or a chip used to be set in the aforementioned device or apparatus. The base station may also be a mobile switching center and a device that performs the base station function in D2D, V2X, and M2M communications, a network-side device in a 6G network, and a device that performs the base station function in a future communication system. The base station can support networks with the same or different access technologies without limitation.

[0085] In the embodiment of the present application, the device for implementing the function of the network device can be a network device, or a device that can support the network device to implement the function, such as a chip system or a chip, which can be installed in the network device. In the embodiment of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0086] It should be understood that the rate matching method provided in the present application can be considered as a channel coding scheme, which can be used in a dedicated network device or a general device, can be applied to various network devices (e.g., base station devices) as described above, and can also be applied to various terminal devices as described above. Specifically, the channel coding scheme is mainly implemented by a channel coding unit in these devices.

[0087] The method provided in the embodiments of the present application can also be implemented through an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc., or through software (for example, a program code in a memory), without limitation.

[0088] Figure 2 is a schematic diagram of a modulated signal. Figure 2 (1) in is a 4-PAM signal, Figure 2 (2) in the figure is a 16-QAM signal. It can be seen that after expanding to a two-dimensional plane signal, the maximum number of information bits that can be transmitted for each M2-QAM symbol is 2log2(M).

[0089] Next, in order to facilitate understanding of the embodiments provided in this application, the terms involved in this application are briefly introduced below:

[0090] Multi-level coding (MLC)

[0091] MLC technology is a code modulation technology that combines coding and modulation. MLC neither increases the signal bandwidth nor reduces the actual data transmission rate, while improving the reliability of data transmission. Therefore, MLC is also called "high-efficiency bandwidth coding".

[0092] According to Shannon's channel capacity theorem, when the code rate of each component code in MLC is equal to the equivalent channel capacity of each channel, MLC technology will obtain better bit error rate and throughput performance. Therefore, the design focus of MLC technology lies in the appropriate selection of component code rate. The code rate of traditional linear block codes is relatively fixed. Generally, there are only a limited number of code rates to choose from, which makes it difficult to match the code rate of block codes with the equivalent channel capacity under different channel conditions. Unlike linear block codes, rateless codes can theoretically generate any number of groups of coded symbols based on the same group of information for transmission, thereby achieving continuous adjustment of the code rate. Obviously, compared with linear block codes, rateless codes are more likely to obtain a code rate close to the channel capacity, thereby obtaining a larger throughput and a lower bit error rate.

[0093] It should be understood that MLC divides a string of modulation symbols into m layers according to the different capacities of modulated bits in the symbols, and each layer is independently encoded.

[0094] Figure 3 It is a schematic diagram of the MLC process of m-order modulation. Figure 3 The coding in the example of polar code is introduced. For example, for an m-order modulation, the information bit stream z to be transmitted is first converted from serial to parallel to divide it into m bit streams u 1 ,u 2 ,u 3 ...u m Each bit stream corresponds to a bit channel under high-order modulation, and polar coding is performed separately for the bit channel, that is, the codeword x output by the mth encoder 1 The modulator (Mod) generates N modulation symbols and sends them to the channel for transmission. The demodulator (Dem) uses the channel received sequence y to demodulate the soft value v required by the first polar decoder. 1 , then the polar decoder uses the soft value sequence v corresponding to the first stream 1 Decode u 1 To decode the soft value v corresponding to the second stream 2 , you need to change u 1 The corresponding polar code word x 1 The demodulator uses y and x 1 Demodulate the soft value sequence v corresponding to the second stream 2 , and input it to the second polar code decoder. The second polar code decoder uses the soft value sequence to decode u 2 , and then the demodulator uses u 2 and u 1 The corresponding codeword x 2 and x 1, and the channel received sequence y demodulates the soft value sequence v corresponding to the third stream 3 Similarly, to demodulate the mth stream, the channel receiving sequence y and the codeword x of the previous m-1 polarization codes are required. 1 ~x m .

[0095] It can be seen that MLC uses serial demodulation, and the MLC requires m encoders and m decoders.

[0096] Demodulation refers to converting a modulation symbol (such as S 1 ,S 2 ,S 3 ...S m ) into its corresponding bit sequence (e.g. v 1 ,v 2 ,v 3 ...v m ) process. Among them, the demodulation method can be divided into serial demodulation and parallel demodulation.

[0097] The following uses a 4-PAM symbol as an example to illustrate the serial demodulation and parallel demodulation methods respectively. Assume that a 4-PAM symbol s corresponds to two bits (v1, v2), and the symbol received by the decoder after s passes through the AWGN channel is y.

[0098] (1) Serial demodulation

[0099] In order to obtain the value of v1, we can deduce the probability P(v1) that v1 = 0 based on y. 1 =0|y) and the probability P(v1=1) 1 =1|y), and determine the value of v1 according to the following formula (2):

[0100]

[0101] in

[0102] akin,

[0103] According to the above Figure 2 In the 4-PAM example given in (1), when calculating P(v 1 =0|y) and P(v 1 =1|y), S 00 =-3A, S 10 =-A, S 11 =+A,S 01 = +3A, in order to ensure the average transmission power E s=1, that is, 1 / 4*(|S 00 | 2 +|S 10 | 2 +|S 11 | 2 +|S 01 | 2 )=1, yes Then use the above formula (2) to get v 1 The value of .

[0104] In order to obtain v 2 The serial demodulation needs to calculate the value of v 1 Under the condition of taking value v 2 =0 probability P(v 2 =0|y,v 1 ) and v 2 =1 probability P(v 2 =1|y,v 1 ), then calculate the log-likelihood ratio of the above two probabilities, and then get v according to formula (3) 2 The value of:

[0105]

[0106] If v 1 =0,

[0107] but

[0108]

[0109] If v 1 =1:

[0110] but

[0111]

[0112] Thus, we can calculate P(v 2 =0|y,v 1 ) and P(v 2 =1|y,v 1 ) probability, and then according to the above formula (3) we can serially demodulate v 2 .

[0113] (2) Parallel Demodulation

[0114] Request v 1 The process is the same as the serial demodulation in (1) above to find v 1 The process is the same as above. For details, please refer to the above introduction.

[0115] Request v2 In the process, the parallel demodulation does not need to use v 1 , but for all v 1 The possible values ​​are averaged and v is determined according to the following formula (4): 2 The value of 0:

[0116]

[0117] in,

[0118]

[0119] akin,

[0120]

[0121] It can be seen that serial demodulation needs to first estimate v based on the received symbol y 1 The value of , and then use v 1 The estimated value of and y further estimate v 2 The only difference between parallel demodulation and serial demodulation is that parallel demodulation is used to find the value of v 2 You don't need to use v 1 is an estimate of 1 and v 2 Can be obtained simultaneously and can be implemented in parallel.

[0122] It should be understood that both serial demodulation and parallel demodulation can be regarded as a m The process of converting a high-order modulation channel of 10 symbols into an m-bit channel. For example, taking 4-PAM as an example, the channel capacity of the modulation channel is I(Y; V 1 ,V 2 ). Serial demodulation decomposes the modulated channel into two bit channels, where the capacity of the first bit channel is I(Y; V 1 ), the capacity of the second bit channel is I(Y; V 2 |V 1 ), it can be proved that I(Y; V 1 ,V 2 )=I(Y;V 1 )+I(Y;V 2 |V 1 ), that is, serial demodulation does not cause capacity loss: Figure 4 As shown by the solid lines in the figure, the first solid line from bottom to top is V 1 The bit channel capacity I(Y; V 1 ), the second solid line is V 2 The bit channel capacity I(Y; V2 |V 1 ), the third solid line from the bottom to the top is the modulation channel capacity I(Y; V 1 ,V 2 ). Parallel demodulation also decomposes the modulation channel into two bit channels, where the capacity of the first bit channel is I(Y; V 1 ), but the capacity of the second bit channel is I(Y; V 2 ), due to I(Y;V 1 ,V 2 )>=I(Y;V 1 )+I(Y;V 2 ), so parallel demodulation will cause a certain capacity loss: such as Figure 4 As shown by the dotted line in the middle, the first dotted line from bottom to top is V 1 The bit channel capacity I(Y; V 1 ), the second dotted line is V 2 The bit channel capacity I(Y; V 2 ), the third dotted line is the modulation channel capacity I(Y; V 1 )+I(Y;V 2 ). It can be seen that parallel demodulation has a certain capacity loss compared to serial demodulation, but since parallel demodulation is simple to implement and can be parallelized, it is generally used at present.

[0123] Modulation and coding scheme (MCS) is a commonly used technology in wireless communication technology. For example, before a terminal device sends an uplink data channel (such as a physical uplink shared channel (PUSCH)) to a network device, the terminal device needs to determine the MCS used by the PUSCH. The MCS is used to indicate the modulation order and coding rate corresponding to the data channel. The terminal device determines the redundant coding scheme and modulation scheme used for the data carried by the PUSCH based on the MCS. It can be seen that the existing MCS specifies the modulation order and coding rate of the data channel during the communication process.

[0124] MCS defines the number of valid bits that a resource element (RE) can carry. MCS can include MCS schemes 0 to 31, with MCS schemes 29 to 31 reserved. The higher the MCS index, the higher the number of valid bits that can be carried. MCS mainly defines two parts: modulation order and code rate.

[0125] The modulation order corresponds to the modulation scheme, and the optional modulation schemes supported by 5G NR include QPSK, 16QAM, 64QAM and 256QAM. When QPSK is used as the modulation scheme, 2 bits of information can be transmitted on each RE; when 16QAM is used as the modulation scheme, 4 bits of information can be transmitted on each RE; when 64QAM is used as the modulation scheme, 6 bits of information can be transmitted on each RE; when 256QAM is used as the modulation scheme, 8 bits of information can be transmitted on each RE.

[0126] The code rate is the ratio of the number of useful bits to the total number of transmitted bits, which includes useful bits and redundant bits. The code rate is mainly used to measure the redundancy added by the physical layer. Redundant bits are used for forward error correction.

[0127] The MCS table is introduced as an example below. As shown in Table 1, the MCS table includes 4 columns: MCS index, modulation order, code rate x1024, and spectrum efficiency.

[0128] Table 1

[0129]

[0130] It can be seen that the highest modulation order of the MCS table shown in Table 1 is 6, that is, the highest modulation mode is 64QAM. Of course, when the modulation order in Table 1 is 2 and 4, the corresponding modulation modes are QPSK and 16QAM respectively.

[0131] As shown in Table 1, the first column is the MCS index number, where 29 to 31 are reserved bits. The second column is the modulation order, which indicates which modulation method is used. The value of the second column can be expressed as Q m , where Q m =2, it means using 2 2 =4 modulation order, i.e. QPSK; Q m =4, it means using 2 4 = Modulation order of 16, i.e. 16QAM; Q m =6, indicating the use of 2 6 =64 modulation order, i.e. 64QAM. The third column is the code rate (or target code rate), which indicates the code rate expected to be achieved after selecting the modulation mode and corresponding redundancy corresponding to the MCS index. The fourth column is the spectrum efficiency, which indicates the frequency efficiency corresponding to the MCS index. Among them, the code rate in the above Table 1 is positively correlated with the spectrum efficiency, i.e. the higher the spectrum efficiency, the higher the code rate.

[0132] It should be understood that the MCS is determined by the network device based on the link adaptation algorithm, and the specific MCS selected often depends on the quality of the wireless link. The better the quality of the wireless link, the higher the MCS index, that is, the more useful bits are transmitted in one symbol. Correspondingly, the worse the quality of the wireless link, only the MCS with a lower MCS index can be selected, that is, the fewer useful bits are transmitted in one symbol. The network device can select the MCS based on the block error rate (BLER). Usually a BLER threshold equal to 10% is defined, and the network device uses the link adaptation algorithm to allocate the MCS so that the BLER does not exceed the threshold under different radio conditions.

[0133] 3GPP has standardized the relevant standard protocols and provided MCS tables for PDSCH to be provided to network devices for selection. These include 64QAM table, 256QAM table and low spectrum efficiency 64QAM table. Among them, 64QAM table (such as Table 1 above): when the network device or terminal device does not support 256QAM or the channel quality of the wireless link is poor, the 256QAM table decoding is unsuccessful, and the network device needs to use QPSK for modulation, then the 64QAM table can be used; 256QAM table: when the wireless link channel state is good, and the network device and terminal device support 256QAM, then the 256QAM table can be used; low spectrum efficiency 64QAM table: suitable for applications that require reliable data transmission, such as URLLC category applications. The MCS of this table improves the reliability of the channel by reducing the coding rate and increasing the channel coding redundancy, so the spectrum efficiency is relatively low.

[0134] Among them, the 256QAM table and the low spectrum efficiency 64QAM table can be referred to in the prior art, and will not be described in detail here.

[0135] Based on the above-mentioned existing MCS, each MCS index corresponds to a fixed modulation order and target code rate. Since the modulation order is fixed, the modulation order cannot be flexibly adjusted during the coding modulation process, and an extremely low code rate may occur, resulting in coding loss and affecting channel capacity allocation.

[0136] The present application provides a communication method, which can avoid the problem of large computational complexity caused by the system pre-calculating the modulation order corresponding to the MCS index, and at the same time, can improve the stability of coding performance.

[0137] Figure 5 This is a schematic flow chart of a communication method provided in an embodiment of the present application. It may include the following steps:

[0138] 501. The first device receives indication information.

[0139] The indication information is used to indicate the first index in the encoding strategy set.

[0140] It should be understood that the coding strategy set is composed of a first index and a first value, the first value is a spectrum efficiency and / or a quantized value of spectrum efficiency. The coding strategy set includes multiple groups of correspondences, each of which is used to describe the first index and the first value.

[0141] It should also be understood that the set of coding strategies does not include modulation order.

[0142] As an example, the encoding strategy set may include one or more items in the following Table 2:

[0143] Table 2

[0144]

[0145]

[0146] As shown in Table 2, each entry corresponds to a set of corresponding relationships, and each set of corresponding relationships is a corresponding relationship between the first index and the quantized value of the spectrum efficiency, and the spectrum efficiency.

[0147] As another example, the encoding strategy set may include one or more items in the following Table 3:

[0148] Table 3

[0149] First Index Spectral efficiency x1024 0 256 1 320 2 400 3 496 4 608 5 736 6 880 7 1040 8 1216 9 1408 10 1616 11 1840 12 2096 13 2360 14 2632 15 2912 16 3200 17 3496 18 3800 19 4112 20 4428 21 4749 22 5072 23 5400 24 5732 25 6068 26 6408

[0150] As shown in Table 3, each entry corresponds to a set of corresponding relationships, and each set of corresponding relationships is a corresponding relationship between a first index and a quantized value of spectrum efficiency.

[0151] As another example, the encoding strategy set may include one or more items in the following Table 4:

[0152] Table 4

[0153]

[0154]

[0155] As shown in Table 4, each entry corresponds to a set of corresponding relationships, and each set of corresponding relationships is a corresponding relationship between a first index and a spectrum efficiency.

[0156] Based on the coding strategy sets shown in Tables 2, 3 and 4 above, the coding strategy sets in the present application do not limit the specific value of the modulation order, that is, the modulation order corresponding to the first index and the first value can take any value, and the system does not need to pre-calculate the modulation order corresponding to the first index and the first value.

[0157] It should also be understood that the above Table 2, Table 3 and Table 4 are only examples of the present application, wherein the specific values ​​of the first index, the spectrum efficiency and / or the quantized value of the spectrum efficiency are not specifically limited in the present application. The quantized value of the spectrum efficiency in the above Table 2 and Table 3 is taken as an example of the spectrum efficiency x1024, and the quantized value of the spectrum efficiency may also exist in other calculation methods, which are not limited in the present application.

[0158] 502. The first device determines a first value corresponding to the first index according to the first index.

[0159] It should be understood that the first device obtains the first value corresponding to the first index from the encoding strategy set according to the first index in the indication information.

[0160] 503. The first device sends a first codeword.

[0161] It should be understood that the first codeword is based on the number N of resource units RE RE and the first value determines the number N of resource units RE Related to the symbol to be sent.

[0162] In a possible implementation, the number of information bits corresponding to the first codeword is equal to the number N of resource units RE. RE Related to the number of flows.

[0163] As an example, the number of information bits corresponding to the first codeword satisfies: N info =N RE *R s *v.

[0164] Among them, N RE represents the number of resource units RE, Rs is determined according to R and Qm, R represents the code rate, Qm represents the number of bits in the modulation symbol, and v represents the number of streams.

[0165] In another possible implementation, the first codeword is based on the number N of resource units RE RE , the first value and the second modulation order are determined by adjusting the first modulation order M according to the third sequence. The third sequence is based on the number N of resource units RE RE , determined by the first sequence and k non-pre-frozen bits. The first sequence corresponds to the number of symbols N and the first modulation order M, and the number of resource units RE N RE For the first sequence (NN RE The bits corresponding to the first and second symbols are pre-frozen to obtain the second sequence. The third sequence is determined by selecting k non-pre-frozen bits from the second sequence in descending order of reliability.

[0166] It should be understood that the maximum number of symbols supported by the first sequence is N, and the maximum modulation order supported (or called the first modulation order) is M. Alternatively, it can be understood that the first sequence corresponds to the number of symbols N and the first modulation order M, and the length of the first sequence is N*M.

[0167] It should also be understood that the number N of the resource units RE RE The size of N is the number of symbols allocated / preset by the system, or the number of symbols to be sent by the system for the network configuration. RE is a positive integer. RE It can take any value, for example, N RE is 15, 22, 12 or 6, etc., this application is for N RE There is no restriction on the specific value of .

[0168] It should also be understood that the first device is based on the number N of the resource units RE RE For the first sequence (NN RE ) symbols are pre-frozen, that is, the pre-frozen bits cannot contain information bits. The first device performs pre-freezing on the bits corresponding to the first sequence (NN RE ) symbols corresponding to the bits are pre-frozen, and the resulting sequence can be called the second sequence. The second sequence is the first sequence (NN RE ) symbols are pre-frozen to obtain a sequence. Further, the first device selects k non-pre-frozen bit positions from the second sequence in descending order of bit reliability to obtain the third sequence. The first device modulates the first modulation order M according to the third sequence to obtain the second modulation order.

[0169] The first modulation order is a modulation order corresponding to the first sequence, and the first sequence is a sequence pre-set and constructed by the system. The second modulation order is used to determine the modulation order of the first codeword, and the second modulation order is adjusted and determined according to the first modulation order.

[0170] As an example, the first device adjusts the first modulation order and determines the second modulation order according to the number m of modulation orders occupied by the k first bits in the third sequence.

[0171] Assume that the third sequence includes M modulation orders, each of the M modulation orders includes the first bit, that is, the k information bits are distributed in the M modulation orders in the third sequence, that is, m=M, and M can be used as the second modulation order. Assume that when the second modulation order is a QAM modulation order, the number of constellation points of the QAM can be determined according to M. For example, the number of constellation points of the QAM satisfies: A=2 2M; Or, there are x modulation orders in the third sequence that do not include the first bit, that is, Mx modulation orders include the first bit, that is, the number of modulation orders including the first bit in the third sequence is: m=Mx. Assuming that the second modulation order is the modulation order of QAM, the number of constellation points of the QAM can be determined according to m=Mx. For example, the number of constellation points of the QAM satisfies: A=2 2(M-x) .

[0172] It should be understood that k information bits correspond to k first bits in the third sequence, and the k first bits are at m modulation orders of the third sequence. The m can be used to determine the number of constellation points of the modulation mode (eg, QAM, PAM).

[0173] As another example, the number of modulation orders of the k first bits in the third sequence is m, and the first device determines whether the m modulation orders meet the first condition, adjusts the first modulation order, and determines the second modulation order.

[0174] Assume that the m modulation orders corresponding to the k first bits in the third sequence do not satisfy the first condition, and the k first bits correspond to k information bits, where m is less than or equal to M, and m is a positive integer. The first device determines a new sequence, and determines whether the first condition is satisfied based on the new sequence, until the modulation order corresponding to the new sequence satisfies the first condition, and then adjusts the first modulation order to a second modulation order of the number of modulation orders that satisfies the first condition.

[0175] For example, the m modulation orders corresponding to the k first bits in the third sequence do not meet the first condition, and the fourth sequence is further determined based on the k information bits and the modulation order m of the third sequence. The k second bits in the fourth sequence correspond to m' modulation orders. The m' modulation orders meet the first condition, m' is less than m, and the k second bits are used to carry the k information bits; the first modulation order M is adjusted, and m' is used as the second modulation order.

[0176] For another example, the m modulation orders corresponding to the k first bits in the third sequence do not meet the first condition, and the first device determines the fifth sequence based on the k information bits and the modulation order m of the third sequence. The k third bits in the fifth sequence are used to carry the k information bits, and the k third bits correspond to m” modulation orders in the fifth sequence, and the m” modulation orders do not meet the first condition; further, according to the fifth sequence, the bits corresponding to the lowest or highest layer of bit reliability in the m” modulation orders in the fifth sequence are pre-frozen to obtain a fourth sequence. The k second bits in the fourth sequence correspond to m' modulation orders. The m' modulation orders meet the first condition, m' is less than m", and the k second bits are used to carry the k information bits. Adjust the first modulation order M and use m' as the second modulation order.

[0177] It should be understood that the first condition includes: in the modulation order where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to the first threshold; and / or, the k information bits are located at the bit positions corresponding to the same modulation order.

[0178] The size of the first threshold is predefined or preset by the system, and this application does not impose any limitation on this.

[0179] It should also be understood that according to the first condition, the second modulation order is determined by adjusting the first modulation order. For a detailed description, please refer to Figure 6 An exemplary description in .

[0180] Figure 6 is a schematic flow chart of determining a modulation order provided by an embodiment of the present application. Figure 6 As shown, the first device may perform the following steps:

[0181] Step 1: According to the number N of resource units RE RE , for the first sequence (NN RE ) symbols are pre-frozen to obtain a second sequence.

[0182] Among them, the number of resource units RE is N RE Corresponding to the size of the first symbol number n, the number of resource units RE N RE N is the number of resource units allocated by the system for symbols to be sent. RE Is a positive integer.

[0183] Among them, the first sequence is a sequence pre-set and constructed by the system. The first sequence supports a maximum number of symbols of N and a maximum modulation order (or called the first modulation order) of M. Alternatively, it can be understood that the first sequence corresponds to N symbols and M modulation orders, and the length of the first sequence is N*M.

[0184] It should be understood that according to the number N of the resource units RE RE For the first sequence (NN RE ) symbols are pre-frozen, that is, the pre-frozen bits cannot contain information bits, which is the second sequence.

[0185] Step 2: Select k non-pre-frozen bits from the second sequence in descending order of bit reliability to obtain a third sequence.

[0186] The selected k non-pre-frozen bits are used to place k information bits, where k is a positive integer. The size of the k information bits is configured by the system, or the system is configured according to network requirements, and this application does not make any specific limitation on this.

[0187] It should be understood that k non-pre-frozen bits are selected from the second sequence according to the bit reliability from high to low to obtain a third sequence. The third sequence includes k first bits, and the k first bits are used to place the k information bits. The number of modulation orders occupied by the k first bits in the third sequence is m, m≤M, and m is a positive integer.

[0188] Step 3: The k information bits correspond to the k first bits of the third sequence, and the number of modulation orders including the k first bits in the third sequence is determined to be m.

[0189] The k information bits correspond to k first bits in the third sequence, and the k first bits are respectively located at m modulation orders in the third sequence, that is, the bits corresponding to the m modulation orders in the third sequence include the k first bits.

[0190] Step 4: Determine whether the m modulation orders meet the first condition.

[0191] Among them, it is determined whether the ratio between the number of first bits on at least one modulation order (for example, the modulation order with the lowest reliability) among the m modulation orders is greater than or equal to the first threshold, and / or whether m is equal to 1.

[0192] It should be understood that, assuming that the third sequence includes 4 modulation orders, namely level0, level1, level2 and level3, the reliability of level0 is the lowest and the reliability of level3 is the highest. The reliabilities corresponding to level0, level1, level2 and level3 are respectively: level0<level1<level2<level3 from low to high. If the bit positions corresponding to level0, level1, level2 and level3 are not pre-frozen, that is, the number of information bits carried by level0, level1, level2 and level3 are k0, k1, k2, k3 respectively, that is, k0<k1<k2<k3.

[0193] Assume that k=11, n=22, and the bit corresponding to level3 in the third sequence is a pre-frozen bit, that is, m=3. The number of first bits included in level0, level1, and level2 are: 2, 4, and 5, respectively. Assume that when m=3, the first threshold is 1 / 28, and the ratio (code rate) between the number of first bits included in level0 of the three modulation orders and n is: 1 / 11. The ratio between the number of first bits included in level0 and n is greater than the first threshold 1 / 28. It can be seen that the modulation order m=3 corresponding to the third sequence satisfies the first condition, that is, m=3 can be used to determine the number of QAM constellation points. The number of QAM constellation points can satisfy: A=2 2*3 = 64. No further steps are required.

[0194] Assume that k=2, n=22, and the third sequence includes 4 modulation levels, namely level0, level1, level2 and level3. Among them, the bits corresponding to level1, level0 and level3 are pre-frozen bits, that is, m=1. The number of first bits included on level2 is: 2. Since the modulation level of the information bit carried in the third sequence is 1, that is, the first condition is met, the number of constellation points of the QAM can meet: A=2 2*1 = 4. No further steps are required.

[0195] Assume that k=11, n=64, and the third sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Among them, the bit corresponding to level3 is the pre-frozen bit, that is, m=3. The number of first bits included in level0, level1, and level2 are: 2, 4, and 5 respectively. Assume that when m=3, the first threshold is 1 / 28, and the ratio between the number of first bits included in level0 of the three modulation orders and n is: 1 / 32. The ratio between the number of first bits included in level0 and n is less than the first threshold 1 / 28, and m is not equal to 1. It can be seen that the three modulation orders corresponding to the third sequence do not meet the first condition, so continue to execute. Figure 7 Follow step 5 and subsequent steps in .

[0196] Assume again that k=13, n=150, and the third sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Level0, level1, level2 and level3 in the third sequence can all be used to carry information bits, that is, m=4. Among them, the number of first bits included in level0, level1, level2 and level3 are: 1, 3, 4, 5 respectively. Assume that when m=4, the first threshold is 1 / 140, and the ratio between the number of first bits included in level0 of the four modulation orders and n is: 1 / 150. The ratio between the number of first bits included in level0 and n is less than the first threshold 1 / 140, and m is not equal to 1. It can be seen that the 4 modulation orders corresponding to the third sequence do not meet the first condition, then continue to execute. Figure 7 Follow step 5 and subsequent steps in .

[0197] Assume that k=7, n=22, and the third sequence includes 4 modulation orders, namely level0, level1, level2 and level3. The bits corresponding to level0 and level3 are pre-frozen bits, that is, m=2. Among them, the number of first bits included in level1 and level2 are: 2 and 5 respectively. Assume that when m=2, the first threshold is 1 / 12, and the ratio between the number of first bits included in level1 of the two modulation orders and n is: 1 / 11. The ratio between the number of first bits included in level1 and n is greater than the first threshold 1 / 12. It can be seen that the two modulation orders corresponding to the third sequence meet the first condition, that is, the number of QAM constellation points can be determined according to m=2. The number of QAM constellation points can satisfy: A=2 2*2 = 16. No further steps are required.

[0198] Step 5: Pre-freeze the bits corresponding to the lowest layer or the highest layer of bit reliability among the m modulation orders to obtain a fifth sequence.

[0199] It should be understood that if the number of first bits corresponding to at least one layer of modulation orders among the m modulation orders in the third sequence is less than or equal to the first threshold, then the bits corresponding to the lowest or highest layer of bit reliability in the third sequence are pre-frozen to obtain the fifth sequence.

[0200] Assume that the third sequence includes 4 modulation orders, namely level0, level1, level2 and level3. The bit corresponding to level0 is the bit with the lowest bit reliability in the third sequence; the bit corresponding to level3 is the bit with the highest bit reliability in the third sequence. When the number of first bits corresponding to at least one modulation order (for example, the modulation order with the lowest reliability) among the m modulation orders in the third sequence is less than or equal to the first threshold, the bits corresponding to level0 in the third sequence are pre-frozen to obtain the fourth sequence, or the bits corresponding to level3 in the third sequence are pre-frozen to obtain the fifth sequence.

[0201] Step 6: correspond the k information bits to the k third bits in the fifth sequence, and determine that the number of modulation orders including the k third bits in the fifth sequence is m".

[0202] The fifth sequence is a sequence after the bits corresponding to the highest or lowest bit reliability level in the third sequence are pre-frozen. Assume that the fifth sequence includes 4 modulation levels, namely level0, level1, level2 and level3. The bits corresponding to level0 or level3 are pre-frozen bits and cannot be used to store information bits.

[0203] Among them, the k information bits correspond to k third bits in the fifth sequence, and the k third bits are respectively located at m" modulation orders in the fifth sequence, that is, the bits corresponding to the m" modulation orders in the fifth sequence include the k third bits.

[0204] Step 7: Determine whether the m" modulation orders meet the first condition.

[0205] Among them, it is determined whether the number of third bits on at least one modulation order among the m" modulation orders is greater than or equal to a first threshold, and / or m"=1.

[0206] Assume that k=9, n=22, and the fifth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Among them, the bits corresponding to level0 and level3 are pre-frozen bits, that is, m”=2. The number of third bits included in level1 and level2 are: 4 and 5 respectively. Assume that when the modulation order is 2, the first threshold is 1 / 12, and in the two modulation orders of level1 and level2, the ratio between the number of third bits included in level1 and n is: 1 / 11. The ratio between the number of third bits included in level1 and n is greater than the first threshold 1 / 12. It can be seen that the two modulation orders corresponding to the fifth sequence meet the first condition, that is, the number of QAM constellation points can be determined according to m”=2. The number of QAM constellation points can satisfy: A=2 2*2 = 16. No further steps are required.

[0207] Assume that k=2, n=6, and the fifth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. The bits corresponding to level1, level3 and level2 are pre-frozen bits, that is, m"=1. The number of third bits included on level1 is: 2. Level1 in the fifth sequence includes 2 third bits. Since m"=1, the m" modulation orders corresponding to the fifth sequence meet the first condition. The number of constellation points of the QAM can meet: A=2 2*1 = 4. No further steps are required.

[0208] Assume that k=8, n=48, and the fifth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Among them, the bits corresponding to level0 and level3 are pre-frozen bits, that is, m”=2. The number of third bits included in level1 and level2 are: 3 and 5 respectively. Assume that when m”=2, the first threshold is 1 / 12, and the ratio between the number of third bits included in level1 of the two modulation orders and n is: 3 / 48. The ratio between the number of third bits included in level1 and n is less than the first threshold 1 / 12, and m” is not equal to 1. It can be seen that the two modulation orders corresponding to the fifth sequence do not meet the first condition, then continue to execute Figure 7 Follow step 8 and subsequent steps in .

[0209] Step 8: Pre-freeze the bits corresponding to the lowest or highest layer of bit reliability in the m" modulation orders to obtain a fourth sequence.

[0210] It should be understood that if the number of first bits corresponding to at least one layer of modulation orders among the m" modulation orders in the fifth sequence is less than the first threshold, the bits corresponding to the lowest layer or the highest layer of bit reliability in the fifth sequence are pre-frozen to obtain the fourth sequence.

[0211] Assume that the fifth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. In step 5, the bits corresponding to level0 in the third sequence are pre-frozen to obtain the fifth sequence. The bits corresponding to level0 in the fifth sequence are pre-frozen bits. At this time, the bits corresponding to level1 are the bits with the lowest reliability in the fifth sequence; the bits corresponding to level3 are the bits with the highest bit reliability in the fifth sequence. Among them, when the ratio of the number of third bits corresponding to the modulation order with the lowest reliability among the m" modulation orders in the fifth sequence to the first symbol number n is less than the first threshold value, the bits corresponding to level1 in the fifth sequence are pre-frozen to obtain the fourth sequence, or the bits corresponding to level3 in the fifth sequence are pre-frozen to obtain the fourth sequence.

[0212] It should also be understood that step 8 is similar to step 5 above and will not be described in detail here.

[0213] Step 9: correspond the k information bits to the k second bits in the fourth sequence, and determine the number of modulation orders including the k second bits in the fourth sequence as m'.

[0214] The fourth sequence is a sequence after the bits corresponding to the highest or lowest bit reliability layer in the fifth sequence are pre-frozen. Assume that the fourth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. In step 5, the bits corresponding to level0 are pre-frozen, and no information bits can be placed. In step 8, the bits corresponding to level1 or level3 can be pre-frozen, and no information bits can be placed.

[0215] The k information bits correspond to k second bits in the fourth sequence, and the k second bits are respectively located at m' modulation orders in the fourth sequence, that is, the bits corresponding to the m' modulation orders in the fourth sequence include the k second bits.

[0216] Step 10: Determine whether the m' modulation orders meet the first condition.

[0217] It is determined whether the ratio of the number of second bits on the modulation order with the lowest reliability among the m′ modulation orders to the first symbol number n is greater than or equal to a first threshold, and / or whether m′ is equal to 1.

[0218] Assume that k=9, n=22, and the fourth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Among them, the bits corresponding to level0 and level3 are pre-frozen bits, that is, m'=2. The number of second bits included in level1 and level2 are: 4, 5 respectively. Assume that when m'=2, the first threshold is 1 / 12, and the ratio between the number of first bits included in level1 of the two modulation orders and n is: 2 / 11. The ratio between the number of second bits included in level1 of the two modulation orders and n is greater than the first threshold 1 / 12. It can be seen that the two modulation orders corresponding to the fourth sequence meet the first condition, that is, the number of QAM constellation points is determined according to m'=2. The number of QAM constellation points can satisfy: A=2 2*2 = 16. No further steps are required.

[0219] Assume again that k=2, n=22, and the fourth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Among them, the bits corresponding to level0, level1 and level3 are pre-frozen bits, that is, m'=1. The number of second bits included on level2 is: 2. Since m'=1, there is no need to determine the relationship between the ratio between the number of second bits corresponding to level2 and the first symbol number n and the first threshold value, and the corresponding 1 modulation order of the fourth sequence meets the first condition. The number of constellation points of the QAM can satisfy: A=2 2*1 = 4. No further steps are required.

[0220] Assume that k=8, n=45, and the fourth sequence includes 4 modulation levels, namely level0, level1, level2 and level3. The bits corresponding to level0 and level1 are pre-frozen bits, that is, m'=2. The number of second bits included in level2 and level3 are: 3, 5 respectively. Assume that when m'=2, the first threshold is 1 / 12, and the ratio between the number of second bits included in level2 of the two modulation levels and n is: 1 / 15. The ratio between the number of second bits included in level2 and n is less than the first threshold 1 / 12, and m' is not equal to 1, then continue to execute as follows Figure 7 Steps 5 to 7, or steps 8 to 10 or similar steps, are performed to further determine the number of QAM constellation points.

[0221] Assume again that k=6, n=33, and the fourth sequence includes 4 modulation orders, namely level0, level1, level2 and level3. Among them, the bits corresponding to level2 and level3 are pre-frozen bits, that is, m'=2. The number of second bits included in level0 and level1 are: 2, 4 respectively. Assume that when m'=2, the first threshold is 1 / 12, and the ratio between the number of second bits included in level0 of the two modulation orders and n is: 2 / 33. The ratio between the number of second bits included in level0 and n is less than the first threshold 1 / 12. It can be seen that the two modulation orders corresponding to the third sequence do not meet the first condition, and m"=2, and is not equal to 1, then continue to execute the same Figure 7 Steps 5 to 7, or steps 8 to 10 or similar steps, are performed to further determine the number of QAM constellation points.

[0222] It should be understood that, as mentioned above Figure 6 As shown, the second modulation order used to determine the first codeword is determined by the first device itself, and it is determined whether the bit position corresponding to the highest or lowest bit reliability layer in the sequence needs to be pre-frozen according to the modulation order of the bit position carrying the information bit and the first condition, and the information bit is re-corresponded to the non-pre-frozen bit position, and the first modulation order is adjusted to obtain the second modulation order. The information bits included in each coding layer corresponding to the second modulation order meet certain conditions (such as the first condition). Thereby, the system does not need to pre-calculate the modulation order, and the first device can determine the appropriate modulation order to avoid the coding loss caused by the extremely low code rate in the coding modulation process affecting the channel capacity allocation.

[0223] According to the above Figure 5 and Figure 6 The coding strategy set in the present application includes a correspondence between a first index and a first value. When the symbols to be transmitted are coded and modulated, the modulation order is adaptively determined by the first device, and the system does not need to pre-calculate and configure it to the first device. The first device can determine a suitable modulation order based on the symbols to be transmitted, thereby avoiding the situation of extremely low code rate when using the existing MCS, causing coding loss to affect channel capacity allocation. In addition, the method provided by the present application does not require the system to pre-calculate the modulation order, thereby reducing the calculation complexity of the system.

[0224] As an example, the method proposed in this application is given below, and when the block error rate of the data packet is 1%, the relationship between the first index and the symbol signal-to-noise ratio is obtained in combination with the data of the coding strategy set provided in Table 2 above.

[0225] Figure 7This is a simulation diagram when BLER=0.01.

[0226] It should be understood that Figure 7 This is a simulation experiment based on the specific example of the coding strategy set provided by the present application in Table 2 above. Figure 7 The horizontal axis in represents the first index in Table 2, and the vertical axis represents the symbol signal-to-noise ratio. It can be seen that there is a linear relationship between the first index and the symbol signal-to-noise ratio, that is, as the first index increases, the symbol signal-to-noise ratio increases steadily. The symbol signal-to-noise ratio changes at equal intervals with the change of the first index, which shows that the overall performance of the system is relatively stable.

[0227] according to Figure 7 As shown in the simulation diagram, the first device can adaptively determine the modulation order of QAM, increase the first index at equal intervals according to the coding strategy set provided in the present application, and increase the symbol signal-to-noise ratio at equal intervals, thereby ensuring the stability of the system performance and the relative stability of the encoding and decoding performance.

[0228] It is understood that the steps in the above figures are only exemplary and not strictly limited. In addition, the sequence numbers of the above processes do not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.

[0229] It can also be understood that some coding sequence names are involved in the various embodiments of the present application, and their naming does not limit the protection scope of the embodiments of the present application.

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

[0231] It can also be understood that in the above-mentioned various method embodiments, the methods and operations implemented by the first device can also be implemented by components (such as chips or circuits) that can be implemented by the first device, without limitation.

[0232] Corresponding to the methods given in the above-mentioned method embodiments, the embodiments of the present application also provide corresponding devices, which include modules for executing the corresponding methods in the above-mentioned method embodiments. The module can be software, hardware, or a combination of software and hardware. It can be understood that the technical features described in the above-mentioned method embodiments are also applicable to the following device embodiments.

[0233] Figure 8 800 is a schematic block diagram of a communication device 800 provided in this application. Figure 8, the communication device 800 includes a processing unit 810 and a communication unit 820. The communication unit is also called a transceiver unit. The device 800 can implement the steps or processes corresponding to the first device in the above method embodiment, wherein the processing unit 810 is used to perform the processing-related operations of the first device in the above method embodiment, and the communication unit 820 is used to perform the sending-related operations of the first device in the above method embodiment. For example, each unit of the communication device 800 is used to implement the following functions:

[0234] The communication unit 820 is used to receive indication information, where the indication information is used to indicate a first index in a coding strategy set, where the coding strategy set is composed of a first index and a first value, and the coding strategy set includes multiple groups of correspondences, where each group of correspondences in the multiple groups of correspondences is used to describe the first index and the first value, and the first value is a spectral efficiency and / or a quantized value of the spectral efficiency; the processing unit 810 is used to determine a first value corresponding to the first index according to the first index; the communication unit 820 is also used to send a first codeword, where the first codeword is based on the number N of resource units RE RE and the first value determines the number of resource units N RE Related to the symbol to be sent.

[0235] In each embodiment of the communication device 800 corresponding to the transmitting end, the processing unit 810 is used to perform the processing and / or operation implemented by the first device in addition to the sending and receiving actions. The communication unit 820 is used to perform the receiving (or inputting) action of the first device, and / or, to perform the sending (or outputting) action of the first device.

[0236] It should be understood that the device 800 herein is embodied in the form of a functional unit. The term "unit" herein may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (e.g., a shared processor, a dedicated processor, or a group processor, etc.) and a memory for executing one or more software or firmware programs, a combined logic circuit, and / or other suitable components that support the described functions.

[0237] The apparatus 800 of each of the above schemes has the function of implementing the corresponding steps performed by the first device in the above method. The function can be implemented by hardware, or by hardware executing the corresponding software implementation. The hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (for example, the sending unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver), and other units, such as the processing unit, can be replaced by a processor to respectively perform the sending and receiving operations and related processing operations in each method embodiment.

[0238] In addition, the communication unit may also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit may be a processing circuit. In an embodiment of the present application, the device 800 may be the first device in the aforementioned embodiment, or may be a chip or a chip system, for example, a system on chip (SoC), wherein the communication unit may be an input / output circuit, a communication interface, and the processing unit may be a processor or a microprocessor or an integrated circuit integrated on the chip. This is not limited here.

[0239] Fig. 9 Schematic diagram of the communication device 900 provided in this application. Fig. 9 The communication device 900 includes: one or more processors 910, one or more memories 920, and one or more communication interfaces 930. The processor 910 is used to control the communication interface 930 to send and receive signals, the memory 920 is used to store a computer program, and the processor 910 is used to call and run the computer program from the memory 920, so that the communication device 800 performs the processing performed by the sending end or the receiving end in each method embodiment of the present application.

[0240] For example, the processor 910 may have Figure 8 The functions of the processing unit 810 shown in FIG. 8 , the communication interface 930 may have Figure 8 Specifically, the processor 910 may be used to execute a process or operation executed by the communication device, and the communication interface 930 may be used to execute a sending and / or receiving operation of the communication device.

[0241] Optionally, the memory and processor in the above-mentioned device embodiments may be physically independent units, or the memory may be integrated with the processor, which is not limited in the present application.

[0242] In addition, the present application also provides a computer-readable storage medium, in which computer instructions are stored. When the computer instructions are executed on a computer, the operations and / or processing performed by the first device in each method embodiment of the present application are executed.

[0243] In addition, the present application also provides a computer program product, which includes computer program code or instructions. When the computer program code or instructions are run on a computer, the operations and / or processing performed by the first device in each method embodiment of the present application are executed.

[0244] In addition, the present application also provides a chip, which includes a processor, a memory for storing computer programs is set independently of the chip, and the processor is used to execute the computer program stored in the memory, so that a device equipped with the chip performs the operations and / or processing performed by the first device in any method embodiment.

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

[0246] Optionally, the processor may be one or more, the memory may be one or more, and the memory may be one or more.

[0247] In addition, the present application also provides a communication device (for example, a chip or a chip system), including a processor and a communication interface, according to the operation and / or processing performed by the first device in any of the aforementioned method embodiments, the communication interface is used to receive (or referred to as input) message bits to be encoded, and the processor encodes the message bits to be encoded. Optionally, the communication interface is also used to send (or referred to as output) data and / or information processed by the processor.

[0248] In addition, the present application also provides a communication device, comprising at least one processor, wherein the at least one processor is coupled to at least one memory, and the at least one processor is used to execute a computer program or instruction stored in the at least one memory, so that the communication device performs the operations and / or processing performed by the first device in any method embodiment.

[0249] In addition, the present application also provides a communication system, including the first device in the method embodiment of the present application.

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

[0251] The method provided in the above embodiment can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product may include one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated.

[0252] In order to clearly describe the technical solutions of the embodiments of the present application, in the embodiments of the present application, numbers such as "first" and "second" are used to distinguish the same or similar items with substantially the same functions and effects. Those skilled in the art can understand that numbers such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit them to be different.

[0253] In the embodiments of the present application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship.

[0254] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0255] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0256] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0257] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0258] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0259] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0260] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

Claims

1. A communication method, characterized in that: include: Receive indication information, where the indication information is used to indicate a first index in a coding strategy set, where the coding strategy set is composed of the first index and a first value, where the coding strategy set includes multiple groups of correspondences, where each group of correspondences in the multiple groups of correspondences is used to describe the first index and the first value, where the first value is a spectrum efficiency and / or a quantized value of the spectrum efficiency; Determine, according to the first index, the first value corresponding to the first index; Send a first codeword, wherein the first codeword is based on the number N of resource units RE RE and the first value determines the number N of the resource units RE RE Related to the symbol to be sent.

2. The method according to claim 1, characterized in that The number of information bits corresponding to the first codeword and the number N of the resource units RE RE Related to the number of flows.

3. The method according to claim 2, characterized in that The number of information bits corresponding to the first codeword satisfies: N info =N RE *R s *v, Among them, N RE represents the number of resource units RE, Rs is determined according to R and Qm, R represents the code rate, Qm represents the number of bits in the modulation symbol, and v represents the number of streams.

4. The method according to any one of claims 1 to 3, characterized in that The first codeword is the number N of resource units RE RE and the first value is determined, comprising: The first codeword is based on the number N of the resource units RE RE , the first value and the second modulation order are determined, the second modulation order is determined by adjusting the first modulation order M according to a third sequence, and the third sequence is based on the number N of the resource units RE RE , the first sequence and k non-pre-frozen bits determine, The first sequence corresponds to the number of symbols N and the first modulation order M, and the number of resource units RE N RE For the first sequence (NN RE ) symbols are pre-frozen to obtain a second sequence, and the third sequence is determined by selecting the k non-pre-frozen bits from the second sequence in descending order of reliability.

5. The method according to claim 4, characterized in that The second modulation order is determined by adjusting the first modulation order M according to the third sequence, including: The m modulation orders corresponding to the k first bits in the third sequence do not satisfy the first condition, the second modulation order is m' modulation orders, the m' modulation orders are the modulation orders corresponding to the k second bits in the fourth sequence, and the m' modulation orders satisfy the first condition, The fourth sequence is determined according to the k information bits and m, the k second bits correspond to the k information bits, m' is less than m, the k first bits correspond to the k information bits, m is less than or equal to M, and m is a positive integer.

6. The method according to claim 5, characterized in that The fourth sequence is determined according to the k information bits and m, and includes: The fourth sequence is obtained by pre-freezing the bits corresponding to the lowest layer or the highest layer of bit reliability in the m" modulation orders by the fifth sequence, the fifth sequence is determined according to the k information bits and m, the k third bits in the fifth sequence correspond to the k information bits, the k third bits correspond to the m" modulation orders, and the m" modulation orders do not meet the first condition, Wherein, m" is less than M, and m" is a positive integer.

7. The method according to claim 5 or 6, characterized in that: The first condition includes: In the modulation orders where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, The k information bits are located at bit positions corresponding to the same modulation order.

8. The method according to claim 4, characterized in that The second modulation order is determined by adjusting the first modulation order M according to the third sequence, including: The m modulation orders corresponding to the k first bits in the third sequence meet the first condition, and the second modulation order is the m modulation order, Among them, the k first bits correspond to the k information bits, m is less than M, m is a positive integer, and the first condition includes: in the modulation order where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, the k information bits are located at the bit positions corresponding to the same modulation order.

9. The method according to any one of claims 4 to 8, characterized in that When the first modulation order M is the modulation order of the first quadrature amplitude modulation QAM, the first modulation order M is used to determine the number of constellation points of the first QAM, and the number of constellation points of the first QAM satisfies: A=2 2M ; When the second modulation order is the modulation order of the second QAM, the second modulation order is used to determine the number of constellation points of the second QAM, and the number of constellation points of the second QAM satisfies a=2 2* Second modulation order.

10. The method according to any one of claims 1 to 9, characterized in that The multiple groups of corresponding relationships included in the encoding strategy set correspond to one or more of the following items: 。 11. A communication device, characterized in that: include: a transceiver unit, configured to receive indication information, wherein the indication information is used to indicate a first index in a coding strategy set, wherein the coding strategy set is composed of the first index and a first value, wherein the coding strategy set includes multiple groups of correspondences, wherein each group of correspondences in the multiple groups of correspondences is used to describe the first index and the first value, wherein the first value is a spectrum efficiency and / or a quantized value of the spectrum efficiency; a processing unit, configured to determine, according to the first index, the first value corresponding to the first index; The transceiver unit is further configured to send a first codeword, wherein the first codeword is based on the number N of resource units RE. RE and the first value determines the number N of the resource units RE RE Related to the symbol to be sent.

12. The device according to claim 11, characterized in that The number of information bits corresponding to the first codeword and the number N of the resource units RE RE Related to the number of flows.

13. The device according to claim 12, characterized in that The number of information bits corresponding to the first codeword satisfies: N info =N RE *R s *v, Among them, N RE represents the number of resource units RE, Rs is determined according to R and Qm, R represents the code rate, Qm represents the number of bits in the modulation symbol, and v represents the number of streams.

14. The device according to any one of claims 11 to 13, characterized in that The first codeword is the number N of resource units RE RE and the first value is determined, comprising: The first codeword is based on the number N of the resource units RE RE , the first value and the second modulation order are determined, the second modulation order is determined by adjusting the first modulation order M according to a third sequence, and the third sequence is based on the number N of the resource units RE RE , the first sequence and k non-pre-frozen bits determine, The first sequence corresponds to the number of symbols N and the first modulation order M, and the number of resource units RE N RE For the first sequence (NN RE ) symbols are pre-frozen to obtain a second sequence, and the third sequence is determined by selecting the k non-pre-frozen bits from the second sequence in descending order of reliability.

15. The device according to claim 14, characterized in that The second modulation order is determined by adjusting the first modulation order M according to the third sequence, including: The m modulation orders corresponding to the k first bits in the third sequence do not satisfy the first condition, the second modulation order is m' modulation orders, the m' modulation orders are the modulation orders corresponding to the k second bits in the fourth sequence, and the m' modulation orders satisfy the first condition, The fourth sequence is determined according to the k information bits and m, the k second bits correspond to the k information bits, m' is less than m, the k first bits correspond to the k information bits, m is less than or equal to M, and m is a positive integer.

16. The device according to claim 15, characterized in that The fourth sequence is determined according to the k information bits and m, and includes: The fourth sequence is obtained by pre-freezing the bits corresponding to the lowest layer or the highest layer of bit reliability in the m" modulation orders by the fifth sequence, the fifth sequence is determined according to the k information bits and m, the k third bits in the fifth sequence correspond to the k information bits, the k third bits correspond to the m" modulation orders, and the m" modulation orders do not meet the first condition, Wherein, m" is less than M, and m" is a positive integer.

17. The device according to claim 15 or 16, characterized in that The first condition includes: In the modulation orders where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, The k information bits are located at bit positions corresponding to the same modulation order.

18. The device according to claim 14, characterized in that The second modulation order is determined by adjusting the first modulation order M according to the third sequence, including: The m modulation orders corresponding to the k first bits in the third sequence meet the first condition, and the second modulation order is the m modulation order, Among them, the k first bits correspond to the k information bits, m is less than M, m is a positive integer, and the first condition includes: in the modulation order where the k information bits are located, the number of information bits included in each modulation order is greater than or equal to a first threshold; and / or, the k information bits are located at the bit positions corresponding to the same modulation order.

19. The device according to any one of claims 14 to 18, characterized in that When the first modulation order M is the modulation order of the first quadrature amplitude modulation QAM, the first modulation order M is used to determine the number of constellation points of the first QAM, and the number of constellation points of the first QAM satisfies: A=2 2M ; When the second modulation order is the modulation order of the second QAM, the second modulation order is used to determine the number of constellation points of the second QAM, and the number of constellation points of the second QAM satisfies a=2 2* Second modulation order.

20. The device according to any one of claims 11 to 19, characterized in that The multiple groups of corresponding relationships included in the encoding strategy set correspond to one or more of the following items: 。 21. A communication device, characterized in that: The device comprises at least one processor coupled to at least one memory, wherein the at least one processor is configured to execute a computer program or instruction stored in the at least one memory so as to enable the communication device to perform the method according to any one of claims 1 to 10.

22. A chip, characterized in that: The method comprises a processor and a communication interface, wherein the communication interface is used to receive a sequence to be encoded and send the sequence to be encoded to the processor, and the processor is according to the method according to any one of claims 1 to 10.

23. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the method according to any one of claims 1 to 10 is performed.

24. A computer program product, characterized in that The computer program product comprises a computer program code which, when run on a computer, causes the method according to any one of claims 1 to 10 to be performed.

Images