Channel coding or decoding method and communication device

Abstract

The invention provides a channel coding or decoding method. The method comprises the following steps: modifying a code rate of channel coding in an MCS table in NR; or the MCS table is redesigned, for example, the table item of the probability shaping pre-transformation code rate is introduced into the MCS table of the NR, and part of the table items in the MCS table are correspondingly modified based on the new constraint relation between the table items in the MCS table, so that the code rate r of channel coding in the modified MCS table or the designed MCS table is not equal to the code rate r of channel coding in the MCS table. And the code rate is consistent with the code rate actually used by channel coding, so that confusion or chaos introduced when the MCS table in the NR is used in a scene containing probability shaping pre-transformation is avoided.

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and more specifically, to a method and apparatus for channel coding or decoding. Background Technology

[0002] Higher-order modulation refers to mapping multiple bits to the same channel symbol, which can improve spectral efficiency. Common higher-order modulation schemes include quadrature amplitude modulation (QAM) and amplitude modulation (AM), such as 16QAM, 64QAM, and 256AM. Different symbols in higher-order modulation may have different energies; by transmitting more low-energy symbols and fewer high-energy symbols, average energy can be saved. Theoretical analysis shows that for a Gaussian white noise channel, the greatest energy saving occurs when the transmitted symbol distribution follows a Gaussian distribution. Compared to a uniform distribution, up to 1.53 dB of transmit power can be saved.

[0003] Probabilistic shaping (PS) is a common "shaping" technique. It involves cascading a precoder before the encoder to map ("shape") the information bits into a sequence following a specific distribution (the precoder is also called a distribution matcher (DM), or some kind of transformation). Then, during the encoding process, systematic coding is used, ensuring that the aforementioned sequence satisfying the specific distribution ultimately appears directly in the encoded sequence, thus shaping the final modulated symbol. Probabilistic shaping can achieve a higher probability of occurrence for low-energy symbols than for high-energy symbols.

[0004] However, when probabilistic shaping is introduced, precoding is required before channel coding. For a given spectral efficiency, the code rate for channel coding becomes higher, causing a mismatch between the current modulation and coding scheme (MCS) table in new radio (NR) and the actual channel coding code rate. Summary of the Invention

[0005] This application provides a channel coding or decoding method and communication apparatus that can be applied to situations where a probabilistic shaping pre-transformation is introduced before channel coding. This avoids confusion or chaos caused by applying existing MCS tables in this situation, ensuring that the code rate of the channel coding indicated in the MCS scheme matches the actual code rate of the channel coding. Furthermore, in the case of introducing probabilistic shaping, it can reduce the energy consumption of the coding device when transmitting modulation symbols and reduce the transmission power.

[0006] Firstly, a channel coding method is provided, which can be executed by a communication device or a module applied to the communication device (e.g., a processor, chip, circuit, etc., or a logic module, hardware, and / or software capable of implementing all or part of the functions of the communication device). The communication device is also referred to as an encoding device. The method may include: acquiring a bit sequence to be encoded; encoding the bit sequence to be encoded based on a channel coding code rate r to obtain an encoded sequence, wherein the channel coding code rate r satisfies a first constraint: r > SE / Q. m The Q m The modulation order is given, and the SE is the spectral efficiency; the encoded sequence is output.

[0007] In various embodiments of this application, the code rate r of the channel coding is less than or equal to 1.

[0008] In the technical solution of this application, if a probabilistic shaping pre-transform is introduced before channel coding, the code rate of the channel coding may not be consistent with the code rate of the channel coding contained in the MCS table of the NR. Therefore, the coding-side device determines the code rate of the channel coding based on a new constraint relationship (i.e., the first constraint relationship) satisfied by the code rate of the channel coding, thereby obtaining the actual code rate of the channel coding. This avoids errors or confusion when the code rate of the channel coding queried from the existing MCS table is directly applied in this situation. On the one hand, with the introduction of probabilistic shaping pre-transform, the code rate of the channel coding indicated in the MCS scheme matches the actual code rate of the channel coding; on the other hand, due to the introduction of probabilistic shaping pre-transform, the energy consumption of the coding-side device when transmitting modulation symbols can be reduced, thus lowering the transmission power.

[0009] Secondly, a channel decoding method is provided, which can be executed by a communication device or a module applied to the communication device (e.g., a processor, chip, circuit, etc., or a logic module, hardware, and / or software capable of implementing all or part of the functions of the communication device). The communication device is also called a decoding device. The method may include: acquiring a received value sequence; decoding the received value sequence based on a channel coding rate r to obtain a decoded bit sequence, wherein the channel coding rate r satisfies a first constraint: r > SE / Q. m The Q mThe modulation order is given, and the SE is the spectral efficiency; the decoded bit sequence is output.

[0010] The second approach is the decoding-side approach. Similar to the encoding-side approach, the decoding-side device determines the channel coding rate based on the new constraint relationship (i.e., the first constraint relationship) satisfied by the channel coding rate, and performs corresponding decoding based on the channel coding rate determined by the new constraint relationship. This avoids the problem that the channel coding rate recorded in the MCS table in NR is not suitable for describing cases involving probabilistic shaping pretransformation.

[0011] In some implementations of the first or second aspect, the code rate r of the channel coding and the modulation order Q m The spectral efficiency SE is an item in the first table, and at least one row of the first table satisfies the first constraint relationship.

[0012] In this implementation, when probabilistic shaping pre-transformation is included, the code rate r and modulation order Q of the channel coding are... m The spectral efficiency (SE) satisfies a first constraint relationship. A first table is established based on this first constraint relationship. This could be a modification of the MCS table in the NR, or a new table format could be designed to include the first constraint relationship between these parameters. Furthermore, the coding-side device or decoding-side device can directly look up the channel coding rate (r) obtained from Table 1, which is the actual code rate after introducing probabilistic shaping pre-transformation. Therefore, the first table is a description of channel coding-related parameters (e.g., the channel coding rate) that support probabilistic shaping pre-transformation.

[0013] In some implementations of the first or second aspect, when channel coding is performed based on rows in the first table that satisfy the first constraint relationship, a probabilistic shaping pre-transformation is included before the channel coding.

[0014] In this implementation, when performing channel coding based on rows in the first table that satisfy the first constraint relationship, a probabilistic shaping pre-transformation is included before channel coding. In other words, the constraint relationship between the entries in the first table that satisfy the first constraint relationship is determined based on the premise of supporting the probabilistic shaping pre-transformation.

[0015] In some implementations of the first or second aspect, the method further includes: determining the input length L1 of the probabilistic shaping pretransformation based on one or more entries in the first table corresponding to the first row index, wherein the first row index indicates any one of at least a row that satisfies the first constraint relationship.

[0016] In this implementation, for the rows in the first table that satisfy the first constraint relationship, since the channel coding includes a probabilistic shaping pre-transformation, when encoding the bit sequence to be encoded, it is necessary to determine the parameters related to the probabilistic shaping pre-transformation, such as the input length of the probabilistic shaping pre-transformation, so that the bit sequence to be encoded is first subjected to a probabilistic shaping pre-transformation (or pre-coding) before the channel coding.

[0017] In some implementations of the first or second aspect, the input length L1 of the probabilistic shaping pretransform is K-K1+L2, where K is the length of the bit sequence to be encoded, K1 is the input length of the channel coding, and L2 is the output length of the probabilistic shaping pretransform.

[0018] In this implementation, a method for determining the input length of the probabilistic shaping pretransform is described, which involves the output length of the probabilistic shaping pretransform, the length K of the bit sequence to be encoded, and the input length K1 of the channel coding, etc., and the description of the parameters related to the probabilistic shaping pretransform is given.

[0019] In some implementations of the first or second aspect, the output length L2 of the probabilistic shaping pretransform is related to the number N of resource elements RE.

[0020] In some implementations of the first or second aspect, the input length K1 of the channel coding is related to the number N of resource elements RE, and the Q... m It is related to the code rate r of the channel coding.

[0021] In some implementations of the first or second aspect, the code rate r of the channel coding and the modulation order Q m The spectral efficiency SE is an entry in a first table, and at least one row in the first table satisfies a second constraint, which includes the code rate r of the channel coding and SE / Q. m The difference between them is less than or equal to the set threshold.

