Information transmission method, electronic device and storage medium

Abstract

Provided in the embodiments of the present application are an information transmission method, an electronic device and a storage medium. The method comprises: a first node sending an encoded code block to a second node, wherein the code block comprises an output bit sequence generated on the basis of an input bit sequence and according to a preset encoding operation. The embodiments of the present application aim to solve the problem in respect of rate matching of fast polar codes by means of a preset encoding operation, so that the decoding efficiency for an encoded code block can be improved, thereby improving the communication quality.

Description

Information transmission method, electronic device and storage medium Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to an information transmission method, electronic device, and storage medium. Background Art

[0002] Polar codes are a high-capacity channel coding method and have become the coding scheme for control channels in fifth-generation mobile communication systems. The Successive Cancellation (SC) algorithm is a commonly used decoding algorithm for polar codes. Its process can be viewed as a depth-first traversal of a binary tree. The number of nodes required to traverse determines the decoding delay. The Fast Successive Cancellation (Fast-SC) algorithm is a fast decoding method for polar codes. The decoding problem of a polar code of length N can be viewed as the decoding of two subcodes of length N². Fast decoding methods exist for specific subcode types. The fast cancellation of specific subcode types in the Fast-SC algorithm can effectively reduce the number of nodes required to traverse, thereby reducing the decoding delay of polar codes. Currently, fast decoding methods for various subcode types have been proposed, such as Rate-0, Repetition (REP), REP-2, Parity Checked Repetition (PCR), Repeated Parity Check (RPC), SPC-2, Single-Parity-Check (SPC), and Rate-1 nodes. However, existing fast polar code encoding methods only consider fast polar code encoding methods with power-of-two code lengths, and do not consider the rate matching issue of fast polar codes, which hinders their application.

[0003] Summary of the Invention

[0004] The embodiments of the present application aim to provide an information transmission method, electronic device, and storage medium to solve the rate matching problem of fast polar codes, thereby improving the coding efficiency of coding code blocks and enhancing communication quality.

[0005] An embodiment of the present application provides an information transmission method, wherein the method includes:

[0006] The first node sends an encoded code block to the second node, where the code block includes an output bit sequence generated according to an input bit sequence according to a preset encoding operation.

[0007] An embodiment of the present application provides an electronic device, wherein the electronic device includes:

[0008] one or more processors;

[0009] a memory for storing one or more programs;

[0010] When the one or more programs are executed by the one or more processors, the one or more processors implement any method described in the embodiments of the present application.

[0011] An embodiment of the present application also provides a computer-readable storage medium, wherein the computer-readable storage medium stores one or more programs, and the one or more programs are executed by one or more processors to implement any method described in the embodiments of the present application.

[0012] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0014] FIG1 is a flow chart of an information transmission method provided in an embodiment of the present application;

[0015] FIG2 is a flow chart of another information transmission method provided in an embodiment of the present application;

[0016] FIG3 is a performance comparison diagram of the polar code encoding operation provided by an embodiment of the present application and other polar code encoding methods;

[0017] FIG4 is a performance comparison diagram of the polar code encoding operation provided by an embodiment of the present application and other polar code encoding methods;

[0018] FIG5 is a schematic structural diagram of an information transmission device provided in an embodiment of the present application;

[0019] FIG6 is a schematic structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0020] It should be understood that the specific implementations described herein are merely used to explain the embodiments of the present application and to limit the embodiments of the present application.

[0021] In the subsequent description, suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the description of this application and have no specific meaning. Therefore, "module", "component" or "unit" can be used interchangeably.

[0022] FIG1 is a flowchart of an information transmission method provided in an embodiment of the present application. The embodiment of the present application is applicable to the transmission of polar code-encoded information. The method can be performed by an information transmission device, which can be implemented by software and / or hardware. Referring to FIG1 , the method provided in an embodiment of the present application specifically includes the following steps:

[0023] Step 110: The first node sends an encoded code block to the second node, where the code block includes an output bit sequence generated according to a preset encoding operation based on the input bit sequence.

[0024] The preset coding operation may be an operation of encoding an input bit sequence into an output bit sequence. The preset coding operation may include a polar code coding mode. The preset coding operation may implement rate matching of the polar code.

[0025] In this embodiment of the present application, the first node may process an input bit sequence into an output bit sequence according to a preset coding operation. The output bit sequence may be a code block generated by polar code encoding. The first node may send the generated code block to the second node.

[0026] In some application embodiments, FIG2 is a flowchart of another information transmission method provided by an embodiment of the present application. Referring to FIG2 , in the embodiment of the present application, an output bit sequence generated according to a preset encoding operation based on an input bit sequence includes:

[0027] Step 210: Determine the mother code length N.

[0028] In the embodiment of the present application, n can be determined based on parameters such as the code length E of the output bit sequence and the number of information bits K of the input bit sequence. The mother code length N=2 n .

[0029] Step 220: Determine the first frozen bit index set

