Encoding method, decoding method, and apparatus, storage medium and program product

Abstract

Provided in the embodiments of the present disclosure are an encoding method, a decoding method, and an apparatus, a storage medium and a program product. The encoding method comprises: acquiring a sequence to be encoded corresponding to input encoded bits; on the basis of a preset polar permutation relationship, performing subcode rate adjustment on the sequence to be encoded, wherein the preset polar permutation relationship is used for indicating a correspondence between frozen-bit subcode indices and the number of information bits, and the frozen-bit subcode indices are indices of frozen-bit subcodes comprised in a polar sequence of a preset maximum code length; on the basis of the adjusted sequence to be encoded and the input encoded bits, constructing an information sequence; performing polar code encoding on the information sequence, so as to obtain an encoded sequence; and sending the encoded sequence.

Description

Coding and decoding method and device, storage medium, and program product

[0001] The present disclosure claims priority to Chinese Patent Application No. 202411156853.4, filed on August 21, 2024, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0002] The present disclosure relates to the technical field of communication, and in particular to a coding and decoding method and device, a storage medium, and a program product. BACKGROUND

[0003] With the rapid development of technologies such as big data, cloud computing, and latency-sensitive networks, user equipment in wireless communication networks is experiencing explosive growth. Wireless communication networks will carry diverse applications and massive amounts of data, which puts high demands on data transmission rates, throughput, reliability, latency, and the like. Channel coding, as the most basic wireless access technology, is one of the important research objects for meeting communication needs. Communication systems usually use polar codes to encode channels to improve the reliability of data transmission and ensure communication quality.

[0004] Polar codes are a channel coding technology that can theoretically prove to achieve the Shannon limit and has a practical linear complexity coding and decoding capability. Polar codes are an error correction code with asymptotic capacity, and the main decoding algorithms are the successive cancellation (SC) algorithm and the belief propagation (BP) algorithm. SUMMARY

[0005] In a first aspect, the present disclosure provides a coding method applied to an encoding end, the coding method comprising:

[0006] obtaining a to-be-encoded sequence corresponding to input coding bits;

[0007] performing rate adjustment on the to-be-encoded sequence according to a preset polar permutation relationship, wherein the preset polar permutation relationship is used to indicate a corresponding relationship between a frozen bit subcode index and an information bit quantity, and the frozen bit subcode index is an index of a frozen bit subcode included in a polar sequence with a preset maximum code length;

[0008] constructing an information sequence according to the adjusted to-be-encoded sequence and the input coding bits;

[0009] performing polar code encoding on the information sequence to obtain a coding sequence;

[0010] sending the coding sequence.

[0011] In a second aspect, the present disclosure also provides a decoding method applied to a decoding end, the encoding method comprising:

[0012] receiving an encoded sequence, wherein the encoded sequence is obtained by polar code encoding based on an information sequence, the information sequence is constructed based on an adjusted to-be-encoded sequence and input encoding bits; the to-be-encoded sequence comprises sub-codes that can be quickly decoded, and the sub-codes in the to-be-encoded sequence are adjusted in rate based on a preset polar permutation relationship; the preset polar permutation relationship is used to indicate a corresponding relationship between a frozen bit sub-code index and an information bit quantity, and the frozen bit sub-code index is an index of a frozen bit sub-code included in a polar sequence with a preset maximum code length;

[0013] performing decoding processing on the encoded sequence to obtain the input encoding bits.

[0014] In a third aspect, the present disclosure also provides a communication device. The communication device comprises an obtaining module, a processing module, an encoding module and a sending module, wherein

[0015] the obtaining module is configured to obtain a to-be-encoded sequence corresponding to input encoding bits;

[0016] the processing module is configured to adjust the sub-codes in the to-be-encoded sequence in rate according to a preset polar permutation relationship; wherein the preset polar permutation relationship is used to indicate a corresponding relationship between a frozen bit sub-code index and an information bit quantity, and the frozen bit sub-code index is an index of a frozen bit sub-code included in a polar sequence with a preset maximum code length;

[0017] the processing module is further configured to construct an information sequence based on the adjusted to-be-encoded sequence and the input encoding bits;

[0018] the encoding module is configured to perform polar code encoding on the information sequence to obtain an encoded sequence;

[0019] the sending module is configured to send the encoded sequence.

[0020] In a fourth aspect, the present disclosure also provides a communication device. The communication device comprises a receiving module and a decoding module, wherein

[0021] the receiving module is configured to receive an encoded sequence, wherein the encoded sequence is obtained by polar code encoding based on an information sequence, the information sequence is constructed based on an adjusted to-be-encoded sequence and input encoding bits; the to-be-encoded sequence comprises sub-codes that can be quickly decoded, and the sub-codes in the to-be-encoded sequence are adjusted in rate based on a preset polar permutation relationship; the preset polar permutation relationship is used to indicate a corresponding relationship between a frozen bit sub-code index and an information bit quantity, and the frozen bit sub-code index is an index of a frozen bit sub-code included in a polar sequence with a preset maximum code length;

[0022] The decoding module is configured to decode the encoded sequence to obtain input encoded bits.

[0023] In a fifth aspect, a communication apparatus is provided. The communication apparatus includes a processor and a memory. The memory stores instructions executable by the processor. The processor is configured to execute the instructions to cause the communication apparatus to implement the method provided in the first aspect or the second aspect.

[0024] In a sixth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores computer instructions. When the computer instructions are executed on a computer, the computer is caused to perform the method provided in the first aspect or the second aspect.

[0025] In a seventh aspect, a computer program product including computer instructions is provided. When the computer instructions are executed on a computer, the computer is caused to perform the method provided in the first aspect or the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0026] The accompanying drawings are included to provide a further understanding of the technical solutions of the present disclosure, constitute a part of the specification, and are used to explain the technical solutions of the present disclosure together with the embodiments of the present disclosure, and do not constitute a limitation to the technical solutions of the present disclosure.

[0027] FIG. 1 is a schematic diagram of an architecture of a communication system according to an embodiment of the present disclosure.

[0028] FIG. 2 is a schematic diagram of a flow of an encoding method according to an embodiment of the present disclosure.

[0029] FIG. 3 is a schematic diagram of a flow of a decoding method according to an embodiment of the present disclosure.

[0030] FIG. 4 is a schematic diagram of encoding and decoding performance according to an embodiment of the present disclosure.

[0031] FIG. 5 is another schematic diagram of encoding and decoding performance according to an embodiment of the present disclosure.

