Encoding method, decoding method, encoding apparatus, and decoding apparatus
Patent Information
- Application Number
- PCT/CN2026/094806
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-14
- Filing Date
- 2026-05-06
- Publication Date
- 2026-11-19
Smart Images

Figure CN2026094806_19112026_PF_FP_ABST
Abstract
Description
An encoding method, a decoding method, an encoding device, and a decoding device.
[0001] This application claims priority to Chinese Patent Application No. 202510626019.5, filed with the State Intellectual Property Office of China on May 14, 2025, entitled "An Encoding Method, Decoding Method, Encoding Device and Decoding Device", the entire contents of which are incorporated herein by reference. Technical Field
[0002] This application relates to the field of communication technology, specifically to an encoding method, a decoding method, an encoding device, and a decoding device. Background Technology
[0003] Constellation shaping is a technique that improves the performance of communication systems by optimizing the layout of constellation points and the probability of using modulation symbols. It can significantly improve the spectral efficiency and bit error rate of a system without increasing system power or bandwidth, and has been widely used in the field of communications.
[0004] However, when constellation shaping technology is applied, the probability distribution of amplitude bits will be changed when using the existing channel coding process corresponding to the protocol. The existing channel coding process is not fully compatible with constellation shaping technology. Summary of the Invention
[0005] This application provides an encoding method, a decoding method, an encoding device, and a decoding device, which improve the bit interleaving stage in the channel coding process, so as to achieve that the probability distribution of amplitude bits is not changed when constellation shaping technology is applied.
[0006] The first aspect of this application provides an encoding method applied to an encoding device. For example, the encoding device may be a communication device (such as a terminal device or network device), or it may be a component of the communication device (such as a processor, circuit, chip, or chip system responsible for communication functions), or it may be a logic module or software capable of implementing all or part of the functions of the communication device. The following description uses an encoding device as an example. In this method, the encoding device performs a first interleaving on the amplitude bits to obtain the corresponding row number and the interleaved amplitude bits. This first interleaving is a row-list Q. m The interleaving of -2 columns, the amplitude bit comes from the first code block, which is obtained after bit selection, the Q mThis indicates the number of bits corresponding to each symbol. Then, the encoding device performs a second interleaving on the second code block to obtain a third code block. The second code block includes a parity bit, a sign bit, and the interleaved amplitude bits. The parity bit in the second code block is located before the sign bit in the second code block, and the sign bit in the second code block is located before the interleaved amplitude bits in the second code block. The second interleaving is an interleaving with rows listed in columns t, where t is the row number.
[0007] Based on the above scheme, the bit interleaving stage in the channel coding process is improved by first rowing the amplitude bits into Q. m Interleaving of -2 columns, then interleaving of the second code block including the interleaved amplitude bits in rows of t columns, so that every Q in the third code block m Inserting two amplitude bits into the shuffled sign bit and / or shuffled parity bit conforms to the protocol and ensures that the distribution of amplitude bits is not distorted. This ensures that the probability distribution of amplitude bits is not changed when constellation shaping technology is applied.
[0008] In conjunction with the first aspect, in one possible implementation of the first aspect, the first code block is obtained by performing low-density parity check (LDPC) encoding, puncturing, and bit selection on the fourth code block. This fourth code block is then obtained by processing the original code block using a distribution matcher (DM). The code rate of the DM is determined by the code rate of the communication system, the code rate of the LDPC, and the Q... m Confirmed. Thus, the code rate of the communication system, the code rate of LDPC, and Q... m Limiting the range of the DM's bit rate ensures that the resulting third code block conforms to the protocol while the distribution of amplitude bits remains undistorted.
[0009] In conjunction with the first aspect, in one possible implementation of the first aspect, the bitrate of DM satisfies the following condition: Among them, R FEC R represents the code rate of LDPC, and R represents the code rate of the communication system. DM This represents the bit rate of the DM. A specific formula is provided to limit the range of values the DM bit rate must satisfy, ensuring that the obtained third code block conforms to the protocol specifications while the amplitude bit distribution is not distorted, thus improving the feasibility of the scheme.
[0010] In conjunction with the first aspect, in one possible implementation of the first aspect, the amplitude bit and the first code block satisfy the following relationship: Where n1 represents the length of the amplitude bits, and N represents the length of the first code block. Thus, through Q... mBy limiting the range of values for the ratio between the length of the amplitude bit and the length of the first code block, the proportion of the amplitude bit in the first code block is limited. This ensures that the distribution of the amplitude bit in the obtained third code block is not distorted while conforming to the protocol, thus improving the feasibility of the scheme.
[0011] In conjunction with the first aspect, in one possible implementation of the first aspect, the method further includes: an encoding device scrambling the i-th bit in the third code block to obtain a fifth code block; where i equals Q. m ×k1, and / or i equals Q m ×k1+1, where k1 is an integer greater than or equal to 0. This proposes a new scrambling method that scrambles only the sign bit and the parity bit, i.e., only specific bits, thereby improving the scrambling processing speed while achieving the scrambling objective.
[0012] In conjunction with the first aspect, in one possible implementation of the first aspect, the encoding device scrambles the i-th bit in the third code block to obtain the fifth code block, including: performing modulo-2 addition based on the i-th bit and the first scrambling sequence to obtain the scrambled i-th bit, which belongs to the fifth code block. Thus, performing modulo-2 addition only on the sign bit and parity bit achieves the same scrambling purpose and improves the scrambling speed.
[0013] In conjunction with the first aspect, in one possible implementation of the first aspect, the original code block includes a first sub-code block. The method further includes: an encoding device processing the first sub-code block using a DM to obtain a third sub-code block; the encoding device scrambling the third sub-code block based on a second scrambling sequence to obtain amplitude bits, the second scrambling sequence being used to scramble the third code block. Thus, without changing the scrambling stage in the existing channel coding process, a new scrambling method is proposed. The output of the DM is first scrambled using the same scrambling sequence as subsequent scrambling stages. After completing the subsequent scrambling stages, the original amplitude bits can be recovered without changing the discrete probability distribution of the amplitude bits, achieving scrambling only on the symbol and parity bits.
[0014] In conjunction with the first aspect, in one possible implementation of the first aspect, the encoding device scrambles the third sub-code block to obtain amplitude bits, including: scrambling the third sub-code block based on the j-th bit in the second scrambling sequence to obtain amplitude bits; wherein j is greater than or equal to Q. m ×k2+2, and j is less than or equal to Q m ×k2+Q m k2 is an integer greater than or equal to 0. By limiting the specific value of j, the output of DM is scrambled, improving the feasibility of the scheme.
[0015] A second aspect of this application provides a decoding method applied to a decoding device. For example, the decoding device may be a communication device (such as a network device or terminal device), or it may be a component of the communication device (such as a processor, circuit, chip, or chip system responsible for communication functions). Alternatively, the decoding device may be a logic module or software capable of implementing all or part of the communication device's functions. The following description uses a decoding device as an example. In this method, the decoding device performs a first deinterleaving on a third code block to obtain a second code block. The first deinterleaving is a row-list Q. m The solution to the series is intertwined, Q m This indicates the number of bits corresponding to each symbol; the decoding device performs a second deinterleaving on the last n1 bits of the second code block to obtain the sixth code block, and this second deinterleaving is used for column output Q. m -2 columns of deinterleaving, n1 is the length of the amplitude bits; the decoding device shifts the last (n1+n2) bits of the sixth code block to the beginning of the first bit in the sixth code block to obtain the first code block, where n2 is the length of the sign bit in the first code block.
[0016] Based on the above scheme, the bit deinterleaving stage in the channel decoding process is improved by first performing a row-based Q-array on the third code block. m The columns are deinterleaved, and then the last n1 bits of the code block obtained from the initial deinterleaving are processed by column-wise Q-output. m The deinterleaving of the -2 columns enables the deinterleaving of code blocks that conform to the protocol and whose amplitude bit distribution is not distorted. Thus, by only changing the bit deinterleaving stage in the channel decoding process, accurate decoding of code blocks obtained by applying constellation shaping technology can be achieved.
[0017] In conjunction with the second aspect, in one possible implementation of the second aspect, the method further includes: the decoding device descrambling the i-th bit in the fifth code block to obtain the third code block; where i equals Q. m ×k1, and / or i equals Q m ×k1+1, where k1 is an integer greater than or equal to 0. This proposes a new descrambling method that descrambles only the sign bit and the parity bit, i.e., only specific bits, thereby improving the descrambling processing speed while achieving the descrambling objective.
[0018] In conjunction with the second aspect, in one possible implementation of the second aspect, the method further includes: the decoding device based on Q... m The length of the third code block determines n1. This provides a way to determine n1, improving the feasibility of the scheme.
[0019] In conjunction with the second aspect, in one possible implementation of the second aspect, the decoding device determines the length of the parity bit in the first code block based on the LDPC and the length of the third code block; and determines n2 based on n1, the length of the third code block, and the length of the parity bit in the first code block. This provides a way to determine n2, improving the feasibility of the scheme.
[0020] A third aspect of this application provides an encoding apparatus that performs the functions described in the first aspect. For example, the encoding apparatus includes a module or unit that performs the operations described in the first aspect. This module or unit can be implemented in software, hardware, or a combination of both. For instance, the encoding apparatus includes a processing unit and a transceiver unit. The processing unit performs a first interleaving on the amplitude bits to obtain the corresponding row number and the interleaved amplitude bits. The amplitude bits are derived from a first code block, which is obtained after bit selection. The first interleaving is a row-order Q. m -2 columns of interweaving, the Q m This indicates the number of bits corresponding to each symbol; the processing unit is also used to perform a second interleaving on the second code block to obtain a third code block. The second code block includes: a parity bit, a sign bit, and interleaved amplitude bits. The parity bit in the second code block is located before the sign bit in the second code block, and the sign bit in the second code block is located before the interleaved amplitude bits in the second code block. The second interleaving is an interleaving of rows and columns t, where t is the row number.
[0021] In the third aspect of the embodiments of this application, the constituent modules of the encoding device can also be used to execute the steps executed in various possible implementations of the first aspect and achieve the corresponding technical effects. For details, please refer to the first aspect, which will not be repeated here.
[0022] A fourth aspect of this application provides a decoding device that performs the functions described in the second aspect above. For example, the decoding device includes a module or unit that performs the operations described in the second aspect. This module or unit can be implemented in software, hardware, or a combination of both. For instance, the decoding device includes a processing unit and a transceiver unit. The processing unit performs a first deinterleaving on a third code block to obtain a second code block. The first deinterleaving is a row-order Q-sequence. m The solution to the series is intertwined, Q m This indicates the number of bits corresponding to each symbol; this processing unit is also used to perform a second deinterleaving on the last n1 bits of the second code block to obtain the sixth code block, and the second deinterleaving is performed as a column output Q. m-2 columns of deinterleaving, n1 is the length of the amplitude bits; this processing unit is also used to shift the last (n1+n2) bits of the sixth code block to the beginning of the first bit in the sixth code block to obtain the first code block, where n2 is the length of the sign bit.
[0023] In the fourth aspect of the embodiments of this application, the constituent modules of the decoding device can also be used to execute the steps executed in various possible implementations of the second aspect and achieve the corresponding technical effects. For details, please refer to the second aspect, which will not be repeated here.
[0024] A fifth aspect of this application provides an encoding apparatus, including at least one processor, which executes a computer program or instructions to enable the encoding apparatus to implement the encoding method as described in the first aspect or any possible implementation thereof.
[0025] Optionally, the at least one processor is coupled to a memory for storing computer programs or instructions.
[0026] Optionally, the encoding device includes the memory.
[0027] Optionally, the memory is integrated with at least one processor.
[0028] A sixth aspect of this application provides a decoding apparatus, including at least one processor, which executes a computer program or instructions to enable the decoding apparatus to implement the decoding method as described in the second aspect or any possible implementation thereof.
[0029] Optionally, the at least one processor is coupled to a memory for storing computer programs or instructions.
[0030] Optionally, the decoding device includes the memory.
[0031] Optionally, the memory is integrated with at least one processor.
[0032] A seventh aspect of this application provides an encoding apparatus, including at least one logic circuit and an input / output interface; the logic circuit is used to execute the encoding method as described in the first aspect or any possible implementation thereof.
[0033] In one possible implementation, the encoding device is a chip or chip system.
[0034] An eighth aspect of this application provides a decoding apparatus, including at least one logic circuit and an input / output interface; the logic circuit is used to execute the decoding method as described in the second aspect or any possible implementation thereof.
[0035] In one possible implementation, the decoding device is a chip or a chip system.
[0036] A ninth aspect of this application provides a communication system that includes the above-described encoding and decoding devices.
[0037] The tenth aspect of this application provides a computer-readable storage medium for storing one or more computer programs or instructions that, when executed by a processor, implement the encoding method as described in the first aspect or any possible implementation thereof, or execute the decoding method as described in the second aspect or any possible implementation thereof.
[0038] The eleventh aspect of this application provides a computer program product (or computer program) that, when the computer program or instructions in the computer program product are executed by a processor, implements the encoding method as described in the first aspect or any possible implementation of the first aspect, or executes the decoding method as described in the second aspect or any possible implementation of the second aspect.
[0039] The twelfth aspect of this application provides a chip or chip system, which includes at least one processor for supporting an encoding device to implement the encoding method in the first aspect or any possible implementation thereof, or for supporting a decoding device to implement the decoding method in the second aspect or any possible implementation thereof. For example, the chip may be a baseband chip, a modem chip, a system-on-chip (SoC) chip containing a modem core, a system-in-package (SIP) chip, or a communication module, etc.
[0040] In one possible design, the chip or chip system may further include a memory for storing program instructions and data necessary for the encoding or decoding device. The chip system may be composed of chips or may include chips and other discrete devices. Optionally, the chip system may also include interface circuitry that provides program instructions and / or data to the at least one processor.
[0041] The thirteenth aspect of this application provides a chip including one or more interface circuits and one or more processors; the interface circuits are used to receive signals from the memory of an electronic device and send signals to the processors, the signals including computer instructions stored in the memory; when the processor executes the computer instructions, it causes the electronic device to perform the encoding method in the first aspect or any possible implementation of the first aspect, or to perform the decoding method in the second aspect or any possible implementation of the second aspect.
[0042] The technical effects of any of the design methods in aspects three through thirteen can be found in the technical effects of the different design methods in aspects one through two above, and will not be repeated here. Attached Figure Description
[0043] Figure 1 is a schematic diagram of a communication system provided in an embodiment of this application;
[0044] Figure 2 is a schematic diagram of another communication system provided in an embodiment of this application;
[0045] Figure 3 is a schematic diagram of a circular buffer provided in an embodiment of this application;
[0046] Figure 4 is a schematic diagram of a PAS process provided in this application;
[0047] Figure 5 is a schematic diagram of a channel coding process provided in an embodiment of this application;
[0048] Figure 6 is a schematic diagram of another channel coding process provided in an embodiment of this application;
[0049] Figure 7 is a schematic diagram of a channel decoding process provided in an embodiment of this application;
[0050] Figure 8 is a flowchart illustrating an encoding / decoding method provided in an embodiment of this application;
[0051] Figure 9 is a schematic diagram of a bit interleaving process provided in an embodiment of this application;
[0052] Figure 10 is a schematic diagram of a bit deinterleaving process provided in an embodiment of this application;
[0053] Figure 11 is a flowchart illustrating another encoding / decoding method provided in an embodiment of this application;
[0054] Figure 12 is a flowchart illustrating another encoding / decoding method provided in an embodiment of this application;
[0055] Figure 13 is a flowchart illustrating a scrambling method provided in an embodiment of this application;
[0056] Figure 14 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;
[0057] Figure 15 is a schematic diagram of another communication device provided in an embodiment of this application;
[0058] Figure 16 is a schematic diagram of another communication device provided in an embodiment of this application;
[0059] Figure 17 is a schematic diagram of another communication device provided in an embodiment of this application. Detailed Implementation
[0060] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. The terminology used in the following embodiments is for the purpose of describing specific embodiments only and is not intended to be a limitation of this application. As used in the specification and appended claims of this application, the singular expressions "a," "an," "the," "the," "the," and "this" are intended to also include expressions such as "one or more," unless the context clearly indicates otherwise. It should also be understood that in the embodiments of this application, "one or more" refers to one, two, or more; "and / or" describes the relationship between related objects, indicating that three relationships may exist; for example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship.
[0061] References to "one embodiment" or "some embodiments" as described in this specification mean that one or more embodiments of this application include a specific feature, structure, or characteristic described in connection with that embodiment. Therefore, the phrases "in one embodiment," "in some embodiments," "in other embodiments," "in still other embodiments," etc., appearing in different parts of this specification do not necessarily refer to the same embodiment, but rather mean "one or more, but not all, embodiments," unless otherwise specifically emphasized. The terms "comprising," "including," "having," and variations thereof mean "including but not limited to," unless otherwise specifically emphasized.
[0062] The "multiple" mentioned in the embodiments of this application refers to two or more. It should be noted that in the description of the embodiments of this application, terms such as "first" and "second" are used only for the purpose of distinguishing descriptions and should not be construed as indicating or implying relative importance, nor should they be construed as indicating or implying order.
[0063] This application applies to communication systems, including Global System for Mobile Communication (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), and General Packet Radio Service (GPRS). It can also be 2G, 3G, Long Term Evolution (LTE), 5G, a hybrid LTE / 5G architecture, 5G New Radio (5G NR), new radio (NR) access technology systems, and other new communication systems emerging in future communication developments. Application scenarios include signal authority (SA), carrier aggregation (CA), and data center (DC) scenarios.
[0064] The communication system includes a first device and a second device. The first device can be a network-side device used to provide network communication functions; it is sometimes also called a network device, network-side device, or network element. Network devices can typically be base stations (including functional units of base stations, or combinations of functional units of base stations), core networks (CNs), or core network units. The core network can include a Mobility Management Entity (MME), a Serving Gateway (S-GW), a Packet Data Network Gateway (P-GW), etc. Core network units can be functional units within the core network, including but not limited to Access and Mobility Management Function (AMF) units, User Plane Function (UPF) units, or Session Management Function (SMF) units. The second device can be a device accessing the network, typically a terminal device. An example of a communication system is shown in Figure 1, which includes base station 1 and terminal device 2.
[0065] In the embodiments provided in this application, the base station can be any device with wireless transceiver capabilities, including but not limited to: evolved Node B (NodeB or eNB or e-NodeB) in LTE, next-generation evolved Node B (ng-eNB), base station (gNodeB or gNB) or transmission receiving point / transmission reception point (TRP) in NR, base stations evolved by 3GPP, access nodes, wireless relay nodes, wireless backhaul nodes, etc. in Wi-Fi systems. The base station can be: macro base station, micro base station, pico base station, small cell, relay station, satellite base station, or balloon station, etc. The base station can include one or more co-located or non-co-located transmission reception points (TRPs). The base station can also be a radio controller, centralized unit (CU), and / or distributed unit (DU) in a cloud radio access network (CRAN) scenario. The base station can communicate with the terminal, or it can communicate with the terminal through a relay station. The terminal can communicate with multiple base stations using different technologies. For example, the terminal can communicate with base stations supporting LTE networks, base stations supporting 5G networks, and even have dual connections with both LTE and 5G base stations. Another example of a communication system is shown in Figure 2. The communication system in Figure 2 includes: AMF / UPF, gNB, and ng-eNB. Multiple AMF / UPFs form the 5G core network (5GC), and multiple gNBs and multiple ng-eNBs form the next-generation radio access network (NG-RAN). In Figure 2, NG is the interface between NG-RAN and 5GC, used for transmitting control plane and user plane data. The Xn interface in Figure 2 is the interface between nodes in NG-RAN, including between gNBs, between gNBs and ng-eNBs, and between ng-eNBs.
[0066] In the embodiments provided in this application, the terminal can take various forms, such as a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal device, augmented reality (AR) terminal device, wireless terminal in industrial control, vehicle-mounted terminal device, wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, wearable terminal device, etc. The terminal may also be referred to as terminal equipment, user equipment (UE), access terminal equipment, vehicle-mounted terminal, industrial control terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal equipment, mobile device, UE terminal equipment, terminal equipment, wireless communication equipment, UE agent, or UE device, etc. The terminal can also be a fixed terminal or a mobile terminal.
[0067] To more clearly illustrate the technical solutions of the embodiments of this application, the relevant concepts involved in the embodiments of this application are explained below.
[0068] (1) Rate matching.
[0069] In the protocol channel coding process, because the spreading factor Zc is discontinuous, the actual generated code group bits do not meet the actual transmission load. Rate matching is to match the code stream with the actual transmission capacity.
[0070] The rate matching in the LDPC protocol includes bit selection and bit interleaving. Bit selection involves writing the encoded data into a circular buffer, as shown in Figure 3. The size of each code block is calculated, and the starting position within the buffer is selected based on different redundancy version (RV) numbers. RV0, RV1, RV2, and RV3 in Figure 3 represent the redundancy version numbers. Bit interleaving scrambles the bit-selected data, preventing consecutive bit errors in the event of a burst error. Instead, the erroneous bits are distributed across multiple data segments, allowing for error correction through techniques such as forward error correction, thus achieving error-free data transmission. It should be noted that after rate matching, the rate matching results from different code blocks are subjected to code block concatenation and constellation mapping.
[0071] (2)LDPC.
[0072] Channel coding is required in transmission channels to improve the reliability and anti-interference capability of information transmission. For example, LDPC coding schemes can be used. LDPC code is a linear block code with a sparse parity-check matrix. The sparse property of the parity-check matrix means that it contains very few non-zero elements, and only the code elements at the non-zero positions in each row participate in the check, which ensures the complexity of decoding.
[0073] The 3GPP protocol uses quasi-cyclic low-density parity check (QC-LDPC) codes. The parity check matrix of a QC-LDPC code can be generated based on the base graph (BG) and the spread factor Zc. Quasi-cyclic refers to dividing the code into multiple equal-sized square matrices according to Zc. Each square matrix is either a cyclic shift matrix of the identity matrix or an all-zero matrix, which facilitates memory storage and addressing, and reduces encoding and decoding complexity.
[0074] The LDPC encoding process may include: determining whether to use BG1 or BG2 based on the LDPC code rate and code length; selecting BG2 if the original transport block length A ≤ 292, or A ≤ 3824 and the code rate ≤ 0.67, or the code rate ≤ 0.25; otherwise, selecting BG1. The spreading factor Zc is determined based on the corresponding temporary parameter Kb, and then the corresponding index i is determined based on Zc. LS Then according to i LS From different base map matrices H BG Select the element V from each row and column. ij To generate the verification matrix, and then based on element V ij Perform Zc-cycle expansion if H BG Generate an element V that is not in the table. ij -1 represents a Zc×Zc all-zero matrix, and the final check matrix is expanded from the size of the base graph to Zc×base graph.
[0075] It should be noted that since LDPC is a systematic code, the encoded result does not completely change the original information bits, but rather appends new check bits to the original information bits.
[0076] (3) Astrological cosmetic surgery.
[0077] Constellation shaping technology can bring benefits to the demodulation threshold in scenarios with limited average transmit power. Constellation shaping technology is mainly divided into geometric constellation shaping (GCS) and probabilistic constellation shaping (PCS). The purpose of constellation shaping is to transform a uniformly distributed discrete input into a Gaussian-like input, approximating the Gaussian channel capacity to obtain a shaping gain of 1.53dB. GCS simulates a Gaussian-like shape of the input distribution by modifying the relative positions of constellation points in the constellation diagram to construct non-uniform intervals. GCS implementation is relatively simple, requiring only changes to the positions of constellation points during constellation mapping. PCS adjusts the transmission probability of constellation points, allowing low-energy inner constellation points to appear more frequently while reducing the probability of using high-energy outer constellation points.
[0078] Because the outer constellation points in quadrature amplitude modulation (QAM) have high power and contribute more to bit errors, using Probability-Based Structuring (PCS) to adjust the occurrence probability of different constellation points and use lower-power constellation points more frequently can reduce the bit error rate and improve system performance. A traditional method for implementing PCS is to add a distribution matcher (DM) before forward error correction (FEC) encoding and a distribution dematcher after the FEC decoder. During transmission, the DM converts the equally probable 1 and 0 input bit sequences into symbols following an MB distribution. During reception, the distribution dematcher performs the reverse operation to convert back to the original bit stream. However, the input for FEC is non-uniformly distributed data, while the output is uniformly distributed overhead data. Combined transmission leads to the expected Gaussian-like distribution distortion. To address this Gaussian-like distribution distortion problem, Amplitude Probability Shaping (PAS) was proposed.
[0079] Please refer to Figure 4, which is a schematic diagram of a PAS process provided in an embodiment of this application. Figure 4 shows the use of PAS to implement probabilistic constellation shaping. Bits with a proportion of γ are extracted from the source bits and used together with the parity bits to serve as the sign bit, achieving different code rates for FEC. In Figure 4, b(.) is the decapsulation process, i.e., mapping the symbol back to the bit; b^-1(.) is the mapper, i.e., mapping the bit to the symbol; P is the generation of the LDPC code. Figure 4 only performs decapsulation on the bits serving as the sign bit, and finally multiplies it with A1…Anc, which is equivalent to pre-mapping the amplitude bits.
[0080] However, after applying probabilistic constellation shaping technology, the prior probability of the bits changes. Using the existing channel coding process corresponding to the protocol will alter the probability distribution of the amplitude bits, thus requiring corresponding adjustments to the log likelihood ratio (LLR) of the decoder input or demodulator output. Therefore, the existing channel coding process is not fully compatible with probabilistic constellation shaping technology and needs modification.
[0081] Therefore, embodiments of this application provide an encoding method, a decoding method, an encoding device, and a decoding device, which improve the bit interleaving stage in the channel coding process, so as to achieve that the probability distribution of amplitude bits is not changed when constellation shaping technology is applied.
[0082] Please refer to Figure 5, which is a schematic diagram of a channel coding process provided in an embodiment of this application. In Figure 5, a cyclic redundancy check (CRC) code is added to transport block (TB)0; then TB0 is split into three code blocks (CB)1, CB2, and CB3; CRC codes are added to each of the three code blocks; the code blocks after adding CRC are processed by a constant composition distribution matcher (CCDM) or a parallel distribution matching (PDM), that is, a part of the code block after adding CRC obtains the bit stream of the desired amplitude probability distribution through DM and introduces overhead, and the other part is used as the sign bit; the output of DM and the bit used as the sign bit are added together and used as the input of LDPC for LDPC encoding; then rate matching is performed on the LDPC-encoded code blocks; multiple rate-matched code blocks are merged to obtain a combined CB; then the combined CB is scrambled; and the scrambled code blocks are labeled.
[0083] It should be noted that the embodiments of this application mainly improve the rate matching and scrambling process in Figure 5 to adapt to constellation shaping technology.
[0084] Please refer to Figure 6, which is a schematic diagram of another channel coding process provided in the embodiment of this application. Figure 6 uses a single CB as an example for illustration. Since the initial redundant version starts at position k_0 = 0 and redundant bits have been introduced in DM, the bit selection length E_r must be less than the total block length. The total block length is the length of the code block obtained after puncturing. That is, the parity bit will become shorter after bit selection, while the amplitude bit and sign bit are not affected. In Figure 6, the original CB is divided into two parts: kamp and ksign. The kamp is processed by DM to obtain the bit stream kamp+Δk with the expected amplitude probability distribution. ksign is used as the sign bit. The sum of kamp+Δk and ksign is used as the input for LDPC. After LDPC encoding, the LDPC-encoded code block ksign+kamp+Δk+filler_bits+Δn is obtained, where filler_bits represents the padding bits, which will be filled with bits 0, and Δn represents the generated initial parity bit. The LDPC-encoded code block ksign+kamp+Δk+filler_bits+Δn is punctured and bit-selected to obtain the bit-selected code block ksign-2Zc+kamp+Δk+Δn'. The current protocol stipulates that the first 2Zc bits are not transmitted after LDPC encoding, and puncturing is performed accordingly. Bit selection skips the padding bits. ksign-2Zc+Δn' serves as the sign bit. Δn' may be Δn, a shortened Δn, or Δn plus information bits. It should be noted that, in order to match the length of CB, if there are too many padding bits and the DM overhead is small, the bits of the preceding ksign-2Zc may be padded to the end, which will cause △n' to contain information bits.
[0085] Please refer to Figure 7, which is a flowchart illustrating a channel decoding method provided in an embodiment of this application. In Figure 7, the received code block is subjected to tag restoration, descrambling, and deinterleaving to obtain the LDPC-encoded code block ksign-2Zc+kamp+△k+△n'. Then, the LDPC-encoded code block ksign-2Zc+kamp+△k+△n' is subjected to LDPC decoding and distribution matching to obtain the original CB.
[0086] It should be noted that in the subsequent embodiments, the first code block corresponds to the bit-selected code block ksign-2Zc+kamp+△k+△n' in Figures 6 and 7; the sign bit in the subsequent embodiments corresponds to ksign-2Zc in Figures 6 and 7; the amplitude bit in the subsequent embodiments corresponds to kamp+△k in Figures 6 and 7; and the parity bit in the subsequent embodiments corresponds to △n' in Figure 6. In the subsequent embodiments, the sign bit and parity bit both serve as the sign bit, and can also be referred to as phase bits.
[0087] Please refer to Figure 8, which is a flowchart illustrating an encoding / decoding method provided in this application. This encoding / decoding method can be executed by a communication system, which includes an encoding device and a decoding device. The encoding / decoding method provided in this application embodiment may include the following steps:
[0088] S801, The encoding device performs the first interleaving of the amplitude bits to obtain the corresponding row number and the interleaved amplitude bits.
[0089] The amplitude bit comes from the first code block, which is obtained after bit selection. The first code block includes a sign bit, an amplitude bit, and a parity bit. The sign bit in the first code block is located before the amplitude bit in the first code block, and the amplitude bit in the first code block is located before the parity bit in the first code block. The sign bit corresponds to ksign-2Zc in Figure 6, the amplitude bit corresponds to kamp+△k in Figure 6, and the parity bit corresponds to △n' in Figure 6.
[0090] In this embodiment, the first interlacing is a rowing sequence Q. m -2 columns of interweaving, the Q m This indicates the number of bits corresponding to each symbol.
[0091] It should be noted that the "sign bit" in the embodiments of this application can also be expressed as "sign bit", "sign bit sequence", "sign bit position"; the "amplitude bit" in the embodiments of this application can also be expressed as "amplitude bit", "amplitude bit sequence", "amplitude bit position", etc.; the "check bit" in the embodiments of this application can also be expressed as "check bit", "check bit sequence", "check bit position", etc.
[0092] S802, The encoding device performs a second interleaving on the second code block to obtain the third code block.
[0093] The second code block includes a parity bit, a sign bit, and interleaved amplitude bits. The parity bit precedes the sign bit, and the sign bit precedes the interleaved amplitude bits. The second interleaving is a row-by-row interleaving with t columns, where t is the row number. It should be noted that t = n1 / (Q) m -2), where n1 represents the length of the amplitude bits in the first code block.
[0094] In this embodiment, the sign bit and amplitude bit in the first code block can be shifted to the end of the parity bit in the first code block to obtain a sixth code block. Then, the amplitude bits in the sixth code block are interleaved for the first time to obtain a second code block. The sixth code block includes a parity bit, a sign bit, and an amplitude bit. The parity bit in the sixth code block is located before the sign bit in the sixth code block, and the sign bit in the sixth code block is located before the amplitude bit in the sixth code block.
[0095] In this embodiment, the amplitude bits in the first code block can also be interleaved to obtain a seventh code block. Then, the sign bit and the interleaved amplitude bits in the seventh code block are shifted after the parity bit in the seventh code block to obtain a second code block. The seventh code block includes a sign bit, interleaved amplitude bits, and a parity bit. The sign bit in the seventh code block is located before the interleaved amplitude bits in the seventh code block, and the interleaved amplitude bits in the seventh code block are located before the parity bit in the seventh code block.
[0096] Please refer to Figure 9, which is a schematic diagram of a bit interleaving process provided in an embodiment of this application. It should be noted that the values "1, 2, 3, 4...16" in Figure 9 are used to distinguish different bit positions, i.e., the 1st bit, the 2nd bit,...the 16th bit, and do not represent the information carried by that bit. In Figure 9, Q is used as the unit of measurement. m Taking 4 as an example, "1, 2, 3, 4" represent the sign bit, "5, 6, 7, 8, 9, 10, 11, 12" represent the amplitude bit, and "13, 14, 15, 16" represent the parity bit. Shifting the sign bit and amplitude bit "1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12" after the parity bit "13, 14, 15, 16" yields the sixth code block "13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12". Then, the amplitude bit "5, 6, 7, 8, 9, 10, 11, 12" is arranged into (4-2) = 2 columns. The interleaving process yields a row number t of 4 and interleaved amplitude bits "5, 7, 9, 11, 6, 8, 10, 12". The second code block "13, 14, 15, 16, 1, 2, 3, 4, 5, 7, 9, 11, 6, 8, 10, 12" is then interleaved in 4 columns to obtain the third code block "13, 1, 5, 6, 14, 2, 7, 8, 15, 3, 9, 10, 16, 4, 11, 12". The amplitude bit distribution in this third code block remains unchanged, still in the order "5, 6, 7, 8, 9, 10, 11, 12", and every two phase bits are connected to Q. m -2 amplitude bits, meaning every two bits that act as the sign bit are connected to Q. m -2 amplitude bits, such as "13, 1" connected to "5, 6", "14, 2" connected to "7, 8", "15, 3" connected to "9, 10", and "16, 4" connected to "11, 12", which conforms to the provisions of the protocol. It is understood that the above is only an exemplary illustration and should not be construed as a limitation on the embodiments of this application.
[0097] S803, the encoding device scrambles and maps tags to the third code block to obtain the encoded code block.
[0098] It should be noted that tag mapping maps the bitstream to non-equally spaced constellation points based on binary tags.
[0099] S804. The encoding device sends the encoded code block to the decoding device.
[0100] S805, the decoding device performs tag restoration and descrambling on the encoded code block to obtain the third code block.
[0101] It should be noted that label restoration is the inverse process of label mapping, and descrambling is the inverse process of scrambling.
[0102] S806. The decoding device performs the first deinterleaving on the third code block to obtain the second code block.
[0103] The first solution is interwoven into a series of Q. m The solutions to the column are intertwined, and the Q is... m This indicates the number of bits corresponding to each symbol.
[0104] S807. The decoding device performs a second deinterleaving on the last n1 bits of the second code block to obtain the sixth code block.
[0105] Among them, the second solution is interleaved into columns to produce Q. m -2 columns of deinterleaving, where n1 is the length of the amplitude bits in the first code block.
[0106] S808 The decoding device shifts the last (n1+n2) bits of the sixth code block to the beginning of the sixth code block to obtain the first code block.
[0107] Where n2 is the length of the sign bit in the first code block.
[0108] It should be noted that S807 and S808 in the embodiments of this application can also be replaced by the decoding device shifting the last (n1+n2) bits of the second code block to the front to obtain the seventh code block; then the decoding device performs a second deinterleaving on the n2 to (n2+n1-1) bits of the seventh code block to obtain the first code block.
[0109] It should be noted that in the embodiments of this application, the 0th bit represents the first bit in the code block, that is, the 1st bit in the code block, the 1st bit represents the 2nd bit in the code block, the 2nd bit represents the 3rd bit in the code block, and so on, the n2nd bit represents the n2+1th bit in the code block, and so on.
[0110] Please refer to Figure 10, which is a schematic diagram of a bit deinterleaving process provided in an embodiment of this application. Figure 10 shows the bit deinterleaving process corresponding to the bit interleaving process in Figure 9. It should be noted that the values "1, 2, 3, 4...16" in Figure 10 are only used to distinguish different bit positions, i.e., the 1st bit, the 2nd bit,...the 16th bit, and do not represent the information carried by that bit. In Figure 10, Q... m Taking 4 as an example, the third code block "13, 1, 5, 6, 14, 2, 7, 8, 15, 3, 9, 10, 16, 4, 11, 12" is listed in rows as Q. m The deinterleaving of 4 columns yields the second code block "13, 14, 15, 16, 1, 2, 3, 4, 5, 7, 9, 11, 6, 8, 10, 12". The last n1 = 8 bits of the second code block "5, 7, 9, 11, 6, 8, 10, 12" are deinterleaved a second time to obtain the sixth code block "13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12". The last (n1+n2) = (8+4) = 12 bits of the sixth code block "1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12" are shifted before the first bit "13" of the sixth code block to obtain the first code block "1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16". It is understood that the above is merely an illustrative example and should not be construed as a limitation on the embodiments of this application.
[0111] As can be seen, the bit interleaving stage in the channel coding process is improved in this embodiment by first rowing the amplitude bits into Q. m Interleaving of -2 columns, then interleaving of the second code block including the interleaved amplitude bits in rows of t columns, so that every Q in the third code block m Inserting two amplitude bits into the shuffled sign bit and / or shuffled parity bit conforms to the protocol requirements, and the amplitude bit distribution is not distorted. This ensures that the probability distribution of the amplitude bits remains unchanged even when constellation shaping technology is applied. Furthermore, improvements are made to the bit deinterleaving stage in the channel decoding process by first performing a row-order Q-array on the third code block. m The columns are deinterleaved, and then the last n1 bits of the code block obtained from the initial deinterleaving are processed by column-wise Q-output. m The deinterleaving of the -2 columns enables the deinterleaving of code blocks that conform to the protocol and whose amplitude bit distribution is not distorted. Thus, by only changing the bit deinterleaving stage in the channel decoding process, accurate decoding of code blocks obtained by applying constellation shaping technology can be achieved.
[0112] Please refer to Figure 11, which is a flowchart illustrating another encoding / decoding method provided in this application. Figure 11 provides a more detailed explanation of the encoding / decoding method based on the method provided in Figure 8. The communication method in Figure 11 can also be executed by a communication system, which includes an encoding device and a decoding device. The encoding / decoding method provided in this application embodiment may include:
[0113] S1101. The encoding device processes the first sub-code block through a distribution matcher to obtain the amplitude bits.
[0114] The original code block includes a first sub-code block and a second sub-code block. Referring to Figure 6, in this embodiment, the original code block corresponds to CB in Figure 6, the first sub-code block corresponds to kamp in Figure 6, the second sub-code block corresponds to ksign in Figure 6, and the amplitude bit corresponds to kamp+Δk in Figure 6.
[0115] S1102, The encoding device obtains the fourth code block based on the amplitude bit and the second sub-code block.
[0116] S1103. The encoding device performs LDPC encoding, puncturing, and bit selection on the fourth code block to obtain the first code block.
[0117] In this embodiment, the code rate of the distributed matcher can be determined by the code rate of the communication system, the code rate of LDPC, and Q. m The code rate of the distributed matcher must meet the following conditions:
[0118] Where n1 represents the length of the amplitude bits, N represents the length of the first code block, and R FEC R represents the code rate of LDPC, and R represents the code rate of the communication system. DM This indicates the code rate of the distributed matcher.
[0119] In this embodiment of the application, it is also necessary to ensure that ksign > 2Zc, where ksign represents the length of the second sub-code block and Zc represents the expansion factor.
[0120] The above conditions ensure that punching will not disrupt the amplitude distribution, guaranteeing that in the interleaved code block, specifically the third code block, every two phase bits are connected to Q. m Each amplitude bit conforms to the specifications in the protocol, and the distribution of amplitude bits is not distorted.
[0121] In the embodiments of this application, if it is 16 quadrature amplitude modulation (QAM), n1:(N-n1)=1:1; if it is 64QAM, n1:(N-n1)=2:1.
[0122] S1104. The encoding device performs the first interleaving of the amplitude bits to obtain the corresponding row number and the interleaved amplitude bits.
[0123] It is understandable that S1104 is similar to S801, and the similarities will not be repeated here.
[0124] In one possible implementation, S1104 in this embodiment may include: rowing the amplitude bits Q. m The memory consists of -2 columns, which gives the number of storage rows t and the amplitude bits after interleaving.
[0125] S1105, The encoding device performs a second interleaving on the second code block to obtain the third code block.
[0126] It is understandable that S1105 is similar to S802, and the similarities will not be repeated here.
[0127] In one possible implementation, in embodiment S1105 of this application, the second code block is arranged in t columns of memory to obtain the third code block.
[0128] S1106. The encoding device scrambles the i-th bit in the third code block to obtain the fifth code block.
[0129] Where i equals Q m ×k1, and / or i equals Q m ×k1+1, where k1 is an integer greater than or equal to 0.
[0130] It should be noted that in the embodiments of this application, the 0th bit represents the first bit in the code block, that is, the 1st bit in the code block, the 1st bit represents the 2nd bit in the code block, the 2nd bit represents the 3rd bit in the code block, and so on. The k1th bit represents the k1+1th bit in the code block, and so on.
[0131] Referring to Figure 9, k1 = 0, 1, 2, 3; i = 0, 1, 4, 5, 8, 9, 12, 13, which scrambles the 1st, 2nd, 5th, 6th, 9th, 10th, 13th, and 14th bits in the third code block, i.e., scrambling "13, 1", "14, 2", "15, 3", and "16, 4" in Figure 9. It should be understood that the above is merely an illustrative description and should not be construed as limiting the embodiments of this application.
[0132] In this embodiment, S1106 may include: performing modulo-2 addition based on the i-th bit and the first scrambling sequence to obtain the scrambled i-th bit, which belongs to the fifth code block. This proposes a new scrambling method that only performs modulo-2 addition on the phase bits, i.e., only scrambles specific bits, thereby improving the scrambling processing speed while achieving the scrambling objective.
[0133] It should be noted that the length of the scrambling sequence is generated by the length of the code block obtained after rate matching.
[0134] In one possible implementation, in this embodiment of the application, modulo-2 addition can be performed based on the i-th bit in the third code block and the i-th bit in the first scrambling sequence to obtain the scrambled i-th bit.
[0135] In one possible implementation, the scrambling of the third code block in this embodiment can be achieved by the following formula: b' (q) (i)=(b (q) (i)+c (q) (i))mod2,i=Q m ×k1, Q m ×k1+1;
[0136] Among them, b' (q) (i) represents the i-th bit after scrambling, b (q) (i) represents the i-th bit in the third code block, c (q) (i) represents the i-th bit in the first scrambling sequence, and mod2 represents modulo 2 addition, i.e. XOR processing.
[0137] Correspondingly, the protocol flow is modified as follows:
[0138] S1107. The encoding device performs tag mapping on the fifth code block to obtain the encoded code block.
[0139] S1108. The encoding device sends the encoded code block to the decoding device.
[0140] S1109. The decoding device performs tag restoration on the encoded code block to obtain the fifth code block.
[0141] S1110. The decoding device descrambles the i-th bit in the fifth code block to obtain the third code block.
[0142] This application proposes a new descrambling method that descrambles only the sign bit and the parity bit, that is, only specific bits, thereby improving the descrambling processing speed while achieving the descrambling purpose.
[0143] S1111 The decoding device performs the first deinterleaving on the third code block to obtain the second code block.
[0144] It is understandable that S1111 is similar to S806, and the similarities will not be repeated here.
[0145] In one possible implementation, S1111 in this embodiment may include: listing the third code block Q in a row. m The second code block is obtained from the column's memory.
[0146] S1112. The decoding device performs a second deinterleaving on the last n1 bits of the second code block to obtain the sixth code block.
[0147] It is understandable that S1112 is similar to S807, and the similarities will not be repeated here.
[0148] In one possible implementation, S1112 in this embodiment may include: performing a Q-factor operation on the last n1 bits of the second code block. m -2 columns of memory are used to obtain the sixth code block.
[0149] In this embodiment, the decoding device stores condition information. In order to perform de-intertwining.
[0150] In one possible implementation, the decoding device can be based on Q. m Based on the length of the third code block and the LDPC code rate, determine n1; based on the length of the third code block and the LDPC code rate, determine the length of the parity bit in the first code block; based on n1, the length of the third code block and the length of the parity bit in the first code block, determine n2.
[0151] In one possible implementation, the decoding device in this application embodiment knows Q. m and R FEC Furthermore, after tag restoration and descrambling, the length N of the third code block can be obtained, which in turn allows us to obtain the length N of the first code block. This enables [the process of obtaining the first code block]. Obtain the length n1 of the amplitude bits; through N×R FEC We obtain the length n3 of the parity bit; and we obtain the length n2 of the sign bit through (N-n1-n3).
[0152] In one possible implementation, the encoding device in this embodiment can also use signaling to transmit n1, n2, n3, N, and R. DM R FEC At least one of t, etc., is passed to the decoding device so that the decoding device and the encoding device align the information for deinterleaving.
[0153] S1113. The decoding device shifts the last (n1+n2) bits of the sixth code block to the beginning of the sixth code block to obtain the first code block.
[0154] It is understandable that S1113 is similar to S808, and the similarities will not be repeated here.
[0155] S1114. The decoding device performs bit extraction, de-puncturing, and LDPC decoding on the first code block to obtain the fourth code block.
[0156] The fourth code block includes the amplitude bit and the second sub-code block.
[0157] It should be noted that bit extraction in the embodiments of this application is the reverse process of bit selection, de-puncturing is the reverse process of puncturing, and LDPC decoding is the reverse process of LDPC encoding.
[0158] S1115. The decoding device processes the amplitude bits through a distributed dematcher to obtain the first sub-code block.
[0159] S1116. The decoding device obtains the original code block based on the second sub-code block and the first sub-code block.
[0160] As can be seen, this application proposes a new bit interleaving method and a new scrambling method, and also proposes a new deinterleaving method and a new descrambling method. By changing specific steps in the channel coding process and the channel decoding process, it is possible to achieve the goal of not changing the probability distribution of amplitude bits when constellation shaping technology is applied, and to scramble only the sign bit and the parity bit, so that the channel coding process and the channel decoding process are compatible with constellation shaping technology.
[0161] Please refer to Figure 12, which is a flowchart illustrating another encoding / decoding method provided in this application. Figure 12 provides a more detailed explanation of the encoding / decoding method based on the method provided in Figure 8. The communication method in Figure 12 can also be executed by a communication system, which includes an encoding device and a decoding device. The encoding / decoding method provided in this application embodiment may include:
[0162] S1201. The encoding device processes the first sub-code block through a distribution matcher to obtain the third sub-code block.
[0163] The original code block includes a first sub-code block and a second sub-code block. Referring to Figure 6, in this embodiment, the original code block corresponds to CB in Figure 6, the first sub-code block corresponds to kamp in Figure 6, and the second sub-code block corresponds to ksign in Figure 6.
[0164] S1202, The encoding device scrambles the third sub-code block based on the second scrambling sequence to obtain the amplitude bits.
[0165] Referring to Figure 6, the amplitude bit corresponds to kamp+△k in Figure 6. This second scrambling sequence is used to scramble the third code block in the future.
[0166] Please refer to Figure 13, which is a flowchart illustrating a scrambling method provided in an embodiment of this application. In Figure 13, the code block after DM processing, i.e., the third sub-code block, is scrambled. Thus, without changing the scrambling stage in the existing channel coding process, a new scrambling method is proposed. The output of DM is first scrambled using the same scrambling sequence as subsequent scrambling stages. This way, after completing the subsequent scrambling stages, the original amplitude bits can be restored without changing the discrete probability distribution of the amplitude bits.
[0167] In this embodiment, S1202 may include: scrambling the third sub-code block based on the j-th bit in the second scrambling sequence to obtain the amplitude bit; wherein, j is greater than or equal to Q. m ×k2+2, and j is less than or equal to Q m ×k2+Q m k2 is an integer greater than or equal to 0. By limiting the specific value of j, the bits used to scramble the output of DM can be extracted from the original second scrambling sequence, thus improving the feasibility of the scheme.
[0168] It should be noted that in the embodiments of this application, the 0th bit represents the first bit in the code block, that is, the 1st bit in the code block, the 1st bit represents the 2nd bit in the code block, the 2nd bit represents the 3rd bit in the code block, and so on, the k2nd bit represents the k2+1th bit in the code block, and so on.
[0169] In one possible implementation, the scrambling of the third sub-code block in this embodiment can be achieved by the following formula: b' (q) (j)=(b (q) (j)+c (q) (j))mod2,Q m ×k²+2≤j≤Q m ×k2+Q m ;
[0170] Among them, b' (q) (j) represents a bit in the scrambled third sub-block, i.e., a bit of amplitude, which can be understood as the j-th bit in the third block. (q) (j) represents a bit in the third sub-code block, which can be understood as the j-th bit in the fifth code block, c (q) (j) represents the j-th bit in the second scrambling sequence, and mod2 represents modulo 2 addition, i.e. XOR processing.
[0171] S1203, The encoding device obtains the fourth code block based on the amplitude bit and the second sub-code block.
[0172] S1204. The encoding device performs LDPC encoding, puncturing, and bit selection on the fourth code block to obtain the first code block.
[0173] S1205, The encoding device performs the first interleaving of the amplitude bits to obtain the corresponding row number and the interleaved amplitude bits.
[0174] It is understandable that S1205 is similar to S801 and S1104, and the similar parts will not be repeated here.
[0175] S1206. The encoding device performs a second interleaving on the second code block to obtain the third code block.
[0176] It is understandable that S1206 is similar to S802 and S1105, and the similar parts will not be repeated here.
[0177] S1207. The encoding device scrambles the third code block based on the second scrambling sequence to obtain the fifth code block.
[0178] S1208, The encoding device performs tag mapping on the fifth code block to obtain the encoded code block.
[0179] S1209. The encoding device sends the encoded code block to the decoding device.
[0180] S1210 The decoding device performs tag restoration on the encoded code block to obtain the fifth code block.
[0181] S1211. The decoding device descrambles the i-th bit in the fifth code block to obtain the eighth code block.
[0182] It is understandable that the eighth code block is equivalent to the code block obtained by descrambling the amplitude bits in the third code block.
[0183] Where i equals Q m ×k1, and / or i equals Q m ×k1+1, where k1 is an integer greater than or equal to 0.
[0184] This application proposes a new descrambling method that descrambles only the sign bit and the parity bit, that is, only specific bits, thereby improving the descrambling processing speed while achieving the descrambling purpose.
[0185] S1212, The decoding device performs the first deinterleaving on the eighth code block to obtain the ninth code block.
[0186] It is understandable that the ninth code block is equivalent to the code block obtained by descrambling the amplitude bits in the second code block.
[0187] It is understandable that S1212 is similar to S806, and the similar parts will not be repeated here.
[0188] In one possible implementation, S1212 in this embodiment may include: listing the eighth code block Q in a row. m The ninth code block is obtained from the column's memory.
[0189] S1213. The decoding device performs a second deinterleaving on the last n1 bits of the ninth code block to obtain the tenth code block.
[0190] It is understandable that the tenth code block is equivalent to the code block obtained by descrambling the amplitude bits in the sixth code block.
[0191] It is understandable that S1213 is similar to S807, and the similarities will not be repeated here.
[0192] In one possible implementation, S1213 in this embodiment may include: performing a Q-factor operation on the last n1 bits of the ninth code block. m -2 columns of memory are used to obtain the tenth code block.
[0193] S1214. The decoding device shifts the last (n1+n2) bits of the tenth code block to the beginning of the tenth code block to obtain the eleventh code block.
[0194] It is understandable that the eleventh code block is equivalent to the code block obtained by descrambling the amplitude bits in the first code block.
[0195] It is understandable that S1214 is similar to S808, and the similarities will not be repeated here.
[0196] S1215. The decoding device performs bit extraction, de-puncturing, and LDPC decoding on the eleventh code block to obtain the twelfth code block.
[0197] It is understandable that the twelfth code block is equivalent to the code block obtained by descrambling the amplitude bits in the fourth code block.
[0198] The twelfth code block includes the third sub-code block and the second sub-code block.
[0199] S1216. The decoding device processes the third sub-code block through a distributed dematcher to obtain the first sub-code block.
[0200] S1217. The decoding device obtains the original code block based on the second sub-code block and the first sub-code block.
[0201] As can be seen, this application proposes a new bit interleaving method and a new scrambling method, and also proposes a new deinterleaving method and a new descrambling method. By changing specific steps in the channel coding process and the channel decoding process, it is possible to achieve the goal of not changing the probability distribution of amplitude bits when constellation shaping technology is applied, and to scramble only the sign bit and the parity bit, so that the channel coding process and the channel decoding process are compatible with constellation shaping technology.
[0202] It should be noted that the above embodiments can be extended to other technical fields that require bit interleaving and scrambling, bit deinterleaving and descrambling of transport blocks.
[0203] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.
[0204] To facilitate better implementation of the above-described solutions in the embodiments of this application, related apparatus for implementing the above-described solutions is also provided below.
[0205] Please refer to Figure 14. This application embodiment provides a schematic diagram of a communication device. This communication device 1400 can realize the functions of the encoding device or decoding device in the above method embodiments, and therefore can also achieve the beneficial effects of the above method embodiments. In this application embodiment, the communication device 1400 can be an encoding device (or a decoding device), or it can be an integrated circuit or component inside the encoding device (or decoding device), such as a chip. The communication device 1400 includes a processing unit 1401 and a transceiver unit 1402.
[0206] It should be noted that the transceiver unit 1402 may include a transmitting unit and a receiving unit, which are used to perform transmitting and receiving respectively.
[0207] When the communication device 1400 is used to execute the method performed by the encoding device in the foregoing embodiment, the processing unit 1401 is used to perform a first interleaving on the amplitude bits to obtain the corresponding row number and the interleaved amplitude bits. The amplitude bits come from a first code block, which is obtained after bit selection. The first interleaving is a row-list Q. m -2 columns of interweaving, the Q mThe number of bits corresponding to each symbol is indicated; the processing unit 1401 is also used to perform a second interleaving on the second code block to obtain a third code block. The second code block includes: a parity bit, a sign bit, and an interleaved amplitude bit. The parity bit in the second code block is located before the sign bit in the second code block, and the sign bit in the second code block is located before the interleaved amplitude bit in the second code block. The second interleaving is an interleaving of rows and columns t, where t is the row number.
[0208] In one possible implementation, the first code block is obtained by performing LDPC encoding, puncturing, and bit selection on the fourth code block. This fourth code block is then obtained by processing the original code block using DM. The code rate of DM is determined by the code rate of the communication system, the code rate of LDPC, and Q. m Sure.
[0209] In one possible implementation, the bitrate of DM satisfies the following condition:
[0210] Among them, R FEC R represents the code rate of LDPC, and R represents the code rate of the communication system. DM This indicates the bitrate of DM.
[0211] In one possible implementation, Where n1 represents the length of the amplitude bit, and N represents the length of the first code block.
[0212] In one possible implementation, the processing unit 1401 is further configured to scramble the i-th bit in the third code block to obtain the fifth code block; where i equals Q. m ×k1, and / or i equals Q m ×k1+1, where k1 is an integer greater than or equal to 0.
[0213] In one possible implementation, the processing unit 1401 is further configured to perform modulo-2 addition based on the i-th bit and the first scrambling sequence to obtain the scrambled i-th bit, which belongs to the fifth code block.
[0214] In one possible implementation, the original code block includes a first sub-code block and a second sub-code block. The processing unit 1401 is further configured to process the first sub-code block through a distribution matcher to obtain a third sub-code block; and to scramble the third sub-code block based on a second scrambling sequence to obtain amplitude bits. The second scrambling sequence is used to scramble the third code block.
[0215] In one possible implementation, the processing unit 1401 is further configured to scramble the third sub-code block based on the j-th bit in the second scrambling sequence to obtain the amplitude bit; wherein j is greater than or equal to Q. m ×k2+2, and j is less than or equal to Q m×k2+Q m k2 is an integer greater than or equal to 0.
[0216] In one possible implementation, the transceiver unit 1402 is used to transmit the encoded code block.
[0217] In one possible implementation, the transceiver unit 1402 is used to send a first signaling message, which carries at least one of the following information: n1, n2, n3, N, R DM .
[0218] When the device 1400 is configured to execute the method performed by the decoding device in the foregoing embodiments, the processing unit 1401 is configured to perform a first deinterleaving on the third code block to obtain a second code block, wherein the first deinterleaving is a row-listed Q. m The solution to the series is intertwined, Q m This indicates the number of bits corresponding to each symbol;
[0219] Processing unit 1401 is also used to perform a second deinterleaving on the last n1 bits of the second code block to obtain a sixth code block. The second deinterleaving is performed as a column output (Q). m -2) Deinterleaving of the column, where n1 is the length of the amplitude bit;
[0220] The processing unit 1401 is also used to shift the last (n1+n2) bits of the second code block to before the first bit in the sixth code block to obtain the first code block, where n2 is the length of the sign bit in the first code block.
[0221] In one possible implementation, the processing unit 1401 is further configured to descramble the i-th bit in the fifth code block to obtain the third code block; where i equals Q. m ×k1, and / or i equals Q m ×k1+1, where k1 is an integer greater than or equal to 0.
[0222] In one possible implementation, the processing unit 1401 is further configured to be based on Q m Based on the length of the third code block, n1 is determined.
[0223] In one possible implementation, the processing unit 1401 is further configured to determine the length of the parity bit in the first code block based on the code rate of the low-density parity check and the length of the third code block; and to determine n2 based on n1, the length of the third code block and the length of the parity bit in the first code block.
[0224] In one possible implementation, the transceiver unit 1402 is used to receive the encoded code block.
[0225] In one possible implementation, the transceiver unit 1402 is used to receive a first signaling message, which carries at least one of the following information: n1, n2, n3, N, R DM wait.
[0226] Please refer to Figure 15, which is a schematic diagram of another communication device provided in this application. The communication device 1500 includes a logic circuit 1501 and an input / output interface 1502. The communication device 1500 can be a chip or an integrated circuit.
[0227] In Figure 14, the transceiver unit 1402 can be a communication interface, which can be the input / output interface 1502 in Figure 15. The input / output interface 1502 can include an input interface and an output interface. Alternatively, the communication interface can also be a transceiver circuit, which can include an input interface circuit and an output interface circuit.
[0228] In one possible implementation, the processing unit 1401 shown in FIG14 can be the logic circuit 1501 in FIG15.
[0229] The logic circuit 1501 and the input / output interface 1502 can execute the steps performed by the encoding device or the decoding device in any embodiment and achieve the corresponding beneficial effects, which will not be elaborated here.
[0230] Optionally, the logic circuit 1501 can be a processing device, the functions of which can be partially or entirely implemented in software.
[0231] Optionally, the processing apparatus may include a memory and a processor, wherein the memory is used to store a computer program, and the processor reads and executes the computer program stored in the memory to perform the corresponding processing and / or steps in any of the method embodiments.
[0232] Optionally, the processing device may consist of only a processor. A memory for storing computer programs is located outside the processing device, and the processor is connected to the memory via circuitry / wires to read and execute the computer programs stored in the memory. The memory and processor may be integrated together or physically independent of each other.
[0233] Optionally, the processing device may be one or more chips, or one or more integrated circuits. For example, the processing device may be one or more field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), system-on-chips (SoCs), central processing units (CPUs), network processors (NPs), digital signal processors (DSPs), microcontroller units (MCUs), programmable logic devices (PLDs), or other integrated chips, or any combination of the above chips or processors.
[0234] Please refer to Figure 16, which shows the communication device 1600 involved in the above embodiments provided in the embodiments of this application. Specifically, the communication device 1600 can be the encoding device or decoding device that serves as a terminal device in the above embodiments. The communication device shown in Figure 16 is implemented through a terminal device (or a component in the terminal device).
[0235] The present invention provides a possible logical structure diagram of the communication device 1600, which may include, but is not limited to, at least one processor 1601 and a communication port 1602.
[0236] In Figure 14, the transceiver unit 1402 can be a communication interface, which can be the communication port 1602 in Figure 16. The communication port 1602 can include an input interface and an output interface. Alternatively, the communication port 1602 can also be a transceiver circuit, which can include an input interface circuit and an output interface circuit.
[0237] Further optionally, the device may also include at least one of a memory 1603 and a bus 1604. In embodiments of this application, the at least one processor 1601 is used to control the operation of the communication device 1600.
[0238] Furthermore, the processor 1601 can be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor can also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a digital signal processor and a microprocessor, etc. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0239] It should be noted that the communication device 1600 shown in Figure 16 can be used to implement the steps implemented by the encoding device or decoding device in the aforementioned method embodiments, and to achieve the corresponding technical effects of the encoding device or decoding device. The specific implementation of the communication device shown in Figure 16 can be referred to the description in the aforementioned method embodiments, and will not be repeated here.
[0240] Please refer to Figure 17, which is a schematic diagram of the structure of the communication device 1700 involved in the above embodiments provided in the embodiments of this application. The communication device 1700 can specifically be an encoding device or a decoding device as a network device in the above embodiments. The communication device illustrated in Figure 17 is implemented through a network device (or a component in a network device). The structure of the communication device can be referred to the structure shown in Figure 17.
[0241] The communication device 1700 includes at least one processor 1711 and at least one network interface 1714. Optionally, the communication device further includes at least one memory 1712, at least one transceiver 1713, and one or more antennas 1715. The processor 1711, memory 1712, transceiver 1713, and network interface 1714 are connected, for example, via a bus. In this embodiment, the connection may include various interfaces, transmission lines, or buses, etc., and this embodiment is not limited thereto. The antenna 1715 is connected to the transceiver 1713. The network interface 1714 enables the communication device to communicate with other communication devices through a communication link. For example, the network interface 1714 may include a network interface between the communication device and core network equipment, such as an S1 interface; the network interface may also include a network interface between the communication device and other communication devices (e.g., other network devices or core network equipment), such as an X2 or Xn interface.
[0242] In Figure 14, the transceiver unit 1402 can be a communication interface, which can be the network interface 1714 in Figure 17. The network interface 1714 can include an input interface and an output interface. Alternatively, the network interface 1714 can also be a transceiver circuit, which can include an input interface circuit and an output interface circuit.
[0243] Processor 1711 is primarily used for processing communication protocols and communication data, controlling the entire communication device, executing software programs, and processing data from the software programs, for example, to support the actions described in the embodiments of the communication device. The communication device may include a baseband processor and a central processing unit (CPU). The baseband processor is primarily used for processing communication protocols and communication data, while the CPU is primarily used for controlling the entire terminal device, executing software programs, and processing data from the software programs. Processor 1711 in Figure 17 can integrate the functions of both a baseband processor and a CPU. Those skilled in the art will understand that the baseband processor and CPU can also be independent processors interconnected via technologies such as buses. Those skilled in the art will understand that a terminal device may include multiple baseband processors to adapt to different network standards, and multiple CPUs to enhance its processing capabilities. Various components of the terminal device can be connected via various buses. The baseband processor can also be described as a baseband processing circuit or a baseband processing chip. The CPU can also be described as a central processing circuit or a central processing chip. The function of processing communication protocols and communication data can be built into the processor or stored in memory as a software program, which is then executed by the processor to implement the baseband processing function.
[0244] The memory is primarily used to store software programs and data. The memory 1712 can exist independently or be connected to the processor 1711. Optionally, the memory 1712 can be integrated with the processor 1711, for example, integrated within a single chip. The memory 1712 can store program code that executes the technical solutions of the embodiments of this application, and its execution is controlled by the processor 1711. The various types of computer program code being executed can also be considered as drivers for the processor 1711.
[0245] Figure 17 shows only one memory and one processor. In actual terminal devices, there may be multiple processors and multiple memories. Memory can also be called storage medium or storage device, etc. Memory can be a storage element on the same chip as the processor, i.e., an on-chip storage element, or it can be a separate storage element; this application does not limit this.
[0246] Transceiver 1713 can be used to support the reception or transmission of radio frequency (RF) signals between a communication device and a terminal. Transceiver 1713 can be connected to antenna 1715. Transceiver 1713 includes a transmitter Tx and a receiver Rx. Specifically, one or more antennas 1715 can receive RF signals. The receiver Rx of transceiver 1713 is used to receive the RF signals from the antennas, convert the RF signals into digital baseband signals or digital intermediate frequency (IF) signals, and provide the digital baseband signals or IF signals to processor 1711 so that processor 1711 can perform further processing on the digital baseband signals or IF signals, such as demodulation and decoding. In addition, the transmitter Tx in transceiver 1713 is also used to receive modulated digital baseband signals or IF signals from processor 1711, convert the modulated digital baseband signals or IF signals into RF signals, and transmit the RF signals through one or more antennas 1715. Specifically, the receiver Rx can selectively perform one or more stages of downmixing and analog-to-digital conversion on the radio frequency signal to obtain a digital baseband signal or a digital intermediate frequency (IF) signal. The order of these downmixing and IF conversion processes is adjustable. The transmitter Tx can selectively perform one or more stages of upmixing and digital-to-analog conversion on the modulated digital baseband signal or digital IF signal to obtain a radio frequency signal. The order of these upmixing and IF conversion processes is also adjustable. The digital baseband signal and the digital IF signal can be collectively referred to as digital signals.
[0247] The transceiver 1713 can also be called a transceiver unit, transceiver, transceiver device, etc. Optionally, the device in the transceiver unit that performs the receiving function can be regarded as the receiving unit, and the device in the transceiver unit that performs the transmitting function can be regarded as the transmitting unit. That is, the transceiver unit includes a receiving unit and a transmitting unit. The receiving unit can also be called a receiver, input port, receiving circuit, etc., and the transmitting unit can be called a transmitter, transmitter, or transmitting circuit, etc.
[0248] It should be noted that the communication device 1700 shown in Figure 17 can be used to implement the steps implemented by the encoding device or decoding device in the aforementioned method embodiments, and to achieve the corresponding technical effects of the encoding device or decoding device. The specific implementation of the communication device 1700 shown in Figure 17 can be referred to the description in the aforementioned method embodiments, and will not be repeated here.
[0249] This application also provides a computer-readable storage medium for storing one or more computer-executable instructions. When the computer-executable instructions are executed by a processor, the processor performs the method as described in the possible implementations of the encoding or decoding devices in the foregoing embodiments.
[0250] This application also provides a computer program product (or computer program) that, when executed by a processor, executes the method of the encoding or decoding device as described above.
[0251] This application also provides a chip system including at least one processor for supporting a communication device in implementing the functions involved in the possible implementations of the communication device described above. Optionally, the chip system further includes an interface circuit that provides program instructions and / or data to the at least one processor. In one possible design, the chip system may further include a memory for storing the program instructions and data necessary for the communication device. The chip system may be composed of chips or may include chips and other discrete devices, wherein the communication device may specifically be an encoding device or a decoding device as described in the foregoing method embodiments.
[0252] This application also provides a communication system, which includes the encoding device and decoding device from any of the above embodiments.
[0253] 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 an indirect coupling or communication connection between apparatuses or units through some interfaces, and may be electrical, mechanical, or other forms.
[0254] 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.
[0255] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit. If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes, or all or part 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.
Claims
1. An encoding method, characterized in that, The method includes: performing first interleaving on the amplitude bits to obtain corresponding row numbers and interleaved amplitude bits, the amplitude bits being from a first code block, the first code block being obtained after performing bit selection, the first interleaving being row-column out Q m -2 interleaving, the Q m representing a number of bits corresponding to each symbol; The second code block is interleaved a second time to obtain a third code block. The second code block includes a parity bit, a sign bit, and the interleaved amplitude bit. The parity bit in the second code block is located before the sign bit in the second code block. The sign bit in the second code block is located before the interleaved amplitude bit in the second code block. The second interleaving is an interleaving with rows listed in columns t, where t is the row number.
2. The method according to claim 1, characterized in that, The first code block is obtained by low-density parity-check encoding, puncturing and bit selection on a fourth code block, which is obtained by processing an original code block through a distribution matcher, a code rate of which is determined by a code rate of a communication system, a code rate of low-density parity-check and the Q m determination.
3. The method according to claim 2, characterized in that, The code rate of the distributed matcher satisfies the following condition: wherein R FEC represents the code rate of the low density parity check, R represents the code rate of the communication system, R DM represents the code rate of the distribution matcher.
4. The method according to any one of claims 1 to 3, characterized in that, The amplitude bit and the first code block satisfy the following relationship: Wherein, n1 represents the length of the amplitude bit, and N represents the length of the first code block.
5. The method according to any one of claims 1 to 4, characterized in that, The method further includes: The i-th bit in the third code block is scrambled to obtain the fifth code block; wherein said i is equal to Q m and / or said i is equal to Q m and / or said i is equal to Q k1+1, said k1 being an integer greater than or equal to 0.
6. The method according to claim 5, characterized in that, The step of scrambling the i-th bit in the third code block to obtain the fifth code block includes: Based on the i-th bit and the first scrambling sequence, modulo-2 addition is performed to obtain the scrambled i-th bit, which belongs to the fifth code block.
7. The method according to any one of claims 1 to 4, characterized in that, The original code block includes a first sub-code block, and the method further includes: The first sub-code block is processed by a distribution matcher to obtain the third sub-code block; The third sub-code block is scrambled based on the second scrambling sequence to obtain the amplitude bits, wherein the second scrambling sequence is used to scramble the third code block.
8. The method according to claim 7, characterized in that, The step of scrambling the third sub-code block to obtain the amplitude bits includes: The third sub-code block is scrambled based on the j-th bit in the second scrambling sequence to obtain the amplitude bit; wherein said j is greater than or equal to Q m and said j is less than or equal to Q m and said j is less than or equal to Q m said k2 is an integer greater than or equal to 0.
9. A decoding method, characterized in that, The method includes: performing first de-interleaving on the third code block to obtain a second code block, the first de-interleaving being Q m row de-interleaving, the Q m denoting the number of bits corresponding to each symbol; performing a second de-interleaving on the last n1 bits of the second code block to obtain a sixth code block, the second de-interleaving being column-wise out of Q m -2 column de-interleaving, the n1 being a length of the amplitude bits in the first code block; The last (n1+n2) bits of the sixth code block are shifted to the position before the first bit in the sixth code block to obtain the first code block, where n2 is the length of the sign bit in the first code block.
10. The method according to claim 9, characterized in that, The method further includes: Descramble the i-th bit in the fifth code block to obtain the third code block; wherein said i is equal to Q m and / or said i is equal to Q m and / or said i is equal to Q k1+1, said k1 being an integer greater than or equal to 0.
11. The method according to any one of claims 9 to 10, characterized in that, The method further includes: Based on the Q m The length of the third code block is used to determine n1.
12. The method according to any one of claims 9 to 11, characterized in that, The method further includes: The length of the parity bit in the first code block is determined based on the code rate of the low-density parity check and the length of the third code block. Based on n1, the length of the third code block, and the length of the parity bit in the first code block, n2 is determined.
13. An encoding device, characterized in that, The apparatus includes a module for implementing the encoding method as described in any one of claims 1 to 8.
14. A decoding device, characterized in that, The apparatus includes a module for implementing the decoding method as described in any one of claims 9 to 12.
15. An encoding apparatus comprising at least one processor, the processor being configured to invoke computer instructions in memory to cause the encoding apparatus to perform the encoding method as claimed in any one of claims 1 to 8.
16. A decoding apparatus comprising at least one processor, the processor being configured to invoke computer instructions in memory to cause the decoding apparatus to perform the decoding method as claimed in any one of claims 9 to 12.
17. A computer-readable storage medium, characterized in that, Includes instructions that, when executed on a computer, cause the computer to perform the encoding method as described in any one of claims 1 to 8, or the decoding method as described in any one of claims 9 to 12.
18. A computer program product, characterized in that, Includes instructions that, when executed on a computer, cause the computer to perform the encoding method as described in any one of claims 1 to 8, or the decoding method as described in any one of claims 9 to 12.
19. A chip, characterized in that, The device includes one or more interface circuits and one or more processors; the interface circuits are configured to receive signals from the memory of the electronic device and send the signals to the processors, the signals including computer instructions stored in the memory; when the processor executes the computer instructions, the electronic device performs the encoding method as described in any one of claims 1 to 8, or the decoding method as described in any one of claims 9 to 12.
