Method and device for constructing parity check polarization code, terminal and storage medium

Abstract

The invention relates to the technical field of channel coding and decoding. The invention discloses a parity check polarization code construction method and device, a terminal and a storage medium. The parity check polarization code with error detection capability can be generated. The construction method of the parity check polarization code comprises the following steps: acquiring a polarization code constraint matrix; constructing an information set based on the polarization code constraint matrix, constructing a constraint set based on the polarization code constraint matrix, constructing a frozen set based on the constraint set, and constructing a verification set based on the constraint set; constructing a parity check polarization code based on the information set, the frozen set and the check set; in the decoding process of the parity check polar code, parity check bits in the check set are used as information bits, and check is carried out according to a linear constraint relationship between the parity check bits and the information bits in the information set after decoding, so that effective code words are obtained.

Description

Technical Field

[0001] This application relates to the field of channel coding and decoding technology. More specifically, this application relates to a method, apparatus, terminal, and storage medium for constructing parity-check polar codes. Background Technology

[0002] The traditional method for constructing parity-check polar codes involves determining the information set, the parity set, and the parity check relation to generate the code. However, the parity bits generated by this method are treated as dynamically frozen bits during decoding, and their values ​​depend on the information bits. Consequently, this method renders the parity-check polar code incapable of error detection.

[0003] Therefore, existing technologies still need to be improved and enhanced. Summary of the Invention

[0004] The purpose of this application is to provide a method, apparatus, terminal, and storage medium for constructing a parity-check polar code, which can generate a parity-check polar code with error detection capability. This application is mainly achieved through the following technical solutions: A first aspect of this application provides a method for constructing a parity-check polar code, comprising: Obtain the polar code constraint matrix; An information set is constructed based on the polar code constraint matrix; a constraint set is constructed based on the polar code constraint matrix; a frozen set is constructed based on the constraint set; and a verification set is constructed based on the constraint set. A parity-check polar code is constructed based on the information set, the frozen set, and the check set; In the decoding process of the parity-check polar code, the parity check bits in the parity set are treated as information bits, and after decoding, the parity check bits are checked according to the linear constraint relationship between the parity check bits and the information bits in the information set to obtain a valid codeword.

[0005] According to one embodiment of this application, the steps for obtaining the polar code constraint matrix include: Obtain the parity check matrix of the EBCH code; Obtain the polar code generator matrix; The first preset algorithm is used to calculate and process the parity check matrix of the EBCH code and the polar code generator matrix to obtain the matrix to be processed; The matrix to be processed is subjected to Gaussian elimination to obtain the polar code constraint matrix.

[0006] According to one embodiment of this application, the number of columns containing the rightmost 1 in each row of the polar code constraint matrix is ​​different.

[0007] According to one embodiment of this application, the step of constructing an information set based on the polar code constraint matrix includes: Multiple linear constraint sets are generated based on the polar code constraint matrix to form the polar code encoded bit sequence; The second preset algorithm is used to calculate and process the multiple linear constraint sets to obtain an information superset; The information set is obtained by setting multiple preset bits in the information superset as frozen bits.

[0008] According to one embodiment of this application, the plurality of preset bits are bits corresponding to the plurality of least reliable indices in the information superset.

[0009] According to one embodiment of this application, the step of constructing a constraint set based on the polar code constraint matrix includes: In the polar code constraint matrix, a column of values ​​corresponding to each preset bit is set to zero to obtain the constraint set.

[0010] According to one embodiment of this application, the bit corresponding to the maximum index in each of the linear constraint sets is a constrained bit, and the constrained bit includes a frozen bit and a parity check bit.

[0011] A second aspect of this application provides an apparatus for constructing parity-check polar codes, comprising: The acquisition module is used to obtain the polar code constraint matrix; The first construction module is used to construct an information set based on the polar code constraint matrix, construct a constraint set based on the polar code constraint matrix, construct a frozen set based on the constraint set, and construct a verification set based on the constraint set. The second construction module is used to construct a parity-check polar code based on the information set, the frozen set, and the check set; during the decoding process of the parity-check polar code, the parity-check bits in the check set are treated as information bits, and after decoding, the parity-check bits are checked according to the linear constraint relationship between the parity-check bits and the information bits in the information set to obtain a valid codeword.