[0022] In this implementation, the first table may include rows satisfying the second constraint in addition to rows satisfying the first constraint. This implementation is suitable for modifying the MCS table in NR, where the modified MCS table contains both rows that support probabilistic shaping pretransformation and rows that do not. The encoding or decoding side reads the corresponding entries from the modified MCS table, depending on whether probabilistic shaping pretransformation is enabled in the actual application, to perform encoding or decoding. This approach is generally applicable to scenarios where probabilistic shaping pretransformation is enabled or disabled.

[0023] In some implementations of the first or second aspect, when channel coding is performed based on rows in the first table that satisfy the second constraint, the channel coding does not include a probabilistic shaping pre-transformation.

[0024] In some implementations of the first or second aspect, the code rate r of the channel coding satisfies the third constraint relationship r = (K - L1 + L2) / N / Q m Where K is the length of the bit sequence to be encoded, L1 is the input length of the probabilistic shaping pretransform, L2 is the output length of the probabilistic shaping pretransform, N is the number of resource elements (REs), and Q... m This refers to the modulation order. In this implementation, if probabilistic shaping pretransform is enabled before channel coding, the parameters related to probabilistic shaping pretransform and the parameters related to channel coding satisfy a third constraint relationship. This implementation explicitly provides an expression for the third constraint relationship, which can be used to calculate the parameters related to probabilistic shaping pretransform and the parameters related to channel coding when probabilistic shaping pretransform is enabled.

[0025] In some implementations of the first or second aspect, the code rate r of the channel coding and the modulation order Q m The spectral efficiency SE and the second code rate are entries in a first table, at least one row of the first table satisfies the third constraint relationship, wherein the second code rate is the code rate of the probabilistic shaping pretransform.

[0026] In this implementation, based on the third constraint relationship between the parameters related to probabilistic shaping pretransformation and the parameters related to channel coding, a table containing the code rate of probabilistic shaping pretransformation can be designed. For example, the code rate of probabilistic shaping pretransformation can be introduced into the MCS table in NR. The coding side or decoding side can directly read the code rate of probabilistic shaping pretransformation from the first table.

[0027] In some implementations of the first or second aspect, the modulation order Q m The spectral efficiency SE and the second code rate are entries in a first table, at least one row of the first table satisfies the third constraint relationship, wherein the second code rate is the code rate of the probabilistic shaping pretransform; and the method further includes: determining the code rate r of the channel coding based on the entry in the first table corresponding to the second row index, wherein the second row index indicates any row in the first table.

[0028] In this implementation, based on the third constraint relationship satisfied between the parameters related to probabilistic shaping pretransform and the parameters related to channel coding, a table can be designed that includes the code rate of probabilistic shaping pretransform but excludes the code rate of channel coding. The encoding or decoding side can directly read the code rate of probabilistic shaping pretransform from the first table and then calculate the code rate of channel coding based on the third constraint relationship.

[0029] In some implementations of the first or second aspect, the method further includes: obtaining the second bitrate based on the first table, the second bitrate being related to the input length L1 of the probabilistic shaping pretransform and the output length L2 of the probabilistic shaping pretransform, the output length L2 of the probabilistic shaping pretransform being related to the number N of the REs; and determining the input length L1 of the probabilistic shaping pretransform based on the output length L2 of the probabilistic shaping pretransform and the second bitrate.

[0030] This implementation provides a method for determining parameters related to probabilistic shaping pretransformation, such as bit rate, input length, or output length.

[0031] In some implementations of the first or second aspect, the length K of the bit sequence to be encoded is related to the number N of resource elements (RE) and the spectral efficiency (SE).

[0032] In some implementations of the first or second aspect, the output length L2 of the probabilistic shaping pretransform is related to the number N of REs, including: for a complex modulation symbol, if the real part and imaginary part of the complex modulation symbol each correspond to 1 integer bit of the probabilistic shaping pretransform, the output length L2 of the probabilistic shaping pretransform is 2N; for a complex modulation symbol, if the real part and imaginary part of the complex modulation symbol each correspond to 2 integer bits of the probabilistic shaping pretransform, the output length L2 of the probabilistic shaping pretransform is 4N; or, for a complex modulation symbol, if the real part and imaginary part of the complex modulation symbol each correspond to 3 integer bits of the probabilistic shaping pretransform, the output length L2 of the probabilistic shaping pretransform is 6N.

[0033] In some implementations of the first or second aspect, the code rate r of the channel coding in the first table corresponds to the code rate R of the normalized channel coding, R = 1024r.

[0034] Alternatively, in any implementation, when describing the code rate of channel coding, the normalized code rate corresponding to the code rate of channel coding can be used instead, and the two can be derived from each other.

[0035] In some implementations of the first or second aspect, the method further includes: obtaining a modulation and coding strategy (MCS) index; and determining the code rate R of the normalized channel coding corresponding to the MCS index based on the MCS index and the first table.

[0036] Optionally, in the embodiments of this application, the modified MCS table in the NR or the newly designed first table can be called an MCS table or its name, without limitation. When the first table is called an MCS table, the row index of the first table can also be similar to the MCS index in the MCS table in the NR. When the first table has other names, each row of the first table corresponds to an index, and each row index indicates a row in the first table and corresponds to the table entries contained in that row, such as the normalized channel coding code rate R and the modulation order Q. m One or more of the following, namely, spectral efficiency (SE) and the code rate of probabilistic shaping pretransformation, are not limited.

[0037] In some implementations of the first or second aspect, when the modulation order Q m When = 2, the second code rate is equal to zero.

[0038] In some implementations of the first or second aspect, when the modulation order Q m When the value is any other than 2, the second bit rate is related to one or more of the other entries in the first table.

[0039] In some implementations of the first or second aspect, when the modulation order Q m When the second code rate is any value other than 2, the modulation order Q is... m related.

[0040] In some implementations of the first or second aspect, the second code rate is equal to any modulation order other than 2.

[0041] In some implementations of the first or second aspect, in the first table, when the modulation order Q m When the value is any other than 2, the second code rate corresponding to the same modulation order increases or decreases linearly according to the spectral efficiency from low to high; or, the second code rate corresponding to the same modulation order increases linearly first and then decreases linearly.

[0042] The above implementation methods provide several examples of determining the code rate for probabilistic shaping precoding. The optimal code rate can be determined by considering factors such as the complexity of probabilistic shaping precoding, channel conditions, and signaling overhead. For example, the optimal code rate for probabilistic shaping precoding differs for different signal-to-noise ratios (SNRs). Therefore, the code rate for probabilistic shaping precoding should be designed based on different MCS entries (e.g., one or more entries in the MCS table).

[0043] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: sending a first message, the first message indicating a third row index in the first table, the third row index indicating whether the probabilistic shaping pre-transformation is enabled, the third row index being any row in the first table.

[0044] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: sending a second message, the second message indicating an index of the first table, the index of the first table indicating the activation of the probabilistic shaping pretransformation.

[0045] In this implementation, if the first table contains both rows that support probabilistic shaping pretransformation and rows that do not support probabilistic shaping pretransformation (e.g., the values ​​of each entry in each row of the MCS table in NR), the encoding side indicates the row index in the first table to the decoding side, so that the decoding side knows whether probabilistic shaping pretransformation is enabled, and thus performs the corresponding processing on the decoding side.

[0046] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: receiving a first message, the first message indicating a third row index in the first table, the third row index indicating whether the probabilistic shaping pre-transformation is enabled, the third row index being any row in the first table.

[0047] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: receiving a second message indicating an index of the first table, the index of the first table indicating the activation of the probabilistic shaping pretransformation.

[0048] In this implementation, if the first table only contains rows that support probabilistic shaping pretransformation, and the rows that do not support probabilistic shaping pretransformation (e.g., the values ​​of each entry in each row of an MCS table in NR) are recorded in another table, the encoding side indicates the index of the table to the decoding side, so that the decoding side knows whether probabilistic shaping pretransformation is enabled, and thus performs the corresponding processing on the decoding side. For example, if the encoding side indicates the index of the first table, the decoding side can know that probabilistic shaping pretransformation is enabled on the encoding side. The specific row index can be indicated through the first message or other messages.

[0049] Thirdly, 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-described function.

[0050] Fourthly, a communication device is provided, which has the function of implementing the method in the second aspect or any possible implementation of the second 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-described function.