[0032] FIG. 6 is a schematic diagram of a composition of a communication apparatus according to an embodiment of the present disclosure.

[0033] FIG. 7 is a schematic diagram of another composition of a communication apparatus according to an embodiment of the present disclosure.

[0034] FIG. 8 is a schematic diagram of a structure of a communication apparatus according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0035] In order for the person skilled in the art to better understand the technical solutions of the embodiments of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described in the following with reference to the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, not all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by the person skilled in the art without creative labor fall within the protection scope of the present disclosure.

[0036] Unless otherwise required by context, the term “comprise” and its other forms such as “comprises” and “comprising” are to be construed as “open”, “inclusive” meaning, i.e. “including, but not limited to”. In the description of the specification, the terms “one embodiment”, “some embodiments”, “exemplary embodiments”, “example”, “specific example” or “some examples” and the like are intended to mean that a particular feature, structure, material or characteristic related to that embodiment or example is included in at least one embodiment or example of the present disclosure. The illustrative representation of the above terms does not necessarily mean the same embodiment or example. In addition, the specific features, structures, materials or characteristics described can be included in any one or more embodiments or examples in any appropriate manner.

[0037] The terms “first”, “second”, and the like are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features limited with “first”, “second”, etc. can explicitly or implicitly include one or more of the features. In the description of the present disclosure, unless otherwise stated, the meaning of “a plurality of” is two or more.

[0038] In the embodiments of the present disclosure, the words “exemplary”, “for example” or the like are used to mean serving as an example, instance or illustration. Any embodiment or design solution described as “exemplary”, “for example” or the like in the embodiments of the present disclosure should not be interpreted as being more preferred or having more advantages than other embodiments or design solutions in the present disclosure. Rather, the use of “exemplary”, “for example” or the like is intended to present the relevant concept in a specific manner.

[0039] In addition, the use of “based on” means openness and inclusiveness, because the process, step, calculation or other action “based on” one or more stated conditions or values can be based on additional conditions or beyond the stated values in practice.

[0040] At present, in order to reduce the complexity of the polar code encoding and decoding algorithm, a fast polar code construction method is proposed, including: (1) segmenting the (N, K) polar code constructed by using the traditional polar code construction method such as Gaussian approximation according to equal length; (2) all the frozen bit positions are initialized to active state, and the active bit position can be converted to information bit position; (3) judging whether each segment can be fast decoded, if not, converting the information position with the lowest reliability in the current segment to a frozen bit position, and converting the frozen bit position in the active state in a subsequent segment to an information bit position; (4) the segment where the frozen bit position converted to the information bit position should still be fast decoded after conversion, if not, the position is changed to inactive state, and the position is reselected. The method can use the rate adjustment algorithm to adjust the code rate of the polar code subcode, and eliminate the subcode that cannot be fast decoded in the polar code. However, the rate adjustment algorithm needs to be run once for each code length and code rate configuration, which leads to high complexity.

[0041] Therefore, the present disclosure provides a coding method, the encoding end can obtain a to-be-encoded sequence corresponding to input encoding bits; the subcode in the to-be-encoded sequence is adjusted in rate according to a preset polar permutation relationship, so that the to-be-encoded sequence after adjustment includes subcodes that can be fast decoded; the preset polar permutation relationship is used to indicate the correspondence between the frozen bit subcode index and the information bit quantity, and the frozen bit subcode index is the index of the frozen bit subcode included in the polar sequence with a preset maximum code length; an information sequence is constructed according to the to-be-encoded sequence after adjustment and the input encoding bits; the information sequence is polar code encoded to obtain an encoding sequence; and the encoding sequence is sent.

[0042] In this way, the subcode in the to-be-encoded sequence can be adjusted in rate according to the preset polar permutation relationship, so that the to-be-encoded sequence after adjustment includes subcodes that can be fast decoded. Moreover, the to-be-encoded sequence corresponding to the target code length used in the current polar code encoding can also be adjusted in rate of subcode by using the preset polar permutation relationship (corresponding to the preset maximum code length). That is, the polar code encoding process of different code lengths can all use the preset polar permutation relationship corresponding to the preset maximum code length to adjust the rate of subcode, so that for different code lengths, multiple polar permutation tables do not need to be stored, the storage space can be saved, and by adjusting the rate, each subcode in the to-be-encoded sequence after adjustment can be fast decoded, which can further reduce the complexity of the polar code encoding and decoding algorithm.

[0043] Embodiments of the present disclosure provide technical solutions that can be applied to various mobile communication networks, for example, long term evolution (LTE) systems, various versions based on LTE evolution, 5th-generation mobile communication technology (5G) systems (including but not limited to new radio (NR) mobile communication system environments, ambient internet of things (Ambient IoT), and the like), and the like. In addition, the encoding and decoding methods provided by the embodiments of the present disclosure can also be applied to future-oriented communication systems (for example, 6G communication systems, and the like) or networks of various communication fusion systems, and the like, which are not limited by the embodiments of the present disclosure.

[0044] FIG. 1 shows an architecture diagram of a communication system according to an embodiment of the present disclosure. As shown in FIG. 1, the communication system includes one or more first nodes 10 and one or more second nodes 20.

[0045] In some embodiments, the first node 10 can be a base station, configured to provide wireless access services for a plurality of terminals. In some embodiments, a base station provides a service coverage area (also referred to as a cell). A terminal entering the area can communicate with the base station through a wireless signal to accept the wireless access services provided by the base station.

[0046] In some embodiments, the base station can be a base station in long term evolution (LTE), long term evolution advanced (LTEA), or an evolutional node B (eNB or eNodeB), a base station device in a 5G network, or a base station in a future communication system, and the like. The base station can include various macro base stations, micro base stations, home base stations, wireless remote devices, reconfigurable intelligent surfaces (RIS), routers, wireless fidelity (WIFI) devices, and various network side devices.

[0047] In some embodiments, the second node 20 can be a terminal, which can be a device with wireless transceiver function, and can be deployed on land, including indoor or outdoor, handheld, wearable or vehicle-mounted; can also be deployed on the water surface (such as ships, etc.); can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The terminal can be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. The embodiments of the present disclosure are not limited to the application scenarios. The terminal can also be referred to as a user, a user equipment (UE), an access terminal, a UE unit, a UE station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a UE terminal, a wireless communication device, a UE agent or a UE apparatus, etc. The embodiments of the present disclosure are not limited thereto.