[0012] A third aspect of this application provides a terminal device, including a processor and a memory, the memory being used to store a computer program, and the processor being used to call and run the computer program stored in the memory to execute the steps of the parity check polar code construction method provided in the first aspect of this application.

[0013] A fourth aspect of this application provides a computer-readable storage medium for storing a computer program that causes a computer to perform the steps of the parity-check polar code construction method provided in the first aspect of this application.

[0014] The beneficial effects of the embodiments of this application include: This application embodiment obtains a polar code constraint matrix; constructs an information set based on the polar code constraint matrix, a constraint set based on the polar code constraint matrix, a frozen set based on the constraint set, and a check set based on the constraint set; constructs a parity-check polar code based on the information set, the frozen set, and the check set; during the decoding process of the parity-check polar code, the parity bits in the check set are treated as information bits, and after decoding, a check is performed based on the linear constraint relationship between the parity bits and the information bits in the information set to obtain a valid codeword. Compared with the prior art that treats parity bits as dynamically frozen bits during the decoding process, this application embodiment constructs a parity-check polar code, and during the decoding process of the parity-check polar code, treats the parity bits in the check set as information bits, and performs a check based on the linear constraint relationship between the parity bits and the information bits in the information set after decoding. This check process enables the parity-check polar code to have error detection capability and improves the error correction performance of the parity-check polar code. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of this application or the conventional technology, the drawings used in the description of the embodiments or the conventional technology will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 The flowcharts for constructing the parity-check polar code of this application are shown in some embodiments. Figure 2 This is a reference figure comparing the block error rate and false detection rate of the parity check polar code and the CRC concatenated polar code of this application when the code dimension is 32 and 48, respectively. Figure 3 The diagram below shows the principle block diagram of the device for constructing the parity-check polar code of this application in some embodiments. Figure 4 This is a schematic block diagram of the terminal device of this application in some embodiments. Detailed Implementation

[0017] To make the above-mentioned objectives, features, and advantages of this application more apparent and understandable, the specific embodiments of this application are described in detail below with reference to the accompanying drawings. Many specific details are set forth in the following description to provide a thorough understanding of this application. However, this application can be implemented in many other ways different from those described herein, and those skilled in the art can make similar modifications without departing from the spirit of this application. Therefore, this application is not limited to the specific embodiments disclosed below.

[0018] It should be noted that the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0019] The terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or illustration. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0020] The terms “comprising,” “including,” or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, system, product, or apparatus that includes a series of steps or units is not necessarily limited to those steps or units that are expressly listed, but may include other steps or units that are not expressly listed or that are inherent to such process, method, product, or apparatus.

[0021] Unless otherwise defined, all technical and scientific terms used in this application have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The term "and / or" as used in this application includes any and all combinations of one or more of the associated listed items.

[0022] The specific embodiments of this application will be further described below with reference to the accompanying drawings.

[0023] refer to Figure 1 The diagram shown is a flowchart of a method for constructing a parity-check polar code according to a first aspect of an embodiment of this application. Figure 1 The method for constructing the parity-check polar code includes: S1. Obtain the polar code constraint matrix.

[0024] Further, step S1 includes: obtaining the parity check matrix of the EBCH (Extended Bose–Chaudhuri–Hocquenghem) code; obtaining the polar code generator matrix; performing calculations on the parity check matrix of the EBCH code and the polar code generator matrix using a first preset algorithm to obtain a matrix to be processed; and performing Gaussian elimination on the matrix to be processed to obtain the polar code constraint matrix.

[0025] In this embodiment, the EBCH code is set to... ,in, It is the code length of the EBCH code; It is the code dimension of the EBCH code; This is the minimum codeweight of the EBCH code. The parity-check matrix of the EBCH code is set to... .