[0051] Fifthly, a communication device is provided, comprising at least one processor configured to cause the communication device to execute the method of the first aspect or any possible implementation thereof; or to execute the method of the second aspect or any possible implementation thereof. Optionally, the at least one processor is coupled to at least one memory for storing computer programs or instructions, and the at least one processor is configured to call and run the computer program or instructions from the at least one memory, causing the communication device to execute the method of the first aspect or any possible implementation thereof; or to execute the method of the second aspect or any possible implementation thereof. Optionally, the at least one processor may be included in the communication device or may be configured outside the communication device. Optionally, the communication device further includes the at least one memory. Optionally, the communication device further includes at least one communication interface. As an example, the communication interface may include an input interface and / or an output interface, or may be an interface circuit.

[0052] Sixthly, a communication device is provided, comprising a communication interface and a circuit. The communication interface is configured to receive a signal to be processed and transmit the signal to the circuit. The circuit is configured to process the signal to perform a method as described in the first aspect or any possible implementation thereof; or to perform a method as described in the second aspect or any possible implementation thereof. Optionally, the communication interface is further configured to output a signal processed by the circuit. Optionally, the signal may include information and / or data. Optionally, the communication device may be a chip (e.g., a baseband chip) or a chip system.

[0053] A seventh aspect provides a computer-readable storage medium storing computer program code or instructions that, when executed on a computer, cause the method of the first aspect or any possible implementation thereof to be implemented; or, the method of the second aspect or any possible implementation thereof to be implemented.

[0054] Eighthly, a computer program product is provided, the computer program product comprising computer program code or instructions, which, when executed on a computer, cause the method in the first aspect or any possible implementation thereof to be implemented; or, as in the second aspect or any possible implementation thereof, the method to be implemented.

[0055] A ninth aspect provides a wireless communication system, including a communication device as described in the third aspect and a communication device as described in the fourth aspect. Attached Figure Description

[0056] Figure 1 This is a schematic flowchart of probabilistic shaping technology.

[0057] Figure 2 This shows the constellation distribution after probabilistic shaping.

[0058] Figure 3 This is an example of a communication system applicable to the technical solutions of this application.

[0059] Figure 4 This is a schematic diagram of the basic process of wireless communication.

[0060] Figure 5 A schematic flowchart of the channel coding or decoding method 200 provided in this application.

[0061] Figure 6 This is a schematic diagram of probability shaping achieved through auxiliary probability shaping bits.

[0062] Figure 7 A schematic structural diagram of the communication device 1000 provided in this application.

[0063] Figure 8 A schematic structural diagram of another communication device provided in this application.

[0064] Figure 9 A schematic structural diagram of the chip provided in this application. Detailed Implementation

[0065] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0066] Higher-order modulation refers to mapping multiple bits to the same channel symbol. Table 1 shows a 16ASK bit mapping relationship. During the modulation process, the modulation symbol x is determined based on bits b0, b1, b2, and b3, and is used as the modulation symbol to be transmitted.

[0067] Table 1

[0068] b0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 b1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 b2 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 b3 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 x -15 -13 -11 -9 -7 -5 -3 -1 1 3 5 7 9 11 13 15

[0069] Since different symbols in high-order modulation may have different energies, average energy can be saved by sending more low-energy symbols and fewer high-energy symbols. Probabilistic shaping is a common "shaping" technique, and its typical flowchart is as follows: Figure 1 As shown.

[0070] Figure 1 This is a schematic flowchart of probabilistic shaping technology. For example... Figure 1 By cascading a precoder before the channel encoder, information bits are mapped ("shaped") into a sequence that follows a specific distribution. This precoder is also known as a distribution matcher (DM) or probabilistic shaping pretransform. Then, during the encoding process, systematic coding is used, ensuring that the aforementioned sequence satisfying the specific distribution appears directly in the coded sequence, thus achieving the shaping of the final modulation symbol. It should be noted that... Figure 1 The diagram illustrates one possible implementation of probabilistic shaping pretransformation; other pretransformation methods are also possible, this is merely an example. Figure 1 In the code, the bit sequence to be encoded is u1u2…u K The bit sequence u1u2…u z As input for channel coding; another part of the bit sequence u z+ 1u z+2 …u K As the input to the probabilistic shaping pretransform, the output of the probabilistic shaping pretransform is the bit sequence p1p2…p s Without probabilistic shaping pretransformation, the input to channel coding is a bit sequence u1u2…u z At this point, the input length of the channel coding is K1 = z = K; however, when the probabilistic shaping pretransform is enabled, the input of the channel coding is a bit sequence u1u2…u z The bit sequence p1p2…p of the output of the probabilistic shaping pretransform s These two parts, at this point the input length of the channel coding is K1 = z + s.

[0071] Figure 2This is a schematic diagram of the constellation distribution after probabilistic shaping. It can be seen that low-energy symbols appear more frequently than high-energy symbols.

[0072] The MCS table in New Radio (NR) includes four items: MCS index, modulation order, channel coding code rate r (referred to as target code rate in the MCS table), and spectral efficiency. The MCS table typically uses the channel coding code rate r × 1024 to represent the actual code rate information, R = r × 1024, where R is a transformed value of the channel coding code rate r, referred to as the normalized channel coding code rate in the embodiments below. These items satisfy R = 1024 × SE / Q. m R and SE represent spectral efficiency, and Q represents... m This is the modulation order. For example, 120 = 1024 × 0.2344 / 2, 193 = 1024 × 0.377 / 2.

[0073] Table 2(MCS index table 2for PDSCH)