[0048] The embodiments of the present disclosure can be applied to downlink data transmission, uplink data transmission and device-to-device data transmission. For downlink data transmission, the sending end is a base station, and the corresponding receiving end is a terminal. For uplink data transmission, the sending end is a terminal, and the corresponding receiving end is a base station. For device-to-device data transmission, the sending end is a terminal, and the corresponding receiving end is also a terminal. The sending end and the receiving end in the present disclosure can include encoding apparatus and / or decoding apparatus, so as to modulate and encode the information to be sent, and also to demodulate and decode the received encoded information, to realize the information transmission between the sending end device and the receiving end device. The embodiments of the present disclosure are not limited thereto.

[0049] It should be noted that FIG. 1 is only an exemplary framework diagram, and the number of devices included in FIG. 1, the name of each device is not limited, and in addition to the devices shown in FIG. 1, the communication system can also include other devices, such as core network devices.

[0050] The application scenarios of the embodiments of the present disclosure are not limited. The system architecture and business scenarios described in the embodiments of the present disclosure are used to more clearly illustrate the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. Those skilled in the art can know that, with the evolution of network architecture and the appearance of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are also applicable to similar technical problems.

[0051] Some embodiments provided by the present disclosure are introduced below in combination with the accompanying drawings of the specification.

[0052] As shown in FIG. 2, the present disclosure provides an encoding method applied to an encoding end, which includes S101-S105.

[0053] S101, obtaining a to-be-encoded sequence corresponding to input encoding bits.

[0054] The to-be-encoded sequence can be understood as an initial sequence constructed by the encoding end for encoding the input encoding bits.

[0055] In some embodiments, the encoding end can construct the to-be-encoded sequence corresponding to the input encoding bits according to a polarization sequence of a preset maximum code length and a target code length corresponding to the input encoding bits.

[0056] The polarization sequence of the preset maximum code length is a polarization channel reliability sorting sequence. The preset maximum code length is the maximum code length that can be used for polarization code encoding.

[0057] Exemplarily, the polarization sequence of the preset maximum code length can be N max is the maximum code length. The polarization sequence of the maximum code length is used to indicate the polarization subchannel reliability arrangement order of the polarization code with the length of N max , and has the characteristics of code length nesting and the same subchannel reliability arrangement order of each subcode.

[0058] For example, and in the sequence, wherein, indicates the index corresponding to the subchannel reliability.

[0059] Exemplarily, when the mother code length N=1024 and the subcode length M=16, the mother code with the length of 1024 contains 64 subcodes with the length of 16, wherein the reliability sorting of each index in the tthsubcode can be as shown in Table 1:

[0060] Table 1

[0061] wherein, W(i) indicates the reliability of the bit index i.

[0062] Further, pre-sorting can be performed based on Table 1 to obtain a polar sequence with a preset maximum code length and a corresponding reliability W As shown in Table 2:

[0063] Table 2

[0064] In some embodiments, the encoding end can perform the following S1-S3 to construct a to-be-encoded sequence.

[0065] S1, obtain elements with an index less than a target code length in a polar sequence with a preset maximum code length, and construct a target polar sequence.

[0066] The length of the target polar sequence is the same as the target code length. The target code length is the code length used for polar code encoding of the input coded bits this time. The target code length is less than or equal to the above-mentioned preset maximum code length.

[0067] Exemplarily, the target polar sequence corresponding to the target code length N is a subset of composed of elements with an index less than N in .

[0068] S2, determine a frozen bit index set and an information bit index set according to the reliability of each element in the target polar sequence.

[0069] Exemplarily, the information bit index set can be determined according to the K elements with the highest reliability in the target polar sequence , for example The remaining elements can constitute the frozen bit index set, for example , where K is the number of input coded bits.

[0070] S3, construct a to-be-encoded sequence according to the frozen bit index set and the information bit index set.

[0071] Exemplarily, the to-be-encoded sequence v = [v0v1v2…v N-1 ] with a length of the target code length can be constructed. All elements with an index belonging to the information bit index set in the to-be-encoded sequence v = [v0v1v2…v N-1 ] can be assigned a fixed value, for example 1, and the remaining elements can be assigned another fixed value, for example 0.

[0072] ​S102. Adjust the rate of the subcodes in the sequence to be encoded according to the preset polarization permutation relationship.

[0073] This allows all subcodes in the adjusted sequence to be encoded to be decoded quickly.

[0074] In some implementations, the encoder can determine polarization auxiliary parameters and, based on the polarization auxiliary parameters and a preset polarization permutation relationship, determine whether there are subcodes in the sequence to be encoded that cannot be decoded quickly. If there are subcodes in the sequence to be encoded that cannot be decoded quickly, the rate of the subcodes in the sequence to be encoded is adjusted.

[0075] The polarization auxiliary parameter is the information bit length of the auxiliary polarization code.

[0076] In some embodiments, the polarization auxiliary parameters can be determined based on the reliability of each element in the aforementioned frozen bit index set and the target code length corresponding to the input coded bits.

[0077] In one example, when the target code length is equal to the preset maximum code length, the encoder can determine the polarization auxiliary parameter as the number of bits of the input coded bits.

[0078] In another example, when the target code length is less than the preset maximum code length, the encoder can determine the first element with the highest reliability in the frozen bit index set, and then use the number of elements with higher reliability than the first element in the polarization sequence with the preset maximum code length as the polarization auxiliary parameter.

[0079] For example, the encoding end can freeze the set of bit indices. The element with the highest reliability is determined in the middle. That is, the first element. This allows for the polarization sequence with a preset maximum code length. Medium reliability greater than The number of elements is determined by the polarization auxiliary reference K*. The target polarization code (N,K) is the auxiliary polarization code (N... max The subcode of K*).

[0080] For example, when N is 512 and K is 384, the polarization auxiliary reference K* for determining the target polarization code (512, 384) can be based on Table 2 above, according to the polarization sequence with a preset maximum code length. All elements with a value less than 512 constitute the target polarization sequence. Target polarization sequence The 384 elements with the highest reliability constitute the information bit index set. The remaining 128 elements constitute the frozen bit index set.

[0081] Furthermore, the frozen bit index set can be retrieved. The most reliable polar subchannel index is 168, based on Table 2, it can be determined that The corresponding reliability Thus, the auxiliary information bit parameter K can be calculated * = (1024 - 1) - 142 = 881.