[0026] Furthermore, the calculation formula for the step of using the first preset algorithm to calculate and process the parity-check matrix of the EBCH code and the polar code generator matrix to obtain the matrix to be processed is as follows: ; in, It is the matrix to be processed; It is the polar code generator matrix; Represents transposition; This symbol represents "defined as" or "equal to".

[0027] The matrix to be processed is a OK A matrix of columns.

[0028] Furthermore, the step of performing Gaussian elimination on the matrix to be processed to obtain the polar code constraint matrix includes the following steps S11, S12 and S13.

[0029] S11. Take the first row of the matrix to be processed as the current processing position.

[0030] S12. The index at the current processing position is not greater than... In this case, the following steps are executed repeatedly: If not all values ​​at the current processing position are 0, then traverse leftwards from the rightmost column of the matrix to be processed until the specified value. In each row of the matrix to be processed, the last occurrence of 1 is selected as the pivot. After determining the pivot, the row corresponding to the pivot is moved to the current processing position through a row swap operation. Then, an elimination operation is performed, using the row where the pivot is located to eliminate non-zero elements in other rows in the same column as the pivot through modulo 2 addition. Finally, the current processing position is modified to the next row.

[0031] S13, the index at the current processing position is greater than In the case of [the above condition], the above loop ends, and the matrix modified by the above loop steps is used as the polar code constraint matrix.

[0032] Steps S11, S12, and S13 belong to the reverse selection strategy. This reverse selection strategy causes the pivot position to move from the bottom right corner of the matrix to the top left, forming a reverse ladder structure.

[0033] Furthermore, after performing Gaussian elimination on the matrix to be processed to obtain the polar code constraint matrix, the number of columns containing the rightmost 1 in each row of the polar code constraint matrix is ​​different from that of the matrix to be processed.

[0034] S2. Construct an information set based on the polar code constraint matrix, construct a constraint set based on the polar code constraint matrix, construct a frozen set based on the constraint set, and construct a verification set based on the constraint set.

[0035] Further, the step of constructing an information set based on the polar code constraint matrix includes: generating multiple linear constraint sets of polar code encoded bit sequences based on the polar code constraint matrix; performing calculation processing on the multiple linear constraint sets using a second preset algorithm to obtain an information superset; setting multiple preset bits in the information superset as frozen bits to obtain the information set.

[0036] Furthermore, the calculation formula for the step of generating multiple linear constraint sets of polar code encoded bit sequences based on the polar code constraint matrix is ​​as follows: ; in, It is the polar code constraint matrix The first in The linear constraint set corresponding to the row is also the first bit of the polar code encoded bit sequence. A set of linear constraints; It is the polar code constraint matrix The first in Line number List; It is the length of the polar code encoded bit sequence; .

[0037] The polar code encoded bit sequence can be expressed as: .

[0038] The polar code encoded bit sequence and the polar code constraint matrix satisfy a first preset condition. The formula for calculating the first preset condition is: .

[0039] Furthermore, under the first preset condition, a polar code encoded bit sequence can be generated. A linear constraint, expressed as: ;in, It is the binary addition symbol.

[0040] Furthermore, the bit corresponding to the maximum index in each of the linear constraint sets is a constrained bit, which includes a frozen bit and a parity check bit.

[0041] Furthermore, a second preset algorithm is used to calculate and process the multiple linear constraint sets to obtain an information superset. The calculation formula for the step is: ; in, The removal symbol for a set; It is the union symbol; It is the symbol for finding the maximum value.

[0042] Furthermore, the information superset must satisfy a second preset condition, the formula for which the second preset condition is calculated is: .

[0043] Furthermore, the multiple preset bits are the bits corresponding to the multiple lowest reliability indices in the information superset. Each element in the information superset has a corresponding reliability assessment value.

[0044] Further, the step of constructing a constraint set based on the polar code constraint matrix includes: setting a column of values ​​corresponding to each preset bit in the polar code constraint matrix to zero, thereby obtaining the constraint set. .

[0045] The step of “setting a column of values ​​corresponding to each preset bit to zero” can be represented as: , It can be understood as the "=" symbol, the "=" in the formula "This can be understood as any line."

