Data processing method, device, and storage medium

Abstract

This application discloses a data processing method, including: obtaining an information bit sequence, where the information bit sequence includes K information bits, where K is an integer greater than 0; encoding the information bit sequence based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain a coded data sequence, where the coded data sequence includes N coded data, where N is an integer greater than K, and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, where N is equal to or less than 2 n ; and transmitting the coded data sequence.

Description

[Technical Field]

[0001] This application is filed based on a Chinese patent application bearing application number 202211557955.8 and filing date December 6, 2022, and claims priority to that Chinese patent application, the entire contents of which are incorporated herein by reference.

[0002] The present application relates to the technical field of communications, and in particular to a data processing method, device, and storage medium. [Background technology]

[0003] Polar codes are short codes with higher reliability, and therefore, in the 5th Generation Mobile Communication (5G) standard established by the 3rd Generation Partnership Project (3GPP (registered trademark)), polar codes are adopted as the coding scheme for 5GNR control information. Specifically, polar codes are adopted as the coding scheme for downlink control information (DCI), uplink control information (UCI), and broadcast information carried by the physical broadcast channel (PBCH) in the control channel.

[0004] Polar code sequences are used to indicate the bit selection order before encoding the polar code, i.e., "good channel selection." To support the flexible code length and code rate requirements of 5G NR control information, it is necessary to design a sufficiently practical subchannel reliability sorting sequence for polar codes. Polar weight (PW) sequences have been shown through standardization and practical application to have characteristics that are independent of channel parameters, and PW sequences can exhibit good and stable performance under various code length and code rate configurations.

[0005] In a specific application, the PW sequence can be obtained by calculating the polarization weights, sorting them in ascending order, and finding the sequence numbers of the input bits that correspond to them. Calculating the PW sequence in real time requires high precision when calculating the polarization weights, which requires many memory transistors. To obtain the PW sequence from the acquisition memory, a memory of size N is required. max A PW sequence of size N must be stored in memory. max The first N subsequences are extracted from the PW sequence to construct N subchannel reliability sorted sequences, where N is the number of N max This method reduces the overhead of online computing resources, but increases the overhead of storage. Summary of the Invention [Problem to be solved by the invention]

[0006] The present application provides a data processing method, an apparatus, and a storage medium for reducing the overhead of storage resources used in encoding Polar codes. [Means for solving the problem]

[0007] In a first aspect, the present embodiment comprises: obtaining an information bit sequence, the information bit sequence including K information bits, where K is an integer greater than 0; encoding the information bit sequence based on at least one of a first coding parameter, a quantization weight value sequence, and a reliability threshold to obtain a coded data sequence, wherein the coded data sequence includes N coded data, where N is an integer greater than K, and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, and N is equal to or less than 2 n ; transmitting the encoded data sequence.

[0008] In a second aspect, the present embodiment comprises: a step of receiving an encoded data sequence transmitted by a transmitting side, wherein the encoded data sequence is obtained by encoding an information bit sequence based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain the encoded data sequence, wherein the information bit sequence includes K information bits, where K is an integer greater than 0; the encoded data sequence includes N encoded data, where N is an integer greater than K; and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, and N is equal to or less than the nth power of 2.

[0009] In a third aspect, the present embodiment comprises: at least one processor; at least one memory for storing at least one program; The present invention provides an electronic device that, when at least one of the programs is executed by at least one of the processors, realizes the data processing method according to the first or second aspect.

[0010] In a fourth aspect, the present embodiment comprises: There is provided a computer-readable storage medium storing a processor-executable program which, when executed by a processor, implements the data processing method according to the first or second aspect.

[0011] In a fifth aspect, the present application provides an embodiment comprising: A computer program product is provided, comprising a computer program or computer instructions, the computer program or the computer instructions being stored on a computer-readable storage medium, a processor of a computing device reading the computer program or the computer instructions from the computer-readable storage medium, and the processor executing the computer program or the computer instructions to cause the computing device to perform the data processing method according to the first or second aspect. [Effects of the Invention]

[0012] In an embodiment of the present application, an information bit sequence including K information bits is encoded based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain a coded data sequence, wherein the coded data sequence includes N coded data, where N is an integer greater than K, and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, and N is equal to or less than the n-th power of 2. In this way, in a specific implementation process, an information sequence including information bits and frozen bits is obtained by online determining whether each subchannel carries information bits or frozen bits, and then the coded data sequence is obtained by coding the information sequence, thereby reducing memory overhead and the number of memory transistors used. [Brief explanation of the drawings]

[0013] [Figure 1a]FIG. 10 is a schematic diagram of logic code that realizes the addition of a frozen bit. [Figure 1b] FIG. 10 is a diagram showing polarization conversion coefficients for N=16. [Figure 2] 1 is a schematic diagram of the architecture of a communication system to which an embodiment of the present application is applied; [Figure 3] 1 is a flowchart of a data processing method according to an embodiment of the present application; [Figure 4] FIG. 1 is a schematic diagram of logic code for implementing updating of information and frozen bit sequences according to an embodiment of the present application; [Figure 5] FIG. 1 is a schematic diagram of logic code for implementing updating of information and frozen bit sequences according to an embodiment of the present application; [Figure 6] FIG. 1 is a schematic diagram of logic code for implementing updating of information and frozen bit sequences according to an embodiment of the present application; [Figure 7] FIG. 1 is a schematic diagram of logic code for implementing updating of information and frozen bit sequences according to an embodiment of the present application; [Figure 8] FIG. 2 is a schematic diagram of a serially encoded logic code according to an embodiment of the present application; [Figure 9] FIG. 2 is a schematic diagram of a serially encoded logic code according to an embodiment of the present application; [Figure 10] 1 is a flowchart of another data processing method according to an embodiment of the present application. [Figure 11] 1 is a schematic diagram illustrating the configuration of a data processing device according to an embodiment of the present application. [Figure 12] 1 is a schematic diagram illustrating the configuration of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION OF THE INVENTION

[0014] The present application will now be further described with reference to the drawings and specific examples.

[0015] In the following description, "some embodiments" describes a subset of all possible embodiments, but "some embodiments" may be the same subset of all possible embodiments, or different subsets, and may be combined without contradicting each other.

[0016] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art. The terms used herein are for the purpose of describing the embodiments of the present application and are not intended to limit the present application.

[0017] In order to facilitate understanding of the solutions of the embodiments of the present application, the technical terms related to the embodiments of the present application will be explained below.

[0018] (1) Polar Weight (PW) sequence For a PW sequence, the formula for calculating the polarization subchannel reliability of index bit i is:

number

[0019] The number of polarization subchannels N max =2 n The quantization weight sequence β=[βn-1 ,β n-2 ,…,β0] is the number of polarization subchannels N=2 t It can be used for polar coding of (t=n, n-1, n-2, ..., 1). For example, n=10, N max For the quantization weight sequence β=[β9, β8, …, β0] calculated from =1024, the above configuration can be used for polar coding with the number of polarized subchannels N=1024, 512, 256, 128 …, so N can be set to 2. n For convenience of explanation, in the solution of the embodiment of the present application, N max Write all together in N, N=2 n To do so.

[0020] Table 1 shows a PW sequence for N=16, i.e., PW=[0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15], where the first element "0" represents the index number of the least reliable subchannel and the last element "15" represents the index number of the most reliable subchannel.

[0021] [Table 1] (2) Polar code encoding

[0022] a=[a0,a1,…,a K-1 ], a is an information sequence of length K, N is the number of polarization subchannels, and the information sequence a is a codeword d=[d0,d1,…,d N-1 ] is encoded as follows:

[0023] (1) Adding frozen bits: Select the appropriate subchannels to bear the information bits and the subchannels to place the frozen bits, and create an information sequence a = [a0, a1, ..., a K-1 ], add NK bits 0 to the sequence u = [u0,u1,…,u N-1Illustratively, the process of adding the frozen bit can be realized by the logic code shown in FIG. 1a.

[0024]

number

[0025] Referring to Fig. 2, Fig. 2 shows a schematic diagram of the architecture of a communication system to which the embodiments of the present application are applied. The communication system shown in Fig. 2 includes a first transmitting node 110 and a second transmitting node 120, and the first transmitting node 110 transmits an encoded data sequence to the second transmitting node 120. The first transmission node 110 and the second transmission node 120 may include any of the following devices: a base station (BS), an access point (AP), a nodeB, a gnodeB (generalized nodeB), a radio network controller (RNC), an evolved nodeB (eNB), a base station controller (BSC), a base transceiver station (BTS), a transceiver function (TF), a wireless router, a wireless transceiver, a basic service set (BSS), an extended service set (ESS), or a radio base station (RBS), but embodiments of the present application are not limited thereto.

[0026] In a possible embodiment, the first transmitting node 110 and the second transmitting node 120 may be referred to as an access terminal, user equipment (UE), subscriber unit, subscriber station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device. For example, the first transmitting node 110 and the second transmitting node 120 may be, but are not limited to, a mobile phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a 5G network or a future 5G or higher network, etc.

[0027] Referring to Fig. 3, Fig. 3 is a flowchart of a data processing method according to a first aspect of the embodiment of the present application, which is applicable to the first transmission node 110 shown in Fig. 2. As shown in Fig. 3, this data processing method includes the following steps S100 to S300, and each step will be described in turn below.

[0028] Step S100: Obtain an information bit sequence, where the information bit sequence includes K information bits, where K is an integer greater than 0. Step S200: Encode the information bit sequence based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain a coded data sequence, where the coded data sequence includes N coded data, where N is an integer greater than K, and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, and N is less than or equal to 2 n . Step S300: Transmit the coded data sequence.

[0029] Illustratively, the first encoding parameters include at least one of the following:

[0030] (1) Information bit sequence size: refers to the number of information bits included in the information bit sequence. In the embodiment of the present application, the number of information bits is represented by K, where K is an integer greater than 0. (2) Number of polarization subchannels: refers to the number of subchannels transmitting polarization codes. In the embodiment of the present application, the number of polarization subchannels is represented by N, where N is a positive integer power of 2, and N is greater than K. (3) Code rate: This refers to K / N, which is the ratio of the information bit sequence size K to the number of polarization subchannels N. In the embodiment of the present application, the code rate is represented by R. (4) Information index number: Refers to a number for indexing an information bit in the information and frozen bit sequence. In the embodiments of the present application, the information index number is represented by k, where k is an integer greater than or equal to 0 and less than or equal to (K-1), or k is an integer greater than or equal to (NK) and less than or equal to (N-1). (5) Sub-channel index number: refers to the number of the polarization code sub-channel. In the embodiment of the present application, the sub-channel index number is represented by i, where i is an integer equal to or greater than 0 and less than N. (6) Polarization encoding stage index number: refers to the number of the polarization encoding stage. In the embodiment of the present application, the polarization encoding stage index number is represented as stage0, stage1, etc., and the stage that obtains the information and frozen bit sequence from the information bit sequence is represented as stage-1. (7) Number of transport block bits TBS: A positive integer. (8) Number of cyclic redundancy check bits L CRC : is a positive integer. (9) Number of parity bits L PC : is a positive integer.

[0031] The first encoding parameters can be selected and set according to specific application scenarios, but are not limited here. The specific application principles of the above-mentioned first encoding parameters will be explained in each of the following embodiments, so the explanation will be omitted here.

[0032] For example, the encoded data sequence in step S200 can be specifically obtained by the following steps S210 to S220.

[0033] Step S210: Add frozen bits to the information bit sequence based on at least one of the first encoding parameter, the quantization weight value sequence, and the reliability threshold to obtain an information and frozen bit sequence, where the information and frozen bit sequence includes N bits.

[0034] Step S220: Encode the information and the frozen bit sequence to obtain an encoded data sequence.

[0035] For example, the input information bit sequence a=[a0, a1, ..., a K-1 ], add (NK) frozen bits to the K information bits of the information bit sequence a, and create the information and frozen bit sequence u=[u0,u1,…,u N-1 The information and frozen bit sequence u includes K information bits and (NK) frozen bits, and the positions of the information bits and the frozen bits are determined based on at least one of the first coding parameters, the quantization weight value sequence, and the reliability threshold.

[0036] For example, the information and frozen bit sequence of step S210 can be specifically obtained by the following steps S211 to S212.

[0037] Step S211: Add frozen bits to the information bit sequence according to a preset rule to obtain an initial information and frozen bit sequence, where the information and frozen bit sequence includes N bits.

[0038] Exemplarily, the initial information and the frozen bit sequence can be obtained by any of the following methods.

[0039] Method 1: Set the information bits in the information bit sequence in ascending order to the first K bits of the initial information and the frozen bit sequence.

[0040] For the information bit sequence a = [a0, a1, …, a K-1 , when setting the information bits in ascending order to the first K bits of the initial information and the frozen bit sequence, the initial information and the frozen bit sequence u = [u0, u1, …, u N-1 = [a0, a1, …, a K-1 , 0, …, 0] is obtained, where N represents the number of polarization sub-channels, its value is a positive integer power of 2, K is the number of information bits, its value is a positive integer, and K < N is satisfied.

[0041] Method 2: Set the information bits in the information bit sequence in ascending order to the subsequent K bits of the initial information and the frozen bit sequence.

[0042] For the information bit sequence a = [a0, a1, …, a K-1 , when setting the information bits in ascending order to the subsequent K bits of the initial information and the frozen bit sequence, the initial information and the frozen bit sequence u = [u0, u1, …, u N-1 = [0, …, 0, a0, a1, …, a K-1 is obtained, where N represents the number of polarization sub-channels, its value is a positive integer power of 2, K is the number of information bits, its value is a positive integer, and K < N is satisfied.

[0043] Method 3: Set the information bits in the information bit sequence in descending order to the first K bits of the initial information and the frozen bit sequence.

[0044] For the information bit sequence a = [a0, a1, …, a K-1For, when setting the information bits in reverse order to the first K bits of the information and frozen bit sequence, the initial information and frozen bit sequence u = [u0, u1, …, u N-1 =[a K-1 ,a K-2 ,…,a0,0,…,0] is obtained, where N represents the number of polarization sub-channels, the value of which is a positive integer power of 2, K is the number of information bits, the value of which is a positive integer, and K < N is satisfied.

[0045] Method 4: Set the information bits in the information bit sequence in reverse order to the last K bits of the initial information and frozen bit sequence.

[0046] For the information bit sequence a = [a0, a1, …, a K-1 , when setting the information bits in the information bit sequence in reverse order to the last K bits of the initial information and frozen bit sequence, the initial information and frozen bit sequence u = [u0, u1, …, u N-1 =[0,…,0,a K-1 ,a K-2 ,…,a0] is obtained, where N represents the number of polarization sub-channels, the value of which is a positive integer power of 2, K is the number of information bits, the value of which is a positive integer, and K < N is satisfied.

[0047] When the information bit sequence is stored in the initial information and frozen bit sequence by the above method, the position of the information bits in the information and frozen bit sequence is adjusted according to the information index number and the information and frozen bit indication, and the final information and frozen bit sequence input to the polarization channel can be obtained without requiring additional storage space for storing the information bits, thus saving storage space.

[0048] Step S212: Sequentially traverse the N polarization sub-channels in descending or ascending order of the sub-channel index number, and for the currently traversed polarization sub-channel, execute the following steps S2121~S2123.

[0049] Step S2121: Determine the subchannel reliability value of the currently traversed polarization subchannel based on the quantization weight value sequence.

[0050] Step S2122: Determine a frozen bit indication corresponding to the currently traversed polarization subchannel based on the reliability threshold and the subchannel reliability value.

[0051] Step S2123: Determine the value of the bit in the information and frozen bit sequence corresponding to the currently traversed polarization sub-channel according to the frozen bit instruction, and update the information and frozen bit sequence according to the value of the bit.

[0052] For example, the subchannel index numbers corresponding to the N polarization subchannels are arranged in ascending or descending order to obtain a subchannel index number sequence [0, 1, ..., N-1] or [N-1, N-2, ..., 0]. Then, the polarization subchannels corresponding to each subchannel index number in the subchannel index number sequence are traversed. Each time a polarization subchannel is traversed, a subchannel reliability value and a frozen bit indication corresponding to the currently traversed polarization subchannel are determined. According to the frozen bit indication, it is determined whether the bit carried by the currently traversed polarization subchannel is an information bit or a frozen bit, and the information and frozen bit sequences are updated.

[0053] Once the traversal of the N polarization sub-channels is complete, the final information and frozen bit sequence is obtained.

[0054] Note that in this embodiment, the quantization weight sequence is represented by β, where β includes n quantization weights, and the j-th quantization weight in β is β jrepresents the quantization weight value corresponding to the j-th bit in the binary form of the sub-channel index number, where j is an integer between 0 and (n - 1). Exemplarily, the binary form of the sub-channel index number i is i = B n-1 B n-2 …B2B1B0, and the 0-th bit B0 is the least significant bit, and the (n - 1)-th bit B n-1 is the most significant bit. In this case, β<00000​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​​+…+β0 < M is satisfied, where M is a positive integer power of 2.

[0059] In the second method, it is determined based on the constraint condition that the difference number between the quantized polarization weight value sequence (quantized PW sequence) obtained by the quantization weight value sequence and the polarization weight value sequence (PW sequence) is not more than the second numerical value D. Here, the second numerical value D is an integer from 0 to N. M = 2 l (where l is a positive integer), and M = 2 l In the case of M = 2, at most 1 bit is stored for each reliability threshold.

[0060] As an example, the quantization weight value sequence β includes any of the following. β = [96, 81, 68, 57, 48, 40, 34, 28, 24, 20], or β = [197, 165, 139, 116, 98, 82, 68, 58, 49, 41], or β = [389, 327, 275, 231, 194, 163, 137, 115, 97, 82], or β = [780, 656, 552, 464, 390, 328, 276, 232, 195, 164], or β = [51, 43, 36, 30, 25, 21, 18, 15, 13], or β = [101, 85, 71, 60, 50, 42, 35, 30, 25], or <​​​​​​For example, the reliability threshold in the embodiments of the present application may be obtained from a predetermined mapping relationship based on an index value, where the index value includes, but is not limited to, a value determined based on at least one of the number of information bits K, the number of polarization subchannels N, and the code rate R, and the mapping relationship includes, but is not limited to, at least one of a mapping formula, a mapping table, or a mapping map. Of course, the mapping relationship may be other expressions having a corresponding relationship, and is not limited to this in the embodiments of the present application.

[0062] In one possible implementation, the information bit sequence a=[a0, a1, ..., a K-1 ], calculate the reliability value of the i-th subchannel according to the quantization weight value sequence, obtain a reliability threshold according to the mapping relationship, compare the reliability value of the i-th subchannel with the reliability threshold, and determine whether the i-th subchannel bears information bits; and calculate the information and frozen bit sequence u=[u0,u1,...,u N-1 ] and further encode the information and frozen bit sequence u to obtain encoded data d=[d0,d1,...,d N-1 ] may be obtained.

[0063] The information bit sequence and the information and frozen bit sequence have a mapping relationship u f1(j) =a f2(j) where f1 is a function of j and is determined by f2(j), the information and frozen bit indication, information index number, but is not limited to f1(j)∈{0,1,...,N-1}. f2 is a function of j, including but not limited to f(j)=j, f(j)=Kj, f2(j)∈{0,1,...,K-1}, where j=0,1,...,K-1. Based on the above mapping relationship, the obtained information bit sequence a=[a0,a1,...,a K-1 ], the information and frozen bit sequence u=[u0,u1,…,u N-1 ] can be determined.

[0064] Next, the data processing method according to the embodiments of the present application will be described using several specific examples. Example 1

[0065] Based on the index value, obtain the reliability threshold w from a preset mapping relationship. th In this example, the index value is determined based on the value of the number of information bits K and the value of the polarization sub-channel number N. The mapping relationship between the number of information bits K, the polarization sub-channel number N, and the reliability threshold is recorded by a mapping table (hereinafter referred to as a reliability threshold table).

[0066] Exemplarily, N is a positive integer power of 2 and includes, but is not limited to, any one of 32, 64, 128, 256, 512, 1024. K is a positive integer and includes, but is not limited to, any one of 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, 299. w K,N is <M, where M is a positive integer power of 2, and the value of M includes, but is not limited to, one of 256, 512, 1024, 2048, 4096. Referring to Table 2, Table 2 is an executable reliability threshold table indexed by K and N. In some other examples, the reliability threshold table includes at least one row or at least one column of Table 2. Table 2 is only one mapping form of the executable reliability threshold table, and other mapping forms may be used. This is not particularly limited in this embodiment.

[0067]

Table 2

[0068] The relationship between the number of information bits K and the number of polarization subchannels N can be obtained from the reliability threshold table. The reliability threshold corresponding to a combination of a certain value K and a certain value N is NaN,w K,N where "NaN" is a NULL value indicating that there is no confidence threshold for the current K and N combination, and K,N is the confidence threshold for the combination of K and N.

[0069] If the value of K is greater than or equal to the value of N, the confidence threshold corresponding to the value of K and the value of N is NaN, indicating that the confidence threshold is NULL.

[0070] Also, if the value of K is smaller than the value of N, the confidence threshold corresponding to the value of K and the value of N is w K,N where, in one possible embodiment, w K,N The value of is determined by the following steps S310 to S313.

[0071] Step S310: Calculate subchannel reliability values ​​corresponding to the polarization subchannels according to the quantization weight value sequence β and the subchannel index numbers i corresponding to each polarization subchannel respectively.

[0072] Step S311: Obtain a subchannel reliability sequence based on the subchannel reliability values ​​corresponding to the N polarization subchannels.

[0073] Step S312: Select the K largest subchannel reliability values ​​from the subchannel reliability sequence.

[0074] Step S313: From the K maximum subchannel reliability values, select the minimum subchannel reliability value as w K,N Select as.

[0075] That is, based on the quantization weight value sequence β and the subchannel index number i, N subchannel reliability values ​​w′=[w′0, w′1, …, w′N-1 ], select the largest K reliability values ​​from w', and then select the smallest w from the largest K reliability values. N-K Select w N-K is the element value at the (N, K) position in the confidence threshold table.

[0076] For example, the reliability threshold w of the i-th subchannel ’ i is determined by the following equation (2):

number

[0077] The values ​​of N correspond to two different values ​​of K, i.e., K1 and K2, and if K1 is smaller than K2, then w K1,N But w K2,N is larger than w K1,N represents the confidence threshold corresponding to the value of K1 and the value of N, and w K2,N represents the confidence threshold corresponding to the value of K2 and the value of N.

[0078] The values ​​of K correspond to two different values ​​of N, namely N1 and N2, and if N1 is smaller than N2, then w K,N1 But w K,N2 is smaller than w K,N1 represents the confidence threshold corresponding to the value of K and the value of N1, and w K、N2 represents the confidence threshold corresponding to the value of K and the value of N2. Example 2

[0079] Based on the index value, a confidence threshold w is calculated from the predefined mapping relationship. thTo obtain. In this example, the index value is determined based on the value of the number of information bits K and the value of the code rate R, and the mapping relationship between the number of information bits K, the code rate R, and the reliability threshold is recorded by a mapping table (hereinafter referred to as the reliability threshold table).

[0080] Exemplarily, R is a real number greater than 0 and less than 1, and includes, but is not limited to, one of 25 / 32, 25 / 64, 25 / 128, 25 / 256, 25 / 512, 25 / 1024, 35 / 64, 35 / 128, 35 / 256, 35 / 512, 35 / 1024, 43 / 64, 43 / 128, 43 / 256, 43 / 512, 43 / 1024, 51 / 64, 51 / 128, 51 / 256, 51 / 512, 51 / 1024, 59 / 64, 59 / 128, 59 / 256, 59 / 512, 59 / 1024. K is a positive integer and includes, but is not limited to, one of 25, 35, 43, 51, 59. w K,R <is M, where M is a positive integer power of 2, and the value of M includes, but is not limited to, one of 256, 512, 1024, 2048, 4096. The reliability threshold table indexed by K and R is shown in Table 3. In another example, the reliability threshold table includes at least one row or at least one column of Table 3. Table 3 is just one mapping form of an executable reliability threshold table, and other mapping forms may be used. This is not particularly limited in this embodiment.

[0081]

Table 3

[0082] The change relationship of the reliability threshold with respect to the number of information bits K and the change relationship of the reliability threshold with respect to the code rate R can be obtained from the reliability threshold table. The corresponding reliability threshold for a combination of a certain value K and a certain value R includes either NaN, w K,R of which, where "NaN" is a NULL value indicating that there is no reliability threshold for the current combination of K and R, and w K,Rindicates the confidence threshold for the combination of K and R.

[0083] If K is greater than or equal to K / R, the confidence threshold corresponding to the value of K and the value of R is NaN, indicating that the confidence threshold is null.

[0084] Also, when K is smaller than K / R, the confidence threshold corresponding to the value of K and the value of R is w K,R and in one possible embodiment, w K,R The value of is determined by the following steps S320 to S323.

[0085] Step S320: Based on the values ​​of K and R, the value of N is determined.

[0086] Step S321: Calculate a subchannel reliability value corresponding to each polarization subchannel according to the quantization weight value sequence β and the subchannel index number i corresponding to the N polarization subchannels respectively.

[0087] Step S322: Obtain a subchannel reliability sequence according to the subchannel reliability values ​​corresponding to the N polarization subchannels, and select K largest subchannel reliability values ​​from the subchannel reliability sequence.

[0088] Step S323: Select the smallest subchannel reliability value from the K largest subchannel reliability values, and denote the smallest subchannel reliability value as w K,R Let's say.

[0089] That is, first, the number of polarization subchannels N is determined based on the number of information bits K and the code rate R, and illustratively N=K / R. Next, based on the quantization weight value sequence β and the subchannel index number i, N subchannel reliability values ​​w′=[w′0, w′1, ..., w′ N-1 ] is calculated. The largest K reliability values ​​are selected from w', and then the smallest w N-K Select w N-Kis the element value at the (R, K) position in the confidence threshold table.

[0090] The value of K corresponds to two different values ​​of R, namely R1 and R2, and when R1 is smaller than R2, w K,R1 But w K,R2 is larger than w K,R1 represents the confidence threshold corresponding to the value of K and the value of R1, and w K,R2 represents the confidence threshold corresponding to the value of K and the value of R2. Example 3

[0091] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0092] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2 ,…,β0]=[96,81,68,57,48,40,34,28,24,20] and n=10. N is a positive integer power of 2, including but not limited to, 32, 64, 128, 256, 512, and 1024. K is a positive integer, including but not limited to, 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, and 299. A specific example of a confidence threshold table is shown in Table 4, and in another example, the confidence threshold table includes at least one row or at least one column of Table 4.

[0093] [Table 4] Example 4

[0094] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0095] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2 ,…,β0]=[197,165,139,116,98,82,68,58,49,41] and n=10. N is a positive integer power of 2, including but not limited to, 32, 64, 128, 256, 512, and 1024. K is a positive integer, including but not limited to, 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, and 299. A specific example of a confidence threshold table is shown in Table 5, and in another example, the confidence threshold table includes at least one row or at least one column of Table 5.

[0096] [Table 5] Example 5

[0097] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0098] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2,…,β0]=[389,327,275,231,194,163,137,115,97,82] and n=10. N is a positive integer power of 2, including but not limited to 32, 64, 128, 256, 512, and 1024. K is a positive integer, including but not limited to 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, and 299. A specific example of a confidence threshold table is shown in Table 6, and in another example, the confidence threshold table includes at least one row or at least one column of Table 6.

[0099] [Table 6] Example 6

[0100] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0101] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2,…,β0]=[780,656,552,464,390,328,276,232,195,164] and n=10. N is a positive integer power of 2, including but not limited to 32, 64, 128, 256, 512, or 1024. K is a positive integer, including but not limited to 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, or 299. A specific example of a confidence threshold table is shown in Table 7, and in another example, the confidence threshold table includes at least one row or at least one column of Table 7.

[0102] [Table 7] Example 7

[0103] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0104] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2,...,β0] = [51, 43, 36, 30, 25, 21, 18, 15, 13] and n = 9. N is a positive integer power of 2, including but not limited to, 32, 64, 128, 256, 512. K is a positive integer, including but not limited to, 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, 299. A specific example of a confidence threshold table is shown in Table 8, and in another example, the confidence threshold table includes at least one row or at least one column of Table 8.

[0105] [Table 8] Example 8

[0106] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0107] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2, ...,β0] = [101, 85, 71, 60, 50, 42, 35, 30, 25] and n = 9. N is a positive integer power of 2, including but not limited to, 32, 64, 128, 256, 512. K is a positive integer, including but not limited to, 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, 299. A specific example of a confidence threshold table is shown in Table 9, and in another example, the confidence threshold table includes at least one row or at least one column of Table 9.