[0082] The preset polar permutation relationship is used to indicate the correspondence between the frozen bit subcode index and the information bit quantity. The frozen bit subcode index is the index of the frozen bit subcode included in the preset maximum code length polar sequence. Exemplarily, Table 3 shows a preset polar permutation table, where N max = 1024, e represents the index of the frozen bit subcode, and K t represents the information bit quantity. In some embodiments, based on each row of data in the preset polar permutation table, one rate adjustment operation can be performed.

[0083] Table 3

[0084] Thus, the encoding end can determine whether there is a subcode that cannot be quickly decoded in the to-be-encoded sequence according to the polar auxiliary parameter and the preset polar permutation relationship. And in the case that there is a subcode that cannot be quickly decoded in the to-be-encoded sequence, the subcode in the to-be-encoded sequence is rate adjusted.

[0085] In some embodiments, the encoding end can detect whether the first frozen bit subcode can be quickly decoded according to the preset polar permutation relationship, in the case that the information bit quantity corresponding to the index of the first frozen bit subcode is less than or equal to the polar auxiliary parameter; and further rate adjust the subcode in the case that the first frozen bit subcode cannot be quickly decoded.

[0086] Exemplarily, a to-be-encoded sequence v = [v0v1v2…v N-1 of length N can be divided into N / M equal-length subcodes, where M = 2 m , and m < n. The i-th subcode in the sequence v can be expressed as v i = [v (i-1)M v (i-1)M+1 v (i-1)M+2 …v iM-1 ], and the information bit quantity in the subcode can be The subcode code rate can be

[0087] According to the preset polar permutation relationship, i.e., Table 3 above, for the case that the information bit quantity in Table 3 is less than or equal to the polar auxiliary parameter, i.e., K t ≤ K*, it is detected that the first frozen bit subcode v ewhether the first frozen bit subcode can be fast-decoded. In the detection process, the case of e≥N / M does not need to be considered. In the first frozen bit subcode v e In the case that the first frozen bit subcode cannot be fast-decoded, subcode rate adjustment needs to be performed to determine the first frozen bit subcode, otherwise, subcode rate adjustment does not need to be performed to determine the first frozen bit subcode.

[0088] In an example, whether the first frozen bit subcode can be fast-decoded can be detected according to a fast-decodable code rate set. Exemplarily, in the case that the code rate of the first frozen bit subcode is not in the fast-decodable code rate set, it is determined that the first frozen bit subcode needs to be subjected to subcode rate adjustment; in the case that the code rate of the first frozen bit subcode is in the fast-decodable code rate set, it is determined that the first frozen bit subcode does not need to be subjected to subcode rate adjustment.

[0089] For example, given a fast-decodable rate set Θ, the subcode rate r i can be used to determine whether the subcode can be fast-decoded. If r i belongs to the set Θ, the subcode v i can be fast-decoded, otherwise, it cannot be fast-decoded.

[0090] Further, based on all subcode indexes that cannot be fast-decoded detected under the condition of K t ≤K*, a set E with a set size of |E| can be constructed.

[0091] When N is 512 and K is 384, it is determined that the auxiliary information bit parameter K * of the target polar code (512, 384) is 881. According to Table 3, the D=11 largest K * in Table 3 that are not more than K t can form a set wherein the parameter D is generally set to a positive integer greater than 10. The indexes e corresponding to the elements in the set can also form a set , so as to detect whether the subcode can be fast-decoded, that is, to determine whether the subcode rate is 5 / 16 or 9 / 16, and the subcode with the subcode rate of 5 / 16 or 9 / 16 cannot be fast-decoded. The subcode indexes less than m=N / M in the set ε={5, 16} form a set ε={5, 16}. Further, the subcode rate of 5 / 16 or 9 / 16 can be eliminated through rate adjustment, so that as many subcodes as possible can support fast-decoding, and the decoding efficiency and performance of the entire communication system can be improved.

[0092] It should be noted that the target polar code (N, K) is an auxiliary polar code (Nmax , the target code length corresponding to the to-be-encoded sequence also adopts the preset polarization permutation relationship (corresponding to the preset maximum code length) for the subcode rate adjustment. That is, the polarization code encoding process of different code lengths can all adopt the preset polarization permutation relationship corresponding to the preset maximum code length for the subcode rate adjustment, so that for different code lengths, it is not necessary to store multiple polarization permutation tables, and the storage space can be saved.

[0093] In some embodiments, the above-mentioned rate adjustment of the subcode in the to-be-encoded sequence can be implemented as:

[0094] The most reliable frozen bit in the first frozen bit subcode in the to-be-encoded sequence is converted into an information bit. The least reliable information bit in the second information bit subcode corresponding to the first frozen bit subcode in the to-be-encoded sequence is converted into a frozen bit.

[0095] Exemplarily, the encoding end can perform interleaving processing on the first frozen bit subcode to obtain a first interleaving subblock, and perform interleaving processing on the second information bit subcode to obtain a second interleaving subblock. Further, the encoding end exchanges the element corresponding to the most reliable frozen bit in the first interleaving subblock with the element corresponding to the least reliable information bit in the second interleaving subblock. The encoding end performs deinterleaving processing on the first interleaving subblock to obtain the converted first frozen bit subcode, and performs deinterleaving processing on the second interleaving subblock to obtain the converted second information bit subcode.

[0096] For example, the first frozen bit subcode is v e , and the second information bit subcode is v f , where e∈ε, At this time, the most reliable frozen bit in the subblock v e can be converted into an information bit, and the least reliable information bit in the subblock v f is converted into a frozen bit.

[0097] In the case of M=16, as shown in Table 4, the first frozen bit subcode v e can be interleaved based on Table 4 to obtain a first interleaving subblock , and the second information bit subcode v f is interleaved to obtain a second interleaving subblock

[0098] Table 4

[0099] The encoding end can exchange the element corresponding to the most reliable frozen bit in the first interleaving subblock , that is, the (M-c e -1)th element, with the element corresponding to the least reliable information bit in the second interleaving subblock The element corresponding to the least reliable information bit is the Mc-th bit. f Swap the elements.

[0100] Furthermore, the encoding end can process the first interleaved sub-block after the exchange. Deinterleaving is performed to obtain the first frozen bit code after conversion. and the second interleaved sub-block after the exchange Deinterleaving is performed to obtain the converted second information bit code.

[0101] Therefore, the sequence to be encoded, v = [v0v1v2…v], can be encoded. N-1 sub-block v in ] e Replace with v e ′ and block v f Replace with v f ′ .

[0102] In another example, the above rate adjustment process can also be implemented as follows:

[0103] The encoder can determine the set of frozen bit indices. with sub-block v e The intersection of the sets of indices of the elements in the set, the elements in this intersection are v. e The frozen bit position index in, for example: Therefore, it can be based on the reliability of the index. For sets Sort the indexes in the array, and denote the index with the highest reliability as d. e The index d e Corresponding elements

[0104] The encoding end can determine the set of information bit indices. with sub-block v f The intersection of the sets of indices of the elements in the set, the elements in this intersection are v. f Information bit position index in, for example: Therefore, it can be based on the reliability of the index. For sets Sort the indexes in the array, and denote the index with the lowest reliability as d. f The index d f Corresponding elements

[0105] Thus, the sequence v = [v0v1v2,…,v] can be swapped. N-1 elements in ] With elements The adjusted sequence to be encoded is obtained as v′=[v′0v′1v′2,…,v′ N-1 ].

