Data processing method and related device
By using a fixed structure interleaver in the polarization code for interleaving, the problem of large signaling overhead and high implementation difficulty caused by random interleaver is solved, and more efficient error correction performance and simplified interleaver design are achieved.
Patent Information
- Application Number
- PCT/CN2023/097625
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-31
- Publication Date
- 2024-12-05
AI Technical Summary
The error correction performance of existing polarized codes depends on the code spectrum. Random interleaver causes high signaling overhead and high implementation difficulty. The encoding device needs to inform the decoding device of the interleaving method to perform deinterleaving.
The preset matrix is interleaved using a fixed structure interleaver. The encoding device and the decoding device unify the interleaver structure, reduce signaling overhead, simplify the implementation of the interleaver, and improve the error correction code spectrum.
Reduces signaling overhead, simplifies interleaver implementation, improves error correction performance, and avoids the need for interleaver structure notification during encoding.
Smart Images

Figure CN2023097625_05122024_PF_FP_ABST
Abstract
Description
A data processing method and related device Technical Field The present application relates to the field of communications, and in particular to a data processing method and related devices. Background Art Channel coding is an important technology in communication technology, which can improve the reliability of signal transmission and the transmission quality of communication systems. Polar code is a new type of forward error correction coding method with excellent error correction performance. The construction principle is to make each sub-channel present different reliability on the coding side through channel polarization processing. When the code length continues to increase, the capacity of some channels tends to 1, and the capacity of other channels tends to 0. Information is directly transmitted on the channel with a capacity tending to 1 to approach the channel capacity. The error correction performance of polar code mainly depends on the code spectrum. The better the code spectrum, the higher the error correction performance of polar code. At present, the code spectrum of the polar code can be improved by a random interleaver, but the interleaving method of the random interleaver is random each time. Therefore, the encoding device usually needs to inform the decoding device of the interleaving method so that the decoding device can perform a deinterleaving operation. The signaling overhead is large, and the random interleaver is relatively difficult to implement. Summary of the invention The present application provides a data processing method and related devices, in order to reduce signaling overhead and reduce the difficulty of implementing an interleaver. In the first aspect, the present application provides a data processing method, which can be performed by a coding device. The coding device can be, for example, a communication device, such as a terminal, a wireless access network device, etc., or a component configured in a communication device for implementing a coding function, such as a chip, a chip system, etc., or a logic module or software capable of implementing all or part of the coding device function, which is not limited in the present application. Exemplarily, the method includes: obtaining a sequence to be encoded; performing polarization encoding on the sequence to be encoded according to a first matrix to obtain a coding sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, and each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, and at least one circular shift register in each layer of circular shift registers is used to circularly shift columns or rows in a sub-matrix, and the sub-matrix circularly shifted by each circular shift register in a subsequent layer of circular shift registers comes from the sub-matrix obtained after the circular shift register in the previous layer is circularly shifted, and the sub-matrix is obtained based on some columns or some rows in the second matrix; and sending the coding sequence. It should be understood that the interleaver, circular shift register, etc. are named only for the convenience of distinguishing different functions, and do not limit the structure of the data processing device. In a specific implementation, the functions of the interleaver and circular shift register can be implemented by software, hardware, or a combination of software and hardware. In the above technical solution, the encoding device interleaves the preset second matrix through one or more interleavers with a fixed structure to obtain a first matrix, and then encodes the coded sequence based on the first matrix. In other words, the structure of the interleaver will not change randomly. In this way, since the structure of the interleaver can be fixed, the encoding device does not need to change the structure of the interleaver when transmitting data. Informing the decoding device of the structure of the interleaver used in the encoding process is conducive to reducing signaling overhead. Moreover, by fixing the structure of the interleaver, while improving the error correction code spectrum, the structure of the interleaver does not need to be randomly changed, and the interleaver is relatively simple to implement. In addition, the interleaver provided by the present application can act on a preset second matrix, and cyclically shift the submatrix obtained based on some rows or some columns thereof, which is also conducive to improving the error correction performance to a certain extent. It can be understood that the interleaving manner of the second matrix by the interleaver is related to the structure of the interleaver, or in other words, the structure of the interleaver defines the interleaving manner. In this application, circular shift can be understood as follows: when shifting, the bits in the original range are not lost, but they are used as the filling bits at the other end. For example, circular right shift x bits means: each bit is shifted right x bits, and the original low x bits become high x bits; circular left shift x bits means: each bit is shifted left x bits, and the original high x bits become low x bits. Where x is a natural number. In the present application, performing cyclic shift on columns or rows in a sub-matrix may also be understood as performing column transformation or row transformation on the sub-matrix. As mentioned above, when an interleaver includes multiple layers of circular shift registers, the sub-matrix that each circular shift register in the next layer of circular shift registers performs circular shifting comes from the sub-matrix obtained after the circular shift register in the previous layer performs circular shifting. In other words, when an interleaver includes multiple layers of circular shift registers, one layer of circular shift registers performs circular shifting on the columns or rows in a sub-matrix (recorded as sub-matrix X) (or it is called column transformation or row transformation on sub-matrix X) to obtain a circularly shifted sub-matrix (recorded as sub-matrix Y), and the circular shift register in the next layer continues to perform circular shift operations on the columns or rows in sub-matrix Y, and so on, until the multiple layers of circular shift registers included in the interleaver complete the circular shifting of the sub-matrix. Similarly, when the first matrix is obtained by interleaving the second matrix based on multiple interleavers, when the multiple layers of circular shift registers in each interleaving perform circular shifting on the sub-matrix, it can be similar to the above operation. In combination with the first aspect, in some possible implementations of the first aspect, when at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift columns in a submatrix, before obtaining the sequence to be encoded, the method further includes: determining information bits in the sequence to be encoded, where the number of information bits is K, and the K information bits are the top K bits in the sequence to be encoded except for puncturing bits, shortening bits, and / or pre-frozen bits, when polarization channel reliability is arranged from high to low, and the pre-freeze bits are determined based on the polarization channel reliability and the row weight of the first matrix, 1<K≤N, K is an integer, and N is the length of the sequence to be encoded. In the process of determining the information bits, puncturing bits, shortening bits and / or pre-frozen bits are excluded, and the pre-frozen bits are determined based on the polarization channel reliability and the row weight of the first matrix. In other words, the pre-frozen bits not only consider the polarization channel reliability, but also comprehensively consider the row weight of the first matrix obtained by interleaving the second matrix, and the size of the row weight may affect the code distance. In this way, after considering the row weight of the first matrix, it is beneficial to improve the code distance, and then improve the error correction performance. It can be understood that when the polarized channel reliabilities are arranged from low to high, the K information bits may be K bits with the lowest polarized channel reliabilities among the bits excluding punctured bits, shortened bits, and / or pre-frozen bits in the sequence to be encoded. The present application does not limit the sorting method of the polarized channel reliabilities. Optionally, the pre-freeze bit is a row weight of 2 m ·bits corresponding to rows of w, wherein w is determined based on the row weights and polarization channel reliabilities of other rows in the first matrix except the rows corresponding to the punctured bits and the shortened bits, and m is a natural number. The pre-freeze bits may be bits corresponding to rows with a row weight of w, 2w, 4w, etc. in the first matrix, where w is a natural number and the specific value of m may be predefined. For example, when the bits corresponding to rows with a row weight of w in the first matrix are relatively small and the length of the sequence to be encoded is relatively long, the bits corresponding to rows with a row weight of w in the first matrix may be selected on the basis of On this basis, continue to select the bit positions corresponding to the rows with a row weight of 2w in the first matrix as the pre-freeze positions. In combination with the first aspect, in some possible implementations of the first aspect, the method further includes: sending first indication information, where the first indication information is used to indicate the length of the sequence to be encoded. In combination with the first aspect, in some possible implementations of the first aspect, the method further includes: sending second indication information, where the second indication information is used to indicate the number of information bits in the sequence to be encoded. The first indication information and the second indication information may be carried in different signalings or in the same signaling, which is not limited in this application. The encoding device informs the decoding device of the length of the sequence to be encoded, so that the decoding device can determine the length of the interleaver and / or the intermediate polarization layer where the interleaver is located according to the length, and informs the decoding device of the number of information bits, so that the decoding device can determine the information bits. It can be understood that when the encoding device sends the first indication information and the second indication information to the decoding device, the encoding device may be a terminal and the decoding device may be a wireless access network device. When the encoding device is a wireless access network device and the decoding device is a terminal, the wireless access network device may not send the first indication information and the second indication information to the terminal, and the terminal may perform blind detection on the received coding sequence to obtain the original sequence. On the second aspect, the present application provides a data processing method, which can be executed by a decoding device, which can be, for example, a communication device, such as a terminal device, a wireless access network device, etc., or it can also be a component configured in the communication device to implement the encoding function, such as a chip, a chip system, etc., or it can also be a logic module or software that can implement all or part of the encoding device function, which is not limited by the present application. Exemplarily, the method includes: receiving a coding sequence; decoding the coding sequence according to a first matrix to obtain a decoded sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, and at least one circular shift register in each layer of circular shift registers is used to circularly shift columns or rows in a sub-matrix, and the sub-matrix circularly shifted by each circular shift register in a subsequent layer of circular shift registers comes from the sub-matrix obtained after circularly shifting the circular shift register in a previous layer, and the sub-matrix is obtained based on some columns or some rows in the second matrix. In the above technical solution, the decoding device can interleave the preset second matrix through one or more interleavers of a fixed structure to obtain the first matrix, and then decode the coding sequence based on the first matrix. In other words, the structure of the interleaver will not change randomly. In this way, the coding device does not need to inform the decoding device of the structure of the interleaver used in the encoding process when transmitting data, which is conducive to reducing signaling overhead. Moreover, by fixing the structure of the interleaver, the structure of the interleaver does not need to change randomly while improving the error correction code spectrum, and the interleaver is relatively simple to implement. In addition, the interleaver provided in the present application can act on the preset second matrix, and cyclically shift the submatrix obtained based on some rows or columns thereof, which is also conducive to improving the error correction performance to a certain extent. It can be understood that the interleaving manner of the second matrix by the interleaver is related to the structure of the interleaver, or in other words, the structure of the interleaver defines the interleaving manner. In combination with the second aspect, in some possible implementations of the second aspect, when at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift columns in a submatrix, after decoding the coded sequence according to the first matrix, the method further includes: determining information bits in the decoded sequence, where the number of information bits is K, and the K information bits are the top K bits in the decoded sequence except for puncturing bits, shortening bits, and / or pre-frozen bits, when the polarization channel reliability is arranged from high to low, and the pre-frozen bits are determined based on the polarization channel reliability and the row weight of the first matrix, 1<K≤N, K is an integer, and N is the length of the decoded sequence. Among them, in the present application, the encoding device and the decoding device correspond to each other, the sequence to be encoded is the sequence to be transmitted before the encoding device encodes it, and the encoded sequence is obtained after encoding it, and the decoding device decodes the encoded sequence to obtain the decoded sequence, and the decoded sequence is the sequence to be transmitted before encoding (or the sequence to be encoded). In the process of determining the information bits, puncturing bits, shortening bits and / or pre-frozen bits are excluded, and the pre-frozen bits are determined based on the polarization channel reliability and the row weight of the first matrix. In other words, the pre-frozen bits not only consider the polarization channel reliability, but also comprehensively consider the row weight of the first matrix obtained by interleaving the second matrix, and the size of the row weight may affect the code distance. In this way, after considering the row weight of the first matrix, it is beneficial to improve the code distance, and then improve the error correction performance. Optionally, the pre-freeze bit is a row weight of 2 m w bits, where w is determined based on the row weights and polarization channel reliabilities of other rows in the first matrix except the rows corresponding to the punctured bits and the shortened bits, and m is a natural number. In combination with the second aspect, in some possible implementations of the second aspect, the method further includes: receiving first indication information, where the first indication information is used to indicate the length of the coding sequence. In combination with the second aspect, in some possible implementations of the second aspect, the method further includes: receiving second indication information, where the second indication information is used to indicate the number of information bits in the decoded sequence. The first indication information and the second indication information may be sent separately or in the same signaling, which is not limited in this application. The encoding device informs the decoding device of the length of the encoding sequence (that is, the length of the sequence to be encoded), so that the decoding device can determine the length of the interleaver and / or the intermediate polarization layer where the interleaver is located according to the length, and informs the decoding device of the number of information bits, so that the decoding device can determine the information bits. It can be understood that when the encoding device sends the first indication information and the second indication information to the decoding device, the encoding device may be a terminal and the decoding device may be a wireless access network device. When the encoding device is a wireless access network device and the decoding device is a terminal, the wireless access network device may not send the first indication information and the second indication information to the terminal, and the terminal may perform blind detection on the received coding sequence to obtain the original sequence. In combination with the first aspect and the second aspect, in some possible implementations, the number of cyclic shift bits and / or the number of layers of cyclic shift registers included in an interleaver are predefined. The number of bits for cyclic shifting columns or rows in the submatrix (or how many columns are cyclically shifted for columns in the submatrix, how many rows are cyclically shifted for rows in the submatrix), and how many layers of cyclic shift registers an interleaver includes can be predefined, and the encoding device and the decoding device can be predefined, as long as the two are unified. Alternatively, the encoding device can also inform the decoding device through signaling, which is not limited in this application. It can be understood that the more layers of cyclic shift registers an interleaver includes, the better the effect of improving the code spectrum. However, the more layers of cyclic shift registers an interleaver includes, the higher the computational complexity. Therefore, the number of layers of the cyclic shift register can be further determined according to the number of columns or rows of the submatrix interleaved by the interleaver (or the length of the interleaver), so as to reduce the computational complexity while ensuring better error correction performance. In combination with the first aspect and the second aspect, in some possible implementations, the number of layers of cyclic shift registers included in an interleaver is related to the length of the interleaver. One possible design is that the larger the length of the interleaver, the more layers of cyclic shift registers an interleaver can include. The length of an interleaver is related to the number of columns or rows of the submatrix that is interleaved by the interleaver, and may be equal to the number of columns or rows of the submatrix that is interleaved by the interleaver. Therefore, the length of the cyclic shift registers included in an interleaver is The number of layers of the circular shift register is related to the length of the interleaver. It can also be understood that the number of layers of the circular shift register included in an interleaver is related to the number of columns or rows of the sub-matrix interleaving operation performed by the interleaver. In combination with the first aspect and the second aspect, in some possible implementations, if the length of the interleaver is less than 8, the number of layers of the circular shift register included in the interleaver is 1 or 2; if the length of the interleaver is greater than or equal to 8, the number of layers of the circular shift register included in the interleaver is 3. In other words, if the length of the sequence to be encoded (or the mother code length of the polar code) is less than 16, the length of the corresponding interleaver will be less than 8, and the number of layers of the cyclic shift register included in the interleaver may be 1 or 2; if the length of the sequence to be encoded (or the mother code length of the polar code) is greater than or equal to 16, the length of the corresponding interleaver will be greater than or equal to 8, and the number of layers of the cyclic shift register included in the interleaver may be 3. It should be understood that the number of layers of the cyclic shift registers included in the interleavers of different lengths is only an example and should not constitute any limitation to the present application. In practical applications, the number of layers of the cyclic shift registers may also be other values. In combination with the first aspect and the second aspect, in some possible implementations, the length of an interleaver is equal to the number of columns of the sub-matrices on which the interleaving operation is performed by the interleaver. It is not difficult to understand that the number of rows and the number of columns of a sub-matrix are equal, and therefore, the length of an interleaver may also be equal to the number of rows of the sub-matrix on which the interleaver performs an interleaving operation. It can be understood that the length of the interleaver is equal to the number of columns of the sub-matrices that are interleaved by the interleaver. This design may be a possible design of the interleaver length when rate matching is not performed. In combination with the first aspect and the second aspect, in some possible implementations, if the length of the interleaver is 2 n-1 The number of layers of the cyclic shift registers included in the interleaver is 3, and the length of the cyclic shift registers included in the first layer of cyclic shift registers is 2 n-3 The length of the second layer of circular shift registers is 2 n-2 The length of the circular shift register included in the third layer of circular shift registers is 2 n-1 , n is an integer greater than or equal to 4. In the above scheme, when the length of the interleaver is 2 n-1 When the number of layers of the cyclic shift register included in the interleaver is limited to 3 layers, the computational complexity can be reduced while ensuring better error correction performance. It is understood that the number of layers and length of the cyclic shift registers included in the above interleaver are only examples and should not constitute any limitation to the present application. In practical applications, the number of layers and length of the cyclic shift registers included in an interleaver may also be other values. In combination with the first aspect and the second aspect, in some possible implementations, the length of an interleaver is less than the number of columns of a submatrix on which an interleaving operation is performed by the interleaver, wherein the difference between the number of columns of the submatrix on which an interleaving operation is performed by the interleaver and the length of the interleaver is the number of corresponding punctured bits or shortened bits in the submatrix. In the case of rate matching, the length of an interleaver can be less than the number of columns of the submatrix interleaved by the interleaver. In this design, the difference between the number of columns of the submatrix interleaved by the interleaver and the length of the interleaver is the number of corresponding punctured or shortened bits in the submatrix. Another possible design is that in the case of rate matching, the length of an interleaver can also be equal to the number of columns of the submatrix interleaved by the interleaver, except that the rows or columns corresponding to the punctured or shortened bits are not interleaved. In combination with the first aspect and the second aspect, in some possible implementations, the number of bits of the cyclic shift is an odd number. Since the mother code length of the polar code (or the length of the coding sequence) is an integer power of 2, the number of bits of the cyclic shift can be avoided to be an even number as much as possible to obtain a better code spectrum. Another possible design of the number of bits of the cyclic shift may be a prime number other than 2. It is not difficult to understand that, no matter which design is used, the number of bits of the cyclic shift should be smaller than the number of columns of the sub-matrix that is interleaved by the interleaver. In combination with the first aspect and the second aspect, in some possible implementations, the cyclic shift is a cyclic left shift or a cyclic right shift. In combination with the first aspect and the second aspect, in some possible implementations, the length of the one or more interleavers, or the intermediate polarization layer where the one or more interleavers are located is determined according to the length of the sequence to be encoded, and the intermediate polarization layer is other layers in the polarization layer except the polarization channel layer and the physical channel layer. In combination with the first aspect and the second aspect, in some possible implementations, the one or more interleavers are located in the first three middle polarization layers. In this way, while ensuring the error correction performance, the processing process is simplified, and the design of the interleaver is relatively neat. In combination with the first aspect and the second aspect, in some possible implementations, the second matrix is generated based on a polarization kernel. In a third aspect, the present application provides a data processing device, so that the method described in the first aspect to the second aspect and any possible implementation of the first aspect to the second aspect is implemented. The device includes corresponding units for executing the above method. The units included in the device can be implemented by software and / or hardware. In a fourth aspect, the present application provides a data processing device, the device comprising a processor. The processor can be used to execute a computer program in a memory, so that the method described in the first aspect to the second aspect and any possible implementation of the first aspect to the second aspect is implemented. Optionally, the device further comprises a communication interface, and the processor is coupled to the communication interface. The communication interface is used to receive signals from other communication devices outside the device and transmit them to the processor, or send signals from the processor to other communication devices outside the device. Exemplarily, the communication interface can be a transceiver, circuit, bus, module or other type of communication interface. Optionally, the device further comprises a memory, and the processor is coupled to the memory. The memory is used to store program instructions and data. In a fifth aspect, the present application provides a computer-readable storage medium, which stores a computer program or instructions. When the computer program or instructions are executed by a computer, the method in the above-mentioned first aspect to the second aspect and any possible implementation manner of the first aspect to the second aspect is executed. In a sixth aspect, the present application provides a computer program product, comprising: a computer program (also referred to as code, or instructions), which, when executed, enables the methods in the above-mentioned first aspect to the second aspect and any possible implementation of the first aspect to the second aspect to be executed. In the seventh aspect, the present application provides a chip system, which includes at least one processor for supporting the implementation of the functions involved in the above-mentioned first aspect to the second aspect and any possible implementation method of the first aspect to the second aspect, for example, receiving or processing the data involved in the above-mentioned method, etc. In one possible design, the chip system also includes a memory, which is used to store program instructions and data, and the memory is located inside or outside the processor. The chip system may be composed of the chip, or may include the chip and other discrete devices. It should be understood that the third to seventh aspects of the present application correspond to the technical solutions of the first and second aspects of the present application, and the beneficial effects achieved by each aspect and the corresponding feasible implementation methods are similar and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS FIG1 is a schematic diagram of the architecture of a communication system applicable to the method provided in an embodiment of the present application; FIG2 is a schematic diagram of a data transmission process provided by an embodiment of the present application; FIG3 is a schematic diagram of a fence diagram of a polar coding process provided by an embodiment of the present application; FIG4 is a schematic flow chart of a data processing method provided in an embodiment of the present application; FIG5 is a schematic diagram of a circular shift register provided in an embodiment of the present application performing a circular shift on elements in a sequence; FIG6 is a schematic diagram of the position of an interleaver provided in an embodiment of the present application; FIG7 is another schematic diagram of the position of the interleaver provided in an embodiment of the present application; FIG8 is another schematic diagram of the position of the interleaver provided in an embodiment of the present application; FIG9 is a schematic diagram showing a comparison of the effects of the technical solutions provided in the embodiments of the present application; FIG10 is a schematic block diagram of a data processing device provided in an embodiment of the present application; FIG11 is another schematic block diagram of a data processing device provided in an embodiment of the present application; FIG12 is a schematic diagram of a possible structure of a terminal provided in an embodiment of the present application; FIG. 13 is a schematic diagram of the structure of a wireless access network device provided in an embodiment of the present application. DETAILED DESCRIPTION The technical solution in this application will be described below in conjunction with the accompanying drawings. To facilitate understanding of the embodiments of the present application, the following description is first made: First, in order to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first", "second", etc. are used to distinguish the same items or similar items with substantially the same functions and effects. For example, the first matrix and the second matrix are only used to distinguish different matrices, and their order is not limited. Those skilled in the art can understand that the words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not necessarily limit them to be different. Second, in the embodiments of the present application, "at least one" refers to one or more, and "more" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship, but it does not exclude the situation where the previous and next associated objects are in an "and" relationship. The specific meaning can be understood in combination with the context. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c can represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, c can be single or multiple. Third, in the embodiments of the present application, "when", "if" and "if" all mean that the device will take corresponding actions under certain objective circumstances, but do not limit the time, nor do they require that the device must have a judgment action when it is implemented, nor do they mean that there are other limitations. Fourth, in each embodiment of the present application, "B corresponding to A" means that B is associated with A. "Determining B according to A" does not mean determining B only according to A, but B can also be determined according to A and / or other information. Fifth, the storage involved in this application may refer to storage in one or more memories. The multiple memories may be separately provided or integrated in an encoder or decoder, a processor, or a communication device. The one or more memories may also be partially separately provided and partially integrated in a decoder, a processor, or a communication device. The type of memory may be any form of storage medium, which is not limited in this application. Sixth, in the embodiment of the present application, the encoding device corresponds to the decoding device (or decoding device), the sequence to be encoded is the sequence to be transmitted before the encoding device encodes, and the encoded sequence is obtained after encoding, and the decoding device decodes the encoded sequence to obtain the decoded sequence, and the decoded sequence is the sequence to be transmitted before encoding (or the sequence to be encoded). The length of the encoding sequence is equal to the length of the sequence to be encoded. Seventh, the solutions of the embodiments of the present application can be applied to various communication systems, such as: Internet of Things (IoT) system, long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD) system, universal mobile telecommunications system (UMTS), fifth generation (5G) mobile communication system, new radio (NR) system or other evolved communication systems, as well as the next generation mobile communication system of 5G communication system, sixth generation (6G) communication system, or future communication system, etc. Eighth, in the embodiment of the present application, the radio access network (RAN) device may be a device with a wireless transceiver function. The radio access network device may be a device that provides wireless communication function services, usually located on the network side, including but not limited to: the next generation base station (gNodeB, gNB) in the 5G communication system, the next generation base station in the 6G mobile communication system, the base station in the future mobile communication system, the evolved node B (eNB), the radio network controller (RNC), the node B (NB), the base station controller (BSC), the home evolved NodeB (or home Node B, HNB), the base band unit (BBU), the transmission reception point (TRP), the transmitting point (TP), the base transceiver station (BTS), etc., the access node, the wireless relay node, the wireless backhaul node, etc. in the wireless fidelity (Wi-Fi) system. The wireless access network equipment can also be a wireless controller, a relay station, a vehicle-mounted device, a wearable device in a cloud radio access network (CRAN) scenario, and a network device in a future evolution network. In a network structure, the wireless access network device can be coordinated by multiple RAN nodes to assist the terminal in achieving wireless access, and different RAN nodes respectively implement part of the functions of the base station. For example, the RAN node can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU can be set separately, or they can also be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU) or a remote radio head (RRH). Wireless access network equipment can be deployed on land, including indoors or outdoors; it can also be deployed in the air, such as on airplanes, balloons, satellites, etc. In the embodiments of the present application, the device for implementing the functions of the wireless access network may be a wireless access network device; or it may be a device capable of supporting the wireless access network device to implement the corresponding functions, such as a chip system, a communication module, or a modem, etc., which may be installed in the wireless access network device. Among them, the chip system may be composed of a chip, or may include a chip and other discrete devices. The embodiments of the present application do not limit the specific technology and specific device form adopted by the wireless access network device. Ninth, in the embodiment of the present application, the terminal may be a device having a wireless transceiver function. The terminal may also be referred to as a terminal. Terminal equipment, user equipment (UE), mobile station (MS), mobile terminal (MT), etc., which can be an entity on the user side for receiving or transmitting signals, such as a mobile phone. Among them, the terminal includes a handheld device, a vehicle-mounted device, a wearable device or a computing device with a wireless communication function. Exemplarily, the terminal can be a mobile phone, a tablet computer or a computer with a wireless transceiver function. The terminal can also be a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in a smart grid, a wireless terminal in a smart city, a wireless terminal in a smart home, and the like. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle to everything (V2X) communication, machine-type communication (MTC), Internet of things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. Terminals can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. The terminal can be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; it can also be deployed on the water, such as on ships; it can also be deployed in the air, such as on airplanes, balloons and satellites. In the embodiments of the present application, the device for realizing the function of the terminal may be a terminal; or it may be a device capable of supporting the terminal to realize the function, such as a chip system, a communication module, or a modem, etc., which may be installed in the terminal. Among them, the chip system may be composed of a chip, or may include a chip and other discrete devices. The present application does not limit the specific technology and specific device form adopted by the terminal. It should be noted that in the embodiments of the present application, the encoding device can also be understood as an information sending device, which encodes the information before sending it. The encoding device can be a wireless access network device or a terminal. Similarly, the decoding device can be understood as an information receiving device. After receiving the information, the decoding device decodes it. The decoding device can be a wireless access network device or a terminal. The present application does not limit this. To facilitate understanding of the data processing method provided in the embodiment of the present application, the system architecture of the data processing method provided in the embodiment of the present application is described below. It is understandable that the system architecture described in the embodiment of the present application is to more clearly illustrate the technical solution of the embodiment of the present application, and does not constitute a limitation on the technical solution provided in the embodiment of the present application. FIG1 is a schematic diagram of the architecture of a communication system 10 applicable to the method provided in an embodiment of the present application. As shown in FIG1 , the communication system 10 includes a wireless access network 100 and a core network 200. Optionally, the communication system 10 may also include the Internet 300. The wireless access network 100 may include at least one base station (such as 110a and 110b in FIG1 ) and may also include at least one terminal (such as 120a-120j in FIG1 ). The base station may be a base station deployed in the air, such as a satellite base station 110a; or a base station deployed indoors, such as a micro base station or an indoor station 110b. The terminal may be a terminal deployed in the air, such as the helicopter or drone 120i in FIG. 1 ; or it may be a terminal deployed on the ground, such as the mobile phones 120a, 120e, 120f and 120j, the vehicle 120b, the computer 120g, the printer 120h, etc. in FIG. 1 . Base stations and terminals can be fixed or mobile. For example, base stations and terminals can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed in the air on aircraft, balloons, and artificial satellites. The roles of the base station and the terminal may be relative. For example, the helicopter or drone 120i in FIG. 1 may be configured as Mobile base station, for those 120j accessing the wireless access network 100 through 120i, 120i is a base station; but for 110a, 120i is a terminal, that is, 110a and 120i communicate through the wireless air interface protocol. Of course, 110a and 120i can also communicate through the interface protocol between base stations. In this case, relative to 110a, 120i is also a base station. Therefore, base stations and terminals can be collectively referred to as communication devices, and 110a, 110b, and 120a-120j in Figure 1 can be referred to as communication devices with their respective corresponding functions, such as communication devices with base station functions, or communication devices with terminal functions. Base stations and terminals, base stations, and terminals can communicate through authorized spectrum, unauthorized spectrum, or both; they can communicate through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz. The embodiments of the present application do not limit the spectrum resources used for wireless communication. In the embodiments of the present application, the functions of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem including the base station function. The control subsystem including the base station function here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal may also be performed by a module (such as a chip or a modem) in the terminal, or by a device including the terminal function. It should be understood that FIG. 1 is only a schematic diagram, and the communication system may also include other devices, such as wireless relay equipment and wireless backhaul equipment, which are not shown in FIG. 1 . Fig. 2 is a schematic diagram of a data transmission process provided by an embodiment of the present application. The data transmission process will be described in detail below in conjunction with Fig. 2. As shown in Figure 2, the information source is the source of information and information sequence. The information source outputs an information sequence, which is converted into an information sequence in binary (or multi-base) form through source coding, and then the information sequence (or sequence to be coded) is channel coded to obtain a coded sequence to improve the reliability of message transmission. Further, the coded sequence can be modulated and then transmitted through a channel. Accordingly, after the receiving end receives the modulated coded sequence (or modulation symbol), it is demodulated, and then channel decoding is performed through a decoding technology corresponding to the channel coding, and further source decoding is performed to obtain the original information sequence, wherein the destination is the object of information transmission (or destination end). The method provided in the present application mainly relates to channel coding and channel decoding. Channel coding is an important technology in communication technology, which can improve the reliability of signal transmission and the transmission quality of communication systems. Polar code is a new coding method, and the error correction performance of polar code mainly depends on the code spectrum. At present, the code spectrum of the polar code can be improved by a random interleaver, but the interleaving mode of the random interleaver is random each time. Therefore, the encoding device usually needs to inform the decoding device of the interleaving mode so that the decoding device can perform a deinterleaving operation, which results in a large signaling overhead. In order to reduce signaling overhead, the present application provides a data processing method with a fixed interleaver structure. The encoding device interleaves a preset second matrix through an interleaver with a fixed structure to obtain a first matrix, and then encodes a coded sequence based on the first matrix. Correspondingly, the decoding device can also perform deinterleaving based on the interleaver with the same structure. In other words, the encoding device and the decoding device unify the structure of the interleaver, and the structure of the interleaver will not change randomly. In this way, there is no need for the encoding device to inform the decoding device of the structure of the interleaver when transmitting data, and the structure of the interleaver is fixed, so that the interleaver is relatively simple to implement. To facilitate understanding, the technical terms and main parameters involved in the following embodiments are briefly explained first. 1. Polarization code: It is a forward error correction coding method used for signal transmission. The core of its construction is to use channel polarization Processing, on the encoding side, makes each sub-channel present different reliability. When the code length continues to increase, the capacity of some channels tends to 1, and the capacity of other channels tends to 0. Choosing to directly transmit information on the channel whose capacity tends to 1 to approach the channel capacity is the only method that can be strictly proved to reach the Shannon limit. 2. Rate matching: When the number of input bits exceeds the carrying capacity of the physical channel, the input sequence must be punctured; and when the number of input bits does not meet the carrying capacity of the physical channel, the input sequence must be retransmitted. Puncturing is to puncture the current bit and move the following bits forward; repetition is to insert the current bit once between the current bit and the following bit. Rate matching means that the bits on the transmission channel are punctured or retransmitted to match the carrying capacity of the physical channel. In the embodiment of the present application, the rate matching sequence is used to indicate which bits are punctured or shortened. It can be understood that the mother code that exceeds the target code length is punctured or shortened to reach the target code length, and rate matching is performed during decoding, and the received decoding sequence is padded to restore to the mother code length. In this application, the mother code length of the polar code is an integer power of 2. When the target code length is not an integer power of 2, it can be based on The corresponding mother code length is calculated, where N is the mother code length of the polar code (or the length of the sequence to be encoded), and E is the target code length. In the present application, the intermediate sequence generated in the process of polar coding the sequence to be coded may be referred to as a subcode. This will be described in detail below in conjunction with FIG. FIG. 3 is a schematic diagram of a fence diagram of a polar coding process provided in an embodiment of the present application. As shown in FIG3 , the sequence to be encoded is (u1, u2, u3, u4), and the encoded sequence obtained after polarization encoding is (x1, x2, x3, x4). The fence graph corresponding to the sequence to be encoded (or the fence graph corresponding to the encoding matrix for encoding the sequence to be encoded) has 3 layers, the 0th layer is the physical channel layer, the 2nd layer is the polarization channel layer, and the remaining layers (such as the 1st layer) are intermediate polarization layers. It can be understood that the fence graph corresponds one-to-one to the encoding matrix when encoding the sequence to be encoded. Assume that the sequence to be coded is polarized and coded at the polarization channel layer to obtain (v1, v2, v3, v4), where v1 can be obtained by, for example, xoring u1 with u2, v2 can be obtained directly based on u2, v3 can be obtained by, for example, xoring u3 with u4, and v4 can be obtained directly based on u4, then (v1, v2) and (v3, v4) can be called two subcodes. Among them, the subcode with higher capacity is called U code, and the subcode with lower capacity is called V code. The subcode with higher capacity refers to the subcode that carries more information bits than the two subcodes, and the subcode with higher capacity will also have a relatively higher code rate, where the code rate can be considered as the ratio of the number of information bits of the subcode to the total number of bits of the subcode. As can be seen from the above, the above fence diagram corresponds to the coding matrix one-to-one. Therefore, in the present application, the interleaver interleaves the coding matrix (that is, the second matrix), which can also be considered as deploying an interleaver at the corresponding subcode position, and the interleaver affects the submatrix corresponding to the subcode. For example, the coding matrix corresponding to the above fence diagram is (Recorded as Matrix 1), if an interleaver of length 2 is deployed at the position of subcode (v1, v2), it can be considered as the 2×2 submatrix in the upper left corner of Matrix 1 Interweave. More generally, when the mother code length of the polar code is N (or the length of the sequence to be encoded is N), the corresponding fence diagram has a total of (log2N+1) layers, the 0th layer is the physical channel layer, the log2Nth layer is the polarization channel layer, and the remaining layers are intermediate polarization layers. It should be understood that the above polarization layer division is only an example and should not constitute any limitation to the embodiments of the present application. 3. Row weight and column weight: Row weight is the number of values 1 in a row of the matrix. Column weight is the number of values 1 in a column of the matrix. The number of values that are 1. 4. The following parameters are mainly involved in the embodiments of this application: E: refers to the target code length, which is determined by the resources scheduled by the base station. For example, if the base station schedules 7 resource blocks to the terminal, E can be 7. It can be understood that the lengths of the input and output sequences in polar code encoding are both integer powers of 2. Therefore, when the value of E is not an integer power of 2, according to the formula The corresponding mother code length N is calculated, where E is a positive integer. N: refers to the mother code length (or the length of the sequence to be encoded). The value of N is an integer power of 2. N is an integer. K: refers to the number of message bits, 0<K≤E≤N, K is an integer. w: is determined based on the row weights and polarization channel reliabilities of the other rows in the first matrix except the rows corresponding to the punctured bits and shortened bits. The data processing method provided by the embodiment of the present application will be described in detail below in conjunction with the accompanying drawings. It should be understood that the embodiment shown below describes the method from the perspective of the interaction between the encoding device and the decoding device, but should not constitute any limitation on the execution subject of the method. As long as the program with the code of the method provided by the embodiment of the present application can be recorded by running, the method provided by the embodiment of the present application can be executed. For example, the encoding device can also be replaced by a component (such as a chip, a chip system, etc.) configured in the encoding device, or other functional modules that can call a program and execute the program, and the decoding device can also be replaced by a component (such as a chip, a chip system, etc.) configured in the decoding device, or other functional modules that can call a program and execute the program. The embodiment of the present application does not limit this. Fig. 4 is a schematic flow chart of a data processing method 400 provided in an embodiment of the present application. Each step in the method 400 is described in detail below. In step 410, the encoding device obtains a sequence to be encoded. The sequence to be encoded may include information bits and frozen bits, wherein the information bits are used to carry information to be transmitted, and the frozen bits may be used to carry useless information, or in other words, the frozen bits may not carry any information. This application does not limit the specific definition of the frozen bits. It can be seen that the encoding device can also determine which positions are used to carry the information to be transmitted, or which bits are information bits, before obtaining the sequence to be encoded. Accordingly, after the information bits are determined, the remaining positions can be frozen bits, for example, the frozen bits can be set to 0. In one possible design, assuming that the number of information bits is K, the K information bits may be K bits that are ranked first among bits other than punctured bits, shortened bits, and / or pre-frozen bits in the to-be-coded sequence when the polarization channel reliability is arranged from high to low, wherein the pre-frozen bits are determined based on the polarization channel reliability and the row weight of the first matrix. The first matrix is obtained by interleaving a preset second matrix based on one or more interleavers. For the design of the one or more interleavers, please refer to the description below. Exemplarily, assuming that the length of the sequence to be encoded (or the mother code length of the polarization code) is N, the number of information bits is K, the punctured bit is the first bit, the pre-frozen bit is the third bit and the fourth bit, and after excluding the punctured bit and the pre-frozen bit, the remaining N-3 bits are arranged from high to low according to the polarization channel reliability, and the K information bits are the top K bits. Optionally, when the polarization channel reliabilities are arranged from low to high, the K information bits may be K bits with the lowest polarization channel reliabilities among the bits in the to-be-coded sequence except for punctured bits, shortened bits, and pre-frozen bits. The present application does not limit the sorting method of the polarization channel reliabilities. The process of determining information bits by the encoding device provided in an embodiment of the present application will be described in detail below. 1. The encoding device determines the mother code length and the number of message bits according to the resources scheduled by the wireless access network equipment. Assuming that the resources scheduled by the wireless access network device are 7 resource blocks, the target code length E can be 7. It is not difficult to see that 7 is not an integer power of 2. Therefore, the mother code length is determined as in, Indicates rounding up. 2. The encoding device determines a reliability sequence of length N. Each value in the reliability sequence can be used to indicate the reliability of different polarization channels. The reliability sequence can be obtained by polarization weight method (PW) or table lookup, wherein the table lookup can be a reliability sequence defined in the NR standard. For a more detailed description of PW, refer to the known technology. The present application does not limit the method for obtaining the reliability sequence. 3. The encoding device determines a rate matching sequence. The rate matching sequence may be generated based on puncturing, or generated based on shortening, or generated based on the current bit rate. The rate matching sequence is used to indicate the puncturing bits or shortening bits in the sequence to be encoded. The specific method for determining the rate matching sequence can refer to the known technology and will not be described in detail here. The puncturing may be performed from the front to the back, for example. For example, the initialization sequence is an all-zero sequence of length N, and N-E positions (or puncturing positions) are determined from the front to the back, and these puncturing positions are set to 1 to obtain and output a rate matching sequence. 4. The encoding device determines the pre-freeze position. The pre-freeze position is determined based on the polarization channel reliability and the row weight of the first matrix. The process of determining the pre-freeze position will be described in detail below. First determine f, f = log2N*(a-|a*K / E-offset| 2 ), where a and offset are predefined parameters, for example, a=1, offset=0.5. Then determine w. w is determined based on the row weights and polarization channel reliabilities of the other rows in the first matrix except the rows corresponding to the punctured bits and shortened bits. For example, w is the minimum row weight of the K+f rows with the highest polarization channel reliabilities in the other rows in the first matrix except the rows corresponding to the punctured bits and shortened bits. For example, assuming that the first matrix is a 4×4 matrix, and the row corresponding to the punctured bits is the first row, then the second row, the third row, and the fourth row are left. Assuming f=1 and K=1, select the rows with the first K+f=2 bits of polarization channel reliability from the second row, the third row, and the fourth row, assuming that they are the third and fourth rows, and then determine the minimum row weight between the row weight of the third row and the row weight of the fourth row. After determining w, determine the pre-freeze position, which can be a row weight of 2 m The bits corresponding to the rows of w, where m is a natural number. For example, the pre-freeze bits may be bits corresponding to rows with row weights of w and 2w. Among them, f1 bits are selected for rows with row weights of w, and f2 bits are selected for rows with row weights of 2w. When f≤n_w, f1=f, f2=0; when f>n_w, f1=f, f2=B*(f-n_w), B is predefined, B may be 0.75, and n_w is the number of rows with row weights of w in the first matrix. In the present application, the rows of the first matrix correspond to the bits of the sequence to be encoded. For example, if the sequence to be encoded is (u1, u2, u3, u4), the first row in the first matrix can correspond to u1, the second row to u2, the third row to u3, and the fourth row to u4. 5. The encoding device determines the message bit and the frozen bit. After the pre-freeze bits and rate matching sequence are determined, the puncturing bits and shortening bits (puncturing bits or shortening bits can be determined based on the rate matching sequence) are excluded in descending order according to the polarization channel reliability (which can be determined based on the reliability sequence). The K bits with the highest reliability are selected as message bits, and the remaining NK bits are frozen bits. It should be understood that the above process of determining the information bits takes the example of the interleaver interleaving the columns of the sub-matrix in the preset second matrix. Therefore, the row weight is considered when determining the pre-freeze bit. If the interleaver interleaves the rows of the sub-matrix in the preset second matrix, the column weight can be considered when determining the pre-freeze bit accordingly. In addition, in the process of determining the information bits above, the reliability is arranged from high to low as an example. In actual applications, the reliability may also be arranged from low to high. In this case, the row whose polarization channel reliability is the latter K+f is selected. In short, the row with higher reliability is selected. It should be understood that the method of obtaining the sequence to be encoded is not limited to the method described in step 410, and the matrix to be encoded can also be obtained in an existing manner, or the information bits can be determined, and then encoded according to the method provided in this application. In step 420, the encoding device performs polarization encoding on the sequence to be encoded according to the first matrix to obtain a encoded sequence. The first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, and each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, and at least one circular shift register in each layer of circular shift registers is used to circularly shift the columns or rows in a sub-matrix, and the sub-matrix is obtained based on part of the columns or part of the rows in the second matrix; in other words, at least one circular shift register in each layer of circular shift registers can perform column transformation or row transformation on the sub-matrix. In the present application, a sub-matrix may also be referred to as a sub-block, and the present application does not limit its specific name. The first matrix may be obtained by interleaving the second matrix based on one or more interleavers, wherein the number of the one or more interleavers is related to the length of the mother code corresponding to the sequence to be encoded. The number of rows or columns of the second matrix is the same as the length of the mother code corresponding to the sequence to be encoded, therefore, the number of the one or more interleavers may be related to the number of rows or columns of the second matrix. For example, if the number of rows or columns of the second matrix is 4, the maximum number of interleavers can be 1; if the number of rows or columns of the second matrix is 8, the maximum number of interleavers can be 3; if the number of rows or columns of the second matrix is 16, the maximum number of interleavers can be 7; if the number of rows or columns of the second matrix is 32, the maximum number of interleavers can be 15, and so on. More generally, when the mother code length corresponding to the sequence to be encoded is N (or the number of rows or columns of the second matrix is N), the maximum number of interleavers can be 1+2. 1 +2 2 +2 3 +…+N / 4, the specific principle is as follows: The number of interleavers can be equal to the number of V codes in all intermediate polarization layers. For a polarization code with a mother code length of N, the first intermediate polarization layer has 1 V code (length N / 2), the second intermediate polarization layer has 2 V codes (length N / 4), the third intermediate polarization layer has 4 V codes (length N / 8), and the last intermediate polarization layer has N / 2 V codes (length 2). Therefore, when the mother code length is N, the number of all V codes can be determined. Since an interleaver can be deployed at each V code, the maximum number of interleavers can be equal to the number of V codes, that is, 1+2. 1 +2 2 +2 3 +…+N / 4. For example, when N=4, the maximum number of interleavers can be 1; when N=8, the maximum number of interleavers can be 1+2=3; when N=16, the maximum number of interleavers can be 1+2+4=7; when N=32, the maximum number of interleavers can be 1+2+4+8=15. It is understandable that the number of the above interleavers is calculated based on the assumption that an interleaver is deployed in each intermediate polarization layer, but this does not constitute any limitation to all embodiments of the present application. In practical applications, interleavers may also be deployed only in certain intermediate polarization layers. It can be understood that the circular shift register can be used to circularly shift the columns or rows in the sub-matrix. At least one circular shift register in each layer of circular shift registers is used to circularly shift the columns or rows in the sub-matrix, that is, it can be a column transformation of the sub-matrix or a row transformation of the sub-matrix. The interleaver acting on the second matrix is used as an example for introduction. In practical applications, the interleaver can also be considered to act on the sequence to be encoded. Exemplarily, the sequence to be encoded is (u1, u2, u3, u4), the second matrix is A, and when not interleaved, (u1, u2, u3, u4)A=(x1, x2, x3, x4). When interleaved, it is assumed that the second matrix is interleaved based on one or more interleavers to obtain the first matrix A*, wherein A* can be considered to be obtained by performing column transformation or row transformation on a submatrix in the second matrix based on one or more interleavers, and the encoded sequence obtained after polarization encoding according to the first matrix is (x1, x2, x3, x4). In other words, (u1, u2, u3, u4)A*=(x1, x2, x3, x4). Assuming D×A=A*, or in other words, the interleaving of matrix A can be represented by a matrix D, then (u1, u2, u3, u4)×D×A=(x1, x2, x3, x4). In this case, it can also be considered that the sequence to be encoded is interleaved. In addition, in this case, it can also be considered that the rows in the sub-matrix in the second matrix are cyclically shifted. In the following description, the column transformation of the sub-matrix is taken as an example. In practical applications, the cyclic shift register included in an interleaver can also perform cyclic shift on the rows of the sub-matrix, that is, perform row transformation on the sub-matrix. It is also possible to perform column transformation and row transformation on the sub-matrix, that is, two kinds of transformation. One possible design of the interleaver is that the interleaver includes a layer of cyclic shift registers, and the layer of cyclic shift registers includes one or more cyclic shift registers that can perform column transformation on the sub-matrix. For example, the second matrix is (Matrix 1), the submatrix is the 2×2 submatrix in the upper left corner of Matrix 1 After cyclic shift of the sub-matrix, we get Therefore, the first matrix is the matrix after the 2×2 submatrix in the upper left corner of matrix 1 is shifted, that is, It can be understood that the above example is based on the example that the layer of circular shift registers includes a circular shift register, and the circular shift register performs column transformation on the sub-matrix, but it should not constitute any limitation to the embodiments of the present application. The layer of circular shift registers may also include multiple circular shift registers, at least one of which performs circular shift on the sub-matrix. For example, the second matrix is an 8×8 matrix, which is as follows: Among them, the 4×4 submatrix in the upper left corner of the 8×8 matrix is (Matrix 1), the number of the multiple circular shift registers in the one-layer circular shift register included in the interleaver may be, for example, 2, then the 4 columns of Matrix 1 may be divided into two groups, one of which is the first column and the second column (these two columns correspond to the circular shift register 1), and the other is the third column and the fourth column (these two columns correspond to the circular shift register 2). Assuming that the circular shift register 2 performs a circular shift on Matrix 1, the third column and the fourth column are column-transformed, and then we obtain (Recorded as Matrix 2) In other words, the 4×4 matrix 1 in the upper left corner of the original 8×8 matrix is changed to Matrix 2, and the first matrix is obtained. Another possible design of the interleaver is that an interleaver includes multiple layers of circular shift registers, and the sub-matrix that each circular shift register in the next layer of circular shift registers performs circular shifting comes from the sub-matrix obtained after the circular shift register in the previous layer performs circular shifting. Exemplarily, when an interleaver includes multiple layers of circular shift registers, one layer of circular shift registers performs circular shifting on the columns in a sub-matrix (referred to as sub-matrix X) (or performs column transformation on sub-matrix X) to obtain a circularly shifted sub-matrix (referred to as sub-matrix Y), and the circular shift register in the next layer continues to perform circular shift operations on the columns in sub-matrix Y. Exemplarily, the second matrix is a 16×16 matrix, or in other words, the length of the sequence to be encoded is 16, and the 16×16 matrix is as follows: In the process of encoding the sequence to be encoded, the first matrix can be obtained by interleaving the second matrix based on one or more interleavers, and an interleaver includes multiple layers of circular shift registers, and the sub-matrix of each circular shift register in the latter layer of circular shift registers is obtained by circularly shifting the sub-matrix of the previous layer of circular shift registers. Assuming that the length of one of the interleavers is 8, the corresponding interleaved sub-matrix is 8 in the upper left corner. ×8 matrix, for example, the interleaver includes 2 layers of circular shift registers, the first layer of circular shift registers includes 4 circular shift registers, the length of each circular shift register is 2, and the second layer of circular shift registers includes 2 circular shift registers, the length of each circular shift register is 4. Among them, the first layer of circular shift registers includes 4, and it can also be considered that the 8 columns in the upper left corner 8×8 matrix are divided into 4 groups, each with two columns. Assuming that the fourth circular shift register in the first layer of circular shift registers performs circular shift on the sub-matrix, the seventh column in the upper left corner 8×8 matrix is moved to the back of the eighth column, that is, the seventh column and the eighth column are exchanged, and the 8×8 matrix X is obtained as follows: The second layer of circular shift registers includes 2, which can also be considered as dividing the 8 columns of the 8×8 matrix X into 2 groups, each with 4 columns. Assuming that the second circular shift register in the second layer of circular shift registers performs circular shift on the sub-matrix, the fifth column of the 8×8 matrix X is moved to the back of the eighth column, that is, the sixth to eighth columns are moved forward, and the 8×8 matrix Y is obtained as follows: It should be understood that this is only a description of one of the interleavers and should not constitute any limitation to the present application. An interleaver with a length of 4 may also be included, and the design of the cyclic shift register included therein is similar to that of the interleaver with a length of 8, which will not be described in detail here. Optionally, the number of cyclic shift bits and / or the number of layers of cyclic shift registers included in an interleaver are predefined. The number of bits for cyclic shifting the columns in the submatrix (or the number of columns for cyclic shifting the columns in the submatrix) and the number of layers of cyclic shift registers included in an interleaver can be predefined, and the encoding device and the decoding device can be predefined as long as the two are unified. Alternatively, the encoding device can also inform the decoding device through signaling, which is not limited in this application. Optionally, the number of layers of cyclic shift registers included in an interleaver is related to the length of the interleaver. One possible design is that the larger the length of the interleaver, the more layers of cyclic shift registers an interleaver can include. The length of an interleaver is related to the number of columns of the submatrix interleaved by the interleaver, and may be equal to the number of columns of the submatrix interleaved by the interleaver. Therefore, the number of layers of cyclic shift registers included in an interleaver is related to the length of the interleaver. It can also be understood that the number of layers of cyclic shift registers included in an interleaver is greater than the number of layers of cyclic shift registers included in an interleaver. The number of layers of the interleaver is related to the number of columns of the sub-matrices that are interleaved by the interleaver. One possible design is that if the length of the interleaver is less than 8, the number of layers of the cyclic shift register included in the interleaver is 1 or 2; if the length of the interleaver is greater than or equal to 8, the number of layers of the cyclic shift register included in the interleaver is 3. In other words, if the length of the sequence to be encoded is less than 16, the corresponding length of the interleaver will be less than 8, and the number of layers of the cyclic shift register included in the interleaver is 1 or 2; if the length of the sequence to be encoded is greater than or equal to 16, the corresponding length of the interleaver will be greater than or equal to 8, and the number of layers of the cyclic shift register included in the interleaver is 3. Another possible design is that if the length of the sequence to be encoded is 4, the number of layers of circular shift registers included in an interleaver is 1; if the length of the sequence to be encoded is 8, 16 or 32, the number of layers of circular shift registers included in an interleaver is 2; if the length of the sequence to be encoded is 64, 128, 256, 512, 1024, 2048, 4096, or 8192, the number of layers of circular shift registers included in an interleaver is 3. It should be understood that the number of layers of the cyclic shift registers included in the interleavers of different lengths is only an example and should not constitute any limitation to the present application. In practical applications, the number of layers of the cyclic shift registers may also be other values. Optionally, the length of an interleaver is equal to the number of columns of the sub-matrices that are interleaved by the interleaver. It is not difficult to understand that the number of rows and columns of a sub-matrix are equal, so the length of an interleaver can also be equal to the number of rows of the sub-matrix on which the interleaver performs interleaving operations. Optionally, if the length of the interleaver is 2 n-1 The number of layers of the cyclic shift register included in the interleaver is 3, and the length of the cyclic shift register included in the first layer of cyclic shift registers is 2 n-3 The length of the second layer of circular shift registers is 2 n-2 The length of the circular shift register included in the third layer of circular shift registers is 2 n-1 , n is an integer greater than or equal to 4. Exemplarily, the length of the interleaver is 32, the length of the circular shift registers included in the first layer of circular shift registers is 8, the length of the circular shift registers included in the second layer of circular shift registers is 16, and the length of the circular shift registers included in the third layer of circular shift registers is 64. It should be understood that the length of the interleaver and the length of the corresponding circular shift register in each layer of circular shift register are only examples and should not constitute any limitation to the present application. In practical applications, the length of each layer of circular shift register including the circular shift register may also include other values. It can be understood that both the encoding device and the decoding device can predefine some parameters of the interleaver, such as the length of the cyclic shift register included in each layer of the cyclic shift register. For example, when the length of the interleaver is 2, the corresponding parameter of the interleaver is [2]; when the length of the interleaver is 4, the corresponding parameter of the interleaver is
[0024] ; When the length of the interleaver is 8, the corresponding parameters of the interleaver are
[0028] ; when the length of the interleaver is 16, the corresponding parameters of the interleaver are
[0416] ; when the length of the interleaver is 32, the corresponding parameters of the interleaver are
[81632] ; when the length of the interleaver is 64, the corresponding parameters of the interleaver are [163264]; when the length of the interleaver is 128, the corresponding parameters of the interleaver are [3264128]; when the length of the interleaver is 256, the corresponding parameters of the interleaver are [163264]; The parameters corresponding to the interleaver are [64128256]; when the length of the interleaver is 512, the parameters corresponding to the interleaver are [128256512]; when the length of the interleaver is 1024, the parameters corresponding to the interleaver are [2565121024]; when the length of the interleaver is 2048, the parameters corresponding to the interleaver are [51210242048]; when the length of the interleaver is 4096, the parameters corresponding to the interleaver are [102420484096]. The number of elements in [] represents the number of layers of circular shift registers included in the interleaver, the first element represents the length of each circular shift register in the first layer of circular shift registers, the second element represents the length of each circular shift register in the second layer of circular shift registers, and so on. The first element may also represent the number of circular shift registers in the first layer of circular shift registers. The second element represents the number of circular shift registers in the second layer of circular shift registers. The product of the number and the length is the length of the interleaver. This application does not limit the specific meaning of the element. It is understood that the number of layers of cyclic shift registers and the length of cyclic shift registers included in the above interleaver are only examples and should not constitute any limitation to the present application. In practical applications, the number of layers of cyclic shift registers and the length of a cyclic shift register included in an interleaver may also be other values. Optionally, in the present application, the number of bits of the cyclic shift is an odd number. Since the length of the mother code (or the coding sequence) of the polar code is an integer power of 2, the number of bits of the cyclic shift can avoid being an even number as much as possible to obtain a better code spectrum. Another possible design of the number of bits of the cyclic shift can be a prime number other than 2. It is not difficult to understand that, no matter which design is used, the number of bits of the cyclic shift should be smaller than the number of columns of the sub-matrix that is interleaved by the interleaver. Optionally, the cyclic shift is a cyclic left shift or a cyclic right shift. For example, a certain sequence (y1y2y3y4y5y6), the number of cyclic shift bits is 1 as an example, and the cyclic left shift means moving y1 to the end and moving the remaining elements forward to obtain (y2y3y4y5y6y1); the cyclic right shift means moving y6 to the front and moving the remaining elements backward to obtain (y6y1y2y3y4y5). In the present application, the elements in the sequence can be regarded as columns or rows of a submatrix. It can be understood that in practical applications, the encoding device can also be designed for the elements in the corresponding sequence according to the circular shift register in the interleaver, and how the elements in the sequence are circularly shifted can be considered as how the columns in the sub-matrix are circularly shifted. Fig. 5 is a schematic diagram of a circular shift register provided in an embodiment of the present application performing circular shift on elements in a sequence. In conjunction with Fig. 5, the following will describe in detail how circular shift registers of different lengths and numbers of layers perform circular shift. Each element in the sequence shown in FIG5 can be regarded as a column of a submatrix in the second matrix. In addition, FIG5 only exemplarily shows the design of an interleaver based on 4-layer, 3-layer and 2-layer cyclic shift registers. In practical applications, there may be more or fewer layers. Moreover, in practical applications, the lengths of cyclic shift registers in the same layer may be different. As shown in a) of FIG. 5 , the length of the interleaver is 16. The interleaver includes two layers of circular shift registers. The first layer of circular shift registers includes four circular shift registers, and the length of each circular shift register is 4. That is to say, the sequence of length 16 is divided into four segments, each with four elements. In the corresponding matrix, it can be considered that the 16×16 submatrix is divided into four groups according to columns, each with four columns. First, the first circular shift register in the first layer of circular shift registers circularly shifts the first segment in the sequence, such as shifting it left by one bit, to obtain a sequence X (intermediate result, the output of the first layer of circular shift registers, not shown in the figure). Secondly, the second layer of circular shift registers includes a circular shift register, which circularly shifts the sequence X, such as shifting it left by one bit, to obtain a sequence 341…15162. As shown in b) of Figure 5, the length of the interleaver is 32. The interleaver includes three layers of circular shift registers. The first layer of circular shift registers includes four circular shift registers, and the length of each circular shift register is 8. That is to say, the sequence of length 32 is divided into four segments, each with 8 elements. In the corresponding matrix, it can be considered that the 32×32 sub-matrix is divided into four groups according to columns, and each group has 8 columns. First, the last circular shift register in the first layer of circular shift registers circularly shifts the last segment in the sequence, such as shifting it left by one bit, to obtain the sequence X (the output of the first layer of circular shift registers). Secondly, the second layer of circular shift registers includes two circular shift registers, and the length of each circular shift register is 16. That is to say, the sequence X of length 32 is divided into two segments, each with 16 elements. The second circular shift register circularly shifts the second segment of the sequence X, such as shifting it left by one bit, to obtain the sequence Y (output of the second-layer circular shift register). Finally, the third-layer circular shift register includes a circular shift register whose length is 32. The circular shift register circularly shifts the sequence Y, such as shifting it left by one position (using the output of the second-layer circular shift register as the input and output of the third-layer circular shift register), to obtain the sequence 2:3225171. Similarly, as shown in c) in FIG5 , the length of the interleaver is 32, and the interleaver includes 3 layers of cyclic shift registers. The difference between the interleaver and the interleaver shown in b) in FIG5 is that the direction of the cyclic shift is different, and c) in FIG5 is a cyclic right shift. Similarly, as shown in d) in FIG5 , the length of the interleaver is 32, and the interleaver includes 3 layers of cyclic shift registers. The difference between the interleaver and the interleaver shown in c) in FIG5 is the number of cyclic shift bits. d) in FIG5 is a cyclic right shift of 3 bits, and c) in FIG5 is a cyclic right shift of 1 bit. Similarly, as shown in e) of FIG5 , the length of the interleaver is 64, and the interleaver includes 4 layers of circular shift registers. The first layer of circular shift registers includes 8 circular shift registers, and the length of each circular shift register is 8, that is, the sequence of length 64 is divided into 8 segments, each segment has 8 elements. First, the last circular shift register in the first layer of circular shift registers circularly shifts the last segment in the sequence, such as shifting it left by one bit, to obtain sequence X (intermediate result, output of the first layer of circular shift registers). Secondly, the second layer of circular shift registers includes four circular shift registers, and the length of each circular shift register is 16, that is, the sequence X of length 64 is divided into 4 segments, each segment has 16 elements, and the fourth circular shift register circularly shifts the fourth segment of sequence X, such as shifting it left by one bit, to obtain sequence Y (output of the second layer of circular shift registers). Secondly, the third-layer circular shift register includes two circular shift registers, each of which has a length of 32. The second circular shift register circularly shifts the sequence Y, such as shifting it left by one position, to obtain the sequence Z (the output of the third-layer circular shift register). Finally, the fourth-layer circular shift register includes a circular shift register, the length of which is 64. The circular shift register circularly shifts the sequence Z, such as shifting it left by one position, to obtain the sequence 2: 645749331. It should be noted that FIG. 5 is only an exemplary illustration of the number of cyclic shift bits, direction, and segments to be cyclically shifted, but this should not constitute any limitation on the embodiments of the present application. The present application does not limit the number of cyclic shift bits, direction, segments to be cyclically shifted (such as the first segment, the last segment, or the middle segment), the number of layers of cyclic shift registers included in the interleaver, and the length of each cyclic shift register. Optionally, the length of one or more interleavers, or the intermediate polarization layer where one or more interleavers are located is determined according to the length of the sequence to be encoded, and the intermediate polarization layer is other layers in the polarization layer except the polarization channel layer and the physical channel layer. The following describes in detail the process of determining the intermediate polarization layer, length, and starting position of the interleaver where one or more interleavers are located according to the length of the sequence to be encoded (or the mother code length of the polarization code). In other words, how to determine which sub-matrices are interleaved by one or more interleavers according to the length of the sequence to be encoded. Optionally, when the length of the sequence to be encoded is greater than or equal to 32, the layer where one or more interleavers are located can be the first three intermediate polarization layers. When the length of the sequence to be encoded is less than 32, the position of one or more interleavers can be all intermediate polarization layers, that is, the interleaver is present in each intermediate polarization layer. It can be understood that in practical applications, when the length of the sequence to be encoded is greater than or equal to 32, the layers where one or more interleavers are located can also be more intermediate polarization layers (such as the first 4 intermediate polarization layers, etc.), and this application does not limit this. FIG6 is a schematic diagram of the position of the interleaver provided in an embodiment of the present application. As shown in FIG6, the sequence to be encoded The length is 4, and the polarization layer includes 3 layers. The 0th layer is the physical channel layer, the 2nd layer is the polarization channel layer, and the 1st layer is the middle polarization layer. The different positions of each polarization layer are shown in Figure 6. The interleaver is located in the middle polarization layer of the 1st layer. Assume that the corresponding coding matrix is The interleaver is located in the middle polarization layer of the first layer, and the corresponding sub-matrix for interleaving should be the 2×2 sub-matrix in the upper left corner of the above matrix. More generally, the length of the sequence to be encoded is N, and the length of the interleaver for the intermediate polarization layer of the lth layer is The starting position is The position corresponding to the starting position of the submatrix is the first position of the second matrix. Starting from the first column of the row, Submatrices of i = 1, 2, ... 2 l , l = 1, 2, ... log2(N)-1, i has 2 l-1 So the number of interleavers in layer l is 2 l-1 It can be understood that this is the case without rate matching. If rate matching is considered, the number of interleavers may be less than 2. l-1 . Exemplarily, the mother code length (or the length of the sequence to be encoded) is N=64, and the encoding device determines that the layer where the interleaver is located is the lth layer according to the mother code length (since it is greater than 32, the position of the interleaver is the first 3 middle polarization layers), where l=1, 2, 3. The first-layer interleaver starts from the first position and has a length of N / 2=32. If it corresponds to the second matrix, a 32×32 submatrix starts from the first row and first column of the second matrix (the second matrix may have been obtained by interleaving the original coding matrix based on a certain interleaver); the number of second-layer interleavers is 2, starting from the {1, 33}th positions respectively, and the length of the interleaver is 16. If it corresponds to the second matrix, a 16×16 submatrix starts from the first row and first column of the second matrix (the second matrix may have been obtained by interleaving the original coding matrix based on a certain interleaver), and a 16×16 submatrix starts from the 33rd row and first column of the second matrix; the number of third-layer interleavers is 4, starting from the {1, 17, 33, 49}th positions respectively, and the length of the interleaver is 8. Optionally, the length of an interleaver is smaller than the number of columns of a submatrix interleaved by the interleaver, wherein the difference between the number of columns of the submatrix interleaved by the interleaver and the length of the interleaver is the number of corresponding punctured bits or shortened bits in the submatrix. In the case of rate matching, the length of an interleaver can be less than the number of columns of the submatrix interleaved by the interleaver. In this design, the difference between the number of columns of the submatrix interleaved by the interleaver and the length of the interleaver is the number of corresponding punctured or shortened bits in the submatrix. Another design is that in the case of rate matching, the length of an interleaver can also be equal to the number of columns of the submatrix interleaved by the interleaver, but the rows or columns with punctured or shortened bits are not interleaved. FIG. 7 is another schematic diagram of the position of the interleaver provided in an embodiment of the present application. As shown in a) of FIG. 7 , E=5, the mother code length is N=8, and according to the shortened rate matching rule, the 4th, 6th, and 8th positions are selected as shortened positions, which correspond to the 4th, 6th, and 8th rows of the second matrix. Therefore, when designing the interleaver, it is necessary to avoid the rows in the second matrix corresponding to these positions and not participate in the interleaving. Without considering the shortened position, the first layer (which is the intermediate polarization layer) should include an interleaver 1 with a length of 4, and the second layer (which is the intermediate polarization layer) should include two interleavers with a length of 2 (interleaver 2 and interleaver 3). If the shortened position is considered, interleaver 1 should avoid the 4th position (because the 4th position is a shortened position), that is, the length of interleaver 1 can be 3, and similarly, there is no corresponding shortened position in interleaver 2. Interleaver 3 should avoid the 6th position, and the length of interleaver 3 can be 1, that is, no interleaving. As shown in b) of Figure 7, E=5, the mother code length is N=8, and according to the rate matching rule of puncturing, the 1st, 2nd, and 3rd positions are selected as puncturing positions. Therefore, when designing the interleaver, it is necessary to avoid the rows in the second matrix corresponding to these positions from participating in the interleaving. Without considering the puncturing positions, the first layer (this layer is the intermediate polarization layer) should include an interleaver 1 with a length of 4, and the second layer (this layer is the intermediate polarization layer) should include 2 interleavers with a length of 2 (interleaver 2 and interleaver 3). If the puncturing positions are considered, interleaver 1 should avoid the 1st, 2nd, and 3rd positions (because the 3 positions are puncturing positions), that is, the length of interleaver 1 can be 1 (that is, no interleaving), and similarly, there are 2 corresponding puncturing positions in interleaver 2, so there is no interleaver at this position. Interleaver 3 has no corresponding puncturing positions, so the length of interleaver 3 can be 2. The preset second matrix mentioned above may be generated based on the polarization kernel. Exemplarily, if interleaving has not been performed, the coding matrix (it can be understood that the coding matrix is the second matrix in this application) G N That is, the existing polar code encoding matrix is generated based on the polarization kernel. in represents the n-th Kronecker product, n = log2(N), That is, the polarization core can be, for example, For example, It can be understood that the second matrix is interleaved by one or more interleavers to obtain the first matrix, and then the encoding device encodes the sequence to be encoded according to the first matrix to obtain the encoded sequence. In step 430, the encoding device sends the encoding sequence to the decoding device. The encoding device performs polarization encoding on the sequence to be encoded according to the first matrix, and after obtaining the encoded sequence, the encoded sequence can be sent to the decoding device. It can be understood that before sending the coding sequence, the coding device can modulate the coding sequence, and then transmit the modulated coding sequence (or modulation symbol) through the channel. Correspondingly, the decoding device receives the modulated coding sequence (or modulation symbol). In step 440, the decoding device decodes the coded sequence according to the first matrix to obtain a decoded sequence. The decoding device can demodulate after receiving the modulated coding sequence (or modulation symbol), and then perform channel decoding through a decoding technology corresponding to the channel coding. Exemplarily, the decoding device can decode the coding sequence according to the first matrix to obtain a decoded sequence, and the decoded sequence is the same as the sequence before coding (or the sequence to be coded). For the decoding device, the design of the first matrix, the second matrix, the interleaver and how to determine the information bits are the same as the encoding device. For details, please refer to the relevant description of step 420, which will not be repeated here. Optionally, the method 400 shown in FIG4 further includes: the encoding device sends first indication information to the decoding device, and the first indication information is used to indicate the length of the sequence to be encoded. Correspondingly, the decoding device receives the first indication information. At this time, the length of the sequence to be encoded can also be considered as the length of the encoding sequence. Optionally, the method 400 shown in FIG4 further includes: the encoding device sends second indication information to the decoding device, and the second indication information is used to indicate the number of information bits in the sequence to be encoded. Correspondingly, the decoding device receives the second indication information. At this time, the number of information bits in the sequence to be encoded can also be considered as the number of information bits in the decoded sequence. The first indication information and the second indication information may be carried in different signalings or in the same signaling. When the first indication information and the second indication information are carried in the same signaling, the aforementioned step of sending the first indication information and the step of sending the second indication information may be the same step. It can be understood that when the encoding device sends the first indication information and the second indication information to the decoding device, the encoding device may be a terminal and the decoding device may be a wireless access network device. When the encoding device is a wireless access network device and the decoding device is a terminal, the wireless access network device may not send the first indication information and the second indication information to the terminal, and the terminal may perform blind detection on the received coding sequence to obtain the original sequence. Fig. 8 is another schematic diagram of the position of the interleaver provided in an embodiment of the present application. In Fig. 8, the position of the subcode where the interleaver is located is described in detail, wherein P represents the interleaver. As shown in FIG8 , (32, 16) indicates that the length of the sequence to be encoded is 32, wherein the number of information bits is 16, and the subcodes of length 16 include two, wherein the number of information bits is 11 and the other is 5. Therefore, the capacity of the subcode of information bits of 5 is relatively low (it can be called V code), and an interleaver is provided at the V code. For the subcode of length 16 and information bits of 11, it is further divided into subcodes of length 8, information bits of 7 and 4, wherein the subcode of information bits of 4 is V code, and an interleaver is provided; for the subcode of length 16 and information bits of 5, it is further divided into subcodes of length 8, information bits of 1 and 4, wherein the subcode of information bits of 1 is V code, and an interleaver is provided. And so on, and they are not described in detail here. It can be understood that in FIG8 , each intermediate polarization layer has an interleaver, but it should not constitute any limitation to the embodiments of the present application. In practical applications, an interleaver may be provided only in the first three intermediate polarization layers, such as the first layer to the third layer. FIG9 is a schematic diagram of the effect comparison of the technical solution provided in the embodiment of the present application. FIG9 exemplarily shows the performance comparison of polar codes under different code rates under the existing method and the method provided in the embodiment of the present application. The horizontal axis is the signal to noise ratio (SNR), the unit is decibel (dB), and the vertical axis is the bit error rate. The lower the bit error rate, the better the error correction performance. The curve corresponding to the square represents the performance curve of the method provided by the present application, and the curve corresponding to the circle and the curve corresponding to the triangle are the performance curves of the existing methods. Among them, the method represented by the curve corresponding to the circle is the error correction code curve with the best performance among the currently known methods. As shown in a) in FIG. 9 , the number of information bits is 250, the mother code length is 1000, and the performance of the method provided in the present application can approach the performance of the best method currently available (the curve corresponding to the circle symbol). As shown in b) of FIG. 9 , the number of information bits is 334, the mother code length is 1000, and the performance of the method provided in the present application can approach the performance of the best method currently available (the curve corresponding to the circle symbol). Similarly, as shown in c) in Figure 9, the number of information bits is 500 and the mother code length is 1000, as shown in d) in Figure 9, the number of information bits is 667 and the mother code length is 1000, and as shown in e) in Figure 9, the number of information bits is 750 and the mother code length is 1000. The performance of the method provided in this application can be close to the performance of the best method currently available (the curve corresponding to the circle symbol). In the above technical solution, the encoding device interleaves the preset second matrix through one or more interleavers with a fixed structure to obtain a first matrix, and then encodes the coded sequence based on the first matrix. Correspondingly, the decoding device can also perform deinterleaving based on the interleaver with a fixed structure. In other words, while improving the error correction code spectrum, the structure of the interleaver will not change randomly. In this way, the encoding device and the decoding device solidify the number of interleavers and the structure of each interleaver, and the encoding device does not need to inform the decoding device of the structure of the interleaver in the encoding process when transmitting data. Compared with the random interleaver, this solution is conducive to reducing signaling overhead. In addition, the structure of the interleaver provided in the above solution is to a certain extent Moreover, after the structure of the interleaver is fixed, the structure of the interleaver does not need to be randomly changed, and the interleaver is relatively simple to implement. The data processing device provided in the embodiment of the present application will be described in detail below with reference to FIGS. 10 and 13 . FIG10 is a schematic block diagram of a data processing device 1000 provided in an embodiment of the present application. As shown in FIG10 , the device 1000 may include a transceiver unit 1010 and a processing unit 1020 . In a possible design, the device 1000 may correspond to the encoding device in the above method embodiment, and each unit in the device 1000 may be used to implement the corresponding process executed by the encoding device in the method 400 shown in FIG4. For example, the processing unit 1020 may be used to execute steps 410 and 420 in the method 400. Specifically, the processing unit 1020 may be used to obtain a sequence to be encoded; polarization encoding is performed on the sequence to be encoded according to a first matrix to obtain a coding sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, and each interleaver includes one or more layers of cyclic shift registers, wherein each layer of cyclic shift registers includes one or more cyclic shift registers, and at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift columns or rows in a submatrix, and the submatrix cyclically shifted by each cyclic shift register in a subsequent layer of cyclic shift registers comes from the submatrix obtained after the cyclic shift register in the previous layer of cyclic shift registers is cyclically shifted, and the submatrix is obtained based on part of the columns or part of the rows in the second matrix. The transceiver unit 1010 may be used to execute step 430 in the method 400. Specifically, the transceiver unit 1010 may be used to send the coding sequence. Optionally, the number of cyclic shift bits and / or the number of layers of cyclic shift registers included in an interleaver are predefined. Optionally, the number of layers of cyclic shift registers included in an interleaver is related to the length of the interleaver. Optionally, if the length of the interleaver is less than 8, the number of layers of the cyclic shift register included in the interleaver is 1 or 2; if the length of the interleaver is greater than or equal to 8, the number of layers of the cyclic shift register included in the interleaver is 3. Optionally, the length of an interleaver is equal to the number of columns of the sub-matrices on which the interleaving operation is performed by the interleaver. Optionally, if the length of the interleaver is 2 n-1 The number of layers of the cyclic shift registers included in the interleaver is 3, and the length of the cyclic shift registers included in the first layer of cyclic shift registers is 2 n-3 The length of the second layer of circular shift registers is 2 n-2 The length of the circular shift register included in the third layer of circular shift registers is 2 n-1 , n is an integer greater than or equal to 4. Optionally, the length of an interleaver is smaller than the number of columns of a submatrix on which an interleaving operation is performed by the interleaver, wherein the difference between the number of columns of the submatrix on which an interleaving operation is performed by the interleaver and the length of the interleaver is the number of corresponding punctured bits or shortened bits in the submatrix. Optionally, the number of bits of the cyclic shift is an odd number. Optionally, the cyclic shift is a cyclic left shift or a cyclic right shift. Optionally, the length of the one or more interleavers, or the intermediate polarization layer where the one or more interleavers are located is determined according to the length of the sequence to be encoded, and the intermediate polarization layer is other layers in the polarization layer except the polarization channel layer and the physical channel layer. Optionally, the one or more interleavers are located in the first three middle polarization layers. Optionally, in a case where at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift columns in a submatrix, the processing unit 1020 is further used to: determine the information bits in the sequence to be encoded, where the number of information bits is K, and the K information bits are the bits in the sequence to be encoded except for the punctured bits, shortened bits, and / or pre-frozen bits, and the bits that are ranked first when the polarization channel reliability is arranged from high to low. K bits, the pre-frozen bits are determined based on the polarization channel reliability and the row weight of the first matrix, 1<K≤N, K is an integer, and N is the length of the sequence to be encoded. Optionally, the pre-freeze bit is a row weight of 2 m ·bits corresponding to rows of w, wherein w is determined based on the row weights and polarization channel reliabilities of other rows in the first matrix except the rows corresponding to the punctured bits and the shortened bits, and m is a natural number. Optionally, the second matrix is generated based on a polarization kernel. In another possible design, the device 1000 may correspond to the decoding device in the above method embodiment. Each unit of the device 1000 may be used to implement the corresponding process executed by the decoding device in the method 400 shown in FIG4. For example, the transceiver unit 1010 may be used to execute step 430 in the method 400, and the processing unit 1020 may be used to execute step 440 in the method 400. Specifically, the transceiver unit 1010 may be used to receive a coding sequence, and the processing unit 1020 may be used to decode the coding sequence according to a first matrix to obtain a decoded sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, and each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, and at least one circular shift register in each layer of circular shift registers is used to circularly shift columns or rows in a submatrix, and the submatrix for circular shifting each circular shift register in a subsequent layer of circular shift registers comes from the submatrix obtained after the circular shift register in the previous layer is circularly shifted, and the submatrix is obtained based on part of the columns or part of the rows in the second matrix. It should be understood that the specific process of each unit executing the above corresponding steps has been described in detail in the above method embodiment, and for the sake of brevity, it will not be repeated here. It should also be understood that the division of units in the embodiments of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation. In addition, each functional unit in each embodiment of the present application may be integrated into a processor, or may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional modules. FIG. 11 is another schematic block diagram of a data processing device 1100 provided in an embodiment of the present application. As shown in FIG. 11 , the device 1100 may include at least one processor 1110 for implementing the steps performed by the encoding device or the steps performed by the decoding device in the embodiment shown in FIG. 4 . The device 1100 may also include at least one memory 1120 for storing program instructions and / or data. The memory 1120 is coupled to the processor 1110. The coupling in the embodiment of the present application is an indirect coupling or communication connection between devices, units or modules, which may be electrical, mechanical or other forms, and is used for information exchange between devices, units or modules. The processor 1110 may operate in conjunction with the memory 1120. The processor 1110 may execute program instructions stored in the memory 1120. At least one of the at least one memory may be included in the processor. The device 1100 may also include a communication interface 1130, which is used to communicate with other devices through a transmission medium, so that the device 1100 can communicate with other devices. The communication interface 1130 may be, for example, a transceiver, an interface, a bus, a circuit, or a device capable of implementing a transceiver function. The processor 1110 may use the communication interface 1130 to send and receive data and / or information, and is used to implement the method performed by the encoding device or the decoding device in the embodiment shown in FIG. 4. For example, when the device 1100 is used to implement the method performed by the encoding device in the embodiment shown in FIG. 4, the processor 1110 may be used to obtain a sequence to be encoded; polarization encode the sequence to be encoded according to a first matrix to obtain a coding sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, Each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, at least one circular shift register in each layer of circular shift registers is used to circularly shift columns or rows in a sub-matrix, and the sub-matrix circularly shifted by each circular shift register in a subsequent layer of circular shift registers comes from the sub-matrix obtained after the circular shift register in the previous layer is circularly shifted, and the sub-matrix is obtained based on some columns or some rows in the second matrix; and the coding sequence is sent. For another example, when the device 1100 is used to implement the method executed by the decoding device in the embodiment shown in Figure 4, the processor 1110 can be used to receive a coding sequence; according to the first matrix, the coding sequence is decoded to obtain a decoded sequence, the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, at least one circular shift register in each layer of circular shift registers is used to circularly shift columns or rows in a sub-matrix, and the sub-matrix circularly shifted by each circular shift register in a subsequent layer of circular shift registers comes from the sub-matrix obtained after the circular shift register in the previous layer is circularly shifted, and the sub-matrix is obtained based on part of the columns or part of the rows in the second matrix. The specific connection medium between the processor 1110, the memory 1120 and the communication interface 1130 is not limited in the embodiment of the present application. In FIG. 11 , the processor 1110, the memory 1120 and the communication interface 1130 are connected via a bus 1140. The bus 1140 is represented by a bold line in FIG. 11 , and the connection mode between other components is only for schematic illustration and is not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one bold line is used in FIG. 11 , but it does not mean that there is only one bus or one type of bus. FIG. 12 is a schematic diagram of a possible structure of a terminal 1200 provided in an embodiment of the present application. The terminal can be applied to the system shown in FIG1. As shown in FIG12, the terminal 1200 includes a processor 1201 and a transceiver 1202. Optionally, the terminal 1200 also includes a memory 1203. The processor 1201, the transceiver 1202 and the memory 1203 can communicate with each other through an internal connection path to transmit control and / or data signals. The memory 1203 is used to store a computer program, and the processor 1201 is used to call and run the computer program from the memory 1203 to control the transceiver 1202 to send and receive signals. Optionally, the terminal 1200 may also include an antenna 1204, which is used to send the uplink data or uplink control signaling output by the transceiver 1202 through a wireless signal. The processor 1201 and the memory 1203 may be combined into a processing device, and the processor 1201 is used to execute the program code stored in the memory 1203 to implement the above functions. In specific implementation, the memory 1203 may also be integrated into the processor 1201, or independent of the processor 1201. The processor 1201 may correspond to the processor 1110 in FIG. 11 or the processing unit 1020 in FIG. 10. The transceiver 1202 may correspond to the communication interface 1130 in FIG. 11 or the transceiver unit 1010 in FIG. 10. The transceiver 1202 may include a receiver (or receiver, receiving circuit) and a transmitter (or transmitter, transmitting circuit). The receiver is used to receive signals, and the transmitter is used to transmit signals. Optionally, the terminal 1200 may further include a power supply 1205 for providing power to various devices or circuits in the terminal 1200 . In addition, in order to make the functions of the terminal device more complete, the terminal 1200 may also include one or more of an input unit 1206, a display unit 1207, an audio circuit 1208, a camera 1209 and a sensor 1210, and the audio circuit may also include a speaker 1208a, a microphone 1208b, etc. FIG. 13 is a schematic diagram of the structure of a wireless access network device provided in an embodiment of the present application, for example, a base station structure Schematic diagram of the structure. The base station 1300 can be applied to the system shown in Figure 1 to perform the functions of the wireless access network device in the above method embodiment. As shown in the figure, the base station 1300 may include one or more of the following: one or more (DU+RU) 1310, one or more CU 1320. CU 1320 can communicate with the next generation core network (NG core). The DU may include at least one antenna 1311, at least one radio unit 1312, at least one processor 1313 and at least one memory 1314. The DU part is mainly used for receiving and transmitting radio frequency signals, converting radio frequency signals to baseband signals, and partial baseband processing. CU 1320 may include at least one processor 1322 and at least one memory 1321. CU 1320 and DU can communicate through an interface. Among them, the control plane (CP) interface may be Fs-C, such as F1-C, and the user plane (UP) interface may be Fs-U, such as F1-U. DU and RU can cooperate to jointly implement the functions of the physical (PHY) layer. A DU can be connected to one or more RUs. The functions of the DU and RU can be configured in a variety of ways according to the design. For example, the DU is configured to implement the baseband function, and the RU is configured to implement the mid-RF function. For another example, the DU is configured to implement the high-level functions in the PHY layer, and the RU is configured to implement the low-level functions and RF functions in the PHY layer. The high-level functions in the PHY layer may include a part of the functions of the PHY layer, which is closer to the medium access control (MAC) layer, and the low-level functions in the PHY layer may include another part of the functions of the PHY layer, which is closer to the mid-RF side. The CU 1320 is mainly used for baseband processing, controlling the base station, etc. The DU and CU 1320 may be physically arranged together or physically separated, i.e., a distributed base station. The CU 1320 is the control center of the base station, which may correspond to the processing unit in FIG. 10 or the processor in FIG. 11, and may also be referred to as a processing module, which is mainly used to complete the baseband processing function. Specifically, the baseband processing on the CU and DU can be divided according to the protocol layer of the wireless network, for example, the functions of the packet data convergence protocol (PDCP) layer and above are set in the CU, and the functions of the protocol layers below the PDCP, such as the radio link control (RLC) layer and the MAC layer, are set in the DU. For another example, the CU implements the functions of the RRC layer and the PDCP layer, and the DU implements the functions of the RLC layer, the MAC layer, and the PHY layer. In addition, optionally, the base station 1300 may include one or more radio frequency units (RUs), one or more DUs, and one or more CUs. The DU may include at least one processor 1313 and at least one memory 1314, the RU may include at least one antenna 1311 and at least one radio frequency unit 1312, and the CU may include at least one processor 1322 and at least one memory 1321. In one example, the CU 1320 may be composed of one or more boards, and the multiple boards may jointly support a wireless access network of a single access standard (such as a 5G network), or may respectively support wireless access networks of different access standards (such as an LTE network, a 5G network, or other networks). The memory 1321 and the processor 1322 may serve one or more boards. In other words, a memory and a processor may be separately set on each board. It may also be that multiple boards share the same memory and processor. In addition, necessary circuits may be set on each board. The DU may be composed of one or more boards, and the multiple boards may jointly support a wireless access network of a single access standard (such as a 5G network), or may respectively support wireless access networks of different access standards (such as an LTE network, a 5G network, or other networks). The memory 1314 and the processor 1313 may serve one or more boards. In other words, a memory and a processor may be separately set on each board. It may also be that multiple boards share the same memory and processor. In addition, necessary circuits may also be set on each board. It should be understood that the base station 1300 shown in FIG. 13 is only a possible architecture of a wireless access network device, and does not This application shall not constitute any limitation. The method provided in this application may be applicable to network devices of other architectures. For example, wireless access network devices including CU, DU and AAU, etc. This application does not limit the specific architecture of the wireless access network device. It should be understood that FIG13 is only an example and not a limitation, and the wireless access network device may not rely on the structure shown in FIG13. For example, the wireless access network device may also include an AAU, and may also include a CU and / or a DU, or the wireless access network device may also include a BBU, and may also include an adaptive radio unit (ARU). This application is not limited to this. The present application also provides a chip system, which includes at least one processor for implementing the functions involved in the method described in the embodiment shown in FIG. 4 above, for example, receiving or processing the data and / or information involved in the above method. In one possible design, the chip system also includes a memory, which is used to store program instructions and data, and the memory is located inside or outside the processor. The chip system may be composed of the chip, or may include the chip and other discrete devices. The present application also provides a computer-readable storage medium, on which a computer program (also referred to as code or instruction) is stored. When the computer program is executed by a processor, the method described in the embodiment shown in FIG. 4 is executed. The present application also provides a computer program product, which includes: a computer program (also referred to as code, or instruction), and when the computer program is run, the method described in the embodiment of FIG. 4 is executed. It should be understood that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by the hardware integrated logic circuit or software instructions in the processor. The above processor can be a general processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor are combined to perform. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware. It should also be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (DRAM), and the like. The present invention relates to a memory device comprising a plurality of memory devices, such as a DRAM, a SDRAM, a double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), an enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), a synchronous link dynamic random access memory (synchlink DRAM, SLDRAM) and a direct rambus RAM (direct rambus RAM, DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory. The terms "unit", "module", etc. used in this specification may be used to represent computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. The units and modules in the embodiments of the present application have the same meaning and can be used interchangeably. It will be appreciated by those skilled in the art that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or in combination with computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application. In the several embodiments provided in this application, it should be understood that the disclosed devices, equipment and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic, for example, the division of units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point, the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms. In the above embodiments, the functions of each functional unit can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions (programs). When loading and executing computer program instructions (programs) on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that contains one or more available media integrated. Available media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, digital video discs (DVD)), or semiconductor media (eg, solid state drives (SSD)). If the functions provided by the embodiments of the present application are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
Claims
1. A data processing method, It is characterized in that include: Get the sequence to be encoded; According to the first matrix, polarization coding is performed on the sequence to be encoded to obtain a coding sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, each interleaver includes one or more layers of cyclic shift registers, wherein each layer of cyclic shift registers includes one or more cyclic shift registers, at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift columns or rows in a submatrix, and a submatrix cyclically shifted by each cyclic shift register in a subsequent layer of cyclic shift registers comes from a submatrix obtained after a cyclic shift register in a previous layer of cyclic shift registers is cyclically shifted, and the submatrix is obtained based on some columns or some rows in the second matrix; The coded sequence is transmitted.
2. The method according to claim 1, It is characterized in that The number of cyclic shift bits and / or the number of layers of cyclic shift registers included in an interleaver are predefined.
3. The method according to claim 1 or 2, It is characterized in that The number of layers of cyclic shift registers included in an interleaver is related to the length of the interleaver.
4. The method according to claim 3, It is characterized in that If the length of the interleaver is less than 8, the number of layers of the cyclic shift register included in the interleaver is 1 or 2; if the length of the interleaver is greater than or equal to 8, the number of layers of the cyclic shift register included in the interleaver is 3.
5. The method according to any one of claims 1 to 4, It is characterized in that The length of an interleaver is equal to the number of columns of the sub-matrices that are interleaved by the interleaver.
6. The method according to claim 5, It is characterized in that If the length of the interleaver is 2 n-1 The number of layers of the cyclic shift registers included in the interleaver is 3, and the length of the cyclic shift registers included in the first layer of cyclic shift registers is 2 n-3 The length of the second layer of circular shift registers is 2 n-2 The length of the circular shift register included in the third layer of circular shift registers is 2 n-1 , n is an integer greater than or equal to 4.
7. The method according to any one of claims 1 to 4, It is characterized in that The length of an interleaver is less than the number of columns of a submatrix interleaved by the interleaver, wherein the difference between the number of columns of the submatrix interleaved by the interleaver and the length of the interleaver is the number of corresponding punctured bits or shortened bits in the submatrix.
8. The method according to any one of claims 1 to 7, It is characterized in that The number of bits of the cyclic shift is an odd number.
9. The method according to any one of claims 1 to 8, It is characterized in that The cyclic shift is a cyclic left shift or a cyclic right shift.
10. The method according to any one of claims 1 to 9, It is characterized in that The length of the one or more interleavers, or the intermediate polarization layer where the one or more interleavers are located is determined according to the length of the sequence to be encoded, and the intermediate polarization layer is other layers in the polarization layer except the polarization channel layer and the physical channel layer.
11. The method according to claim 10, It is characterized in that The one or more interleavers are located in the first three middle polarization layers.
12. The method according to any one of claims 1 to 11, It is characterized in that In the case where at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift the columns in the submatrix, before obtaining the sequence to be encoded, the method further includes: Determine information bits in the sequence to be encoded, where the number of the information bits is K, and the K information bits are K bits that are ranked first when the polarization channel reliability is arranged from high to low among the bits in the sequence to be encoded except the punctured bits, the shortened bits, and / or the pre-frozen bits, and the pre-frozen bits are determined based on the polarization channel reliability and the row weight of the first matrix, 1<K≤N, K is an integer, and N is the length of the sequence to be encoded.
13. The method according to claim 12, It is characterized in that The pre-freeze bit is a row weight of 2 m ·bits corresponding to rows of w, wherein w is determined based on the row weights and polarization channel reliabilities of other rows in the first matrix except the rows corresponding to the punctured bits and the shortened bits, and m is a natural number.
14. The method according to any one of claims 1 to 13, It is characterized in that The second matrix is generated based on the polarization kernel.
15. A data processing method, It is characterized in that include: receiving a coding sequence; According to the first matrix, the coded sequence is decoded to obtain a decoded sequence, wherein the first matrix is obtained by interleaving a preset second matrix based on one or more interleavers, each interleaver includes one or more layers of circular shift registers, wherein each layer of circular shift registers includes one or more circular shift registers, at least one circular shift register in each layer of circular shift registers is used to circularly shift columns or rows in a sub-matrix, and the sub-matrix circularly shifted by each circular shift register in a subsequent layer of circular shift registers comes from the sub-matrix obtained after the circular shift register in the previous layer is circularly shifted, and the sub-matrix is obtained based on some columns or some rows in the second matrix.
16. The method of claim 15, It is characterized in that The number of cyclic shift bits and / or the number of layers of cyclic shift registers included in an interleaver are predefined.
17. The method according to claim 15 or 16, It is characterized in that The number of layers of cyclic shift registers included in an interleaver is related to the length of the interleaver.
18. The method of claim 17, It is characterized in that If the length of the interleaver is less than 8, the number of layers of the cyclic shift register included in the interleaver is 1 or 2; if the length of the interleaver is greater than or equal to 8, the number of layers of the cyclic shift register included in the interleaver is 3.
19. The method according to any one of claims 15 to 18, It is characterized in that The length of an interleaver is equal to the number of columns of the sub-matrices that are interleaved by the interleaver.
20. The method of claim 19, It is characterized in that If the length of the interleaver is 2 n-1 The number of layers of the cyclic shift registers included in the interleaver is 3, and the length of the cyclic shift registers included in the first layer of cyclic shift registers is 2 n-3 The length of the second layer of circular shift registers is 2 n-2 The length of the circular shift register included in the third layer of circular shift registers is 2 n-1 , n is an integer greater than or equal to 4.
21. The method according to any one of claims 15 to 18, It is characterized in that The length of an interleaver is less than the number of columns of a submatrix interleaved by the interleaver, wherein the difference between the number of columns of the submatrix interleaved by the interleaver and the length of the interleaver is the number of corresponding punctured bits or shortened bits in the submatrix.
22. The method according to any one of claims 15 to 21, It is characterized in that The number of bits of the cyclic shift is an odd number.
23. The method according to any one of claims 15 to 22, It is characterized in that The cyclic shift is a cyclic left shift or a cyclic right shift.
24. The method according to any one of claims 15 to 23, It is characterized in that The length of the one or more interleavers, or the intermediate polarization layer where the one or more interleavers are located is determined according to the length of the coding sequence, and the intermediate polarization layer is other layers in the polarization layer except the polarization channel layer and the physical channel layer.
25. The method of claim 24, It is characterized in that The one or more interleavers are located in the first three middle polarization layers.
26. The method according to any one of claims 15 to 25, It is characterized in that In the case where at least one cyclic shift register in each layer of cyclic shift registers is used to cyclically shift the columns in the sub-matrix, after decoding the coded sequence according to the first matrix, the method further includes: determining information bits in the decoded sequence, where the number of the information bits is K, the K information bits being K bits that are ranked first among bits in the decoded sequence excluding puncturing bits, shortening bits, and / or pre-frozen bits when polarization channel reliability is arranged from high to low, the pre-frozen bits being determined based on the polarization channel reliability and a row weight of the first matrix, 1<K≤N, K is an integer, and N is a length of the decoded sequence.
27. The method of claim 26, It is characterized in that The pre-freeze bit is a row weight of 2 m ·bits corresponding to rows of w, wherein w is determined based on the row weights and polarization channel reliabilities of other rows in the first matrix except the rows corresponding to the punctured bits and the shortened bits, and m is a natural number.
28. The method according to any one of claims 15 to 27, It is characterized in that The second matrix is generated based on the polarization kernel.
29. A data processing device, It is characterized in that The method comprises a unit for implementing the method according to any one of claims 1 to 14, or comprises a unit for implementing the method according to any one of claims 15 to 28.
30. A data processing device, It is characterized in that comprising a processor and a memory, wherein: The memory is used to store computer programs; The processor is configured to call the computer program so that the method according to any one of claims 1 to 14 is executed, or the method according to any one of claims 15 to 28 is executed.
31. A computer-readable storage medium, It is characterized in that The storage medium stores a computer program or instructions. When the computer program or instructions are executed by a computer, the method according to any one of claims 1 to 14 is implemented, or the method according to any one of claims 15 to 28 is implemented.
32. A computer program product, It is characterized in that The computer program product comprises instructions, and when the instructions are executed by a computer, the method according to any one of claims 1 to 14 is implemented, or the method according to any one of claims 15 to 28 is implemented.
Citation Information
Patent Citations
Coding / decoding method of random row / column cyclic shift interleaver
CN102355271A
Data processing method and device
CN106877882A
Encoding method and device
CN108923889A
Interleaving method and interleaving device
CN110098891A
Sequence cyclic shift device and method and storage medium
CN111262592A
Cited By
Encoding method, decoding method, communication apparatus and communication system
WO2026158120A1
Communication method and communication apparatus
WO2026166425A1