[0108] [Table 9] Example 9

[0109] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0110] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2, ...,β0] = [206, 173, 145, 122, 102, 86, 73, 61, 51], and n = 9. N is a positive integer power of 2, including but not limited to, any of 32, 64, 128, 256, and 512. K is a positive integer, including but not limited to, any of 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, and 299. A specific example of a confidence threshold table is shown in Table 10, and in another example, the confidence threshold table includes at least one row or at least one column of Table 10.

[0111] [Table 10] Example 10

[0112] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the number of polarization subchannels N. The mapping relationship between the number of information bits K, the number of polarization subchannels N, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0113] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2,…,β0]=[480, 404, 340, 286, 240, 202, 170, 143, 120] and n=9. N is a positive integer power of 2, including but not limited to 32, 64, 128, 256, and 512. K is a positive integer, including but not limited to 25, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147, 155, 163, 171, 179, 187, 195, 203, 219, 235, 251, 267, 283, and 299. A specific example of a confidence threshold table is shown in Table 11, and in another example, the confidence threshold table includes at least one row or at least one column of Table 11.

[0114] [Table 11] Example 11

[0115] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the code rate R, and the mapping relationship between the number of information bits K, the code rate R, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0116] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2,…,β0]=[97,165,139,116,98,82,68,58,49,41], and n=10. R is a real number greater than 0 and less than 1, including, but not limited to, any of the following: 25 / 32, 25 / 64, 25 / 128, 25 / 256, 25 / 512, 25 / 1024, 35 / 64, 35 / 128, 35 / 256, 35 / 512, 35 / 1024, 43 / 64, 43 / 128, 43 / 256, 43 / 512, 43 / 1024, 51 / 64, 51 / 128, 51 / 256, 51 / 512, 51 / 1024, 59 / 64, 59 / 128, 59 / 256, 59 / 512, and 59 / 1024. K is a positive integer, including, but not limited to, any of 25, 35, 43, 51, and 59. A specific example of a confidence threshold table is shown in Table 12, and in another example, the confidence threshold table includes at least one row or at least one column of Table 12.