[0046] Furthermore, the step of constructing a frozen set based on the constraint set includes: performing calculations on the constraint set using a third preset algorithm to obtain the frozen set.

[0047] Furthermore, the constraint set is processed using a third preset algorithm to obtain the frozen set. The calculation formula for the step is: ; in, It is the union symbol.

[0048] Furthermore, the step of constructing a verification set based on the constraint set includes: performing calculation processing on the constraint set using a fourth preset algorithm to obtain the verification set.

[0049] Furthermore, the constraint set is processed using a fourth preset algorithm to obtain the verification set. The calculation formula for the step is: ; .

[0050] Furthermore, the number of parity bits in a parity-check polar code is .

[0051] S3. Construct a parity-check polar code based on the information set, the frozen set, and the check set; during the decoding process of the parity-check polar code, treat the parity-check bits in the check set as information bits, and perform verification according to the linear constraint relationship between the parity-check bits and the information bits in the information set after decoding to obtain a valid codeword.

[0052] The linear constraint relationship between each parity check bit and the corresponding information bit in the information set is an element of the constraint set.

[0053] The code length of the parity-check polar code can be set to... The parity-check polar code includes Information bits, of which .

[0054] Further, step S3 includes: sequentially filling each bit belonging to the information set, the frozen set, and the check set into the polar code encoded bit sequence to complete the modification of the polar code encoded bit sequence; and performing matrix multiplication on the modified polar code encoded bit sequence and the polar code generator matrix to obtain the codeword of the parity-check polar code.

[0055] Furthermore, matrix multiplication is used to process the modified polar code encoded bit sequence and the polar code generator matrix to obtain the codeword of the parity-check polar code. The calculation formula for the step is: , It is the modified polar code encoded bit sequence.

[0056] Furthermore, the step of "verifying the parity bit according to the linear constraint relationship between the parity bit and the information bits in the information set after decoding to obtain a valid codeword" can be understood as follows: In the final stage of decoding, the decoder at the receiving end performs sequential verification on each candidate path in the decoding list (i.e., the serial cancellation list) according to the linear constraint relationship between the parity bit and the information bits in the information set. Paths that meet the constraint conditions are identified as valid codewords, while paths that do not meet the constraint conditions are identified as invalid codewords. Therefore, the embodiments of this application can ensure error correction performance while possessing reliable error detection capabilities.

[0057] Through the above implementation methods, this application embodiment constructs a parity check polar code. In the decoding process of the parity check polar code, the parity check bits in the check set are treated as information bits. After decoding, the parity check bits are checked according to the linear constraint relationship between the parity check bits and the information bits in the information set. This check process enables the parity check polar code to have error detection capability and improves the error correction performance of the parity check polar code.

[0058] In some implementations, multiple preset bits in the information superset are set as frozen bits to obtain the information set. The calculation formula for the step is: ; in, yes The least reliable index.

[0059] In some implementations, the constraint set It can be expressed as: .

[0060] In some implementations, the method for constructing the parity-check polar code further includes constructing a decoding parity-check matrix.

[0061] The formula for calculating the decoding check matrix is ​​as follows: The formula contains " "This can be understood as any column."

[0062] In some implementations, at the receiving end, a parity-check-assisted SCL (Successive Cancellation List) decoding method is used to decode the parity-check polar code. This method plays a crucial role in the error detection capability of the designed parity-check polar code (which can also be understood as a PC-concatenated polar code). In the final path selection stage of the decoding process, embodiments of this application employ a verification method based on a parity-check matrix, i.e., if and only if the decoded bit sequence... The decoded bit sequence is considered valid only if the third preset condition is met. The decoder at the receiving end selects the path from the list that passes the third preset condition check and has the highest likelihood probability as the output of the parity-check assisted SCL decoding. If no path in the list meets the third preset condition check, the decoding is deemed to have failed.

[0063] The calculation formula for the third preset condition is as follows: .

