Patent Description:
In a communication system, channel encoding is generally used to improve reliability of data transmission and ensure communication quality. A Polar code (Polar Code, abbreviated as Polar code) is a good code which can achieve Shannon capacity by theoretical proof and has a low encoding and decoding complexity. If the code length is short, the performance of conventional successive cancellation (Successive Cancellation, abbreviated as SC) decoding is worse than performances of a low density parity check code (Low Density Parity Check Code, abbreviated as LDPC code) and a Turbo Code. In a case of decoding with list codes, the performance of the Polar code with medium code length is better than performances of the LDPC code or the Turbo Code.

The Polar code is a linear block code, and the generator matrix thereof is GN. The process of Polar code encoding is <MAT> , where <MAT> is an output bit after encoding, <MAT> is an input bit before encoding, GN = BNF⊗n. The code length N = <NUM>n, and n ≥ <NUM>. BN is a transposed matrix such as a bit reversal matrix. F⊗n is a Kronecker power (Kronecker power) of F, which is defined as F⊗n = F⊗ F⊗n-<NUM> , where <MAT>.

The Polar code may be represented as (N, K, A, u Ac ) with a coset code, and the encoding process is <MAT>. A is an information bit index set. GN(A) is a submatrix obtained from a row, which corresponds to the index in the set A, in GN. GN(Ac) is a submatrix obtained from a row, which corresponds to the index in the set Ac, in GN. uAc is Frozen bits the number of which is (N-K), with N being the code length and K being the length of information bits. For simplicity, the Frozen bit may be set to <NUM>, and in this case, the above encoding process is briefly described as <MAT>.

In the conventional technology, a Polar code with a code length being N and a code rate being R<NUM> is represented as (N, K<NUM>, A<NUM>), , a second Polar code with a code length being N and a code rate being R<NUM> is represented as (N, K<NUM>, A<NUM>), , and a Polar code with a code length being N and a code rate being R<NUM> is represented as (N , K<NUM> , A<NUM>),. Polar codes with a same code length and different code rates are represented differently. For example, a first Polar code with the code length being <NUM> and the number of information bits being <NUM> is represented as (<NUM>, <NUM>, A<NUM>), where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. A second Polar code with the code length being <NUM> and the number of information bits being <NUM> is represented as (<NUM>, <NUM>, A<NUM>), where A<NUM> is a subset including <NUM> elements of the set {<NUM>, <NUM>, <NUM>,. A<NUM> and A<NUM> include a large number of same elements. However, in the conventional technology, the first Polar code and the second Polar code need to be represented by A<NUM> and A<NUM> respectively, which causes a high overhead for representing the Polar code conventionally.

<NPL>, discloses a rate-compatible approaches to polar codes: universally capacity achieving rate-compatible polar codes, and punctured polar codes.

<NPL>, discloses rate-compatible LDPC decoder architecture which supports code rates between the rate of the mother code and <NUM>. The rate-<NUM>/<NUM><NUM>-bit Quasi-Cyclic (QC) LDPC codes with dual-diagonal parity check structure is selected from WiMmi standard as the mother code and is punctured using specific puncturing patterns to obtain arbitrary rates, Parallel layered decoding architecture (PLDA) is employed to reduce chip area and improve the throughput.

A method and an apparatus for Polar code encoding are provided according to embodiments of the invention, in which encoding is performed according to representation of Polar codes with a same code length and different code rates based on groups, and the overhead for representing the Polar codes is greatly reduced.

Technical solutions adopted in the embodiments of the invention are as follows.

In a first aspect, a method for Polar code encoding according to claim <NUM> is provided.

In a further aspect, an apparatus for Polar code encoding according to claim <NUM> is provided.

In a further aspect, a computer readable storage medium according to claim <NUM> is provided.

Further aspects are defined in the dependent claims <NUM>-<NUM> and <NUM>-<NUM>.

In order to illustrate the technical solutions according to embodiments of the invention or in the conventional technology more clearly, the drawings to be used in the description of the embodiments or the conventional technology are described briefly hereinafter. Apparently, the drawings in the description are just a few embodiments of the invention, and other drawings may be obtained by those skilled in the art according to those drawings without creative effort.

The technical solutions in embodiments of the invention will be described clearly and completely in conjunction with drawings in the embodiments of the invention hereinafter. Apparently, the described embodiments are just a few rather than all of embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without any creative work will fall within the protection scope of the invention.

It should be noted that, numbers such as <NUM> and <NUM> involved in the embodiments of the invention are only to identify steps of the method, and not to limit the sequence of the numbered steps.

In an aspect, a method for Polar code encoding is provided. As shown in <FIG>, the method may include steps <NUM> to <NUM>.

In <NUM>, each Polar code group in m Polar code groups is represented by a common information bit set, where Polar codes in each Polar code group have a same code length and different code rates and m is greater than or equal to <NUM>.

Exemplarily, multiple Polar codes with a same code length and different code rates may be divided into m Polar code groups, each Polar code group includes one or more Polar codes with different code rates, and information bit sets respectively corresponding to all Polar codes with different code rates in each Polar code group include at least one same element, where m is greater than or equal to <NUM>.

Exemplarily, the code rate of any Polar code is different from each other. In the embodiment of the invention, preferably, Polar codes are divided so that Polar codes with the code rates being close to each other are in a Polar code group. The Polar codes may also be divided by using other division methods, and the method is not limited herein. It is only required that information bit indexes included in the information bit sets corresponding to the Polar codes with different code rates in each group include at least one same information bit index. The information bit set corresponding to the Polar code is an information bit index set that can be used by the Polar code, which may be determined by using the method described in the background, or may be determined by using other methods, and the method is not limited therein. For example, an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. , <NUM>}; an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,.