[0117] [Table 12] Example 12

[0118] Based on the index value, a reliability threshold is obtained from a predetermined mapping relationship. In this example, the index value is determined based on the value of the number of information bits K and the value of the code rate R, and the mapping relationship between the number of information bits K, the code rate R, and the reliability threshold is recorded in a reliability threshold table, and the elements in the reliability threshold table are determined based on the quantization weight value sequence β.

[0119] Illustratively, the quantization weight sequence β=[β n-1 ,β n-2,…,β0]=[480, 404, 340, 286, 240, 202, 170, 143, 120], and n=9. R is a real number greater than 0 and less than 1, including, but not limited to, 25 / 32, 25 / 64, 25 / 128, 25 / 256, 25 / 512, 35 / 64, 35 / 128, 35 / 256, 35 / 512, 43 / 64, 43 / 128, 43 / 256, 43 / 512, 51 / 64, 51 / 128, 51 / 256, 51 / 512, 59 / 64, 59 / 128, 59 / 256, and 59 / 512. K is a positive integer, including, but not limited to, 25, 35, 43, 51, and 59. A specific example of a confidence threshold table is shown in Table 13, and in another example, the confidence threshold table includes at least one row or at least one column of Table 13.

[0120] [Table 13] Example 13 In one possible embodiment, the subchannel reliability values ​​are calculated based on the quantized weight value sequence, and the reliability threshold for the ith polarization subchannel is calculated by the following formula:

number

[0121] The quantized weight value sequence β includes n quantized weight values, and β j is the quantized weight value corresponding to B j satisfies any one of the conditions but is not limited thereto. B j represents the j-th bit for converting the integer i into binary form, i = B n-1 B n-2 …B2B1B0, where the 0-th bit B0 is the least significant bit, the (n - 1)-th bit B n-1 is the most significant bit, n = log2N, N is the number of polarization subchannels, and j ∈ {0, 1, 2, …, n - 2, n - 1}.

[0122] The quantized weight value sequence β = [β n-1 , β n-2 , …, β0] satisfies β n-1 + β n-2 + … + β0 < M, where M is a positive integer power of 2. Specifically, the value of M includes at least one of 256, 512, 1024, 2048, 4096.