[0064] In practical applications, the embodiments of this application employ binary phase shift keying modulation in a Gaussian white noise channel, and the application list size... For SCL decoding of 32, the performance of the parity check polar code constructed in this application embodiment and the existing CRC (Cyclic Redundancy Check) concatenated polar code were compared in terms of block error rate and false negative rate. Specifically, the data comparison of the number of check bits and minimum code weight of the parity check polar code constructed in this application embodiment and the CRC concatenated polar code can be found in Table 1.

[0065] Table 1

[0066] Based on Table 1, under different code rates, the minimum code weight of the parity check polar codes constructed in the embodiments of this application is 1.5 times that of the 5G standard CRC concatenated polar codes.

[0067] At high signal-to-noise ratios, the parity-check polar codes of this application outperform the 5G standard CRC concatenated polar codes in both block error rate and false negative rate. For example, regarding code dimensions... At that time, the parity check polar code is based on the EBCH code. The construction improves the minimum code weight from 8 to 12, while maintaining a block error rate of [missing information]. At that time, the gain reached approximately 0.45 dB, and the false negative rate was... At that time, the gain reached approximately 0.2 dB; for code dimension At that time, the parity check polar code is based on the EBCH code. The construction improves the minimum code weight from 4 to 6, while maintaining a block error rate of [missing information]. At that time, the gain reached approximately 0.55 dB, and the false negative rate was... At that time, the gain reached approximately 0.4 dB. For a more detailed comparison of the block error rate and false negative rate performance of the parity-check polar codes at code lengths of 64 and code dimensions of 32 and 48, please refer to [reference needed]. Figure 2 As shown. It should also be noted that the advantages of the parity-check polar code become increasingly significant as the signal-to-noise ratio continues to increase.

[0068] It should also be understood that the decoding algorithm in this embodiment uses the SCL decoding algorithm, which decodes the parity check bits together with the information bits as the information bits to be decoded, generating a decoding list containing multiple candidate paths. After decoding, for each candidate path in the decoding list, the parity check matrix is ​​used to check whether the decoded bit sequence satisfies the linear constraint relationship preset during encoding. From all candidate paths that satisfy the linear constraint relationship, the path with the optimal path metric value is selected as the final decoded output. If no candidate path satisfies the linear constraint relationship, the decoding is determined to have failed and an error indication is returned. This step also implements the error detection function of parity check polar codes.

[0069] refer to Figure 3 The diagram shown is a schematic block diagram of a parity-check polar code construction apparatus provided in the second aspect of an embodiment of this application. Figure 3 In the above, the parity check polar code construction device 100 includes: Module 101 is used to obtain the polar code constraint matrix; The first construction module 102 is used to construct an information set based on the polar code constraint matrix, construct a constraint set based on the polar code constraint matrix, construct a frozen set based on the constraint set, and construct a verification set based on the constraint set. The second construction module 103 is used to construct a parity-check polar code based on the information set, the frozen set, and the check set; during the decoding process of the parity-check polar code, the parity-check bits in the check set are treated as information bits, and after decoding, the parity-check bits are checked according to the linear constraint relationship between the parity-check bits and the information bits in the information set to obtain a valid codeword.

[0070] A third aspect of this application provides a terminal device, the schematic diagram of which is as follows: Figure 4As shown. The terminal device includes a processor, memory, network interface, display screen, and temperature sensor connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The network interface of the terminal device is used for communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a method for constructing parity-check polar codes. The display screen can be a liquid crystal display (LCD) or an e-ink display. The temperature sensor is pre-installed inside the terminal device to detect the operating temperature of the internal components.

[0071] Those skilled in the art will understand that Figure 4 The schematic diagram shown is only a partial structural diagram related to the present invention and does not constitute a limitation on the terminal device to which the present invention is applied. The specific terminal device may include more or fewer components than shown in the figure, or combine certain components, or have different component arrangements.