[0106] In some embodiments, the encoder can use information bit subcode indexing.

[0107] The set consists of the |ε| elements with the lowest reliability in the information bit index set. Let the information bit subcode indexes form a set For example, the set of information bit indices is obtained based on the size of the set ε = {5, 16}, |ε| = 2. The two elements with the lowest reliability form a set H = {140, 110}. This allows us to calculate the information bit sub-code index set.

[0108] Therefore, the above-mentioned subcode rate adjustment can be regarded as being in subcode v e ,e∈ε and v f , Rate adjustments are made between these intervals to obtain the adjusted sequence to be encoded, v′=[v′0v′1v′2,…,v′]. N-1 Each subcode in the adjusted sequence to be encoded can be decoded quickly.

[0109] It should be noted that this disclosure, by adjusting the subcode rate, enables each subcode in the adjusted sequence to be encoded to be decoded quickly, thereby further reducing the complexity of the polar code encoding and decoding algorithm. Furthermore, it can also improve the performance of the polar code encoding and decoding algorithm.

[0110] S103. Construct an information sequence based on the adjusted sequence to be encoded and the input encoded bits.

[0111] For example, the encoding end can adjust the sequence to be encoded, v′=[v′0v′1v′2,…,v′ N-1 The elements representing the initial values ​​of the information bits in the sequence c = [c0c1c2,…,c…] are replaced with the input bit sequence c = [c0c1c2,…,c…]. K-1 The information sequence u = [u0u1u2,…,u] is obtained. N-1 ].

[0112] S104. Encode the information sequence using polar codes to obtain the encoded sequence.

[0113] For example, the encoding end can process the information sequence u = [u0u1u2,…,u] according to the polarization transformation matrix. N-1 The polarization transformation is performed to obtain the encoded sequence, that is, the output sequence x = [x0x1x2,…,x] N-1], wherein x = uG N , G N is a polarization transformation matrix.

[0114] S105, sending the encoded sequence.

[0115] According to the technical solution provided in the present disclosure, the sub-code rate of the to-be-encoded sequence can be adjusted according to the preset polarization permutation relationship, so that each sub-code included in the adjusted to-be-encoded sequence can be quickly decoded. In this way, the to-be-encoded sequence corresponding to the target code length used in the current polar code encoding can also be adjusted in sub-code rate using the preset polarization permutation relationship (corresponding to the preset maximum code length). That is, the polarization permutation relationship corresponding to the preset maximum code length can be used to adjust the sub-code rate in the polarization code encoding process of different code lengths. In this way, no polarization permutation table needs to be stored for different code lengths, which can save storage space. In addition, by adjusting the sub-code rate, each sub-code in the adjusted to-be-encoded sequence can be quickly decoded, which can further reduce the complexity of the polar code encoding and decoding algorithm.

[0116] In some embodiments, the present disclosure also provides a decoding method, as shown in FIG. 3, which includes S201-S202.

[0117] S201, receiving an encoded sequence.

[0118] The encoded sequence is obtained by polar code encoding based on an information sequence, and the information sequence is constructed based on an adjusted to-be-encoded sequence and input encoding bits.

[0119] Each sub-code included in the adjusted to-be-encoded sequence can be quickly decoded, and the sub-code rate of the to-be-encoded sequence is adjusted based on a preset polarization permutation relationship.

[0120] The preset polarization permutation relationship is used to indicate the correspondence between the frozen bit sub-code index and the number of information bits, and the frozen bit sub-code index is the index of the frozen bit sub-code included in the polarization sequence of the preset maximum code length.

[0121] In some embodiments, the to-be-encoded sequence corresponding to the input encoding bits is constructed based on the target code length corresponding to the input encoding bits and the polarization sequence of the preset maximum code length.

[0122] In some embodiments, the adjusted to-be-encoded sequence is obtained by adjusting the sub-code rate of the to-be-encoded sequence based on the preset polarization permutation relationship and a polarization auxiliary parameter, and the polarization auxiliary parameter is the information bit length of the auxiliary polar code.

[0123] In some embodiments, the polarization auxiliary parameter is determined based on the reliability of each element in the frozen bit index set and the target code length corresponding to the input encoding bits.

[0124] It should be noted that each sub-code in the adjusted to-be-encoded sequence in the present disclosure can be fast-decoded, which can further reduce the complexity of the polar code encoding and decoding algorithm. In addition, the performance of the polar code encoding and decoding algorithm can be improved.

[0125] As shown in Table 5, the number of nodes of the 5G NR polar code with a code length of 1024 at different rates is given. Based on Table 5, it can be seen that the fast polar code encoding and decoding method proposed in the present disclosure effectively reduces the number of nodes that need to be traversed in the decoding process, thereby reducing the complexity of the polar code encoding and decoding algorithm.

[0126] Table 5

[0127] In addition, as shown in FIG. 4, the performance comparison of different encoding and decoding methods for the polar code (512, 256) is shown, where N = 512, K = 256, a quadrature phase shift keying (QPSK) modulation method is used, and BLER refers to block error rate. It can be seen that, compared with the original 5G NR polar code encoding and SC decoding algorithm, the fast polar code encoding and decoding algorithm in the present disclosure effectively reduces the number of decoding nodes while only causing a performance loss of 0.1 dB. As shown in FIG. 5, the performance comparison of different encoding and decoding methods for the polar code (512, 384) is shown. It can be seen that, compared with the SC decoding performance, the fast encoding and decoding algorithm in the present disclosure effectively reduces the number of decoding nodes while only causing a performance loss of 0.1 dB. In this way, the performance of the polar code encoding and decoding algorithm is improved.