Exemplarily, the Polar codes in each Polar code group may share an information bit set or a Frozen bit set assigned for the group.

For example, for an i-th Polar code group, the common information bit set assigned for the i-th Polar code group is represented by Ai , and |Ai| = Ksi , where |Ai| and Ksi represent the total number of elements in the common information bit set Ai of the i-th Polar code group, e.g., Ks<NUM> represents the total number of elements in the common information bit set A<NUM> of the first Polar code group, and Ks<NUM> represents the total number of elements in the common information bit set A<NUM> of the second Polar code group.

Each Polar code in any Polar code group may be represented by a common information bit set of the group. The i-th Polar code group is taken as an example for illustration. Each Polar code in the Polar code group may be represented by (N, Kt) , where N is the code length, and Kt represents the first Kt information bit indexes of the common information bit set Ai of the Polar code group. Thus, compared to the conventional technology, overhead for representing Polar codes having a same code length and different code rates is saved.

Exemplarily, the common information bit set A corresponding to the i-th Polar code group may be a union of information bit sets respectively corresponding to all Polar codes with different code rates in the i-th Polar code group, or may be an information bit set corresponding to a Polar code with a certain code rate in the i-th Polar code group, or may be obtained by using other methods, and the method is not limited herein. For example, if the i-th Polar code group has three Polar codes, i.e., a Polar code with a code length of <NUM> and a code rate of <NUM>, a Polar code with a code length of <NUM> and a code rate of <NUM>, and a Polar code with a code length of <NUM> and a code rate of <NUM>, then the common information bit set of the i-th Polar code group may be an information bit set corresponding to a code length of <NUM> and a code rate of <NUM>.

Exemplarily, a recurrence relation is among common information bit sets corresponding to different Polar code groups in the m Polar code groups.

Exemplarily, the recurrence relation may be: <MAT>
where the set Ai is a common information bit set corresponding to the i-th Polar code group, and δAi is a difference set between the set Ai and the set Ai-<NUM>;
or, <MAT>
where the set Ai is a common information bit set corresponding to the i-th Polar code group, the set Aj is a common information bit set corresponding to a j-th Polar code group, ζ Aj is a difference set between the set Ai and the set Aj , and i is not equal to j.