[0074] MCS Index <![CDATA[Modulation order Q m > The code rate of channel coding is r×1024 Frequency efficiency 0 2 120 0.2344 1 2 193 0.377 2 2 308 0.6016

[0075] When probabilistic shaping is introduced, precoding is required before channel coding. In other words, given spectral efficiency, the code rate required for channel coding becomes higher. This leads to the following problems: if the current NR's MCS table is used, the code rate read from the MCS table does not correspond to the actual required forward error coding (FEC) code rate; if the code rate is not determined based on the MCS table, the code rate column in the MCS table becomes useless, or even does not reflect the actual FEC code rate at all. Therefore, either situation will cause confusion or chaos in the use of the MCS table.

[0076] Therefore, this application provides a channel coding or decoding method to modify or design a new MCS table for NR, and provides a method for using the modified or newly designed MCS table. This can avoid the confusion or chaos in the use of the MCS table caused by introducing probability shaping before channel coding. In other words, the MCS table provided by this application can support the description of probability shaping pre-transformation.

[0077] The technical solution of this application is described below.

[0078] The technical solutions of this application can be applied to various existing and future communication systems, including but not limited to: satellite communication systems, fifth-generation (5G) systems or new radio (NR) systems, long-term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, and future communication systems. Furthermore, they can also be applied to sidelink (SL) 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 herein.

[0079] Figure 3 This is an example of a communication system applicable to the technical solution of this application. For example... Figure 3 The communication system may include one or more transmitters and one or more receivers. Optionally, one of the transmitters and receivers may be a terminal device, and the other may be a network device. The channel coding or decoding method provided in this application is applicable to... Figure 3 The communication between the network device and the terminal device shown is either uplink or downlink communication. For example, in downlink communication, the transmitting device in this embodiment is a network device, and the receiving device is a terminal device; in uplink communication, the transmitting device in this embodiment is a terminal device, and the receiving device is a network device.

[0080] For example, a 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 apparatus. In the embodiments of this application, the terminal device may be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as a handheld device with wireless connectivity, in-vehicle equipment, etc. The terminal device in the embodiments of this application may be a mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. Optionally, the UE may be used to act as a base station. For example, the UE may act as a scheduling entity, providing sidelink signals between UEs in V2X or SL, etc.

[0081] In this embodiment, the device used to implement the functions of the terminal device can be the terminal device itself, or any device capable of supporting the terminal device in implementing the corresponding functions, such as a chip, processor, circuit, hardware, and / or software combination. This device is located on the terminal side and can be configured within or used in conjunction with the terminal device. The chip system can consist of chips or include chips and other discrete components. In this embodiment, the terminal device is used as an example to illustrate the device for implementing the corresponding functions of the terminal device.

[0082] The network device in this application embodiment may include a device for communicating with a terminal device. This network device may include an access network device or a radio access network device; for example, the network device may be a base station. In this application embodiment, the access network device may refer to a radio access network (RAN) node (or device) that connects the terminal device to the wireless network. A base station can broadly encompass, or be replaced by, various names such as: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, auxiliary station, motor slide retainer (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), radio unit (RU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. A base station can also be a mobile switching center, a device performing base station functions in D2D, V2X, and M2M communications, a network device (e.g., a base station) in a future communication network, or a device performing network device functions. A base station can support networks using the same or different access technologies. Optionally, a RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). The embodiments of this application do not limit the specific technology or device form used in the network equipment.

[0083] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0084] In some deployments, the network device in this application embodiment may be a device including a CU, or a DU, or a device including both CU and DU, or a control plane CU node (central unit-control plane (CU-CP)) and a user plane CU node (central unit-user plane (CU-UP)) and a DU node. For example, the network device may include gNB-CU-CP, gNB-CU-UP, and gNB-DU.

[0085] In some deployments, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes each implementing some of the base station's functions. For example, RAN nodes can be CUs, DUs, CU-CPs, CU-UPs, or RUs. CUs and DUs can be configured separately or included in the same network element, such as a BBU. RUs can be included in radio frequency equipment or radio frequency units, such as RRUs, AAUs, or RRHs.

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

[0087] In this embodiment, the device used to implement the functions of the network device can be the network device itself; it can also be a device capable of supporting the network device in implementing the corresponding functions, such as a chip, processor, circuit, hardware, and / or software combination. This device is located on the network side and can be configured within or used in conjunction with the network device. In this embodiment, only the network device is used as an example to illustrate the implementation of the corresponding functions of the network device.

[0088] Figure 4 This is a schematic diagram of the basic process of wireless communication. For example... Figure 4As shown, at the signal transmitting end, the signal source is sequentially processed through source coding, channel coding, and digital modulation before being transmitted. At the signal receiving end, the received signal is sequentially processed through digital demodulation, channel decoding, and source decoding before being output to the destination. Among these processes, channel coding and decoding is one of the core technologies in the field of wireless communication.

[0089] The channel coding or decoding methods provided in this application can be used in dedicated network devices or general-purpose devices, and can be applied to the various network devices (e.g., base stations) and the various terminal devices mentioned above. Specifically, the channel coding scheme is mainly implemented by the channel coding unit (e.g., encoder or device that supports the coding device to perform the corresponding function) in these devices; the channel decoding scheme is mainly implemented by the channel decoding unit (e.g., decoder or device that supports the decoding device to perform the corresponding function) in these devices.

[0090] Optionally, the functions of the encoding or decoding device can be implemented by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or by software (e.g., program code in memory), or by a combination of both, without limitation.

[0091] The channel coding or channel decoding methods provided in this application are described in detail below.

[0092] Figure 5 This is a schematic flowchart of a channel coding or decoding method 200 provided in this application. Steps 210-230 in method 200 can be performed by an encoding-side device (or an information transmitting-side device), such as an encoding device or a device applied to the encoding device (e.g., a chip, processor, or circuit). Optionally, method 200 also includes steps 240-260, which can be performed by a decoding-side device (or an information receiving-side device), such as a decoding device or a device applied to the decoding device (e.g., a chip, processor, or circuit). In the following embodiments, a first device and a second device are used as examples of an encoding-side device and a decoding-side device, respectively.

[0093] 210. The first device acquires the bit sequence to be encoded.

[0094] 220. The first device encodes the bit sequence to be encoded based on the code rate r of the channel coding to obtain the encoded sequence.

[0095] As mentioned above, probabilistic shaping pretransformation can also be called probabilistic shaping precoding. Optionally, the coding in step 220 may include channel coding (without probabilistic shaping pretransformation before channel coding), or may include both channel coding and probabilistic shaping pretransformation (i.e., probabilistic shaping precoding before channel coding).

[0096] The code rate r of the channel coding satisfies the first constraint: r > SE / Q m Q m Where is the modulation order, and SE is the spectral efficiency.

[0097] In the various embodiments of this application, the upper limit of the channel coding code rate r is no greater than 1, that is, the channel coding code rate r is less than or equal to 1. It should be understood that the channel coding code rate r being less than or equal to 1 is satisfied in all embodiments, and will not be repeated below.

[0098] In one example, the channel coding code rate r and modulation order Q m The spectral efficiency SE is an entry in the first table, and at least one row in the first table satisfies the first constraint. A "row" in the first table corresponds to a set of values ​​for each entry in the first table, such as the code rate r and modulation order Q of the channel coding entry. m This includes a set of values ​​for spectral efficiency (SE), etc. In this embodiment, each "row" of the first table can be understood by referring to an MCS index in the MCS table of the NR. Alternatively, the row index in the first table can also be called an MCS index.

[0099] In this embodiment, when performing channel coding based on rows in the first table that satisfy the first constraint, a probabilistic shaping pre-transformation is included before channel coding. In other words, if a probabilistic shaping pre-transformation is introduced before channel coding, the code rate of the channel coding increases, thereby ensuring that the code rate r of the channel coding satisfies the first constraint: r > SE / Q. m .

[0100] Assuming the first row index is any row in the first table that satisfies the first constraint relationship, the input length L1 of the probabilistic shaping pretransform is determined based on one or more entries in the first table corresponding to the first row index.

[0101] As an example, the input length of the probabilistic shaping pretransform is L1 = K - K1 + L2, where K is the length of the bit sequence to be encoded, K1 is the input length of the channel coding, and L2 is the output length of the probabilistic shaping pretransform. The output length L2 of the probabilistic shaping pretransform is related to the number of resource elements (REs) N. The input length K1 of the channel coding is related to the number of resource elements N and the modulation order Q. m It is related to the code rate r of the channel coding.

[0102] It should be noted that K1 is the input length of the channel coding, and in this embodiment, two possible cases are included. Figure 1 For example, if the channel coding includes a probabilistic shaping pre-transformation, K1 corresponds to the bit sequence u1u2…u z The number of bits and the output bit sequence p1p2…p of the probability shaping pretransformation s The sum of the number of bits, i.e., K1 = z + s; if the probability shaping pre-transformation is not included before channel coding, K1 corresponds to the bit sequence u1u2…u z The number of bits, at this time, K1=z=K.

[0103] The input length K1 of the channel coding and the number of resource elements N and Q m It is related to the code rate r of the channel coding. As an example, or,

[0104] In one implementation, a separate table is designed for the case where a probabilistic shaping pre-transformation is performed before channel coding; for example, the first table. In other words, each row in the first table includes entries: the code rate r of the channel coding, and the modulation order Q. m And the spectral efficiency SE, and the code rate r of the channel coding in each row satisfies the first constraint relationship. In this implementation, a separate table is designed for the case where no probability shaping pre-transformation is performed before channel coding, for example, called the second table, or the table of NR can be used. As an example, each row in the second table may include table entries: the code rate r of channel coding, the modulation order Q m And the spectral efficiency SE, and the code rate r of the channel coding in each row satisfies the second constraint relationship, which may include: the code rate r of the channel coding and SE / Q m The difference between them is less than or equal to a set threshold. In one example, the set threshold is 0, and the second constraint relationship can be: the code rate of channel coding r = SE / Q m .

[0105] In another implementation, a table is used to distinguish between cases where probabilistic shaping pre-transformation is performed before channel coding and cases where probabilistic shaping pre-transformation is not performed, such as the first table. In this implementation, the first table includes at least one row that satisfies both a first constraint and a second constraint.

[0106] When performing channel coding based on rows that satisfy the second constraint, probabilistic shaping pre-transformation is not included before channel coding.

[0107] In another example, the code rate r of the channel coding satisfies the first constraint r>SE / Q. mUnder the premise that the third constraint relationship is satisfied: r=(K-L1+L2) / N / Q m Where K is the length of the bit sequence to be encoded, L1 is the input length of the probabilistic shaping pretransform, L2 is the output length of the probabilistic shaping pretransform, and N is the number of resource elements (REs).

[0108] In one implementation, the channel coding code rate r and modulation order W... m The spectral efficiency (SE) and the second code rate are entries in the first table, and at least one row in the first table satisfies the third constraint relationship, wherein the second code rate is the code rate of the probabilistic shaping pretransform. In this implementation, it is equivalent to adding a column (or an entry) to the NR's MCS table: the code rate of the probabilistic shaping pretransform.

[0109] In another implementation, provided that the third constraint is satisfied, the first table includes the following entry: modulation order Q. m The first table does not include the channel coding code rate *r*, which is the spectral efficiency (SE) and the second code rate. In this implementation, when performing channel coding based on the second row index, the first device determines the channel coding code rate according to the corresponding entry in the first table. The second row index is any row in the first table that satisfies the third constraint. For example, by querying the entry corresponding to the second row index in the first table, the first device can obtain the modulation order *Q* corresponding to the second row index. m Based on the spectral efficiency SE and the second code rate, and the third constraint relationship, the first device can determine the code rate r of the channel coding corresponding to the second row index.

[0110] In the embodiment satisfying the third constraint, a probabilistic shaping pre-transformation is included before channel coding. Therefore, the first device needs to determine parameters related to the probabilistic shaping pre-transformation, such as the code rate (i.e., the second code rate), the input length L1, and the output length L2. Since the second code rate is an entry in the first table, it can be directly obtained by querying the first table. Further, the input length L1 of the probabilistic shaping pre-transformation can be determined based on the output length L2 and the second code rate. As an example, the output length L2 of the probabilistic shaping pre-transformation is related to the number N of resource elements (REs). For example:

[0111] For a complex modulation symbol, if the real part and the imaginary part of the complex modulation symbol each correspond to one integer bit of the probability shaping pretransform, the output length L2 of the probability shaping pretransform is 2N.

[0112] For a complex modulation symbol, if the real and imaginary parts of the complex modulation symbol each correspond to two integer bits of the probabilistic shaping pretransform, then the output length L2 of the probabilistic shaping pretransform is 4N; or,

[0113] For a complex modulation symbol, if the real part and the imaginary part of the complex modulation symbol each correspond to 3 integer bits of the probability shaping pretransform, the output length L2 of the probability shaping pretransform is 6N.

[0114] Suppose the second bit rate is represented as R DM According to the principle of probabilistic shaping pretransformation, L1 = R DM L2, from which L1 can be determined.

[0115] Furthermore, in the above embodiments, the length K of the bit sequence to be encoded is related to the number of resource elements (REs) N and the spectral efficiency (SSE). As an example, K is determined based on N·SE, for example, K = N·SE, or, when N·SE is a decimal, K can be equal to the value obtained by rounding up or down N·SE.

[0116] In the above embodiments or tables, the channel coding rate r can also be replaced with the corresponding normalized channel coding rate, denoted as R. As an example, R = 1024r.

[0117] In one implementation of step 220, if the first table includes a normalized channel coding code rate R, the code rate used by the first device when performing channel coding can be read from the first table. For example, the first device obtains a first MCS index and determines the normalized channel coding code rate corresponding to the first MCS index based on the first MCS index and the first table. The first device can determine the first MCS index using existing schemes. For example, if the first device is a network device, the network device determines the corresponding MCS based on the channel quality indication (CQI) fed back by the terminal device. The CQI can be obtained by the terminal device by measuring the downlink reference signal and reported by the network device under the control of the terminal device. Then, the network device selects an appropriate modulation order, code rate, etc. (i.e., determines the MCS index) based on the CQI reported by the terminal device to ensure the downlink transmission performance of the terminal device under different downlink channel conditions.

[0118] 230. The first device outputs the encoded sequence.

[0119] After encoding is completed, the first device outputs the encoded sequence.

[0120] Optionally, method 200 may also include a decoding method on the decoding side. This will be explained below in conjunction with steps 240–260.

[0121] 240. The second device acquires the received value sequence.

[0122] The received value sequence can refer to the received message at the decoding side after the encoded sequence output by the encoding side has been transmitted through the channel.

[0123] 250. The second device decodes the received value sequence based on the code rate r of the channel coding to obtain the decoded bit sequence.

[0124] On the decoding side, the second device, based on calculations or processing similar to that on the coding side, can determine the code rate r of the channel coding, for example, by directly reading it from the first table; or, by reading the code rate of the probabilistic shaping pretransform (i.e., the second code rate) from the first table and combining it with one or more entries in the first table to determine the code rate of the channel coding. Furthermore, when the channel coding on the coding side includes a probabilistic shaping pretransform, the second device, based on the constraint relationships between the entries in the first table, determines the code rate, input length L1, and output length L2 of the probabilistic shaping pretransform, and performs the inverse transformation of the probabilistic shaping pretransform, etc.

[0125] As mentioned above, probabilistic shaping pretransformation can also be called probabilistic shaping precoding. Optionally, the second device decodes the received value sequence, which may include channel decoding (excluding probabilistic shaping pretransformation before channel coding), or decoding that includes both channel decoding and probabilistic shaping pretransformation (including probabilistic shaping pretransformation before channel coding).

[0126] 260. The second device outputs the decoded bit sequence.

[0127] In the above embodiments, after introducing probabilistic shaping pre-transformation, how do the coding and decoding sides determine the code rate r and modulation order Q of the channel coding, respectively? m Spectral efficiency (SE) and code rate (R) of probabilistic shaping pretransformation. DM The processes for input length L1 and output length L2 are described in detail. When the correspondence of some parameters under different values ​​is stored in tabular form, the technical solution of this application modifies some entries in the MCS table of the NR, for example, modifying the code rate r of channel coding; or redesigns the MCS table, for example, introducing the code rate R of probabilistic shaping precoding into the MCS table of the NR. DM This table entry, and based on the new constraint relationships between entries in the MCS table, modifies some entries in the MCS table accordingly. In the above implementation, the modified table corresponds to the first table in the embodiments of this application. Based on the technical solution of this application, the code rate r of the channel coding obtained by querying the first table is consistent with the code rate actually used in the channel coding, thereby avoiding confusion in the use of the MCS table in NR.

[0128] Below are a few more examples of the first table provided in the embodiments of this application.

[0129] Example 1

[0130] As shown in the above embodiment, introducing a probabilistic shaping pre-transformation before channel coding increases the code rate of channel coding, and at least one row in the MCS table in NR no longer satisfies the original second constraint relationship (e.g., R = 1024 × SE / Q). m This can be equivalently expressed as: r = SE / Q m Instead, it satisfies the first constraint (i.e., R > 1024 × SE / Q). m This can be equivalently represented as: r>SE / Q m In one example, the first table includes at least one row satisfying the second constraint and at least one row satisfying the first constraint. The first table can be as shown in Table 3. Table 3 shows only some examples, and the first table can include some or all of the rows in Table 3. For each row, the code rate of the channel coding can be as shown in Table 3, or the difference between the code rate shown in Table 3 and the code rate can be less than or equal to a set threshold, without limitation. That is, the values ​​of each entry provided in Table 3 can vary within a certain range to ignore the effects of rounding up, rounding down, or other rounding methods on decimals. In addition, the first table can also only conform to some rows in Table 3, and for those rows, it can only conform to the values ​​of some entries, and is not limited to being completely consistent with the values ​​of every entry in that row. Other tables provided in the embodiments below are similar and will not be described again below.

[0131] Table 3

[0132]

[0133] In Example 1, Table 3 (an example of the first table) includes rows that satisfy the first constraint, such as I. MCS The rows that belong to the set {5 6 7…31}; also includes rows that satisfy the second constraint, such as I. MCS The row that belongs to the set {0 1 2 3 4}.

[0134] In Example 1, the first device sends a first message to the second device. This first message indicates the index of the third row in the first table. The index of the third row indicates whether probabilistic shaping pre-transformation is enabled, and the third row index can be any row in the first table. It can be understood that since the first table includes rows satisfying both the first and second constraints, whether probabilistic shaping pre-transformation is included before channel coding depends on I. MCS The specific value that I can take. MCSIf the set {5 67…27} is included, then the first device performs a probabilistic shaping pre-transformation before channel coding; correspondingly, the second device performs a deprobabilistic shaping pre-transformation. If I MCS If the sequence belongs to the set {0 1 2 3 4}, then the first device performs channel coding on the bit sequence to be encoded, without performing probabilistic shaping pre-transformation before channel coding; correspondingly, the second device performs channel decoding without needing to perform probabilistic shaping pre-transformation.

[0135] As another implementation of Example 1, two tables are designed, for example, denoted as Table A and Table B. Table A includes rows satisfying a first constraint, and Table B includes rows satisfying a second constraint. In this implementation, when any row from Table A is used for channel coding, it indicates that probabilistic shaping pre-transformation is included before channel coding; when any row from Table B is used for channel coding, it indicates that probabilistic shaping pre-transformation is not included before channel coding. The first device and the second device can respectively store these two tables. The first device sends a second message to the second device, the second message indicating the index of the first table (e.g., Table A), the index of the first table indicating that probabilistic shaping pre-transformation is enabled. Since the two tables respectively contain implementations with and without probabilistic shaping pre-transformation enabled, the first device can indicate to the second device whether probabilistic shaping pre-transformation is enabled through the table index, thereby the second device determines whether to perform the corresponding deprobabilistic shaping pre-transformation.

[0136] Example 2

[0137] Add a new entry to the MCS table for NR: Code rate R for probabilistic shaping pretransformation. DM The new table is called the first table, and the first table may include entries such as: the code rate r of the channel coding, and the modulation order Q. m The spectral efficiency SE and the second code rate, these entries satisfy a third constraint relationship: r = (K - L1 + L2) / N / Q m .

[0138] In Example 2, the first table could be as shown in Table 4. Similarly, the values ​​for each item in Table 4 are merely examples.

[0139] Table 4

[0140]

[0141]

[0142] How to determine the items in Table 4 (another example of the first table) can be found in the explanation in step 220 above, which will not be repeated here.

[0143] The first and second devices can each store Table 4. Whether the probabilistic shaping pre-transformation is enabled is related to the MCS index (i.e., I). MCS The specific value of ) is related to the MCS index. The first device indicates the MCS index to the second device, and the second device determines whether to enable probabilistic shaping pretransformation based on the MCS index used by the first device, and further determines the parameters related to probabilistic shaping pretransformation. For example, the code rate R of probabilistic shaping pretransformation can be directly determined by looking up Table 4. DM And the code rate r of the channel coding (or the code rate R of the normalized channel coding). Furthermore, based on the relationship between the output length L2 of the probabilistic shaping pretransform and the number N of resource elements RE, the output length L2 of the probabilistic shaping pretransform can be determined; then, combined with L1 = R... DM L2 can determine the input length L1 of the probabilistic shaping pretransform.