[0128] S202, decoding the encoding sequence to obtain input encoding bits.

[0129] For example, the decoding end can perform decoding processing on the encoding sequence based on the fast decoding method to obtain input encoding bits.

[0130] In addition, the detailed description of S201-S202 can also refer to the related description of S101-S105 described above, which will not be repeated here.

[0131] Based on the technical solutions provided in the present disclosure, the polar code encoding process of different code lengths can use the preset polar permutation relationship corresponding to the preset maximum code length to adjust the sub-code rate, so that multiple polar permutation tables do not need to be stored for different code lengths, which can save storage space. In addition, each sub-code in the adjusted to-be-encoded sequence used to construct the information sequence can be fast-decoded, so that the fast-decoding efficiency can be improved, and the complexity of the polar code encoding and decoding algorithm can be further reduced.

[0132] It should be understood that, in order to implement the above functions, each communication node comprises a hardware structure and / or software module corresponding to each function. It should be easily understood by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is realized in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. A person skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present disclosure.

[0133] FIG. 6 shows a composition diagram of a communication device provided by an embodiment of the present disclosure. The communication device 600 can perform the encoding method provided by the above method embodiments. As shown in FIG. 6, the communication device 600 comprises an acquisition module 601, a processing module 602, an encoding module 603 and a sending module 604.

[0134] The acquisition module 601 is configured to acquire a to-be-encoded sequence corresponding to the input encoding bits.

[0135] The processing module 602 is configured to perform sub-code rate adjustment on the to-be-encoded sequence according to a preset polarization permutation relationship, so that the adjusted to-be-encoded sequence comprises sub-codes that can be quickly decoded. The preset polarization permutation relationship is used to indicate a corresponding relationship between a frozen bit sub-code index and an information bit quantity. The frozen bit sub-code index is an index of a frozen bit sub-code included in a polarization sequence with a preset maximum code length.

[0136] The processing module 602 is further configured to construct an information sequence according to the adjusted to-be-encoded sequence and the input encoding bits.

[0137] The encoding module 603 is configured to perform polarization code encoding on the information sequence to obtain an encoding sequence.

[0138] The sending module 604 is configured to send the encoding sequence.

[0139] In some embodiments, the processing module 602 is configured to construct the to-be-encoded sequence corresponding to the input encoding bits according to a target code length corresponding to the input encoding bits and a polarization sequence with a preset maximum code length. The polarization sequence with the preset maximum code length is a polarization channel reliability ordering sequence.

[0140] In some embodiments, the processing module 602 is configured to: obtain elements in a preset maximum code length polarization sequence with an index less than a target code length, and construct a target polarization sequence; the target polarization sequence has a same length as the target code length; determine a frozen bit index set and an information bit index set according to reliabilities of elements in the target polarization sequence; and construct a to-be-encoded sequence according to the frozen bit index set and the information bit index set.

[0141] In some embodiments, the processing module 602 is configured to: determine a polarization auxiliary parameter; the polarization auxiliary parameter is an information bit length of an auxiliary polar code; determine whether there is a subcode in the to-be-encoded sequence that cannot be fast decoded according to the polarization auxiliary parameter and a preset polarization permutation relationship; and perform subcode rate adjustment on the to-be-encoded sequence in a case where there is a subcode in the to-be-encoded sequence that cannot be fast decoded.

[0142] In some embodiments, the processing module 602 is configured to: according to the preset polarization permutation relationship, in a case where a number of information bits corresponding to an index of a first frozen bit subcode is less than or equal to the polarization auxiliary parameter, detect whether the first frozen bit subcode can be fast decoded; and perform subcode rate adjustment on the to-be-encoded sequence in a case where the first frozen bit subcode cannot be fast decoded.

[0143] In some embodiments, the processing module 602 is configured to: in a case where a code rate of the first frozen bit subcode is not in a fast-decodable code rate set, determine that the first frozen bit subcode needs to perform subcode rate adjustment; and in a case where the code rate of the first frozen bit subcode is in the fast-decodable code rate set, determine that the first frozen bit subcode does not need to perform subcode rate adjustment.

[0144] In some embodiments, the polarization auxiliary parameter is determined based on reliabilities of elements in the frozen bit index set and a target code length corresponding to the input encoding bits.

[0145] In some embodiments, the processing module 602 is configured to: in a case where the target code length is equal to a preset maximum code length, determine that the polarization auxiliary parameter is a bit number of the input encoding bits; in a case where the target code length is less than the preset maximum code length, determine a first element with a highest reliability in the frozen bit index set; and take a number of elements in the preset maximum code length polarization sequence with a reliability greater than the first element as the polarization auxiliary parameter.

[0146] In some embodiments, the processing module 602 is configured to: convert a frozen bit with a highest reliability in a first frozen bit subcode in the to-be-encoded sequence that cannot be fast decoded into an information bit.

[0147] In some embodiments, the processing module 602 is configured to: convert an information bit with a lowest reliability in a second information bit subcode corresponding to the first frozen bit subcode in the to-be-encoded sequence into a frozen bit.

[0148] In some embodiments, the processing module 602 is configured to: perform interleaving processing on the first frozen bit sub-code to obtain a first interleaved sub-block, and perform interleaving processing on the second information bit sub-code to obtain a second interleaved sub-block; exchange an element corresponding to a frozen bit with the highest reliability in the first interleaved sub-block with an element corresponding to an information bit with the lowest reliability in the second interleaved sub-block; perform de-interleaving processing on the first interleaved sub-block to obtain a converted first frozen bit sub-code, and perform de-interleaving processing on the second interleaved sub-block to obtain a converted second information bit sub-code.

[0149] For more details of the above-described obtaining module 601, processing module 602, encoding module 603, and sending module 604, and more details of each technical feature and beneficial effects thereof, please refer to the corresponding method embodiment part above, which will not be repeated here.

[0150] FIG. 7 shows a composition diagram of a communication device provided by an embodiment of the present disclosure. The communication device 700 can perform the decoding method provided by the above-described method embodiments. As shown in FIG. 7, the communication device 700 includes a receiving module 701 and a decoding module 702.