[0030] In the embodiment of the present application, the rate matching method can be determined by parameters such as the mother code length N, the code length E, and the number of information bits K, and the first frozen bit index set can be determined according to the rate matching method. It can be understood that the first frozen bit index set It can be specifically a temporary frozen bit index set

[0031] Step 230: Determine the first temporary information bit quantity K t .

[0032] Specifically, the first temporary information bit number K can be determined t , the first temporary information bit number K t It can be used to construct polar codes. The number of the first temporary information bits K t It can be determined by parameters such as the mother code length N, code length E, and the number of information bits K.

[0033] Step 240: According to the first temporary information bit quantity K t Determine the second frozen bit index set

[0034] In this embodiment of the present application, the first temporary information bit number K t Generate a second frozen bit index set The second frozen bit index set All subcodes in the determined polar code can be rapidly decoded.

[0035] Step 250: According to the first frozen bit index set and a second frozen bit index set Determine the information bit index set of the polar code

[0036] Specifically, the first frozen bit index set and a second frozen bit index set Determine the information bit index set of the polar code

[0037] Step 260: Index the set of information bits of the polar code Polar code encoding is performed on an input bit sequence to generate an output bit sequence.

[0038] In the embodiment of the present application, the information bit index set can be Polar code encoding is performed on an input bit sequence to generate an output bit sequence corresponding to the input bit sequence. Specifically, the polar code encoding process may include obtaining an input bit sequence, performing polar code encoding on the input bit sequence to obtain a bit sequence d, performing sub-block interleaving on the bit sequence d to obtain a bit sequence y, and performing bit selection on the bit sequence y to obtain an output bit sequence.

[0039] In some embodiments of the present invention, according to the first frozen bit index set and a second frozen bit index set Determine the information bit index set of the polar code include:

[0040] Determine the first frozen bit index set and the second frozen bit index set and obtain the information bit index set corresponding to the union

[0041] In the embodiment of the present application, the first frozen bit index set can be determined and the second frozen bit index set The union of The information bit index set can be generated by union

[0042] In some application embodiments, the information bit index set corresponding to the union is obtained. include:

[0043] Information bit index set in, represents all non-negative integers less than N, Represents the first frozen bit index set and the second frozen bit index set The union of .

[0044] Specifically, all non-negative integers less than the mother code length N can be obtained, and the frozen bit index set can be removed from the set consisting of these non-negative integers. and the second frozen bit index set The union of Thus forming a bit index set as the information bit index set

[0045] In some embodiments of the present invention, the first temporary information bit number K is determined. t ,include:

[0046] The rate matching mode is determined according to the mother code length N, the number of information bits K of the input bit sequence, and the sequence length E of the output bit sequence;

[0047] According to the rate matching method, the first temporary information bit number K is determined t .

[0048] In the embodiment of the present application, the rate matching mode can be determined according to the mother code length N, the number of information bits K of the input bit sequence, and the sequence length E of the output bit sequence, and the first temporary information bit number K can be determined by the determined rate matching mode. t The value of .

[0049] In some embodiments of the application, the first temporary information bit number K is determined according to the rate matching method. t , including at least one of the following:

[0050] Rate matching methods include repetition or puncturing, setting the first temporary information bit number K t is the number of information bits K;

[0051] The rate matching method includes truncation, setting the first temporary information bit number K t It is the sum of the difference between the mother code length N and the sequence length E and the number of information bits K.

[0052] In the embodiment of the present application, when it is determined that the rate matching mode is repetition or puncturing, the first temporary information bit number K can be t Set to the number of information bits K, when it is determined that the rate matching mode is truncation, the first temporary information bit number K can be t Set to the sum of the difference between the mother code length N and the sequence length E and the number of information bits K, that is, K t =N-E+K.

[0053] For example, if E is less than N and K / E is less than or equal to 7 / 16, the rate matching mode can be determined to be puncturing; if E is less than N and K / E is greater than 7 / 16, the rate matching mode can be determined to be truncation; if E is greater than or equal to N, the rate matching mode can be determined to be repetition. Accordingly, after the rate matching mode is determined, the number of first temporary information bits K corresponding to different rate matching modes is t The value of can be different. If the rate matching method is puncturing, then K t =K, if the rate matching mode is truncation, then K t =N-E+K, if the rate matching mode is repeat, then K t =K.

[0054] In some application embodiments, determining the mother code length N includes: determining the mother code length N according to the number of information bits K and the sequence length E.

[0055] In the embodiment of the present application, the mother code length N can be determined by the number of information bits K of the input bit sequence and the sequence length E of the output bit sequence. For example, the mother code length N=2 n , where n can be determined by the number of information bits K of the input bit sequence and the sequence length E of the output bit sequence.

[0056] In some exemplary embodiments, for a given parameter n, the value range n min ≤n≤n max and the minimum rate R min, the method for determining the mother code length N may include:

[0057] If and K / E<9 / 16

[0058] else

[0059] endif

[0060] n=max{min{n1,n2,n max},n min};

[0061] N=2 n ;