[0144] Example 3

[0145] The first table includes the following item: Modulation order Q m Spectral efficiency (SE) and code rate (R) of probabilistic shaping pretransformation DM These entries satisfy a third constraint: r = (K - L1 + L2) / N / Q m In Example 3, the first table does not include the channel coding rate r (or the normalized channel coding rate R). The first and second devices can read the probabilistic shaping pretransform rate R from Table 5. Dm Furthermore, the code rate r of the channel coding is determined based on the entries that can be read from Table 5 or the entries that can be calculated (e.g., L2).

[0146] In Example 3, the first table can be as shown in Table 5. Similarly, the values ​​for each item in Table 5 are merely examples.

[0147] Table 5

[0148]

[0149]

[0150] Tables 3 to 5 above are merely examples. Optionally, the code rate R of the probabilistic shaping pretransformation in the first table... DM It can satisfy any of the following characteristics:

[0151] 1) When the modulation order Q m When = 2, the R DM Q equals zero; m For other values, R DM It can be a fixed value, or, R DM It relates to one or more of the other items in the first table.

[0152] R DM It relates to one or more of the other items in the first table.

[0153] As an example, R DM This changes as the MCS index changes; for example, each MCS index corresponds to an R. DM For example, within the same modulation order, according to the spectral efficiency SE from low to high, R... DM It increases linearly, for example, increasing as the signal-to-noise ratio decreases, which can reduce the effect of probabilistic shaping pretransformation to match the optimal signal-to-noise ratio (SNR); or, R DM It decreases linearly; or, R DM It increases linearly first and then decreases linearly.