[0151] The receiving module 701 is configured to receive an encoded sequence, the encoded sequence being obtained by polar code encoding based on an information sequence, the information sequence being constructed based on an adjusted to-be-encoded sequence and an input encoding bit; the adjusted to-be-encoded sequence includes sub-codes that can be quickly decoded, and is obtained by sub-code rate adjustment on the to-be-encoded sequence based on a preset polar permutation relationship; the preset polar permutation relationship is used to indicate a corresponding relationship between a frozen bit sub-code index and an information bit quantity, and the frozen bit index is an index of a frozen bit sub-code included in a polar sequence with a preset maximum code length;

[0152] The decoding module 702 is configured to perform decoding processing on the encoded sequence to obtain an input encoding bit.

[0153] In some embodiments, the to-be-encoded sequence corresponding to the input encoding bit is constructed according to a target code length corresponding to the input encoding bit and a polar sequence with a preset maximum code length.

[0154] In some embodiments, the adjusted to-be-encoded sequence is obtained by sub-code rate adjustment on the to-be-encoded sequence based on the preset polar permutation relationship and a polar auxiliary parameter, and the polar auxiliary parameter is an information bit length of an auxiliary polar code.

[0155] In some embodiments, the polar auxiliary parameter is determined based on the reliabilities of the elements in the frozen bit index set and the target code length corresponding to the input encoding bit.

[0156] For more details of the receiving module 701 and the decoding module 702, and more details of the technical features and beneficial effects thereof, please refer to the corresponding method embodiments described above, which will not be repeated here.

[0157] It should be noted that the modules in FIG. 6 or FIG. 7 can also be referred to as units, for example, the sending module can be referred to as a sending unit. In addition, in the embodiment shown in FIG. 6 or FIG. 7, the name of each module can not be the name shown in the figure, for example, the receiving module can also be referred to as a communication module, and the sending module can also be referred to as a communication module.

[0158] Each unit or module in FIG. 6 or FIG. 7, if implemented in the form of a software function module and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present disclosure essentially or said part of the prior art that contributes to the technical solutions or all or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, including a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor execute all or part of the steps of the methods in the various embodiments of the present disclosure. The storage medium storing the computer software product includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0159] In the case of implementing the functions of the above integrated modules in the form of hardware, the embodiments of the present disclosure provide a structural diagram of a communication device, which can be the communication device 600 or the communication device 700. As shown in FIG. 8, the communication device 800 includes a memory 801, a processor 802, a communication interface 803, and a bus 804.

[0160] The memory 801 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, can be a random access memory (RAM) or other type of dynamic storage device that can store dynamic information and instructions, can be an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium, or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

[0161] The processor 802 can implement or execute various exemplary methods described in connection with the content of the present disclosure. The processor 802 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, transistor logic, a hardware component, or any combination thereof. The processor 802 can be implemented as or executed as a logic block, a module, and a circuit of various exemplary methods described in connection with the content of the present disclosure. The processor 802 can also be a combination that implements a computing function, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0162] The communication interface 803 is configured to connect with other devices through a communication network. The communication network can be an Ethernet, a wireless access network, a wireless local area network (WLAN), and the like.

[0163] In some embodiments, the memory 801 can exist independently of the processor 802, and the memory 801 can be connected with the processor 802 through the bus 804 for storing instructions or program codes. When the processor 802 invokes and executes the instructions or program codes stored in the memory 801, the method provided by the embodiments of the present disclosure can be implemented.

[0164] In some embodiments, the memory 801 can also be integrated with the processor 802.

[0165] Bus 804, which can be an extended industry standard architecture (EISA) bus, a proprietary bus, or other bus type, can be split into buses based on different standards. For the sake of convenience, the bus 804 is referred to generally as a bus, and specifically an EISA bus, although the scope of the embodiments is not so limited.

[0166] Those skilled in the art can clearly understand the technical personnel in the art through the description of the above embodiments that, for the convenience and brevity of description, only the above division of functional modules is exemplified, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device or apparatus is divided into different functional modules to complete all or part of the functions described above.

[0167] The embodiments of the present disclosure further provide a computer readable storage medium. All or part of the processes of the above method embodiments can be instructed by computer instructions to complete the related hardware, and the program can be stored in the above computer readable storage medium. When the program is executed, it can include the processes of the above method embodiments. The computer readable storage medium can be the internal storage unit of any of the preceding embodiments. The above computer readable storage medium can also be an external storage device of the above device or apparatus, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. Further, the above computer readable storage medium can include both the internal storage unit and the external storage device of the above device or apparatus. The above computer readable storage medium is used to store the above computer program and other programs and data required by the above device or apparatus. The above computer readable storage medium can also be used to temporarily store data that has been output or will be output. The above computer readable storage medium includes a non-transitory computer readable storage medium.

[0168] The embodiments of the present disclosure further provide a computer program product, which contains a computer program, when the computer program product runs on a computer, makes the computer execute any method provided in the above embodiments.

[0169] Although the present disclosure has been described in connection with certain embodiments, it will be understood that the application is capable of further modifications and that this application is intended to cover any variations or alterations that fall within the scope of the present disclosure. Accordingly, the description and drawings are to be regarded as illustrative in nature and not as restrictive. It will be apparent to those skilled in the art that various modifications and variations can be made to the present disclosure without departing from the scope or spirit of the present disclosure. Thus, it is intended that the present disclosure cover the modifications and variations of this application provided they come within the scope of the appended claims and their equivalents.

[0170] Although the present disclosure has been described in connection with specific features thereof, it will be evident to those skilled in the art that various modifications and changes can be made to the present disclosure without departing from the scope or spirit of the disclosure. Accordingly, it is intended that the present disclosure cover all such modifications and changes as fall within the scope of the disclosure. It should be understood that various holidays within the scope of the present disclosure can be made without departing from the scope of the present disclosure. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not a restriction on the scope of the present disclosure. Obviously, many modifications and variations of the present disclosure are possible in light of its teachings. It is intended that the scope of the present disclosure encompass these and all other variations as can fall within the scope of the claims and their equivalents.

[0171] The above description is merely illustrative of the application and not restrictive. The scope of the application should be determined solely by reference to the claims that follow.

Claims

1. An encoding method, wherein, The method is applied to an encoding end and comprises the following steps: acquiring a to-be-encoded sequence corresponding to input encoding bits; performing sub-code rate adjustment on the to-be-encoded sequence according to a preset polarization permutation relationship; wherein the preset polarization permutation relationship is used to indicate a corresponding relationship between a frozen bit sub-code index and an information bit quantity, and the frozen bit sub-code index is an index of a frozen bit sub-code included in a polarization sequence with a preset maximum code length; constructing an information sequence according to the adjusted to-be-encoded sequence and the input encoding bits; performing polarization code encoding on the information sequence to obtain an encoded sequence; sending the encoded sequence.