[0062] That is, if E is less than or equal to And, K / E is less than 9 / 16, then otherwise, You can Parameter n=max{min{n1,n2,n max},n min}.

[0063] In some application embodiments, according to the first temporary information bit number K t Determine the second frozen bit index set include:

[0064] According to the mother code length N, obtain the bit index sequence

[0065] According to the first temporary information bit number K t Get the temporary information bit index set Among them, the temporary information bit index set Bit index sequence The most reliable K t bit index;

[0066] Second frozen bit index set is a bit index sequence Remove the temporary information bit index set The set of remaining bit indices.

[0067] In the embodiment of the present application, a bit index sequence can be generated according to the mother code length N The bit index sequence can be a polarization sequence A subset of can be composed of all elements less than N in the polarization sequence sorted in ascending order of reliability, which can be in the bit index sequence Select the first temporary information bit number K from t The index of the most reliable bits constitutes the temporary information bit index set The bit index sequence can be Remove the temporary information bit index set The set of bit indices remaining after the index of is used as the second frozen bit index set

[0068] Based on the above application embodiment, the method further includes: according to the first temporary information bit number K t Update the temporary information bit index set with the polarization permutation table

[0069] The polarization permutation table consists of three groups of elements, including the number of nominal information bits, the subcode index of the number of information bits to be reduced, and the subcode index of the number of information bits to be increased. The subcodes are obtained by sequentially dividing the mother code according to the same length.

[0070] In the embodiment of the present application, the polarization conversion table can be composed of three groups of elements, including the number of nominal information bits, the subcode index of the number of information bits to be reduced, and the subcode index of the number of information bits to be increased. The subcode can be obtained by dividing the mother code in sequence with the same length, which can be obtained by the first temporary information bit number K t and polarization permutation table for temporary information bit index set to update.

[0071] Based on the above application embodiment, according to the first temporary information bit number K t Update the temporary information bit index set with the polarization permutation table include:

[0072] According to the first temporary information bit number K t determining the number of nominal information bits in the polarization permutation table;

[0073] According to the determined number of nominal information bits, the information bit with the lowest reliability is determined in the corresponding subcode of the number of information bits to be reduced, and the information bit with the lowest reliability is selected from the temporary information bit index set. Remove the index of the information bit with the lowest reliability from ; and

[0074] According to the determined number of nominal information bits, the frozen bit with the highest reliability is determined in the subcode corresponding to the number of information bits to be added, and the temporary information bit index set is added. The index of the frozen bit with the highest reliability is added to .

[0075] Specifically, according to the first temporary information bit number K t Update the temporary information bit index set with the polarization permutation table The process may include: in the polarization permutation table according to the first temporary information bit number K t Determine the number of nominal information bits, for example, by determining the number of first temporary information bits K in the polarization permutation table. t The number of nominal information bits can be used to determine the subcode of the number of information bits to be reduced and the subcode of the number of information bits to be increased associated with the above-mentioned number of nominal information bits, and the information bit with the lowest reliability can be determined within the subcode of the number of bits to be reduced, and the temporary information bit index set can be used to determine the information bit with the lowest reliability. The index of the information bit with the lowest reliability is removed from the temporary information bit index set, and the frozen bit with the highest reliability can be determined within the subcode of the number of bits to be increased, and the frozen bit with the highest reliability is added to the temporary information bit index set. In order to realize the temporary information bit index set Updates.

[0076] In some application embodiments, the invention further comprises:

[0077] According to the first frozen bit index set and a second frozen bit index set The second temporary information bit number K is determined by the union of m According to the second temporary bit number K m Update the first temporary information bit number K with the information bit number K t ; According to the updated first temporary information bit number K t Update the second frozen bit index set

[0078] Specifically, the first frozen bit index set can be determined and a second frozen bit index set The second temporary information bit number K can be obtained by dividing the size of the above-mentioned union by the mother code length N. m , we can calculate the number of second temporary information bits K m The comparison result with the number of information bits K is used to calculate the first temporary information bit data K t Update can be performed based on the updated first temporary information bit number K t Update the second frozen bit index set It can be understood that according to the updated first temporary information bit number K tA frozen bit index set can be re-determined as the updated second frozen bit index set According to the first temporary information bit number K t The method of determining a frozen bit index set may be the same as the process in the above embodiment.

[0079] In some exemplary embodiments, the second temporary information bit number K m If the number of the first temporary information bit data K is the same as the number of information bits K, the first temporary information bit data K may not be used. t Update the number of temporary information bits K in the second m When the number of temporary information bits K is different from the number of information bits K, the second temporary information bit number K can be determined. m The difference between the number of information bits K and the first temporary information bit number K t Increase the difference.

[0080] In some embodiments of the present invention, a first frozen bit index set is determined. Include at least one of the following:

[0081] If the sequence length E of the output bit sequence is greater than the mother code length N, the first frozen bit index set is determined. is an empty set;