[0154] As another example, R DM With modulation order Q m Relevant. For example, given the modulation order, R DM To reduce implementation complexity, R is set to a fixed value, for example, 1024QAM or 256QAM. DM At 0.75; in 16QAM, R DM It is 0.6.

[0155] 2) When the modulation order Q m When it is greater than 2, the R corresponding to any modulation order DM All are equal to reduce implementation complexity. For example, when the modulation order Q m When it is greater than 2, R DM It is fixed at 0.75 or 0.7, etc.

[0156] Example 4

[0157] The first table includes the following items: channel coding code rate r, modulation order Q. m Spectral efficiency (SE) and code rate (R) of probabilistic shaping pretransformation DM And the dimension of the auxiliary probability shaping bits. Among them, some entries satisfy a third constraint relationship: r=(K-L1+L2) / N / Q m .

[0158] Table 6

[0159]

[0160]

[0161] Table 6 introduces the entry "Dimension of Auxiliary Probability Shaping Bits," which will be discussed below. Figure 6The dimensions of the auxiliary probability shaping bits are explained.

[0162] Figure 6 This is a schematic diagram illustrating probability shaping using auxiliary probability shaping bits. For example... Figure 6 Before channel coding, the bit sequence to be encoded is grouped. Assume the bit sequence to be encoded is represented as u0u1…u K-1 K is the length of the bit sequence to be encoded. The bit sequence to be encoded is divided into groups of bit sequences (or subsequences):

[0163] 1) First bit sequence group: The bit sequence of shaping (i.e. probability shaping), which is used as amplitude bits during modulation, only passes through DM in the coding chain, and does not pass through FEC coding;

[0164] 2) Second bit sequence group: Auxiliary shaping (i.e., auxiliary probability shaping) bit sequence, used as amplitude bits during modulation, passed through DM in the coding chain, and also passed through FEC encoding;

[0165] 2) Third bit sequence group: The bit sequence consisting of the remaining bits in the bit sequence to be encoded, excluding the first bit sequence group and the second bit sequence group. It is a bit sequence that is not DM-encoded but is FEC-encoded.

[0166] As described above, the function of DM can be understood as: mapping K bits to N probabilistically shaped bits, where the K bits follow a uniform distribution, and the N probabilistically shaped bits follow a specific distribution (usually not a uniform distribution).

[0167] As an example, when constructing a DM based on a polar code, the K least reliable positions can be selected as information bits, and the remaining NK positions as auxiliary probabilistic shaping bits (or simply auxiliary bits). During distribution matching, the K bits to be shaped are placed in the information bit positions of the polar code. The decoder uses the LLR value sequence corresponding to the target distribution as the received value sequence to be decoded (or the symbol sequence to be decoded), and obtains the auxiliary bits through successive cancellation (SC) decoding. Further, the K bits to be shaped and the decoded auxiliary bits are used as the bit sequence after shaping. By controlling the LLR value sequence, the shaping effect can be controlled, thereby further improving the shaping performance.

[0168] Therefore, the auxiliary probabilistic shaping bits in Example 3 refer to the bits in the second bit sequence group mentioned above, which are used both by the DM and by the encoder for encoding. The dimension of the auxiliary probabilistic shaping bits refers to the number of auxiliary bits calculated given the LLR value sequence corresponding to the target distribution during the process of obtaining the probabilistic shaping bits.

[0169] The dimension of the auxiliary bit is related to the modulation order and spectral efficiency. Within the same modulation order, the dimension of the auxiliary bit can remain unchanged, or it can monotonically increase, monotonically decrease, or it can first monotonically increase and then monotonically decrease. There are no restrictions here.

[0170] Example 5

[0171] Below is another example of a first table, as shown in Table 7.

[0172] Table 7

[0173]

[0174]

[0175] Comparing Table 7 with the tables used in the previous examples (e.g., Tables 3-6), we can see that some entries corresponding to row indices 26 and 27 have different values. For example, the modulation order corresponding to row indices 26 and 27 in Table 7 is higher than the modulation order when the MCS index is 26 and 27 in the aforementioned tables. In Tables 3-6, the row satisfying the first constraint has a channel coding code rate r that is higher than the corresponding channel coding code rate in the MCS table of NR, but the modulation order corresponding to the same row index (i.e., MCS index) is the same. However, in Table 7, the modulation order corresponding to the same row index may be different. In summary, in the tables supporting probabilistic shaping pretransformation, the modulation order corresponding to some row indices is higher than the modulation order corresponding to the corresponding row in the MCS table of NR.