2. The method of claim 1, wherein, The acquiring of the to-be-encoded sequence corresponding to the input encoding bits comprises the following steps: constructing the to-be-encoded sequence corresponding to the input encoding bits according to a target code length corresponding to the input encoding bits and a polarization sequence with the preset maximum code length; wherein the polarization sequence with the preset maximum code length is a polarization channel reliability ordering sequence.

3. The method of claim 2, wherein, The constructing of the to-be-encoded sequence corresponding to the input encoding bits according to the target code length corresponding to the input encoding bits and the polarization sequence with the preset maximum code length comprises the following steps: acquiring elements with an index smaller than the target code length in the polarization sequence with the preset maximum code length to construct a target polarization sequence; the target polarization sequence has a same length as the target code length; determining a frozen bit index set and an information bit index set according to reliabilities of the elements in the target polarization sequence; constructing the to-be-encoded sequence according to the frozen bit index set and the information bit index set.

4. The method of any one of claims 1-3, wherein, The performing of the sub-code rate adjustment on the to-be-encoded sequence according to the preset polarization permutation relationship comprises the following steps: determining a polarization auxiliary parameter; wherein the polarization auxiliary parameter is an information bit length of an auxiliary polarization code; determining whether there is a sub-code that cannot be fast decoded in the to-be-encoded sequence according to the polarization auxiliary parameter and the preset polarization permutation relationship; in response to the existence of the sub-code that cannot be fast decoded in the to-be-encoded sequence, performing sub-code rate adjustment on the to-be-encoded sequence.

5. The method of claim 4, wherein, The performing of the sub-code rate adjustment on the to-be-encoded sequence in the case where there is the sub-code that cannot be fast decoded in the to-be-encoded sequence comprises the following steps: according to the preset polarization permutation relationship, in response to the information bit quantity corresponding to the index of a first frozen bit sub-code being smaller than or equal to the polarization auxiliary parameter, detecting whether the first frozen bit sub-code can be fast decoded; in the case where the first frozen bit sub-code cannot be fast decoded, performing sub-code rate adjustment on the to-be-encoded sequence.

6. The method of claim 5, wherein, The detecting of whether the first frozen bit sub-code can be fast decoded comprises the following steps: in response to the code rate of the first frozen bit sub-code not being in a fast decodable code rate set, determining that the first frozen bit sub-code needs to perform sub-code rate adjustment; or in response to the code rate of the first frozen bit sub-code being in the fast decodable code rate set, determining that the first frozen bit sub-code does not need to perform sub-code rate adjustment.

7. The method according to claim 4, wherein the polarization auxiliary parameter is determined based on reliabilities of elements in a frozen bit index set and a target code length corresponding to the input encoding bits.

8. The method of claim 7, wherein, The determining the polarization auxiliary parameter comprises: In a case where the target code length is equal to the preset maximum code length, determining the polarization auxiliary parameter as a bit number of the input encoding bit; In a case where the target code length is less than the preset maximum code length, determining a first element with a highest reliability in the frozen bit index set; and taking a number of elements with a reliability greater than the first element in the polarization sequence of the preset maximum code length as the polarization auxiliary parameter.

9. The method of claim 4, wherein, The subcode rate adjustment on the to-be-encoded sequence comprises: Converting a frozen bit with a highest reliability in a first frozen bit subcode in the to-be-encoded sequence which cannot be fast decoded into an information bit; Converting an information bit with a lowest reliability in a second information bit subcode corresponding to the first frozen bit subcode in the to-be-encoded sequence into a frozen bit.

10. The method of claim 9, wherein, The converting the frozen bit with the highest reliability in the first frozen bit subcode in the to-be-encoded sequence which cannot be fast decoded into the information bit and the converting the information bit with the lowest reliability in the second information bit subcode corresponding to the first frozen bit subcode in the to-be-encoded sequence into the frozen bit comprises: performing interleaving processing on the first frozen bit subcode to obtain a first interleaving subblock, and performing interleaving processing on the second information bit subcode to obtain a second interleaving subblock; exchanging an element corresponding to the frozen bit with the highest reliability in the first interleaving subblock with an element corresponding to the information bit with the lowest reliability in the second interleaving subblock; performing deinterleaving processing on the first interleaving subblock to obtain a converted first frozen bit subcode, and performing deinterleaving processing on the second interleaving subblock to obtain a converted second information bit subcode.

11. A decoding method, wherein, The method is applied to a decoding end and comprises: receiving an encoding sequence, the encoding sequence being obtained by performing polar code encoding on an information sequence, the information sequence being constructed based on an adjusted to-be-encoded sequence and an input encoding bit; the adjusted to-be-encoded sequence being obtained by performing subcode rate adjustment on the to-be-encoded sequence based on a preset polarization permutation relationship; the preset polarization permutation relationship being used to indicate a corresponding relationship between a frozen bit subcode index and an information bit number, the frozen bit subcode index being an index of a frozen bit subcode included in a polarization sequence of a preset maximum code length; performing decoding processing on the encoding sequence to obtain the input encoding bit.

12. The method of claim 11, wherein, A to-be-encoded sequence corresponding to the input encoding bit is constructed based on a target code length corresponding to the input encoding bit and the polarization sequence of the preset maximum code length.

13. The method of claim 11, wherein, The adjusted to-be-encoded sequence is obtained by performing subcode rate adjustment on the to-be-encoded sequence based on the preset polarization permutation relationship and a polarization auxiliary parameter, the polarization auxiliary parameter being an information bit length of an auxiliary polar code.

14. The method of claim 13, wherein The polarization auxiliary parameter is determined based on reliabilities of elements in a frozen bit index set and a target code length corresponding to the input encoding bit.

15. A coding device comprising: a memory and a processor; wherein the memory and the processor are coupled; the memory is configured to store instructions executable by the processor; and the processor is configured to execute the instructions to perform the method according to any one of claims 1 to 14.

16. A computer readable storage medium, wherein, The computer readable storage medium stores computer instructions, and when the computer instructions run on the processor, the processor executes the method according to any one of claims 1 to 14.

17. A computer program product, wherein, The computer program product comprises a computer program, and when the computer program runs on the computer, the computer executes the method according to any one of claims 1 to 14.

Images