[0082] Determine the first frozen bit index set based on the ratio of the number of information bits K of the input bit sequence and the sequence length E

[0083] In the embodiment of the present application, the first frozen bit index set can be determined by the number of bits K of the input bit sequence, the sequence length E of the output bit sequence, and the mother code length N. Specifically, when E is greater than N, the first frozen bit index set can be determined. is an empty set, otherwise the first frozen bit index set can be determined based on the ratio of K to E, that is, the value of the rate

[0084] In an exemplary embodiment, when E is less than N and K / E is less than or equal to 7 / 16, for n from 0 to NE-1, the corresponding J(n) is determined, where J(n)=P(i)*(N / 32)+mod(n,N / 32), P(i) is the sub-block interleaver pattern, which can be determined by the sub-block interleaving pattern table, and each J(n) can be added to the first frozen bit index set If E is greater than or equal to 3N / 4, then The integers are added to the first frozen bit index set If E is less than 3N / 4, then change 0 to The integers are added to the first frozen bit index set When E is less than N and K / E is greater than 7 / 16, for n from 0 to N-1, the corresponding J(n) is determined, and each J(n) can be added to the first frozen bit index set.

[0085] Based on the above application embodiment, the method further includes: according to the second temporary information bit number K m Determine whether the fast polar code is compatible with the rate matching mode.

[0086] In the embodiment of the present application, the second temporary information bit number K m Compared with the number of information bits K of the input bit sequence, K m The comparison result with K determines whether the fast polar code is compatible with the rate matching method. For example, m When K is different, the fast polar code is incompatible with the rate matching method. In this case, the first temporary information bit number K needs to be updated. t and a second frozen bit index set Thus, a polar code compatible with the rate matching method is obtained.

[0087] In an exemplary embodiment, a code block encoded with a fast polar code may be transmitted in an information transmission method. The information transmission method may include: a first node sending the encoded code block to a second node.

[0088] In the embodiment of the present application, the first node outputs a bit sequence C0, C1, C2, C3, ..., C K-1 After the fast polar code encoding operation, the rate-matched output bit sequence e0, e1, e2, e3, ..., e E-1 .

[0089] Specifically, the fast polar code encoding operation may include:

[0090] 1. The first node determines the mother code length N, where N = 2 n , the parameter n is determined by parameters such as the sequence length E of the output bit sequence of rate matching and the number of information bits K of the input bit sequence.

[0091] In an exemplary embodiment, the process of determining the mother code length N may include:

[0092] For a given parameter n, the range of values ​​n min ≤n≤n max and the minimum rate R min , the mother code length N can be determined by the following method:

[0093] If and K / E<9 / 16

[0094] else

[0095] endif

[0096] n=max{min{n1,n2,n max},n min};

[0097] N=2 n ;

[0098] 2. Construct a temporary frozen bit index set. The rate matching method required for encoding can be determined based on N, E, and K, and the frozen bit index set can be determined based on the rate matching method adopted. Among them, there are three main rate matching methods: repetition, puncturing and truncation, which can be determined by the relative size relationship between parameters N and E and the rate R = K / E.

[0099] In an exemplary embodiment, if the sequence length E is greater than the mother code length N, the temporarily frozen bit index set is an empty set; otherwise, the temporary frozen bit index set is determined based on the ratio of the number of information bits K and the sequence length E This determination process can be as follows:

[0100] if E <N

[0101] If K / E < 7 / 16, the rate matching method is puncturing.

[0102] for n=0 to NE-1

[0103] end for

[0104] if E≥3N / 4

[0105] else

[0106] end if

[0107] else--Rate matching mode is truncation

[0108] for n=E to N-1

[0109] end for

[0110] end if

[0111] end if

[0112] In the embodiment of the present application, J(n)=P(i)*(N / 32)+mod(n,N / 32), P(i) is a sub-block interleaver pattern, and P(i) can be determined by a sub-block interleaving pattern table.

[0113] 3. Determine the temporary fast polar code construction parameters, where the fast polar code construction parameters may include the mother code length N and the number of temporary information bits K t , K t Determined by the parameters N, E, K and the rate matching mode. When the rate matching mode is repetition or puncturing, it is necessary to construct a frozen bit index that completely contains the temporary frozen bit index set. The number of temporary information bits K t =K; When the rate matching mode is truncation, it is necessary to construct a frozen bit index set that does not contain a temporary frozen bit index set The number of temporary information bits K t =N-E+K. For example:

[0114] if E <N

[0115] If K / E<7 / 16--drilling

[0116] K t =K;

[0117] else--truncate

[0118] K t =N-E+K;

[0119] end if

[0120] else--repeat

[0121] K t =K;

[0122] end if

[0123] 4. According to the number of temporary information bits K t Determine the second frozen bit index set For a given polarization sequence The polarization sequences are arranged in ascending order of reliability, that is, Indicates bit index The reliability of an optional polarization sequence is shown in the following table:

[0124] Table 1 Correspondence between polarization sequence bit index and reliability