[0176] As an example, in the above embodiments, whether probabilistic shaping is enabled can be related to the modulation order. For instance, if the modulation order is 2 or 4, probabilistic shaping is not enabled; if the modulation order is 6, 8, or 10, probabilistic shaping is enabled. This design can reduce system implementation complexity and improve system performance.

[0177] As another example, whether probabilistic shaping is enabled may be related to the MCS index (or, more specifically, the row index in the first table). For instance, within a given modulation order, for one or two larger MCS indices, probabilistic shaping pre-transformation is not enabled. Taking Table 7 as an example, assuming a modulation order of 10, the corresponding MCS indices for modulation order 10 are 26–34. When the MCS indices are 33 and 34, probabilistic shaping is not enabled. It should be understood that the above "for one or two larger MCS indices, probabilistic shaping pre-transformation is not enabled" is merely an example. Optionally, the MCS index for which probabilistic shaping pre-transformation is not enabled is not limited to a larger MCS index within a given modulation order; it can also be determined through other calculation methods. Furthermore, within a given modulation order, the number of MCS indices for which probabilistic shaping pre-transformation is not enabled is not limited to one or two; it can also be more than two. This implementation can reduce system complexity.

[0178] The above is a detailed description of the channel coding or decoding method provided in this application.

[0179] In this application example, by modifying the MCS table in the NR (Normally Transformed) table—for example, by modifying the channel coding rate in the MCS table to match the actual rate after introducing probabilistic shaping pretransformation, or by modifying the channel coding rate in the MCS table and adding the probabilistic shaping pretransformation rate as a new entry—the modified MCS table can be applied to scenarios where probabilistic shaping pretransformation is included before channel coding. This avoids the problem that existing MCS tables are not suitable for scenarios including probabilistic shaping pretransformation. In other words, the modified MCS table can support the description of probabilistic shaping pretransformation with low description complexity.

[0180] The communication device provided in this application is described below.

[0181] Figure 7 This is a schematic structural diagram of the communication device 1000 provided in this application. The communication device 1000 can be an encoding-side device, or a device applied to the encoding-side device and capable of implementing the corresponding functions of the encoding-side device in the method embodiments of this application, such as a chip, processor, or circuit. Alternatively, the communication device 1000 can be a decoding-side device, or a device applied to the decoding-side device and capable of implementing the corresponding functions of the decoding-side device in the method embodiments of this application, such as a chip, processor, or circuit.

[0182] Optionally, the communication device 1000 includes a processing module 1001, which may be a processor, a processing board, a processing unit, or a processing device, etc. When the communication device 1000 is an encoding-side device or a device applied to an encoding-side device, the processing module 1001 is used to perform probability shaping pre-transformation, channel coding, etc., based on a first table. Specific processes can be found in the detailed descriptions of the corresponding steps in the method embodiments, and will not be repeated here. When the communication device 1000 is a decoding-side device or a device applied to a decoding-side device, the processing module 1001 is used to perform channel decoding, de-probability shaping pre-transformation, etc., based on the first table. Specific processes can be found in the detailed descriptions of the corresponding steps in the method embodiments, and will not be repeated here.

[0183] Optionally, the communication device 1000 further includes a communication module 1002, which may also be referred to as a transceiver module, transceiver, transceiver unit, or transceiver device, etc., for performing receiving (or input) and / or sending (or output) operations. For example, when the communication device 1000 is an encoding-side device or a device applied to an encoding-side device, the communication module 1002 can be used to acquire a bit sequence to be encoded and transmit the bit sequence to be encoded to the processing module 1001; and output the encoded sequence obtained by the processing module 1001. Similarly, when the communication device 1000 is a decoding-side device or a device applied to a decoding-side device, the communication module 1002 can be used to receive a received value sequence and send the received value sequence to the processing module 1001; and output the decoded bit sequence obtained by the processing module 1001 decoding the received value sequence. Furthermore, it should be noted that the aforementioned communication module and / or processing module can be implemented through virtual modules. For example, the processing module can be implemented through a software functional unit or a virtual device, and the communication module can be implemented through a software function or a virtual device. Alternatively, the processing module or communication module can also be implemented by a physical device, such as a chip / circuit (e.g., an integrated circuit or logic circuit). The communication module can be an input / output circuit and / or a communication interface, performing input operations (corresponding to the aforementioned receiving operation) and output operations (corresponding to the aforementioned sending operation); the processing module is an integrated processor, microprocessor, or circuit (e.g., an integrated circuit, logic circuit).

[0184] The module division in this application is illustrative and represents only one logical functional division. In actual implementation, other division methods are possible. Furthermore, the functional modules in the various examples of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware, as software functional modules, or a combination of hardware and software.

[0185] Figure 8 This is a schematic structural diagram of another communication device provided in this application. The communication device 1100 can be used to implement the functions of any communication device (e.g., an encoding-side device or a decoding-side device) in the communication system described in the foregoing examples. The communication device 1100 may include at least one processor 1110. Optionally, the processor 1110 (or processing device) is coupled to a memory, which may be located within the communication device, integrated with the processor, or located outside the communication device. For example, the communication device 1100 may also include at least one memory 1120. The memory 1120 stores computer programs, instructions, or data necessary for implementing any of the above method embodiments; the processor 1110 may execute the computer programs, instructions, or data stored in the memory 1120 to perform the corresponding functions of the encoding-side device or decoding-side device in any of the above embodiments.

[0186] Optionally, the communication device 1100 may further include a communication interface 1130, through which the communication device 1100 can interact with other devices. For example, the communication interface 1130 may be a transceiver, circuit, bus, module, pin, or other type of communication interface. When the communication device 1100 is a chip-type device or circuit, the communication interface 1130 in the device 1100 may also be an input / output circuit, capable of inputting information (or receiving information) and / or outputting information (or sending information). The processor may be an integrated circuit or logic circuit, etc., and the processor can determine the output information based on the input information.

[0187] The coupling in this application refers to indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 1110 may operate in conjunction with the memory 1120 and the communication interface 1130. This application does not limit the connection medium between the processor 1110, the memory 1120, and the communication interface 1130.

[0188] Figure 9 This is a schematic structural diagram of the chip provided in this application. Chip 30 includes circuit 31 and communication interface 32. Circuit 31 can be a logic circuit, integrated circuit, etc., and communication interface 32 can also be called input / output circuit, input / output interface, interface circuit, etc., which can input information (or receive information) or output information (or send information). Chip 30 can execute the methods executed by the encoding-side device or decoding-side device in the various embodiments of this application.

[0189] In addition, this application also provides a computer-readable storage medium storing computer instructions that, when executed on a computer, cause operations and / or processes performed by an encoding-side device or a decoding-side device in the various method embodiments of this application to be executed.

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

[0191] Furthermore, this application also provides a chip including a processor. A memory for storing a computer program is provided independently of the chip, and the processor is used to execute the computer program stored in the memory, such that operations and / or processes performed by an encoding-side device or a decoding-side device in any method embodiment are executed. Further, the chip may also include a communication interface. The communication interface may be an input / output interface or an interface circuit, etc. Further, the chip may also include the memory.

[0192] This application provides a communication system, including the encoding-side device and decoding-side device in the above method embodiments.

[0193] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0194] In the embodiments of this application, "instruction" can include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information for instructing A, it can be understood that the instruction information carries A, which can be a direct instruction to A or an indirect instruction to A. Indirect instruction can refer to directly instructing B through the instruction information, and the correspondence between B and A, to achieve the purpose of instructing A through the instruction information. The correspondence between B and A can be predefined by the protocol, pre-stored, or obtained through configuration between network elements.

[0195] The processor in this application embodiment has signal processing capabilities and can be a central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in this application can be directly implemented by the hardware processor, or implemented by a combination of hardware and software modules within the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0196] In the embodiments of this application, the memory can be volatile memory or non-volatile memory, or it can include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be 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 random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0197] The technical solutions provided in this application can be implemented in whole or in part through software, hardware, firmware, or any combination thereof. When implemented using software, they can be implemented in whole or in part as a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a terminal device, an access network device, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media, etc.