[0123] The quantized weight value sequence β = [β n-1 , β n-2 , …, β0] is determined by at least one (but not limited to) of the following constraint conditions: being preset, the sum of elements β n-1 + β n-2 + … + β0 < M, and the difference number between the quantized PW sequence obtained based on the quantized weight value sequence and the PW sequence is not more than the second numerical value D. Here, M is a positive integer power of 2, and the value of M includes any of 256, 512, 1024, 2048, 4096 but is not limited thereto. β j is a positive integer, j ∈ {

[0124] When the value of D is small, the difference number between the obtained quantized PW sequence and the PW sequence is small, but to store the quantized PW sequence, a larger M is required, that is, more storage space is needed. When the value of D is large, the difference number between the obtained quantized PW sequence and the PW sequence is large, and a large M is not required to store the quantized PW sequence, that is, only a small amount of storage space is needed to store the reliability threshold. By adjusting the size of D, various application scenarios can be satisfied.

[0125] In one example, M = 256, N = 512, n = 9, D = 254, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [51, 43, 36, 30, 25, 21, 18, 15, 13], where the sum of the elements in the quantized weight value sequence β, β n-1 + β n-2 + … + β0 = 252 < M. Based on the quantized weight value sequence β, the reliability value w<00…Full translation for the remaining part of the text can be provided in a similar way following the above rules. For the sake of space, only the beginning part is fully translated here. If you need the complete translation, please let me know. ’ i of the i-th subchannel is calculated for i = 0, 1, …, N - 1. The N subchannel reliability values are sorted in descending order, and based on the sorted index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW N-1 represents the subchannel index number corresponding to the largest reliability value, and PW0 represents the subchannel index number corresponding to the smallest reliability value. The PW’ sequence is reversed to obtain the quantized PW sequence PW quan = [PW0, PW1, …, PW N-1 . Comparing the quantized PW sequence (PW quan ) obtained by the parameters with the PW sequence (PW), the difference number between the two is 254, which is less than or equal to D, that is, at 254 positions, PW quan (i) ≠ PW(i) for i = 0, 1, …, N - 1.

[0126] In another example, M = 512, N = 512, n = 9, D = 76, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [101, 85, 71, 60, 50, 42, 35, 30, 25], where the sum of the elements in the sequence β n-1 + β n-2 + … + β0 = 499 < M satisfies the characteristic. Based on the quantized weight value sequence β, the reliability value w’ i of the i-th subchannel is calculated for i = 0, 1, …, N - 1. The N subchannel reliability values are sorted in descending order, and based on the sorted index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW N-1 represents the subchannel index number corresponding to the largest reliability value, and PW0 represents the subchannel index number corresponding to the smallest reliability value. The PW sequence is reversed to obtain the quantized PW sequence PW quan = [PW0, PW1, …, PW N-1 . The result of comparing the quantized PW sequence (PW quan ) obtained by the parameters with the PW sequence (PW) shows that the difference number between the two is 76, which is less than or equal to D. That is, at 76 positions, PW quan (i) ≠ PW(i) for i = 0, 1, …, N - 1.

[0127] In yet another example, M = 1024, N = 512, n = 9, D = 6, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [206, 173, 145, 122, 102, 86, 73, 61, 51], where the sum of the elements in the sequence β n-1 + β n-2 + … + β0 = 1019 < M satisfies the characteristic. Based on the quantized weight value sequence β, the reliability value w ’ iCalculate it for i = 0, 1, …, N - 1. Arrange the N sub - channel reliability values in descending order. Based on the arranged index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW N-1 represents the sub - channel index number corresponding to the largest reliability value, and PW0 represents the sub - channel index number corresponding to the smallest reliability value. Reverse the PW’ sequence to obtain the quantized PW sequence PW quan = [PW0, PW1, …, PW N-1 . The result of comparing the quantized PW sequence (PW quan ) obtained by the parameter with the PW sequence (PW) shows that the difference number between the two is 6 and is less than or equal to D, that is, at 6 positions, PW quan (i) ≠ PW(i) for i = 0, 1, …, N - 1.

[0128] In a further example, M = 4096, N = 512, n = 9, D = 0, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [480, 404, 340, 286, 240, 202, 170, 143, 120], where the sum of the elements in the quantized weight value sequence β, β n-1 +β n-2 +…+β0 = 2385 < M. Based on the quantized weight value sequence β, calculate the reliability value w ’ i of the i - th sub - channel for i = 0, 1, …, N - 1. Arrange the N sub - channel reliability values in descending order. Based on the arranged index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW N-1 represents the sub - channel index number corresponding to the largest reliability value, and PW0 represents the sub - channel index number corresponding to the smallest reliability value. Reverse the PW sequence to obtain the quantized PW sequence PW quan = [PW0, PW1, …, PW N-1 . The quantized PW sequence (PWquan ) When compared with the PW sequence (PW), the number of differences between the two is 0 and is less than or equal to D, that is, there are 0 positions where PW quan (i)≠PW(i), where i = 0, 1, …, N - 1.

[0129] In a further example, M = 512, N = 1024, n = 10, D = 466, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [96, 81, 68, 57, 48, 40, 34, 28, 24, 20], where the sum of the elements in the quantized weight value sequence β, β n-1 +β n-2 +…+β0 = 496 < M. Based on the quantized weight value sequence β, the reliability value w ’ i of the i-th subchannel is calculated for i = 0, 1, …, N - 1. The N subchannel reliability values are sorted in descending order, and based on the sorted index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW N-1 represents the subchannel index number corresponding to the largest reliability value, and PW0 represents the subchannel index number corresponding to the smallest reliability value. The PW sequence is inverted to obtain the quantized PW sequence PW quan = [PW0, PW1, …, PW N-1 . The result of comparing the quantized PW sequence (PW quan ) obtained by the parameters with the PW sequence (PW) shows that the number of differences between the two is 466 and is less than or equal to D, that is, there are 466 positions where PW quan (i)≠PW(i), where i = 0, 1, …, N - 1.

[0130] In a further example, M = 1024, N = 1024, n = 10, D = 70, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [197, 165, 139, 116, 98, 82, 68, 58, 49, 41], where the sum of the elements in the quantized weight value sequence β, βn-1 +β n-2 +…+β0 = 1013 satisfies the characteristics of M. Based on the quantization weight value sequence β, the reliability value w’ of the i-th sub-channel i is calculated, where i = 0, 1, …, N - 1. The N sub-channel reliability values are sorted in descending order, and based on the sorted index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW N-1 represents the sub-channel index number corresponding to the largest reliability value, and PW0 represents the sub-channel index number corresponding to the smallest reliability value. The PW sequence is reversed to obtain the quantization PW sequence PW quan = [PW0, PW1, …, PW N-1 . The result of comparing the quantization PW sequence (PW quan ) and the PW sequence (PW) shows that the difference number between the two is 70 and is less than or equal to D, that is, there are 70 positions where PW quan (i) ≠ PW(i), where i = 0, 1, …, N - 1.

[0131] In a further example, M = 2048, N = 1024, n = 10, D = 24, and the quantization weight value sequence β = [β n-1 , β n-2 , …, β0] = [389, 327, 275, 231, 194, 163, 137, 115, 97, 82], where the sum of the elements in the quantization weight value sequence β, β n-1 + β n-2 + … + β0 = 2010 satisfies the characteristics of M. Based on the quantization weight value sequence β, the reliability value w’ of the i-th sub-channel i is calculated, where i = 0, 1, …, N - 1. The N sub-channel reliability values are sorted in descending order, and based on the sorted index values, PW’ = [PW N-1 , PW N-2 , …, PW0] is obtained, where PW<represents the sub-channel index number corresponding to the largest reliability value, and PW0 represents the sub-channel index number corresponding to the smallest reliability value. Reverse the PW sequence to obtain the quantized PW sequence PW quan =[PW0, PW1, …, PW N-1 . The result of comparing the quantized PW sequence (PW quan ) obtained by the parameters with the PW sequence (PW) shows that the difference number between the two is 24 and is less than or equal to D. That is, at 24 positions, PW quan (i) ≠ PW(i), where i = 0, 1, …, N - 1.

[0132] In a further example, M = 4096, N = 1024, n = 10, D = 0, and the quantized weight value sequence β = [β n-1 , β n-2 , …, β0] = [780, 656, 552, 464, 390, 328, 276, 232, 195, 164], where the sum of the elements in the quantized weight value sequence β, β n-1 + β n-2 + … + β0 = 4037 < M. Based on the quantized weight value sequence β, calculate the reliability value w’ i of the i-th sub-channel, where i = 0, 1, …, N - 1. Sort the N sub-channel reliability values in descending order, and based on the sorted index values, obtain PW’ = [PW N-1 , PW N-2 , …, PW0], where PW N-1 [[ID=-- --]] represents the sub-channel index number corresponding to the largest reliability value, and PW0 represents the sub-channel index number corresponding to the smallest reliability value. Reverse the PW sequence to obtain the quantized PW sequence PW quan = [PW0, PW1, …, PW N-1 . The result of comparing the quantized PW sequence (PW quan ) ) obtained by the parameters with the PW sequence (PW) shows that the difference number between the two is 0 and is less than or equal to D. That is, at 0 positions, PW quan (i) ≠ PW(i), where i = 0, 1, …, N - 1. Example 14

[0133] The information and frozen bit indications corresponding to the polarization subchannels are determined based on the subchannel reliability values ​​and the reliability thresholds. Specifically, for the i-th subchannel, the process of determining the information and frozen bit indications corresponding thereto is as follows: The reliability value w' of the i-th subchannel i is the confidence threshold w th When the i-th subchannel bears information bits, the reliability value w' of the i-th subchannel is i is the confidence threshold w th When the i-th subchannel is smaller than , the i-th subchannel bears the frozen bit.

[0134] Illustratively, the information and freeze bit indication for the i-th subchannel is represented by a flag bit F, and w' i ≧w th If w', then F=b1, indicating that the i-th subchannel bears an information bit. Otherwise, F=b0, indicating that the i-th subchannel bears a frozen bit, where b0 and b1 are two unequal binary bit values. In one example, w' i ≧w th If F = 1, then F = 1, indicating that the i-th subchannel bears the information bit; otherwise, F = 0, indicating that the i-th subchannel bears the frozen bit. Example 15

[0135] The values ​​of the bits corresponding to the polarization subchannels in the information and frozen bit sequences are determined based on the information and frozen bit instructions, and the finally obtained information and frozen bit sequences and the information bit sequences have a mapping relationship u f1(j) =a f2(j)satisfies, where f1 is a function of j, determined by f2(j), information and frozen bit instructions, information index number, but not limited thereto, f1(j) ∈ {0, 1, …, N - 1}, f2 is a function of j, f(j) = j, f(j) = K - j, f2(j) ∈ {0, 1, …, K - 1}, but not limited thereto, and j = 0, 1, …, K - 1. Specifically, the information and frozen bit sequence is updated using the information index number according to the information and frozen bit instructions of the subchannel. Here, the initial value of the information index number points to the first information bit or the last information bit.

[0136] Exemplarily, the information bit sequence a = [a0, a1, …, a K-1 is set in ascending order to the first K bits of the information and frozen bit sequence, and the initialized information and frozen bit sequence is u = [u0, u1, …, u N-1 =[a0, a1, …, a K-1 , 0, …, 0]. The initial value of the information index number k = K - 1 is set to point to the last information bit a K-1 in u, and the initial value of the subchannel index number i = N - 1 is set to point to the last bit in u. Based on the information index number k and the information and frozen bit instruction F, the logic code for updating the information and frozen bit sequence, as shown in Figure 4, when k ≥ 0 and F = 1, u i = u k , k = k - 1, i = i - 1, and in other cases, u i = 0, i = i - 1, and repeating the above steps N times. When i = 0, the update of the information and frozen bit sequence is completed to obtain the final information and frozen bit sequence, including, but not limited to, these steps. Here, N is the number of polarized subchannels, and its value is a positive integer power of 2. K is the number of information bits, and its value is a positive integer, satisfying K < N. F = 1 indicates that the i-th subchannel bears an information bit, and F = 0 indicates that the i-th subchannel bears a frozen bit. Example 16

[0137] The information bit sequence a = [a0, a1, …, a K-1 is set in ascending order to the K bits after the information and frozen bit sequence, and the initialized information and frozen bit sequence is u = [u0, u1, …, u N-1 = [0, …, 0, a0, a1, …, a K-1 . The initial value of the information index number k = N - K points to the first information bit a0 in u, and the initial value of the sub-channel index number i = 0 points to the first bit in u. Based on the information index number k and the information and frozen bit indication F, the logical code for updating the information and frozen bit sequence is, as shown in FIG. 5, when k ≤ N - 1 and F = 1, u i = u k , k = k + 1, i = i + 1, and in other cases, u i = 0, i = i + 1, and the steps of repeating the above steps N times and, when i = N - 1, completing the update of the information and frozen bit sequence to obtain the final information and frozen bit sequence, are included, but not limited thereto. Here, N is the number of polarized sub-channels, the value of which is a positive integer power of 2, K is the number of information bits, the value of which is a positive integer, and K < N is satisfied. F = 1 indicates that the i-th sub-channel bears an information bit, and F = 0 indicates that the i-th sub-channel bears a frozen bit. Example 17

[0138] The information bit sequence a = [a0, a1, …, a K-1 is set in descending order to the first K bits of the information and frozen bit sequence, and the initialized information and frozen bit sequence is u = [u0, u1, …, u N-1 = [a K-1 , a K-2,…,a0,0,…,0]. The initial value of the information index number k = K - 1 points to the first information bit a0 in u, and the initial value of the sub-channel index number i = N - 1 is set to point to the last bit in u. Based on the information index number k and the information and frozen bit indication F, the logical code for updating the information and frozen bit sequence, as shown in FIG. 6, when k ≥ 0 and F = 1, u i = u k , k = k - 1, i = i - 1, and in other cases, u i = 0, i = i - 1, and the above steps are repeated N times. When i = 0, the update of the information and frozen bit sequence is completed to obtain the final information and frozen bit sequence, including but not limited to these steps. Here, N is the number of polarized sub-channels, and its value is a positive integer power of 2. K is the number of information bits, and its value is a positive integer, satisfying K < N. F = 1 indicates that the i-th sub-channel bears an information bit, and F = 0 indicates that the i-th sub-channel bears a frozen bit. Example 18

[0139] The information bit sequence a = [a0, a1, …, a K-1 is set in reverse order in the last K bits of the information and frozen bit sequence. The initialized information and frozen bit sequence is u = [u0, u1, …, u N-1 = [0, …, 0, a K-1 , a K-2 , …, a0]. The initial value of the information index number k = N - K is set to point to the last information bit a K-1 in u, and the initial value of the sub-channel index number i = 0 is set to point to the first bit in u. Based on the information index number k and the information and frozen bit indication F, the logical code for updating the information and frozen bit sequence, as shown in FIG. 7, when k ≤ N - 1 and F = 1, u i = u k , k = k + 1, i = i + 1, and in other cases, u ia step where \(=0\) and \(i = i + 1\), and repeating the above step \(N\) times. When \(i = N - 1\), complete the update of the information and the frozen bit sequence to obtain the final information and the frozen bit sequence, including but not limited to these. Here, \(N\) is the number of polarization sub-channels, and its value is a positive integer power of 2. \(K\) is the number of information bits, and its value is a positive integer, satisfying \(K < N\). \(F = 1\) indicates that the \(i\)-th sub-channel bears an information bit, and \(F = 0\) indicates that the \(i\)-th sub-channel bears a frozen bit. Example 19

[0140] The size of the information and the frozen bit sequence is \(N\) bits including the information bits and the frozen bits. The information and the frozen bit sequence are obtained according to the steps provided in any of Examples 14 to 18, including but not limited to these.

[0141] In the embodiments of the present application, after obtaining the information and the frozen bit sequence \(u = [u_0, u_1, \ldots, u\) N-1 , serial-encode the information and the frozen bit sequence \(u = [u_0, u_1, \ldots, u\) N-1 to obtain the encoded data \(d = [d_0, d_1, \ldots, d\) N-1 . Specifically, the intermediate encoded bits of each stage are stored in the storage space of the information and the frozen bit sequence. In each stage, 2 bits are calculated in one group, and the encoding process is calculated serially in Stages 0, 1, \(\ldots\), Stage \(n - 1\). In this way, by using the storage space of the information and the frozen bit sequence to store the intermediate encoded bits of each stage, the storage overhead can be reduced.

[0142] For example, the information and frozen bit sequences are processed in ascending order of sub-channel index numbers. A specific processing process may include processing in ascending order of sub-channel index numbers, calculating two bits in a group in each stage, storing the intermediate coded bits of each stage in a storage space for the information and frozen bit sequences, and performing the coding process serially in Stage 0, Stage 1, ..., Stage-1.

[0143] Illustratively, the information and frozen bit sequence u=[u0,u1,...,u N-1 ] to obtain coded data, as shown in FIG. 8, includes the steps of processing the subchannel index numbers i=0, 2, 4, ..., N-2 in ascending order, the steps of calculating two bits at the positions of the subchannel index numbers k0 and k1 in one group at each stage, and the steps of calculating one intermediate coded bit (u k0 +u k1 ) mod 2 at the k0th position of the information and frozen bit sequence u, where j=0, 1, 2, ..., n-1, and the encoding process is calculated serially in Stage 0, Stage 1, ..., Stage n-1, where j represents the polar encoding stage index number.

[0144] where u=[u0,u1,…,u N-1 ] is the information and frozen bit sequence output in step S210, i is the subchannel index number, and i is in binary form i=B n-1 B n-2 …B j+1 B j B j-1 ...B2B1B0, where B0 is the least significant bit and mod2 means modulo 2. k0 is a decimal number obtained by exchanging the jth bit of i with the least significant bit, and k1 is a decimal number obtained by exchanging the jth bit of i+1 with the least significant bit. In one example, i is an even number, B0=0, and i=B n-1 B n-2 …B j+1 Bj B j-1 …jth bit B of B2B1B0 j is exchanged with the least significant bit B0, so k0=B n-1 B n-2 …B j+1 B0B j-1 …B2B1B j In one example, i=10d=1010b, j=3, and swap the j-th bit of i with the least significant bit to get k0=0011b=3d. In one example, if i is even, then i+1=B n-1 B n-2 …B j+1 B j B j-1 ...The least significant bit of B2B1B0 is B0=1, and i+1=B n-1 B n-2 …B j+1 B j B j-1 …jth bit B of B2B1B0 j is exchanged with the least significant bit B0, and k1=B n-1 B n-2 …B j+1 B0B j-1 …B2B1B j In one example, i+1=1011b=11d, j=3, and swap the j-th bit of i+1 with the least significant bit to get k1=1011b=11d. Example 20

[0145] For example, the information and frozen bit sequences are processed in descending order of subchannel index numbers. A specific processing process may include processing in descending order of subchannel index numbers, calculating two bits in a group in each stage, and storing the intermediate coded bits of each stage in the storage space for the information and frozen bit sequences. The coding process is performed serially from Stage 0, Stage 1, ..., Stage n-1.

[0146] Illustratively, the information and frozen bit sequence u=[u0,u1,...,u N-1] to obtain coded data, as shown in Figure 9, involves the steps of processing the subchannel numbers i=N-2, N-4, N-6, ..., 0 in ascending order, the steps of calculating two bits at the positions of the subchannel index numbers k0 and k1 in one group at each stage, and the steps of calculating one intermediate coded bit (u k0 +u k1 ) mod 2 at the k0-th position of the information and frozen bit sequence u. In one example, the encoding process is calculated serially in Stage 0, Stage 1, ..., Stage n-1, based on j=0, 1, 2, ..., n-1, where j represents the polar encoding stage index number.

[0147] where u=[u0,u1,…,u N-1 ] is the information and frozen bit sequence output in step S210, i is the subchannel index number, and i is in binary form i=B n-1 B n-2 …B j+1 B j B j-1 ...B2B1B0, where B0 represents the least significant bit and mod2 means modulo 2. k0 is a decimal number obtained by exchanging the jth bit of i with the least significant bit, and k1 is a decimal number obtained by exchanging the jth bit of i+1 with the least significant bit. Example 21

[0148] Referring to FIG. 10, this example includes the following steps:

[0149] Step S410: The first transmitting node receives an information bit sequence a, where a=[a0, a1, ..., a K-1 ]. Step S420: The first transmitting node determines an information and frozen bit sequence u according to the first coding parameter, the quantization weight value sequence, the reliability threshold, and the information bit sequence a, where u=[u0, u1, ..., u N-1 ]. Step S430: The first transmitting node encodes the information and frozen bit sequence u to obtain encoded data d, where d=[d0, d1, ..., d N-1 ]. Step S440: The first transmission node receives the encoded data d=[d0, d1, ..., d N-1 ] to the second transmission node.

[0150] A data processing method according to a second aspect of the present embodiment is applicable to the second transmission node 120 shown in FIG. 2, and the data processing method includes the steps of receiving an encoded data sequence transmitted by a transmitting side, wherein the encoded data sequence is obtained by encoding an information bit sequence based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain the encoded data sequence, wherein the information bit sequence includes K information bits, where K is an integer greater than 0, the encoded data sequence includes N encoded data, where N is an integer greater than K, and the quantization weight value sequence includes N quantization weight values, where N represents the number of polarization subchannels, and N is less than or equal to the nth power of 2.

[0151] The receiver receives the coded data sequence d=[d0,d1,…,d N-1 ], the coded data sequence d=[d0,d1,…,d N-1 ] to obtain the information and the frozen bit sequence u=[u0,u1,…,u N-1 ] and calculate the information and frozen bit sequence u=[u0,u1,...,u] based on at least one of the first coding parameters, the quantization weight value sequence, and the reliability threshold. N-1 ] into the original information bit sequence a=[a0,a1,…,a K-1 ] to restore it.

[0152] The process of restoring the coded data sequence d to the original information bit sequence a is the inverse process of converting the information bit sequence a into the coded data sequence d. The specific implementation principle can refer to the implementation principle of the data processing method according to the first aspect of the embodiment of the present application, and the description thereof will be omitted here in the embodiment of the present application.

[0153] The encoded data d=[d0,d1,...,d N-1 ] is obtained by, when the first transmission node obtains the information bit sequence a, determining the information and frozen bit sequence u based on the first encoding parameter, the quantization weight value sequence, and the reliability threshold, and further encoding the information and frozen bit sequence.

[0154] Referring to FIG. 11, a third aspect of an embodiment of the present application provides a data processing device, the data processing device comprising: a sub-channel and stage calculation means 210 for outputting a current sub-channel index number and a stage index number; a confidence threshold memory 220 for storing a confidence threshold; a quantization weight value sequence memory 230 for storing a quantization weight value sequence; a sub-channel reliability calculation means 240 for determining a sub-channel reliability value based on the quantization weight value sequence and the sub-channel index number; a reliability comparator 250 for comparing the sub-channel reliability value with a reliability threshold and outputting information and a freeze bit indication according to the comparison result; an information bit index calculation means 260 for outputting an information bit index according to the information bit number, the polarization sub-channel number, and the information and frozen bit indication; a coded bit information memory 270 for receiving and storing an input information bit sequence and determining and storing an information and frozen bit sequence based on the information bit sequence, the information and frozen bit indications; a serial encoder 280 for performing serial encoding based on the information and the frozen bit sequence and outputting an encoded data sequence; The coded bit information memory 270 is further used to store the coded data sequence.

[0155] The data processing device shown in FIG. 12 is a system framework for realizing a data processing method according to a first aspect of the present embodiment. When polar coding is performed using this framework, the information bit positions can be determined by online calculation without directly storing the polar code sequence, thereby reducing the complexity of storage.

[0156] In one example, in the subchannel and stage calculation means 210, the initial value of stage index j is equal to -1, the initial value of subchannel index i is equal to 0, and after i is counted from 0 to N-1, the stage index j is accumulated to 1. In one example, in the subchannel and stage calculation means 210, the initial value of stage index j is equal to -1, the initial value of subchannel index i is equal to N-1, and after i is counted down from N-1 to 0, the stage index j is accumulated to 1. Here, Stage-1 indicates a stage for obtaining information and frozen bit sequence u from information bit sequence a. Stage0, Stage1, ..., Stage-1 indicate stages for obtaining coded data sequence d from information and frozen bit sequence u.

[0157] In one example, the confidence threshold memory 220 stores a confidence threshold w th is stored, and the reliability threshold has a mapping relationship with parameters including, but not limited to, the information bit sequence size K, the number of polarization subchannels N, and the code rate R.

[0158] In one example, the quantization weight value sequence memory 230 stores a quantization weight value sequence β=[β n-1 ,β n-2, ..., β0] data is stored in the quantization weight value sequence memory 230. In one specific example, the quantization weight value sequence memory 230 stores β=[β n-1 ,β n-2 ,…,β0]=[197,165,139,116,98,82,68,58,49,41] is stored.

[0159] In one example, the subchannel reliability calculation means 240 calculates a reliability value w′ of the i-th subchannel based on the subchannel index i and the quantization weight value sequence β. i In one example, n=10, i=5, d=0000000101b, β=[β n-1 ,β n-2 ,…,β0]=[197,165,139,116,98,82,68,58,49,41], then w'5=β2+β0=58+41=99.

[0160] In one example, the reliability comparator 250 calculates the reliability value w' of the i-th subchannel. i and the confidence threshold w th The information and freeze bit indication of the i-th subchannel is determined by comparing the reliability value w' of the i-th subchannel with the information and freeze bit indication of the i-th subchannel. i is the confidence threshold w th If it is greater than or equal to 1, the i-th subchannel bears the information bit, and the reliability value w' of the i-th subchannel i is the confidence threshold w th If it is less than i-th subchannel, it is determined by the rule including, but not limited to, that ith subchannel bears the frozen bit.

[0161] In one example, the information bit index calculation means 260 calculates the position k where the information bit is located. N-1 ]=[0,…,0,a0,a1,…,a K-1 ], initial k = NK, that is, at the position where a0 exists, when i = 0, 1, ..., N-1, k ≦ N-1 and F = 1, u i =u k, k=k+1, i=i+1, otherwise, u i = 0, i = i + 1. F = 1 indicates that the i-th subchannel is an information bit, and F = 0 indicates that the i-th subchannel is a frozen bit.

[0162] In one example, the coded bit information memory 270 stores an information bit sequence a, an information and frozen bit sequence u, and coded data d. In one example, the coded bit information memory 270 initially receives an information bit sequence, and in one specific example, u=[0,...,0,a0,a1,...,a K-1 In one example, stage index j=-1, and after i counts from 0 to N-1, or after i counts down from N-1 to 0, the information and frozen bit sequence u=[u0, u1, ..., u N-1 In one example, the stage index j=n−1, and the coded data d=[d0, d1, ..., d N-1 ] will be output.

[0163] In one example, the serial encoder 280 encodes the information in the coded bit information memory 270 and the frozen bit sequence data to obtain coded data. In one specific example, i is an even subchannel index number, and binary i=B n-1 B n-2 …B j+1 B j B j-1 …B2B10, k0=B n-1 B n-2 …B j+1 0B j-1 …B2B1B j , k1=B n-1 B n-2 …B j+1 1B j-1 …B2B1B j and the serial encoder 280 encodes the information in the coded bit information memory 270 and the frozen bit sequence u=[u0, u1, ..., u N-1 ], whereas u k0 =(uk0 +u k1 ) mod 2. Update data u k0 is written into the k0th location of the coded bit information memory 270.

[0164] In some embodiments of the present application, the disclosed devices and methods may be realized in other ways. For example, the above device embodiments are merely illustrative, and the division of the modules or units is merely a logical functional division. In actual implementation, other division methods are possible, such as combining multiple units or components, integrating them into another device, or ignoring or not implementing some features. Meanwhile, the shown or discussed couplings or direct couplings or communication connections between each other may be indirect couplings or communication connections via some interfaces, devices, or units, and may be in electrical, mechanical, or other forms.

[0165] In addition, the contents of the information interactions and execution processes between the above devices / units are based on the same concept as the method embodiments of the present application, and therefore, the specific functions and technical effects thereof can be specifically referred to in the method embodiments, and therefore, the description thereof will be omitted here.

[0166] Additionally, although the embodiments herein illustrate operations in a particular order in the figures, this should not be construed as requiring that these operations be performed in the particular order or serial order shown, or that all of the operations shown be performed, to achieve desirable results. In certain environments, multitasking and parallel processing may be advantageous.

[0167] Referring to FIG. 12, a fourth aspect of the present embodiment provides an electronic device 900, which includes: at least one processor 910; at least one memory 920 for storing at least one program, including but not limited to: The at least one program, when executed by the at least one processor 910, performs the data processing method described in any of the above embodiments.

[0168] The processor 910 and memory 920 may be connected by a bus or in some other way.

[0169] The processor 910 may employ a central processing unit (CPU). The processor may be another general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc. The general-purpose processor may be a microprocessor, any conventional processor, etc. Alternatively, the processor 910 employs one or more integrated circuits for executing related programs to realize the technical solutions according to the embodiments of the present application.

[0170] The memory 920 is a non-transitory computer-readable storage medium that can be used to store non-transitory software programs or non-transitory computer-executable programs, such as the data processing methods executed by the electronic device described in any of the embodiments of the present application. The processor 910 can implement the data processing methods by executing the non-transitory software programs and instructions stored in the memory 920.

[0171] The memory 920 may include a program storage area capable of storing an operating system, an application program required for at least one function, and a data storage area capable of storing data required for executing the data processing methods described above. Furthermore, the memory 920 may include high-speed random access memory and may further include non-transitory memory, such as at least one magnetic disk memory device, flash memory device, or other non-transitory solid-state memory device. In some embodiments, the memory 920 optionally includes memory configured remotely from the processor 910, which may be connected to the processor 910 via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0172] The non-transitory software programs and instructions necessary to implement the above data processing methods are stored in memory 920 and, when executed by one or more processors 910, perform the data processing methods according to any embodiment of the present application.

[0173] An embodiment of the present application also provides a computer-readable storage medium storing a processor-executable program for, when executed by a processor, implementing the data processing method described in any of the above embodiments.

[0174] The computer storage medium of the embodiments of the present application may employ any combination of one or more computer-readable media. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific (non-exhaustive) examples of computer-readable storage media include an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. As used herein, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in combination with an instruction execution system, apparatus, or device.

[0175] A computer-readable signal medium may include a propagated data signal in baseband or as part of a carrier that bears computer-readable program code. Such propagated data signals may take various forms, including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

[0176] The program code contained in the computer readable medium may be transmitted over any suitable medium, including but not limited to wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0177] Computer program code for carrying out the operations of the present application may be written in one or more programming languages ​​or a combination thereof. Programming languages ​​include object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may run entirely on the user computer, partially on the user computer, as a separate software package, partially on the user computer, partially on a remote computer, or entirely on a remote computer or server. When a remote computer is involved, the remote computer may be connected to the user computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., connected via the Internet using an Internet Service Provider).

[0178] An embodiment of the present application provides a computer program product storing program instructions which, when run on a computer, causes the computer to perform the data processing method described in any of the above embodiments.

[0179] Although several examples of the present application have been specifically described above, the present application is not limited to the above-described embodiments, and a person skilled in the art may make various equivalent modifications or substitutions under common conditions that do not violate the scope of the present application, and all of these equivalent modifications or substitutions are intended to be included within the scope limited by the present application.

Claims

1. 1. A data processing method comprising: obtaining an information bit sequence, the information bit sequence including K information bits, where K is an integer greater than 0; encoding the information bit sequence based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain a coded data sequence, wherein the coded data sequence includes N coded data, where N is an integer greater than K, and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, and N is equal to or less than 2 to the power of n; and transmitting the encoded data sequence.

2. The method of claim 1 , wherein the n quantization weight values ​​in the sequence of quantization weight values ​​are arranged in ascending or descending order.

3. 2. The method of claim 1, wherein the j-th quantization weight value in the quantization weight value sequence represents a quantization weight value corresponding to the j-th bit in the binary form of a subchannel index number, where j is an integer between 0 and (n-1).

4. 4. The method of claim 3, wherein the sum of all quantization weight values ​​in the sequence of quantization weight values ​​is less than a first number that is a positive integer power of two.

5. The method of claim 4 , wherein the first numerical value comprises one of 256, 512, 1024, 2048, or 4096.

6. The sequence of quantization weight values ​​is Pre-setting, or 5. The method of claim 4, wherein the difference between the quantized polarization weight value sequence obtained by the quantized weight value sequence and the polarization weight value sequence is determined by at least one of the constraints that the difference is less than or equal to a second numerical value, which is an integer greater than or equal to 0 and less than or equal to N.

7. The sequence of quantization weight values ​​is β = [96, 81, 68, 57, 48, 40, 34, 28, 24, 20], or β = [197, 165, 139, 116, 98, 82, 68, 58, 49, 41], or β = [389, 327, 275, 231, 194, 163, 137, 115, 97, 82], or β = [780, 656, 552, 464, 390, 328, 276, 232, 195, 164], or β = [51, 43, 36, 30, 25, 21, 18, 15, 13], or β = [101, 85, 71, 60, 50, 42, 35, 30, 25], or β = [206, 173, 145, 122, 102, 86, 73, 61, 51], or β = [480, 404, 340, 286, 240, 202, 170, 143, 120], The method of claim 4 , wherein β represents a sequence of quantization weight values.

8. 2. The method of claim 1, wherein the reliability threshold is obtained from a predetermined mapping relationship based on an index value, the index value being determined based on at least one of a value of K, a value of N, and a value of a code rate R, and the mapping relationship includes at least one of a mapping equation, a mapping table, or a mapping map.

9. The method of claim 8 , wherein the confidence threshold is obtained from the mapping table based on the index value, the index value being determined based on values ​​of K and N.

10. The values ​​of N correspond to two different values ​​of K, namely K1 and K2, and if K1 is smaller than K2, then w Ｋ１，Ｎ But w Ｋ２，Ｎ is greater than the w Ｋ１，Ｎ represents the confidence threshold corresponding to the value of K1 and the value of N, and Ｋ２，Ｎ represents the confidence threshold corresponding to the value of K2 and the value of N, The value of K corresponds to two different values ​​of N, i.e., N1 and N2, and if N1 is smaller than N2, then w Ｋ，Ｎ１ But w Ｋ，Ｎ２ is smaller than the w Ｋ，Ｎ１ represents the confidence threshold corresponding to the value of K and the value of N1, and Ｋ、Ｎ２ 10. The method of claim 9, wherein: represents a confidence threshold corresponding to a value of K and a value of N2.

11. The confidence threshold is:

10. The method of claim 9, wherein the reliability threshold is determined by: calculating subchannel reliability values ​​corresponding to the polarization subchannels based on a quantized weight value sequence β and a subchannel index number i corresponding to each of the polarization subchannels; obtaining a subchannel reliability sequence based on the subchannel reliability values ​​corresponding to the N polarization subchannels; selecting K maximum subchannel reliability values ​​from the subchannel reliability sequence; and selecting a minimum subchannel reliability value from the K maximum subchannel reliability values ​​as the reliability threshold.

12. The method of claim 8 , wherein the confidence threshold is obtained from the mapping table based on the index value, the index value being determined based on a value of K and a value of R.

13. The value of K corresponds to two different values ​​of R, namely R1 and R2, and if R1 is smaller than R2, then w Ｋ，Ｒ１ But w Ｋ，Ｒ２ is greater than the w Ｋ，Ｒ１ represents a confidence threshold corresponding to the value of K and the value of R1, and Ｋ，Ｒ２ The method of claim 12 , wherein: represents a confidence threshold corresponding to a value of K and a value of R2.

14. The confidence threshold is:

13. The method of claim 12, further comprising: determining a value of N based on values ​​of K and R; calculating a subchannel reliability value corresponding to each of the N polarization subchannels based on a quantization weight value sequence β and a subchannel index number i corresponding to each of the N polarization subchannels; obtaining a subchannel reliability sequence based on the subchannel reliability values ​​corresponding to the N polarization subchannels; selecting K maximum subchannel reliability values ​​from the subchannel reliability sequence; selecting a minimum subchannel reliability value from the K maximum subchannel reliability values; and setting the minimum subchannel reliability value as the reliability threshold.

15. The step of encoding the information bit sequence based on at least one of a first encoding parameter, a quantization weight value sequence, and a reliability threshold to obtain a coded data sequence includes: adding frozen bits to the information bit sequence based on at least one of a first coding parameter, a quantization weight value sequence, and a reliability threshold to obtain information and frozen bit sequences, wherein the information and frozen bit sequences include N bits; and encoding the information and the frozen bit sequence to obtain the encoded data sequence.

16. The expression for the information bit sequence is a=[a ０ , a １ , ..., a Ｋ－１ ], and the expression for the information and frozen bit sequence is u=[u ０ , u １ , ..., u Ｎ－１ ], and the information bit sequence and the information and frozen bit sequence are mapped to a mapping relation u ｆ１（ｊ） = a ｆ２（ｊ） 16. The method of claim 15, wherein f1(j)∈{0, 1, ..., N-1}, f2(j)∈{0, 1, ..., K-1}, j=0, 1, ..., K-1.

17. f1 is a function of j and is determined based on f2(j), information and freeze bit indication, and information index number; 17. The method of claim 16, wherein f2 is a function of j, including f(j)=j or f(j)=K-j.

18. the step of adding frozen bits to the information bit sequence based on at least one of a first coding parameter, a quantization weight value sequence, and a reliability threshold to obtain information and frozen bit sequences includes: adding frozen bits to the information bit sequence according to a preset rule to obtain an initial information and frozen bit sequence, wherein the information and frozen bit sequence includes N bits; Traverse the N polarization subchannels in ascending or descending order of subchannel index number, and for the currently traversed polarization subchannel:

16. The method of claim 15, further comprising: determining a subchannel reliability value of a currently traversed polarization subchannel based on the quantized weight value sequence; determining a frozen bit indication corresponding to the currently traversed polarization subchannel based on the reliability threshold and the subchannel reliability value; determining a value of a bit corresponding to the currently traversed polarization subchannel in the information and frozen bit sequence according to the frozen bit indication; and updating the information and frozen bit sequence based on the value of the bit.

19. said step of encoding said information and frozen bit sequence to obtain said encoded data sequence comprises: Obtaining an n-th serial encoder for performing n-th serial encoding, and performing encoding calculations for two bits in the information and frozen bit sequences as one group in each serial calculation, wherein the two bits are represented as the k0th bit and the k1th bit, respectively, where k0 represents a decimal number obtained by exchanging the jth bit of sub-channel i with the least significant bit, k1 represents a decimal number obtained by exchanging the jth bit of sub-channel i+1 with the least significant bit, i∈{0, 2, 4, ..., N-2}, j represents a serial encoding stage, j∈{0, 1, 2, ..., n-1}, and n=log ２ N, and and encoding the information and frozen bit sequence with the n-th order serial encoder to obtain the encoded data sequence.

20. 2. The method of claim 1, wherein the first encoding parameter comprises at least one of an information bit sequence size, a code rate, a number of polarization subchannels, an information index number, a subchannel index number, a polarization encoding stage index number, a number of transport block bits, a number of cyclic redundancy check bits, or a number of parity bits.

21. 1. A data processing method comprising:

1. A data processing method, comprising: receiving a coded data sequence transmitted by a transmitter; wherein the coded data sequence is obtained by encoding an information bit sequence based on at least one of a first coding parameter, a quantization weight value sequence, and a reliability threshold to obtain the coded data sequence; wherein the information bit sequence includes K information bits, where K is an integer greater than 0; the coded data sequence includes N coded data pieces, where N is an integer greater than K; and the quantization weight value sequence includes n quantization weight values, where N represents the number of polarization subchannels, and N is equal to or less than 2 to the power of n.

22. 1. A data processing device, comprising: a confidence threshold memory for storing a confidence threshold; subchannel and stage calculation means for outputting a current subchannel index number and stage index number; a quantization weight value sequence memory for storing a quantization weight value sequence; subchannel reliability calculation means for determining a subchannel reliability value based on the quantization weight value sequence and the subchannel index number; a reliability comparator for comparing the sub-channel reliability value with the reliability threshold and outputting information and a freeze bit indication depending on the comparison result; an information bit index calculation means for outputting an information bit index based on the number of information bits, the number of polarization subchannels, and the information and frozen bit indication; a coded bit information memory for receiving and storing an input information bit sequence and for determining and storing an information and frozen bit sequence based on the information bit sequence and the information and frozen bit indications; a serial encoder for performing serial encoding based on the information and the frozen bit sequence and outputting an encoded data sequence; A data processing apparatus, wherein said coded bit information memory is further used to store said coded data sequence.

23. An electronic device, at least one processor; at least one memory for storing at least one program; An electronic device implementing the data processing method according to any one of claims 1 to 21 when at least one of said programs is executed by at least one of said processors.

24. A computer-readable storage medium storing a processor-executable program that, when executed by a processor, implements the data processing method according to any one of claims 1 to 21.

25. 1. A computer program product comprising: A computer program product comprising a computer program or computer instructions, the computer program or the computer instructions being stored in a computer-readable storage medium, a processor of a computing device reading the computer program or the computer instructions from the computer-readable storage medium, and the processor executing the computer program or the computer instructions to cause the computing device to perform the data processing method of any one of claims 1 to 21.

Images