[0125] According to the number of temporary information bits K t Determine the second frozen bit index set include:

[0126] First, according to the mother code length N, the polarization sequence Internally determined sequence sequence Can be a polarization sequence A subset of All elements smaller than N are arranged in ascending order of reliability.

[0127] Then, according to the number of temporary information bits K t Get the information bit index set Information bit index set Can be sequenced The most reliable K t bit index.

[0128] Finally, the subcode rate is adjusted according to the polarization permutation table to obtain the second frozen bit index set

[0129] In the embodiment of the present application, the polarization permutation table is composed of three columns of data. The first column is the current number of information bits K, and the second column is the information bit subcode index e. I , the third column is the information bit subcode index e F When N=1024 and the subcode length is fixed at 16, the polarization permutation table P used is 10 As shown in Table 2 below, using this table for rate adjustment can eliminate all subcodes with rates of 5 / 16 and 9 / 16.

[0130] Table 2 Polarization permutation table P for N=1024 10

[0131] Specifically, the subcode rate is adjusted according to the polarization permutation table to obtain the second frozen bit index set The process may include: setting the polarization permutation table P 10 The first column is not greater than K tThe maximum K value is located in the Lth row, and the row range to be executed is from the LDth row to the Lth row, where D is a preset range parameter, usually a positive integer. For each row in the range from the LDth row to the Lth row in the polarization permutation table, first determine the e F Whether the subcode can be quickly decoded, if yes, skip it, otherwise I The information bits in the subcode are adjusted to the eth F In the sub-codes, make the e-th F subcode and the eth I Each subcode becomes a subcode that can be quickly decoded.

[0132] Specific, No. e F The bit index set of subcodes is Q F ={e F ×M,e F ×M+1,…,e F ×M+15}, e I The bit index set of subcodes is Q I ={e I ×M,e I ×M+1,…,e I ×M+15}. e F The information bit index of the subcode is e I The information bit index of the subcode is e F The code rate of each subcode is e I The bit index of the subcode is

[0133] Specifically, if the code rate is R F The e F If the subcode can be decoded quickly, skip the row; otherwise, The least reliable index from the information bit index set Remove from the collection The most reliable index in the information bit index set is added Repeat the index adjustment process until the eth I subcode and the eth F Each subcode is a fast decodable node.

[0134] After completing the subcode rate adjustment, the second frozen bit index set Recorded as That is, the sequence Remove the information bit index set As the second frozen bit index set

[0135] 5. According to the temporary frozen bit index set and a second frozen bit index set Determine the information bit index set of the polar code

[0136] Specifically, determine the temporary frozen bit index set and a second frozen bit index set The union of That is to say The information bit index set in, Represents all non-negative integers less than N, that is, the information bit index set It can be the exclusive union of all non-negative integers less than N The bit index set formed by all bit indexes of Size Can remember K m is the number of second temporary information bits.

[0137] 6. Check whether the polarization code is compatible with the rate matching method

[0138] The second temporary information bit number K m Compare it with the number of information bits K of the input bit sequence to determine whether the current fast polar code is compatible with the rate matching method. Specifically, if K m =K, the current fast polar code is compatible with the rate matching mode; otherwise, the current fast polar code is incompatible with the rate matching mode.

[0139] In the embodiment of the present application, if the rate matching mode is puncturing, the bit index set is temporarily frozen. Should be included in the second frozen bit index set That is, Then K m =K; if the rate matching mode is truncation, the bit index set is temporarily frozen and the second frozen bit index set The intersection of should be an empty set, that is When the parameter K m =K.

[0140] In an exemplary embodiment, a fast polar code with E=992 and K=864 is constructed, and the rate matching mode is truncation. In this case, the mother code length N=1024, and the temporary frozen bit index set The size of the collection At the same time, based on the above application embodiment, it can be known that the number of temporary information bits K t =896, fast polar code (N,K t ) The size of the collection because and The intersection of is an empty set, so The size is but Because K m =K, then the fast polar code (N,K m ) is compatible with the rate matching method.

[0141] 7. Determine that the polar code is incompatible with the rate matching method, and update the construction parameters of the temporary polar code.

[0142] Specifically, if the fast polar code (N,K m ) is compatible with the rate matching method, that is, K m =K, then skip this step; otherwise, in the construction parameter K of the temporary fast polar code t Add an offset based on KK m , and then re-execute the steps of constructing and detecting the temporary fast polar code.

[0143] In an exemplary embodiment, if the fast polar code (N, K m ) is incompatible with the rate matching method, that is, K m ≠K, then the parameter K m Updated to K t =K t +(KK m ). Taking the construction parameter update of the fast polar code with E=864, K=376, rate matching mode as puncturing, and mother code length N=1024 as an example, the information bit index set The size of K m =368. Due to K m ≠K, then the construction parameter K of the temporary fast polar code t =376 updated to K t =376+(376-368)=384.

[0144] 8. Generate polarization change input sequence u=[u0u1u2…u N-1 ]