[0072] In some embodiments, this application provides a terminal device, which includes a processor and a memory. The memory stores a parity check polar code construction program, and the processor calls and runs the parity check polar code construction program stored in the memory. When the processor executes the parity check polar code construction program, it implements the following operation instructions: Obtain the polar code constraint matrix; An information set is constructed based on the polar code constraint matrix; a constraint set is constructed based on the polar code constraint matrix; a frozen set is constructed based on the constraint set; and a verification set is constructed based on the constraint set. A parity-check polar code is constructed based on the information set, the frozen set, and the check set; In the decoding process of the parity-check polar code, the parity check bits in the parity set are treated as information bits, and after decoding, the parity check bits are checked according to the linear constraint relationship between the parity check bits and the information bits in the information set to obtain a valid codeword.

[0073] A fourth aspect of this application provides a computer-readable storage medium for storing a computer program that causes a computer to perform the steps of the parity-check polar code construction method provided in the first aspect of this application.

[0074] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided by this invention can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0075] The technical features of the above embodiments can be combined without changing the basic principles of this application. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0076] The above embodiments merely illustrate several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the patent protection scope of this application should be determined by the appended claims.

Claims

1. A method for constructing a parity-check polar code, characterized in that, include: Obtain the polar code constraint matrix; An information set is constructed based on the polar code constraint matrix; a constraint set is constructed based on the polar code constraint matrix; a frozen set is constructed based on the constraint set; and a verification set is constructed based on the constraint set. A parity-check polar code is constructed based on the information set, the frozen set, and the check set; In the decoding process of the parity-check polar code, the parity check bits in the parity check set are treated as information bits, and after decoding, the parity check bits are checked according to the linear constraint relationship between the parity check bits and the information bits in the information set to obtain a valid codeword.

2. The method for constructing parity-check polar codes according to claim 1, characterized in that, The steps to obtain the polar code constraint matrix include: Obtain the parity check matrix of the EBCH code; Obtain the polar code generator matrix; The first preset algorithm is used to calculate and process the parity check matrix of the EBCH code and the polar code generator matrix to obtain the matrix to be processed; The matrix to be processed is subjected to Gaussian elimination to obtain the polar code constraint matrix.

3. The method for constructing parity-check polar codes according to claim 2, characterized in that, In the polar code constraint matrix, the column number of the rightmost 1 in each row is different.

4. The method for constructing parity-check polar codes according to claim 1, characterized in that, The steps for constructing an information set based on the polar code constraint matrix include: Multiple linear constraint sets are generated based on the polar code constraint matrix to form the polar code encoded bit sequence; The second preset algorithm is used to calculate and process the multiple linear constraint sets to obtain an information superset; The information set is obtained by setting multiple preset bits in the information superset as frozen bits.

5. The method for constructing parity-check polar codes according to claim 4, characterized in that, The multiple preset bits are the bits corresponding to the multiple least reliable indices in the information superset.

6. The method for constructing parity-check polar codes according to claim 4, characterized in that, The steps for constructing a constraint set based on the polar code constraint matrix include: In the polar code constraint matrix, a column of values ​​corresponding to each preset bit is set to zero to obtain the constraint set.

7. The method for constructing parity-check polar codes according to claim 4, characterized in that, The bit corresponding to the maximum index in each of the linear constraint sets is the constrained bit, which includes frozen bits and parity bits.

8. A device for constructing a parity-check polar code, characterized in that, include: The acquisition module is used to obtain the polar code constraint matrix; The first construction module is used to construct an information set based on the polar code constraint matrix, construct a constraint set based on the polar code constraint matrix, construct a frozen set based on the constraint set, and construct a verification set based on the constraint set. The second construction module is used to construct a parity-check polar code based on the information set, the frozen set, and the check set. In the decoding process of the parity-check polar code, the parity check bits in the parity check set are treated as information bits, and after decoding, the parity check bits are checked according to the linear constraint relationship between the parity check bits and the information bits in the information set to obtain a valid codeword.

9. A terminal device, characterized in that, include: A processor and a memory for storing a computer program, the processor for calling and running the computer program stored in the memory to perform the steps of the method for constructing a parity-check polar code as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, Used to store a computer program that causes a computer to perform the steps of the method for constructing parity-check polar codes according to any one of claims 1 to 7.

Images