Referring to <FIG>, A<NUM> includes elements of K<NUM>, K<NUM>,. , Ks1, A<NUM> includes elements of Ks<NUM>+<NUM>, Ks<NUM>+<NUM> ,. , Ks<NUM>+s<NUM>, and Am includes elements of Ksm-<NUM>+<NUM> , Ksm-<NUM>+<NUM> ,. , Ksm-<NUM>+sm, where a recurrence relation is among A<NUM> , A<NUM> ,.

For example, the code length N=<NUM>, and A<NUM>, A<NUM>, A<NUM> correspond to common information bit sets of three Polar code groups respectively,
<MAT>
<MAT>
<MAT>
<MAT>
<MAT>
<MAT>
<MAT>.

In <NUM>, an information bit set corresponding to each Polar code in the Polar code group is obtained based on the common information bit set corresponding to the Polar code group.

In a case that Polar codes in each Polar code group share a common information bit set assigned for the group, the information bit set corresponding to any Polar code (N, Kt) in the i-th Polar code group includes the first Kt information bit indexes of the common information bit set Ai of the Polar code group represented by Kt.

In <NUM>, Polar code encoding is performed on information to be encoded based on the information bit set corresponding to each Polar code in the Polar code group.

Exemplarily, if the number of bits of the information to be encoded is K, there is a Polar code with a certain code length and a certain code rate that corresponds to the bits of the information to be encoded, then the information to be encoded is encoded; if the bits of the information to be encoded are changed, there is a Polar code with another code length and another code rate that corresponds to the changed bits of information to be encoded, then the changed information to be encoded may be encoded.

In the method for Polar code encoding which is not claimed, each Polar code group in the m Polar code groups is represented by a common information bit set, where Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>; an information bit set corresponding to each Polar code in the Polar code group is obtained based on the common information bit set corresponding to the Polar code group, and Polar code encoding is performed on the information to be encoded based on the information bit set corresponding to each Polar code in the Polar code group. In this way, encoding is performed according to representation of Polar codes with a same code length and different code rates based on groups, which greatly reduces the overhead for representing the Polar codes and addresses the problem of large overhead for representing the Polar codes in the conventional technology, compared with the case that each Polar code is represented by an independent information bit set.

In the first aspect, a method for Polar code encoding is provided according to an embodiment of the invention. As shown in <FIG>, the method may include steps <NUM> to <NUM>.

In <NUM>, each Polar code group in m Polar code groups is represented by a common Frozen Frozen bit set, where Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>.

Multiple Polar codes with a same code length and different code rates are divided into m Polar code groups, each Polar code group includes one or more Polar codes with different code rates, and Frozen bit sets respectively corresponding to all Polar codes with different code rates in each Polar code group include at least one same element, where m is greater than or equal to <NUM>.