[0145] Specifically, the sequence u=[u0u1u2…u N-1] belongs to the information bit index set The elements of are set to c=[c0,c1,c2,…,c K-1 ], and the rest of the elements are set to 0. The specific setting process can be done as follows:

[0146] for n=0 to N-1

[0147] if

[0148] u n =c k ;

[0149] k=k+1;

[0150] else

[0151] u n =0;

[0152] end if

[0153] end for

[0154] 9. Polarization change acquisition sequence d = [d0d1d2…d N-1 ]

[0155] Specifically, the sequence d = [d0d1d2…d N-1 ] can be achieved through d=uG N , where G N is the polarization change matrix.

[0156] 10. Sub-block interleaving

[0157] Specifically, for the bit sequence d=[d0d1d2…d N-1 ] performs sub-block interleaving to obtain the sequence y = [y0y1y2…y N-1 ], the specific process of sub-block interleaving can be as follows:

[0158] for n=0 to N-1

[0159] J(n)=P(i)*(N / 32)+mod(n,N / 32);

[0160] y n =d J(n) ;

[0161] endfor

[0162] Among them, y n =d J(n)It can be expressed that the nth element in sequence y is equal to the J(n)th element in sequence d, and the sub-block interleaver pattern P(i) can be shown in the following Table 3:

[0163] Table 3 Sub-block interleaver pattern P(i)

[0164] 11. Bit Selection

[0165] Specifically, the sequence y output by the sub-block interleaver is [y0y1y2…y N-1 ] is written into a circular buffer of length N, and a sequence of length E is obtained, e=[e0,e1,e2,…,e E-1 ], the specific implementation process can be as follows:

[0166] if E≥N

[0167] for k=0 to E-1

[0168] e k =y mod(k,N) ;

[0169] end for

[0170] else

[0171] if K / E≤7 / 16

[0172] for k=0 to E-1

[0173] e k =y k+N-E ;

[0174] end for

[0175] else

[0176] for k=0 to E-1

[0177] e k =y k ;

[0178] end for

[0179] end if

[0180] end if

[0181] In this embodiment of the present application, Table 4 shows the distribution of polar code subcodes for different code lengths and code rates. The subcode length is 16, and all polar codes are constructed using the fast polar code matching encoding operation in this embodiment of the present application. Assuming that only subcodes at rates 5 / 16 and 9 / 16 cannot be fast decoded, Table 4 shows that the fast polar code matching encoding operation in this embodiment of the present application can construct fast polar codes that meet the rate matching scheme, completely eliminating subcodes at rates 5 / 16 and 9 / 16.

[0182] Table 4 Subcode distribution under different code lengths and rates

[0183] Referring to Figures 3 and 4, a performance comparison of the (864, 756) and (864, 376) polar codes under different decoding methods is shown. It can be seen that compared with the 5G NR polar code under the SC decoding algorithm, the performance loss caused by the fast polar code operation proposed in the embodiment of the present application is limited to within 0.1dB. In addition, compared with the 5G NR polar code under the cyclic redundancy check-assisted serial cancellation list (CA-SCL) decoding algorithm, the performance loss caused by the polar code encoding operation proposed in the embodiment of the present application is negligible.

[0184] FIG5 is a schematic diagram of the structure of an information transmission device provided in an embodiment of the present application. The device can execute the information transmission method provided in any embodiment of the present application and has the corresponding functional modules and beneficial effects of the execution method. The device can be implemented by software and / or hardware. As shown in FIG5, the device provided in an embodiment of the present application specifically includes:

[0185] The coding transmission module 301 is configured for a first node to send a coded code block to a second node, wherein the code block includes an output bit sequence generated according to a preset coding operation based on an input bit sequence.

[0186] In some application embodiments, the encoding and transmission module 301 generates an output bit sequence according to a preset encoding operation based on the input bit sequence, including:

[0187] Determine the mother code length N;

[0188] Determine the first frozen bit index set

[0189] Determine the first temporary information bit number K t ;

[0190] According to the first temporary information bit number K t Determine the second frozen bit index set

[0191] According to the first frozen bit index set and the second frozen bit index set Determine the information bit index set of the polar code

[0192] According to the information bit index set of the polar code Perform polar code encoding on the input bit sequence to generate the output bit sequence.

[0193] In some application embodiments, according to the first frozen bit index set and the second frozen bit index set Determine the information bit index set of the polar code include:

[0194] Determine the first frozen bit index set and the second frozen bit index set and obtain the information bit index set corresponding to the union

[0195] In some application embodiments, the information bit index set corresponding to the union is obtained. include:

[0196] The information bit index set in, represents all non-negative integers less than N, represents the union.

[0197] In some embodiments of the present invention, the first temporary information bit number K is determined. t ,include:

[0198] Determining a rate matching mode according to the mother code length N, the number of information bits K of the input bit sequence, and the sequence length E of the output bit sequence;

[0199] According to the rate matching method, the first temporary information bit number K is determined t .