[0198] In the embodiments of this application, "at least one" refers to one or more items. "More than one" means two or more items. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone.

[0199] The term "comprising" and any variations thereof used in the embodiments of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the steps or units listed, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.

[0200] In this application, examples may reference each other without logical contradiction. For example, methods and / or terms between method embodiments may reference each other, functions and / or terms between device embodiments may reference each other, and functions and / or terms between device examples and method examples may reference each other.

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

[0202] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

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

[0204] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

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

[0206] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A channel coding method, characterized in that, include: Obtain the bit sequence to be encoded; The bit sequence to be encoded is encoded based on the channel coding rate r to obtain the encoded sequence, wherein the channel coding rate r satisfies the first constraint: r > SE / Q. m The Q m The modulation order is denoted by SE, and the spectral efficiency is denoted by SE. Output the encoded sequence.

2. A method for channel decoding, characterized in that, include: Obtain the sequence of received values; The received value sequence is decoded based on the channel coding rate r to obtain the decoded bit sequence. The channel coding rate r satisfies the first constraint: r > SE / Q. m The Q m The modulation order is denoted by SE, and the spectral efficiency is denoted by SE. Output the decoded bit sequence.

3. The method according to claim 1 or 2, characterized in that, The code rate r of the channel coding, the modulation order Q m The spectral efficiency SE is an item in the first table, and at least one row of the first table satisfies the first constraint relationship.

4. The method according to claim 3, characterized in that, When performing channel coding based on rows in the first table that satisfy the first constraint relationship, the channel coding includes a probabilistic shaping pre-transformation.

5. The method according to claim 3 or 4, characterized in that, The method further includes: The input length L1 of the probabilistic shaping pretransform is determined based on one or more entries in the first table corresponding to the first row index, wherein the first row index indicates any one of at least one row that satisfies the first constraint relationship.

6. The method according to claim 5, characterized in that, The input length L1 of the probabilistic shaping pretransform is K-K1+L2, where K is the length of the bit sequence to be encoded, K1 is the input length of the channel coding, and L2 is the output length of the probabilistic shaping pretransform.

7. The method according to claim 6, characterized in that, The output length L2 of the probabilistic shaping pretransformation is related to the number N of resource elements RE.

8. The method according to claim 6 or 7, characterized in that, The input length K1 of the channel coding and the number N of resource elements RE, the Q m It is related to the code rate r of the channel coding.

9. The method according to claim 1 or 2, characterized in that, The code rate r of the channel coding, the modulation order Q m The spectral efficiency SE is an entry in a first table, and at least one row in the first table satisfies a second constraint, which includes the code rate r of the channel coding and SE / Q. m The difference between them is less than or equal to the set threshold.

10. The method according to claim 9, characterized in that, When performing channel coding based on the rows in the first table that satisfy the second constraint relationship, the channel coding does not include a probabilistic shaping pre-transformation.

11. The method according to claim 1 or 2, characterized in that, The code rate r of the channel coding satisfies the third constraint relationship r = (K - L1 + L2) / N / Q m Where K is the length of the bit sequence to be encoded, L1 is the input length of the probabilistic shaping pretransform, L2 is the output length of the probabilistic shaping pretransform, and N is the number of resource elements (REs).

12. The method according to claim 11, characterized in that, The code rate r of the channel coding, the modulation order Q m The spectral efficiency SE and the second code rate are entries in a first table, at least one row of the first table satisfies the third constraint relationship, wherein the second code rate is the code rate of the probabilistic shaping pretransform.

13. The method according to claim 11, characterized in that, The modulation order Q m The spectral efficiency SE and the second code rate are entries in a first table, at least one row of the first table satisfies the third constraint relationship, wherein the second code rate is the code rate of the probability shaping pretransform; Furthermore, the method further includes: The code rate r of the channel coding is determined based on the table entry corresponding to the second row index in the first table, where the second row index indicates any row in the first table.

14. The method according to claim 12, characterized in that, The method further includes: Based on the first table, the second bitrate is obtained. The second bitrate is related to the input length L1 and the output length L2 of the probabilistic shaping pretransform. The output length L2 of the probabilistic shaping pretransform is related to the number N of the resource elements RE. The input length L1 of the probabilistic shaping pretransform is determined based on the output length L2 of the probabilistic shaping pretransform and the second code rate.

15. The method according to any one of claims 1 to 14, characterized in that, The length K of the bit sequence to be encoded is related to the number N of resource elements (RE) and the spectral efficiency (SE).

16. The method according to any one of claims 7, 14, or 15, characterized in that, The output length L of the probabilistic shaping pretransform is related to the number N of REs, including: For a complex modulation symbol, if the real part and the imaginary part of the complex modulation symbol each correspond to one integer bit of the probability shaping pretransform, the output length L2 of the probability shaping pretransform is 2N; For a complex modulation symbol, if the real and imaginary parts of the complex modulation symbol each correspond to two integer bits of the probabilistic shaping pretransform, then the output length L2 of the probabilistic shaping pretransform is 4N; or... For a complex modulation symbol, if the real part and the imaginary part of the complex modulation symbol each correspond to 3 integer bits of the probabilistic shaping pretransform, the output length L2 of the probabilistic shaping pretransform is 6N.

17. The method according to any one of claims 3-10, 12-16, characterized in that, The code rate r of the channel coding in the first table corresponds to the code rate R of the normalized channel coding, R = 1024r.

18. The method according to claim 17, characterized in that, The method further includes: Obtain the Modulation and Coding Scheme (MCS) index; Based on the MCS index and the first table, the code rate R of the normalized channel coding corresponding to the MCS index is determined.

19. The method according to any one of claims 12 to 18, characterized in that, When the modulation order Q m When = 2, the second code rate is equal to zero.

20. The method according to claim 19, characterized in that, When the modulation order Q m When the value is any other than 2, the second bit rate is related to one or more of the other entries in the first table.

21. The method according to claim 20, characterized in that, When the modulation order Q m When the second code rate is any value other than 2, the modulation order Q is... m related.

22. The method according to claim 19, characterized in that, The second code rate is equal to any other modulation order except 2.

23. The method according to any one of claims 12 to 18, characterized in that, When the modulation order Q m When the value is any other than 2, in the first table, the second code rate corresponding to the same modulation order increases or decreases linearly according to the spectral efficiency from low to high; or, the second code rate corresponding to the same modulation order increases linearly first and then decreases linearly.

24. The method according to claim 9 or 10, characterized in that, The method further includes: Send a first message, which indicates the index of the third row in the first table. The index of the third row indicates whether the probabilistic shaping pre-transformation is enabled. The index of the third row is any row in the first table.

25. The method according to any one of claims 4-8, 12-23, characterized in that, The method further includes: Send a second message indicating the index of the first table, which in turn indicates the activation of the probabilistic shaping pre-transformation.

26. An encoding device, characterized in that, include: The communication module is used to acquire the bit sequence to be encoded. The processing module is used to encode the bit sequence to be encoded based on the channel coding code rate r to obtain an encoded sequence, wherein the channel coding code rate r satisfies a first constraint: r > SE / Q m The Q m The modulation order is denoted by SE, and the spectral efficiency is denoted by SE. The communication module is also used to output the encoded sequence.

27. A decoding device, characterized in that, include: The communication module is used to acquire the sequence of received values. The processing module is used to decode the received value sequence based on the channel coding rate r to obtain the decoded bit sequence, wherein the channel coding rate r satisfies a first constraint: r > SE / Q. m The Q m The modulation order is denoted by SE, and the spectral efficiency is denoted by SE. The communication module is also used to output the decoded bit sequence.

28. A communication device, characterized in that, The system includes a communication interface and circuitry. The communication interface is used to acquire information required to perform the method as described in any one of claims 1, 3-25, and to send the information to the circuitry, which is used to perform the method as described in any one of claims 1, 3-25 based on the received information; or... The communication interface is used to acquire information required to perform the method as described in any one of claims 2-23, and to send the information to the circuit, which is used to perform the method as described in any one of claims 2-23 based on the received information.

29. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1-25.

30. A communication device, characterized in that, The device includes a processor coupled to a memory, the processor being configured to execute a computer program or instructions stored in the memory to cause the communication device to perform the method as described in any one of claims 1-25.

31. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, implement the method as described in any one of claims 1-25.

Images