The code rate of any Polar code is different from each other. In the embodiment of the invention, preferably, Polar codes are divided so that Polar codes with the code rates being close to each other are in a Polar code group. The Polar codes may also be divided by using other division methods, and the embodiment of the invention is not limited herein. It is only required that Frozen (Frozen) bit indexes included in the Frozen bit sets corresponding to the Polar codes with different code rates in each Polar code group include at least one same Frozen (Frozen) bit index. The information bit set corresponding to the Polar code is an information bit index set that can be used by the Polar code, which may be determined by using the method described in background, or may be determined by using other methods, and the embodiment of the invention is not limited herein. For example, an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. , <NUM>}; an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of the set {<NUM>, <NUM>, <NUM>,.

The Polar codes in each Polar code group share a Frozen bit set assigned for the group. For example, for an i-th Polar code group, the common information bit set assigned for the i-th Polar code group is represented by <MAT>, and <MAT>, where <MAT>and Ksi represent the total number of elements in the common Frozen bit set <MAT> of the i-th Polar code group.

Each Polar code is represented based on a common Frozen bit set of the group. The i-th Polar code group is taken as an example for illustration. Each Polar code in the Polar code group may be represented by (N, Kt) , where N is the code length, and Kt represents the first (N - Kt) Frozen (Frozen) bit indexes of the common Frozen bit set <MAT> of the group included in the Frozen bit set corresponding to the Polar code. The information bit set A is complementary to the Frozen bit set Ac.

The common Frozen bit set <MAT> corresponding to the i-th Polar code group may be a union of Frozen bit sets respectively corresponding to all Polar codes with different code rates in the i-th Polar code group, or may be a Frozen bit set corresponding to a Polar code with a certain code rate in the i-th Polar code group, or may be obtained by using other methods, and the embodiment of the invention is not limited herein. For example, if the i-th Polar code group has three Polar codes, i.e., a Polar code with a code length of <NUM> and a code rate of <NUM>, a Polar code with a code length of <NUM> and a code rate of <NUM>, and a Polar code with a code length of <NUM> and a code rate of <NUM>, then the common Frozen bit set corresponding to the first Polar code group may be a Frozen bit set corresponding to a code length of <NUM> and a code rate of <NUM>.

A recurrence relation is among common Frozen bit sets corresponding to the m Polar code groups.

For example, the recurrence relation may be: <MAT>
where <MAT> is the common Frozen bit set corresponding to the i-th Polar code group, and <MAT> is a difference set between <MAT> and <MAT>;
or, <MAT>
where <MAT> is a common Frozen bit set corresponding to the i-th Polar code group, <MAT> is a common Frozen bit set corresponding to a j-th Polar code group, <MAT> is a difference set between the set <MAT> and the set <MAT>, and i is not equal to j.

In <NUM>, a Frozen bit set corresponding to each Polar code in the Polar code group is obtained based on the common Frozen bit set corresponding to the Polar code group.

In a case that the Polar codes in each Polar code group share a common Frozen bit set assigned for the group, the Frozen bit set corresponding to any Polar code (N, Kt) in the i-th Polar code group includes the first (N - Kt) Frozen (Frozen) bit indexes of the common Frozen bit set <MAT> of the group.

In <NUM>, Polar code encoding is performed on information to be encoded based on the Frozen bit set corresponding to each Polar code in the Polar code group.

Exemplarily, if the number of bits of the information to be encoded is K, there is a Polar code with a certain code length and a certain code rate that corresponds to the bits of the information, then the information to be encoded is encoded; if the bits of the information to be encoded is changed, there is a Polar code with another code length and another code rate that corresponds to the changed bits of information to be encoded, then the changed information to be encoded may be encoded.

In the method for Polar code encoding according to the embodiment of the invention, each Polar code group in the m Polar code groups is represented by a common Frozen bit set, where the Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>; a Frozen bit set corresponding to each Polar code in the Polar code group is obtained based on the common Frozen bit set corresponding to the Polar code group, and Polar code encoding is performed on the information to be encoded based on the Frozen bit set corresponding to each Polar code in the Polar code group. In this way, encoding is performed according to representation of Polar codes with a same code length and different code rates based on groups, which greatly reduces the overhead for representing the Polar codes and addresses the problem of large overhead for representing the Polar codes in the conventional technology, compared with the case that each Polar code is represented by an independent Frozen Frozen bit set.

In an aspect, an apparatus <NUM> for Polar code encoding is provided which is not part of the claimed invention. The apparatus <NUM> for Polar code encoding may be an independent apparatus, or may be located in an indoor baseband processing unit in a base station. Referring to <FIG>, the apparatus <NUM> for Polar code encoding includes a representing unit <NUM>, an obtaining unit <NUM>, and an encoding unit <NUM>.

The representing unit <NUM> is configured to represent each Polar code group in m Polar code groups by a common information bit set, where Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>.

Exemplarily, the code rate of any Polar code is different from each other. Preferably, Polar codes are divided so that Polar codes with the code rates being close to each other are in a Polar code group. The Polar codes may also be divided by using other division methods. It is only required that information bit indexes included in the information bit sets corresponding to the Polar codes with different code rates in each group include at least one same information bit index. The information bit set corresponding to the Polar code is an information bit index set that can be used by the Polar code, which may be determined by using the method described in background, or may be determined by using other methods, and the embodiment of the invention is not limited therein. For example, an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. , <NUM>}; an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of the set {<NUM>, <NUM>, <NUM>,.

For example, for an i-th Polar code group, the common information bit set assigned for the i-th Polar code group is represented by Ai , and |Ai| = Ksi, where |Ai| and Ksi represent the total number of elements in the common information bit set Ai of the i-th Polar code group, e.g., Ks<NUM> represents the total number of elements in the common information bit set A<NUM> of the first Polar code group, and Ks<NUM> represents the total number of elements in the common information bit set A<NUM> of the second Polar code group.

Each Polar code in any Polar code group may be represented by a common information bit set of the group. The i-th Polar code group is taken as an example for illustration. Each Polar code in the Polar code group may be represented by (N, Kt) , where N is the code length, and Kt represents the first Kt information bit indexes of the common information bit set Ai of the Polar code group. Thus, compared with the conventional technology, overhead for representing the Polar codes with a same code length and different code rates is saved.

Exemplarily, the recurrence relation may be: <MAT>
where the set Ai is a common information bit set corresponding to the i-th Polar code group, and δAi is a difference set between the set Ai and the set Ai-<NUM>;
or, <MAT>
where the set Ai is a common information bit set corresponding to the i-th Polar code group, the set Aj is a common information bit set corresponding to a j-th Polar code group, ζAj is a difference set between the set Ai and the set Aj , and i is not equal to j.

Referring to <FIG>, A<NUM> includes elements of K<NUM>, K<NUM>,. , Ks<NUM>, A<NUM> includes elements of Ks<NUM>+<NUM>, Ks<NUM>+<NUM>,. , Ks<NUM>+s<NUM>, and Am includes elements of Ksm-<NUM>+<NUM>, Ksm-<NUM>+<NUM> ,. , Ksm-<NUM>+sm, where a recurrence relation is among A<NUM> , A<NUM> ,.

The obtaining unit <NUM> is configured to obtain an information bit set corresponding to each Polar code in the Polar code group based on the common information bit set corresponding to the Polar code group.

In a case that the Polar codes in each Polar code group share a common information bit set assigned for the group, the information bit set corresponding to any Polar code (N, Kt) in the i-th Polar code group includes the first Kt information bit indexes of the common information bit set Ai of the Polar code group represented by Kt.

The encoding unit <NUM> is configured to perform Polar code encoding on information to be encoded based on the information bit set corresponding to each Polar code in the Polar code group.

Exemplarily, if the number of bits of the information to be encoded is K, there is a Polar code with a certain code length and a certain code rate that corresponds to the bit of information to be encoded, and then the information to be encoded is encoded; if bits of the information to be encoded is changed, there is a Polar code with another code length and another code rate that corresponds to the changed bits of information to be encoded, and then the changed information to be encoded may be encoded.

In the apparatus <NUM> for Polar code encoding, each Polar code group in the m Polar code groups is represented by a common information bit set, where the Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>; an information bit set corresponding to each Polar code in the Polar code group is obtained based on the common information bit set corresponding to the Polar code group, and Polar code encoding is performed on the information to be encoded based on the information bit set corresponding to each Polar code in the Polar code group. In this way, encoding is performed according to representation of Polar codes with a same code length and different code rates based on groups, which greatly reduces the overhead for representing the Polar codes and addresses the problem of large overhead for representing the Polar codes in the conventional technology, compared with the case that each Polar code is represented by an independent information bit set.

In an aspect, another apparatus <NUM> for Polar code encoding is provided which is not part of the claimed invention.

Referring to <FIG>, the apparatus <NUM> for Polar code encoding includes a storage <NUM> and a processor <NUM>.

The storage <NUM> is configured to store Polar codes.

The processor <NUM> is configured to represent each Polar code group in m Polar code groups by a common information bit set, where Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>;.

obtain an information bit set corresponding to each Polar code in the Polar code group based on the common information bit set corresponding to the Polar code group; and
perform Polar code encoding on information to be encoded based on the information bit set corresponding to each Polar code in the Polar code group.

Exemplarily, the code rate of any Polar code is different from each other. Preferably, Polar codes are divided so that Polar codes with the code rates being close to each other are in a Polar code group. The Polar codes may also be divided by using other division methods, and the method is not limited herein. It is only required that information bit indexes included in the information bit sets corresponding to the Polar codes with different code rates in each group include at least one same information bit index. The information bit set corresponding to the Polar code is an information bit index set that can be used by the Polar code, which may be determined by using the method described in background, or may be determined by using other methods, and the embodiment of the invention is not limited herein. For example, an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. , <NUM>}; an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of the set {<NUM>, <NUM>, <NUM>,.

Each Polar code in any Polar code group may be represented by a common information bit set of the group. The i-th Polar code group is taken as an example for illustration. Each Polar code in the Polar code group may be represented by (N, Kt) , where N is the code length, and Kt represents the first Kt information bit indexes of the common information bit set Ai of the Polar code group. Thus, compared to the conventional technology, overhead for representing Polar codes with a same code length and different code rates is saved.

Exemplarily, the common information bit set A corresponding to the i-th Polar code group may be a union of information bit sets respectively corresponding to all Polar codes with different code rates in the i-th Polar code group, or may be an information bit set corresponding to a Polar code with a certain code rate in the i-th Polar code group, or may be obtained by using other methods, and the embodiment of the invention is not limited herein. For example, if the i-th Polar code group has three Polar codes, i.e., a Polar code with a code length of <NUM> and a code rate of <NUM>, a Polar code with a code length of <NUM> and a code rate of <NUM>, and a Polar code with a code length of <NUM> and a code rate of <NUM>, then the common information bit set of the i-th Polar code group may be an information bit set corresponding to a code length of <NUM> and a code rate of <NUM>.

Exemplarily, the recurrence relation may be: <MAT>
where the set Ai is a common information bit set corresponding to the i-th Polar code group, and δAi is a difference set between the set Ai and the set Ai-<NUM>;
or, <MAT>
where the set Ai is a common information bit set corresponding to the i-th Polar code group, the set Aj is a common information bit set corresponding to a j-th Polar code group, ζAj is a difference set between the set Ai and the set Aj, and i is not equal to j.

Referring to <FIG>, A<NUM> includes elements of K<NUM>, K<NUM>,. , Ks<NUM>, A<NUM> includes elements of Ks<NUM>+<NUM>, Ks<NUM>+<NUM> ,. , Ks<NUM>+s<NUM>, and Am includes elements of Ksm-<NUM>+<NUM>, Ksm-<NUM>+<NUM> ,. , Ksm-<NUM>+sm, where a recurrence relation is among A<NUM> , A<NUM> ,.

In the apparatus <NUM> for Polar code encoding, each Polar code group in the m Polar code groups is represented by a common information bit set, where the Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>; an information bit set corresponding to each Polar code in the Polar code group is obtained based on the common information bit set corresponding to the Polar code group, and Polar code encoding is performed on information to be encoded based on the information bit set corresponding to each Polar code in the Polar code group. In this way, encoding is performed according to representation of Polar codes with a same code length and different code rates based on groups, which greatly reduces the overhead for representing the Polar codes and addresses the problem of large overhead for representing the Polar codes in the conventional technology, compared with the case that each Polar code is represented by an independent information bit set.

In an aspect, an apparatus <NUM> for Polar code encoding is provided according to an embodiment of the invention. The apparatus <NUM> for Polar code encoding may be an independent apparatus, or may be located in an indoor baseband processing unit in a base station. Referring to <FIG>, the apparatus <NUM> for Polar code encoding includes a representing unit <NUM>, an obtaining unit <NUM>, and an encoding unit <NUM>.

The representing unit <NUM> is configured to represent each Polar code group in m Polar code groups by a common Frozen Frozen bit set, where Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>.

Exemplarily, the code rate of any Polar code is different from each other. Preferably, Polar code are divided so that Polar codes with the code rates being close to each other are in a Polar code group. The Polar codes may also be divided by using other division methods, and the embodiment of the invention is not limited herein. It is only required that Frozen (Frozen) bit indexes included in the Frozen bit sets corresponding to the Polar codes with different code rates in each group include at least one same Frozen (Frozen) bit index. The information bit set corresponding to the Polar code is an information bit index set that can be used by the Polar code, which may be determined by using the method described in background, or may be determined by using other methods, and the embodiment of the invention is not limited herein. For example, an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. , <NUM>}; an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of the set {<NUM>, <NUM>, <NUM>,.

The Polar codes in each Polar code group share a Frozen bit set assigned for the group. For example, for an i-th Polar code group, the common information bit set assigned for the i-th Polar code group is represented by <MAT>, and <MAT>, where and Ksi represent the total number of elements in the common Frozen bit set <MAT> of the i-th Polar code group.

Each Polar code is represented based on a common Frozen bit set of the group. The i-th Polar code group is taken as an example for illustration. Each Polar code in the Polar code group may be represented by (N,Kt) , where N is the code length, and Kt represents the first (N - Kt) Frozen (Frozen) bit indexes of the common Frozen bit set <MAT> of the group included in the Frozen bit set corresponding to the Polar code. The information bit set A is complementary to the Frozen bit set Ac.

A recurrence relation is among common Frozen bit sets respectively corresponding to the m Polar code groups.

For example, the recurrence relation may be: <MAT>
where <MAT> is the common Frozen bit set corresponding to the i-th Polar code group, and <MAT> is a difference set between <MAT> and <MAT> ;
or, <MAT>
where <MAT> is a common Frozen bit set corresponding to the i-th Polar code group, <MAT> is a common Frozen bit set corresponding to a j-th Polar code group, <MAT> is a difference set between the set <MAT> and the set <MAT>, and i is not equal to j.

The obtaining unit <NUM> is configured to obtain a Frozen bit set corresponding to each Polar code in the Polar code group based on the Frozen bit set corresponding to the Polar code group.

The encoding unit <NUM> is configured to perform Polar code encoding on information to be encoded based on the Frozen bit set corresponding to each Polar code in the Polar code group.

Exemplarily, if the number of bits of the information to be encoded is K, there is a Polar code with a certain code length and a certain code rate that corresponds to the bits of information to be encoded, and then the information to be encoded is encoded; if the bits of the information to be encoded is changed, there is a Polar code with another code length and another code rate that corresponds to the changed bits of information to be encoded, and then the changed information to be encoded may be encoded.

In the apparatus <NUM> for Polar code encoding according to the embodiment of the invention, each Polar code group in the m Polar code groups is represented by a common Frozen bit set, where the Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>; a Frozen bit set corresponding to each Polar code in the Polar code group is obtained based on the common Frozen bit set corresponding to the Polar code group, and Polar code encoding is performed on the information to be encoded based on the Frozen bit set corresponding to each Polar code in the Polar code group. In this way, encoding is performed according to representation of Polar codes with a same code length and different code rates based on groups, which greatly reduces the overhead for representing the Polar codes and addresses the problem of large overhead for representing the Polar codes in the conventional technology, compared with the case that each Polar code is represented by an independent Frozen Frozen bit set.

In an aspect, another apparatus <NUM> for Polar code encoding is provided according to an embodiment of the invention. Referring to <FIG>, the apparatus <NUM> for Polar code encoding includes a storage <NUM> and a processor <NUM>.

The processor <NUM> is configured to represent each Polar code group in m Polar code groups by a common Frozen Frozen bit set, where Polar codes in each Polar code group have a same code length and different code rates, and m is greater than or equal to <NUM>;.

The code rate of any Polar code is different from each other. In the embodiment of the invention, preferably, Polar codes are divided so that Polar codes with the code rates being close to each other are in a Polar code group. The Polar codes may also be divided by using other division methods, and the embodiment of the invention is not limited herein. It is only required that Frozen (Frozen) bit indexes included in the Frozen bit sets corresponding to the Polar codes with different code rates in each group include at least one same Frozen (Frozen) bit index. The information bit set corresponding to the Polar code is an information bit index set that can be used by the Polar code, which may be determined by using the method described in background, or may be determined by using other methods, and the embodiment of the invention is not limited herein. For example, an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of a set {<NUM>, <NUM>, <NUM>,. , <NUM>}; an information bit set corresponding to a Polar code with the code length being <NUM> and the number of information bits being <NUM> may be A<NUM>, where A<NUM> is a subset including <NUM> elements of the set {<NUM>, <NUM>, <NUM>,.

The Polar codes in each Polar code group share a Frozen bit set assigned for the group. For example, for an i-th Polar code group, the common information bit set assigned for the i-th Polar code group is represented by <MAT>, and <MAT>, where <MAT> and Ksi represent the total number of elements in the common Frozen bit set <MAT> of the i-th Polar code group.

The common Frozen bit set <MAT> corresponding to the i-th Polar code group may be a union of Frozen bit sets corresponding to all Polar codes with different code rates in the i-th Polar code group, or may be a Frozen bit set corresponding to a Polar codes with a certain code rate in the i-th Polar code group, or may be obtained by using other methods, and the embodiment of the invention is not limited herein. For example, if the i-th Polar code group has three Polar codes, i.e., a Polar code with a code length of <NUM> and a code rate of <NUM>, a Polar code with a code length of <NUM> and a code rate of <NUM>, and a Polar code with a code length of <NUM> and a code rate of <NUM>, then the common Frozen bit set corresponding to the first Polar code group may be a Frozen bit set corresponding to a code length of <NUM> and a code rate of <NUM>.

For example, the recurrence relation may be: <MAT>
where <MAT> is a common Frozen bit set corresponding to the i-th Polar code group, and <MAT> is a difference set between <MAT> and <MAT>;
or, <MAT>
where <MAT> is a common Frozen bit set corresponding to the i-th Polar code group, <MAT> is a common Frozen bit set corresponding to a j-th Polar code group, <MAT> is a difference set between the set <MAT> and the set <MAT>, and i is not equal to j.

Those skilled in the art should clearly know that, for convenience and concision of description, for the operation of the systems, apparatuses and units mentioned above, one can refer to corresponding processes in the method embodiments, which is not repeated herein.

It should be understood that, in the embodiments of the invention, the disclosed systems, apparatuses and methods may be implemented in other ways. For example, the device embodiments described above are just exemplary. The units are divided based on logical functions, and may also be divided in other ways in practical implementation. Multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the displayed or discussed couplings, direct couplings or communication connections may be indirect couplings or communication connections through some interfaces, apparatuses or units, which may be electrical, mechanical or in other forms.

The units described as separate components may be or may not be separated physically. The components shown as units may be or may not be physical units, i.e., the units may be located at one place or may be distributed onto multiple network units. All of or part of the units may be selected based on actual needs to achieve the purposes according to the embodiments of the disclosure.

In addition, individual function units according to the embodiments of the disclosure may be integrated in one processing unit, or the units may exist separately, or two or more units may be integrated in one unit. The foregoing integrated units may be realized in a form of hardware, or realized in a form of combination of hardware and software functional units.

Claim 1:
A method for Polar code encoding, comprising:
generating a first common frozen bit index set corresponding to a first Polar code group in m Polar code groups, wherein the m Polar code groups are obtained by dividing multiple polar codes with a same code length and different code rates into the m Polar code groups, each having a common frozen bit set, wherein
Polar codes in the first Polar code group have a same code length and different rates, and m is greater than or equal to two;
obtaining (<NUM>) a frozen bit index set corresponding to a polar code in the first polar code group, from the first common frozen bit index set; and
performing (<NUM>) Polar code encoding of information to be encoded based on the frozen bit index set to generate the Polar code in the first Polar code group.