[0200] In some application embodiments, the first temporary information bit number K is determined according to the rate matching method. t , including at least one of the following:

[0201] The rate matching method includes repetition or puncturing, and the number of the first temporary information bits K is set. t is the number of information bits K;

[0202] The rate matching method includes truncation, setting the first temporary information bit number K t is the sum of the difference between the mother code length N and the sequence length E and the number of information bits K.

[0203] In some application embodiments, according to the first temporary information bit number K t Determine the second frozen bit index set include:

[0204] According to the mother code length N, obtain the bit index sequence

[0205] According to the first temporary information bit number K t Get the temporary information bit index set Among them, the temporary information bit index set Bit index sequence The most reliable K t The index is composed of bits;

[0206] The second frozen bit index set is a bit index sequence Remove the temporary information bit index set The set of remaining bit indices.

[0207] In some application embodiments, the invention further comprises:

[0208] According to the first temporary information bit number K t and polarization permutation table to update the temporary information bit index set

[0209] The polarization permutation table is composed of three groups of elements, each of which includes the number of nominal information bits, a subcode index of the number of information bits to be reduced, and a subcode index of the number of information bits to be increased; wherein the subcodes are obtained by sequentially dividing the mother code according to the same length.

[0210] In some application embodiments, according to the first temporary information bit number K t and polarization permutation table to update the temporary information bit index set include:

[0211] According to the first temporary information bit number K t determining the number of the nominal information bits in the polarization permutation table;

[0212] According to the determined number of nominal information bits, in the subcode corresponding to the number of information bits to be reduced, the information bit with the lowest reliability is determined, and the information bit with the lowest reliability is selected from the temporary information bit index set. Remove the index of the information bit with the lowest reliability from ; and

[0213] According to the determined number of nominal information bits, the frozen bit with the highest reliability is determined in the subcode corresponding to the number of information bits to be added, and the frozen bit with the highest reliability is added to the temporary information bit index set. The index of the frozen bit with the highest reliability is added.

[0214] In some application embodiments, the apparatus further includes: and the second frozen bit index set The second temporary information bit number K is determined by the union of m ;

[0215] According to the second temporary bit number K m Update the first temporary information bit quantity K with the information bit quantity K t ;

[0216] According to the updated first temporary information bit number K t Update the second frozen bit index set

[0217] In some application embodiments, a first frozen bit index set is determined within the device. Include at least one of the following:

[0218] If the sequence length E of the output bit sequence is greater than the mother code length N, the first frozen bit index set is determined. is an empty set;

[0219] Determine the first frozen bit index set based on the ratio of the number of information bits K of the input bit sequence to the sequence length E

[0220] In some application embodiments, the apparatus further includes: according to the second temporary information bit number K m Determine whether the fast polar code is compatible with the rate matching mode.

[0221] Figure 6 is a structural diagram of an electronic device provided in an embodiment of the present application, which includes a processor 10 and a memory 11; the number of processors 10 in the electronic device can be one or more, and Figure 6 takes one processor 10 as an example; the processor 10 and the memory 11 in the electronic device can be connected via a bus or other means, and Figure 6 takes the connection via a bus as an example.

[0222] The memory 11 is a computer-readable storage medium that can be used to store software programs, computer executable programs, and modules, such as the module corresponding to the device in the embodiment of the present application (encoding transmission module 301). The processor 10 executes the software programs, instructions, and modules stored in the memory 11 to execute various functional applications and data processing of the electronic device, that is, to implement the above-mentioned information transmission method.

[0223] The memory 11 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and at least one application required for a function; the data storage area may store data created based on the use of the electronic device, etc. In addition, the memory 11 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 11 may further include a memory remotely located relative to the processor 10, and these remote memories may be connected to the electronic device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0224] An embodiment of the present application further provides a storage medium containing computer-executable instructions. When the computer-executable instructions are executed by a computer processor, the computer-executable instructions are used to perform an information transmission method, the method comprising:

[0225] The first node sends an encoded code block to the second node, where the code block includes an output bit sequence generated according to an input bit sequence according to a preset encoding operation.

[0226] Based on the above application embodiment, the step of generating an output bit sequence according to a preset encoding operation based on an input bit sequence includes:

[0227] Determine the mother code length N;

[0228] Determine the first frozen bit index set

[0229] Determine the first temporary information bit number K t ;

[0230] According to the first temporary information bit number K t Determine the second frozen bit index set

[0231] According to the first frozen bit index set and the second frozen bit index set Determine the information bit index set of the polar code

[0232] According to the information bit index set of the polar code Perform polar code encoding on the input bit sequence to generate the output bit sequence.

[0233] Through the above description of the implementation methods, those skilled in the art can clearly understand that the present application can be implemented with the help of software and necessary general-purpose hardware, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as a computer's floppy disk, read-only memory (ROM), random access memory (RAM), flash memory (FLASH), hard disk or optical disk, etc., including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute the information transmission method described in each embodiment of the present application.

[0234] It is worth noting that in the embodiments of the above-mentioned device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application.

