Method for constructing parity-check concatenated polar codes and apparatus therefor

1. A method for constructing a polar code, the method comprising:

receiving a code length, a message length, and channel information relating to a polarized channel;

generating an information set of indexes and a parity set of indexes with respect to elements of polar codes based on the received code length, the received message length, and the received channel information;

generating a parity node of a parity-check code based on the generated information set of indexes and the generated parity set of indexes, the parity node including a set of elements corresponding to the information set of indexes;

constructing the polar code based on the parity-check code; and

performing an error correction based on the constructed polar code.

2. The method of claim 1 , wherein the generating of the parity set of indexes includes:

generating indexes, each of which corresponds to a Hamming weight that is not greater than a preset Hamming weight, as a frozen set of indexes with respect to elements of the polar codes;

generating indexes, which are selected by a preset scheme among remaining indexes other than indexes generated as the frozen set of indexes, as the parity set of indexes; and

generating indexes other than indexes generated as the parity set of indexes among the remaining indexes, as the information set of indexes.

3. The method of claim 2 , wherein the generating of the indexes as the parity set of indexes includes:

calculating a Bhattacharyya parameter of the polarized channel with respect to the remaining indexes other than indexes generated as the frozen set of indexes; and

generating indexes for an upper scale having a specific number as the parity set of indexes after sorting the calculated Bhattacharyya parameter.

4. The method of claim 1 , wherein the generating of the parity node includes:

finding, from among the information set of indexes, information indexes, each of which is smaller than a corresponding index of the parity set; and

generating a parity node by determining the set of elements included in the respective parity node based on a weight value of the sum of a vector for the corresponding index and a vector for each of the information indexes and a weight value of a vector for each of the information indexes.

5. The method of claim 4 , wherein the generating of the parity node includes:

generating a parity node by determining an information index at a time when a weight value for a logical product of a vector for the corresponding index and a vector for each of the information indexes is less than a weight value for a vector for each of the information indexes, as the set of elements included in a corresponding parity node.

6. The method of claim 1 , further comprising:

calculating a weight value of a binary vector corresponding to each index of the parity set and a weight value of a binary vector corresponding to each index of the information set; and

determining indexes of the information set having a weight value, which is not greater than a highest weight value, from among weight values for the respective indexes of the parity set as a candidate set of indexes,

wherein the generating of the parity node includes:

generating the parity node including elements corresponding to the candidate set of indexes based on the candidate set of indexes and the parity set of indexes.

7. A method for constructing a polar code, the method comprising:

receiving a code length, a message length, and channel information relating to a polarized channel;

generating an information set of indexes and a parity set of indexes with respect to elements of polar codes based on the received code length, the received message length, and the received channel information;

generating a parity-check code based on the generated information set of indexes and the generated parity set of indexes;

constructing a polar code concatenated with the parity-check code; and

performing an error correction based on the constructed polar code.

8. The method of claim 7 , wherein the generating of the parity set of indexes includes:

generating indexes, each of which corresponds to a Hamming weight that is not greater than a preset Hamming weight, as a frozen set of indexes with respect to elements of the polar codes;

generating indexes, which are selected by a preset scheme among remaining indexes other than indexes selected as the frozen set, as the parity set of indexes; and

generating indexes other than indexes generated as the parity set of indexes among the remaining indexes, as the information set of indexes.

9. The method of claim 8 , wherein the generating of the indexes as the parity set of indexes includes:

calculating a Bhattacharyya parameter of the polarized channel with respect to the remaining indexes other than indexes generated as the frozen set of indexes; and

generating indexes for an upper scale having a specific number as the parity set after sorting the calculated Bhattacharyya parameter.

10. The method of claim 7 , wherein the constructing of the polar code includes:

finding, from among the information set of indexes, information indexes, each of which is smaller than a corresponding index of the parity set; and

generating a parity node by determining the set of elements included in the respective parity node based on a weight value of the sum of a vector for the corresponding index and a vector for each of the information indexes and a weight value of a vector for each of the information indexes.

11. The method of claim 7 , further comprising:

calculating a weight value of a binary vector corresponding to each index of the parity set and a weight value of a binary vector corresponding to each index of the information set; and

determining indexes of the information set having a weight value, which is not greater than a highest weight value, from among weight values for the respective indexes of the parity set as a candidate set of indexes,

wherein the constructing of the polar code includes:

constructing the polar code concatenated with the parity-check code by generating a parity node including a set of elements corresponding to the candidate set of indexes based on the candidate set of indexes and the parity set of indexes.

12. A polar code constructing apparatus comprising one or more processors configured to:

receive a code length, a message length, and channel information relating to a polarized channel;

generate an information set of indexes and a parity set of indexes with respect to elements of polar codes based on the received code length, the received message length, and the received channel information; and

generate a parity node of a parity-check code based on the generated information set of indexes and the generated parity set of indexes, the parity node including a set of elements corresponding to the information set of indexes; and

construct a polar code based on the parity-check code such that an error correction is performed based on the constructed polar code.

13. The polar code constructing apparatus of claim 12 , wherein the one or more processors are configured to:

generate indexes, each of which corresponds to a Hamming weight that is not greater than a preset Hamming weight, as a frozen set of indexes with respect to elements of the polar codes,

generate indexes, which are selected by a preset scheme among remaining indexes other than indexes generated as the frozen set of indexes, as the parity set of indexes, and

generate indexes other than indexes generated as the parity set of indexes among the remaining indexes, as the information set of indexes.

14. The polar code constructing apparatus of claim 13 , wherein the one or more processors are configured to:

calculate a Bhattacharyya parameter of the polarized channel with respect to the remaining indexes other than indexes generated as the frozen set of indexes, and

generate indexes for an upper scale having a specific number as the parity set of indexes after sorting the calculated Bhattacharyya parameter.

15. The polar code constructing apparatus of claim 12 , wherein the one or more processors are configured to:

find, from among the information set of indexes, information indexes, each of which is smaller than a corresponding index of the parity set; and

generate a parity node by determining the set of elements included in the respective parity node based on a weight value of the sum of a vector for the corresponding index and a vector for each of the information indexes and a weight value of a vector for each of the information indexes.

16. The polar code constructing apparatus of claim 15 , wherein the one or more processors are configured to generate a parity node by determining an information index at a time when a weight value for a logical product of a vector for the corresponding index and a vector for each index of the information indexes is less than a weight value for a vector for each of the information indexes, as the set of elements included in a corresponding parity node.

17. The polar code constructing apparatus of claim 12 , wherein the one or more processors are further configured to:

calculate a weight value of a binary vector corresponding to each index of the parity set and a weight value of a binary vector corresponding to each index of the information set;

determine indexes of the information set having a weight value, which is not greater than a highest weight value, from among weight values for the respective indexes of the parity set as a candidate set of indexes; and

generate the parity node including elements corresponding to the candidate set of indexes based on the candidate set of indexes and the parity set of indexes.