[0235] Those skilled in the art will appreciate that all or some of the steps, devices, and functional modules / units in the methods disclosed above may be implemented as software, firmware, hardware, or appropriate combinations thereof.

[0236] In a hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. The corresponding software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or temporary media). As is well known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media includes, but is not limited to, RAM, ROM, Electrically Erasable Programmable Read-Only Memory (EEPROM), flash memory or other memory technology, portable compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those skilled in the art that communication media generally embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0237] The above content describes the preferred embodiments of the present application with reference to the accompanying drawings, and does not limit the scope of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present application should be within the scope of the present application.

Claims

1. An information transmission method, comprising: The first node sends an encoded code block to the second node, where the code block includes an output bit sequence generated according to a preset encoding operation on an input bit sequence.

2. The method according to claim 1, wherein Generating the output bit sequence according to the preset encoding operation on the input bit sequence includes: Determining the mother code length N; Determine the first set of frozen bit indices Determine the number of first temporary information bits K t ; According to the number K of the first temporary information bits t Determine the second set of frozen bit indices According to the first set of frozen bit indices and the second set of frozen bit indices Determine the set of information bit indices of the polar code According to the information bit index set of the polar code Performing polar code encoding on the input bit sequence to generate the output bit sequence.

3. The method according to claim 2, wherein determining an information bit index set of a polar code according to the first frozen bit index set and the second frozen bit index set includes: including: Determine the first set of frozen bit indices associated with the second set of frozen bit indices union, and obtain the set of information bit indices corresponding to the union 4. The method according to claim 3, wherein Obtaining the set of information bit indices corresponding to the union includes: The set of information bit indices Among them, Denote all non-negative integers less than N, Representing the union.

5. The method according to claim 2, wherein Said determination of the number K of first temporary information bits t , comprising: Determining a rate matching method according to the mother code length N, the number of information bits K of the input bit sequence, and the sequence length E of the output bit sequence; Determine the number of first temporary information bits K according to the rate matching method t .

6. The method according to claim 5, wherein Determining a first number of temporary information bits K according to the rate matching method t , including at least one of the following: The rate matching method includes repetition or puncturing, and the number K of the first temporary information bits is set t to be the number K of the information bits; The rate matching method includes truncation, and sets the number K of the first temporary information bits t For the mother The sum of the difference between the code length N and the sequence length E and the number of information bits K.

7. The method according to claim 2, wherein Said according to the number K of the first temporary information bits t Determine the second set of frozen bit indices including: Obtain a bit index sequence according to the length N of the mother code According to the number K of the first temporary information bits t Obtain a set of temporary information bit indices Among them, the set of temporary information bit indices from the bit index sequence The most reliable K t consists of the indices of bits; The second frozen bit index set is the bit index sequence Remove the set of temporary information bit indices The set composed of the remaining bit indices.

8. The method according to claim 7, further comprising: According to the number K of the first temporary information bits t and the polarization permutation table, update the set of temporary information bit indices Wherein, the polarization permutation table is composed of three groups of elements, and the three groups of elements include the number of nominal information bits, the sub-code indices of the information bits to be reduced, and the sub-code indices of the information bits to be increased; wherein, the sub-codes are obtained by sequentially dividing the mother code according to the same length.

9. The method according to claim 8, wherein Updating the set of temporary information bit indices according to the first number of temporary information bits K t and the polarization permutation table includes: Based on the number K of the first temporary information bits t Determine the number of the nominal information bits in the polarization permutation table; According to the determined number of nominal information bits, in the corresponding sub-code with the number of information bits to be reduced, determine the information bit with the lowest reliability, from the set of temporary information bit indices Removing the indices of the information bits with the lowest reliability; and, According to the determined number of nominal information bits, in the sub - code corresponding to the number of information bits to be added, determine the frozen bit with the highest reliability, and add it to the set of temporary information bit indices Adding the indices of the frozen bits with the highest reliability.

10. The method according to claim 2, further comprising: According to the first set of freeze bit indices and the second set of frozen bit indices The union determines the number of second temporary information bits K m ; According to the second temporary bit quantity K m Update the first temporary information bit quantity K according to the information bit quantity K t ; According to the updated number K of first temporary information bits t Update the second set of frozen bit indices 11. According to the method of claim 2, wherein The determination of the first set of frozen bit indices includes at least one of the following: When the sequence length E of the output bit sequence is greater than the mother code length N, determine the first set of frozen bit indices Being an empty set; Determine the first set of frozen bit indices according to the ratio of the number of information bits K to the sequence length E of the input bit sequence 12. The method according to claim 10, further comprising: According to the number K of the second temporary information bits m Determine whether the fast polar code is compatible with the rate matching method.

13. An electronic device, comprising: One or more processors; A memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the information transmission method according to any one of claims 1-12.

14. A computer-readable storage medium storing one or more programs, the one or more programs being executed by one or more processors to implement the information transmission method according to any one of claims 1-12.

Images