A decoding method and device of a polar code, a storage medium and a terminal

Abstract

The application discloses a polar code decoding method and device, a storage medium and a terminal, and relates to the technical field of polar code decoding. The method comprises the following steps: dividing a polar code with a length of N into S groups, wherein the polar code in each group is data extracted from the polar code with the length of N according to a preset rule; S is an integer power of 2; and after performing log-likelihood ratio (LLR) calculation on each group of the S groups, joint decoding is performed on the calculation results of each group. The application can reduce the decoding delay.

Description

TECHNICAL FIELD

[0001] The embodiment of the present application relates to, but is not limited to, the field of 5th generation mobile communication (5G) encoding and decoding, and particularly relates to a decoding method and device of a polar code, a storage medium and a terminal. BACKGROUND

[0002] The characteristic of the 5th generation mobile communication (5G) technical standard is low latency and high reliability. The ultra reliable low latency communication (URLLC) application scenario of a new radio (NR) of the 5G requires a user plane latency of 0.5 ms, which is 1 / 20 of the user plane latency of 10 ms required by the 4th generation mobile communication (4G); the enhanced mobile broadband (eMBB) application scenario of the 5G NR requires a user plane latency of 4 ms, which is 2 / 5 of the user plane latency required by the 4G. The polar code can be theoretically proved to reach the Shannon limit when the code length is long enough, and meets the high reliability requirement of the 5G, and the low latency is a challenge for the decoding design of the polar code.

[0003] In the related art, the Success Cancellation (SC) decoding algorithm is used for the decoding of the polar code, and the decoding process is bit serial decoding, which results in a large decoding delay. The enhanced SC decoding algorithm based on the SC algorithm includes Successive Cancellation List decoding (SCL), Successive Cancellation Stack decoding (SCS) and Successive Cancellation Hybrid decoding (SCH), etc. Although these enhanced SC decoding algorithms can reduce the decoding delay to a certain extent, they are still serial decoding algorithms in essence and cannot meet the low latency requirement of the 5G. SUMMARY

[0004] In order to solve the above technical problems, the embodiment of the present application provides a decoding method, device, storage medium and terminal of a polar code, which can overcome the high latency problem of the polar code decoding in the related art.

[0005] The embodiment of the present application provides a decoding method of a polar code, which comprises the following steps:

[0006] The Polar code with the length of N is divided into S groups, and the Polar code in each group is data extracted from the Polar code with the length of N according to a preset rule; S is an integer power of 2;

[0007] After the log-likelihood ratio (LLR) calculation is performed on the Polar code in each group of the S groups, joint decoding is performed on the calculation results of each group.

[0008] The embodiment of the application further provides a decoding system of a Polar code, comprising:

[0009] The control module is used for dividing the Polar code with the length of N into S groups, and the Polar code in each group is data extracted from the Polar code with the length of N according to a preset rule, and the Polar code in each group after the division is distributed to the S calculation modules in turn; S is an integer power of 2.

[0010] Each calculation module is used for performing log-likelihood ratio (LLR) calculation on the received Polar code in each group.

[0011] The decoding module is used for performing joint decoding on the LLR calculation results obtained by each calculation module.

[0012] The embodiment of the application further provides a computer readable and writable storage medium, wherein the medium stores computer executable instructions, and the computer executable instructions are executed by a processor to realize the steps of the decoding method of the Polar code.

[0013] The embodiment of the application further provides a decoding terminal of a Polar code, comprising:

[0014] The memory is used for storing computer executable instructions.

[0015] The processor is used for executing the computer executable instructions to realize the steps of the decoding method of the Polar code.

[0016] Compared with the prior art, the embodiment of the application comprises the following: the Polar code with the length of N is divided into S groups, and the Polar code in each group is data extracted from the Polar code with the length of N according to a preset rule; S is an integer power of 2; after the log-likelihood ratio (LLR) calculation is performed on the Polar code in each group of the S groups, joint decoding is performed on the calculation results of each group. The embodiment of the application can overcome the problem of high latency in the Polar code decoding in the related art.

[0017] Additional features and advantages of the application will be set forth in the description that follows, and in part will be apparent from the description, or can be learned by practice of the application. The objectives and other advantages of the application will be realized and attained by the structure particularly pointed out in the description and claims. BRIEF DESCRIPTION OF DRAWINGS

[0018] The accompanying drawings are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the principles of the application.

[0019] Figure 1 Flow chart of the decoding method of the polar code provided by the embodiment of the application;

[0020] Figure 2 Schematic diagram of the parallel computation of the single code block for the application example of the application;

[0021] Figure 3 Schematic diagram of the parallel computation of the four code blocks for the application example of the application;

[0022] Figure 4 Schematic diagram of the parallel computation of the long code block for the application example of the application;

[0023] Figure 5 Composition module diagram of the decoding system of the polar code provided by the embodiment of the application. DETAILED DESCRIPTION

[0024] In order to make the objects, technical solutions and advantages of the application clearer, the embodiments of the application will be described in detail below with reference to the drawings. It should be explained that, in the case of no conflict, the embodiments and the features in the embodiments in the present application can be combined with each other at will.

[0025] The steps shown in the flow chart of the drawings can be executed in a computer system such as a group of computer executable instructions. And, although the logical order is shown in the flow chart, in some cases, the steps shown or described can be executed in an order different from here.

[0026] The polar code length N refers to the bit number of the polar code to be decoded, and the polar decoding process needs to perform the log-likelihood ratio (LLR) calculation of the left child node, i.e. the f node, on the decoding tree and the LLR calculation of the right child node, i.e. the g node, on the decoding tree. Assuming that A0[i] is the LLR data of the original input, i.e. the node of the 0th layer of the decoding tree, the f node performs the LLR calculation, i.e. updates the LLR of the left child node of the node i of the mth layer of the decoding tree (A lm ), and the calculation formula is as follows:

[0027]

[0028]

[0029] wherein sign() is a sign function; m is the height of the decoding tree, and in the above formula, m is in the range of 1 to log2(N).

[0030] The g node performs LLR calculation, i.e. updates the LLR of the right child node of the mth layer node i on the decoding tree (A rm ), which needs to be updated using the hard decision value B lm fed back by the left child node. The hard decision value B lm is the decoding information determined according to the decoding path, and the calculation formula is as follows:

[0031]

[0032]

[0033] As can be seen from the above calculation formula of the f node, the LLR calculation of the mth layer node i is only related to the fixed LLR data of the (m-1)th layer. As can be seen from the calculation formula of the g node, the LLR calculation of the mth layer node i is only related to the fixed LLR data of the (m-1)th layer and the hard decision value B lm fed back by the left child node. The data required for the LLR calculation of each node is independent, so the s-path f node and g node calculation can be performed in parallel. Here, s is an integer power of 2, and the value is not limited to 1, 2, 4, 8, 16, 32. The larger the value of s, the shorter the decoding delay. Those skilled in the art can determine the value of s according to the actual decoding delay requirement. The s-path parallel calculation formula is as follows:

[0034]

[0035] ...

[0037]

[0038]

[0039]

[0040] ...

[0042]

[0043]

[0044] According to the derivation process, the embodiment of the present application provides a decoding method, system, storage medium and terminal for a Polar code.

[0045] As shown in Figure 1 The embodiment of the present application provides a method for decoding a Polar code, and the method comprises:

[0046] S101 divides a Polar code with a length of N into S groups, and the Polar code in each group is data extracted from the Polar code with the length of N according to a preset rule;

[0047] S is an integer power of 2;

[0048] S102 performs log-likelihood ratio (LLR) calculation on the Polar code in each group of the S groups, and then performs joint decoding on the calculation results of each group.

[0049] The embodiment of the present application divides a long Polar code into groups, separately decodes the data in each group according to the characteristic that there is no coupling relationship between each group, and then performs joint decoding on the decoding results of each group. Compared with the prior art of decoding the entire long Polar code, the decoding delay is reduced.

[0050] In the embodiment, the dividing of the Polar code with the length of N into S groups and the Polar code in each group being data extracted from the Polar code with the length of N according to a preset extraction rule comprises:

[0051] The Polar code with the length of N is divided into S groups, the starting point of each group is one Polar code selected from S continuous Polar codes with the length of N, and the data of each group except the starting point is data obtained by extracting the Polar code with the length of N with S as the step length from the starting point, wherein the length of each group of Polar codes is N / S. For example, when S is 2, the two groups of Polar codes are A0[2i] and A0[2i-1], i=1, 2...N / 2, and the length of each group of Polar codes is N / 2; when S is 4, the four groups of Polar codes are A0[4i], A0[4i-1], A0[4i-2] and A0[4i-3], i=1, 2...N / 4, and the length of each group of Polar codes is N / 4.

[0052] In the embodiment, the method further comprises: dividing the Polar code with the length of N into S groups, and each group of Polar code is data extracted from the Polar code with the length of N according to a preset extraction rule; then dividing each group of Polar code into M groups, and M is an integer power of 2; performing LLR calculation on each group of Polar code in the M groups, and then performing LLR calculation on the M LLR calculation results, and taking the LLR calculation results of the M groups of Polar code as the LLR calculation results of one group of Polar code in the S groups.

[0053] The method further comprises:

[0054] For each group of Polar code with the length of N / S, the group of Polar code is divided into M groups, the starting point of each group in the M groups is one Polar code selected from M continuous Polar codes in the Polar code with the length of N / S, the data of each group in the M groups except the starting point is data obtained by extracting the Polar code with the length of N / S with M as the step length, and the length of each group of Polar code divided into M groups is N / (S*M). For example, a Polar code with the code length of 2048 is divided into 4 groups, the first group of Polar code is {A0[8i], A0[8i-4]}, the second group of Polar code is {A0[8i-1], A0[8i-5]}, the third group of Polar code is {A0[8i-2], A0[8i-6]}, and the fourth group of Polar code is {A0[8i-3], A0[8i-7]}, i=1, 2...256. Then each group of Polar code is divided into 2 groups, after the first group of Polar code is divided into 2 groups, the first group of Polar code is {A0[8i]} and {A0[8i-4]}, after the second group of Polar code is divided into 2 groups, the second group of Polar code is {A0[8i-1]} and {A0[8i-5]}, after the third group of Polar code is divided into 2 groups, the third group of Polar code is {A0[8i-2]} and {A0[8i-6]}, and after the fourth group of Polar code is divided into 2 groups, the fourth group of Polar code is {A0[8i-3]} and {A0[8i-7]}. Taking the first group as an example, the LLR calculation of A0[8i] is completed, and the output 1-way calculation result is cached; the LLR calculation of A0[8i-4] is completed, and the output 1-way calculation result is cached; after the cached 2-way calculation result is subjected to LLR calculation, the output 1-way calculation result is taken as the final result of the first group of LLR calculation. The LLR calculation processes of the other three groups are consistent with the LLR calculation process of the first group, and will not be repeated here.

[0055] In the embodiment of the application, the above LLR calculation on each group of Polar code comprises:

[0056] The LLR calculation on each group of Polar code is performed in parallel.

[0057] The embodiment of the present application serially decodes bits of Polar relative to the prior art, and uses a sample parallel decoding mode to reduce decoding delay.

[0058] The embodiment of the present application is exemplified below with a specific application example.

[0059] Application Example 1

[0060] Suppose that the Polar code block lengths to be decoded are 1024, 256, 256, 256, 256, 1024, 256, 256, 256, 256, 256, and the decoding process is as follows:

[0061] First, configure an LLR calculation unit for LLR calculation of Polar code; four LLR units are configured in this application example, each of which can calculate a 256-length code block; write the LLR data of the Polar code block to be decoded into memory and record the write address; configure decoding parameters, including the LLR write address of each code block, the code length of each code block, and decoding accompanying parameters, including frozen bits, information bits, check bit indication, and information bit number, CRC pattern, etc.

[0062] Second, start decoding and read the above-mentioned decoding parameters.

[0063] Third, decode a Polar code with a code length of 1024, and query whether the four LLR calculation units are available in real time; when the four LLR calculation units are available, the Polar code is divided into four groups and sent to the LLR calculation units for LLR calculation, as shown in the following formula: Figure 2 Figure 2 The fgu unit in the formula is the LLR calculation unit, each group of Polar code is A0[4i], A0[4i-1], A0[4i-2], A0[4i-3], i = 1, 2... 256; each group of Polar code outputs one calculation result after LLR calculation; one calculation result is taken from each LLR calculation unit each time to form four LLR data sequences, and path expansion function is completed according to the accompanying information such as frozen bits, information bits, and check bits; decoding decision is completed according to the output path metric value, and 4-bit decoding data is output, and the decoding tree is updated until the decoding of all data is completed.

[0064] Fourth, decode four Polar codes with a code length of 256, as shown in the following formula: Figure 3 ​As shown, 4 256 code blocks are sent to 4 LLR calculation units respectively, the 4 LLR calculation units work in parallel, and the 4 LLR calculation units output 4 calculation results. For the Polar code with a code length of 256, because the number of frozen bits of each Polar code block is different, the decoding delay will be different, and the time when the decoding of the 4 Polar code blocks with a code length of 256 ends may also be different. When it is found that the next code block has a code length of 1024, the decoding of the Polar code block with a code length of 1024 needs to be started after the LLR calculation of all the Polar code blocks with a code length of 256 is completed.

[0065] In the fifth step, a Polar code with a code length of 1024 is decoded. In the third step, the Polar code is divided into 4 groups and sent to the LLR calculation units for LLR calculation. Each time, one calculation result is taken from each LLR calculation unit to form 4 LLR data sequences, and path expansion is completed according to the accompanying information such as frozen bits, information bits and check bits. Decoding decision is completed according to the output path metric value, and the current 4-bit decoding data is output, and the decoding tree is updated until the decoding of all data is completed.

[0066] In the sixth step, 5 Polar codes with a code length of 256 are decoded, and it is found whether one LLR calculation unit is idle. If one LLR calculation unit is idle, the Polar code is sent to the idle LLR calculation unit for calculation, otherwise the decoding is waited until one LLR calculation unit is idle. As long as one LLR calculation unit completes the calculation, all the calculation results of the calculation unit are taken out, path expansion is completed according to the accompanying information such as frozen bits, information bits and check bits, and the path metric value is output. Decoding decision is completed according to the output path metric value, and the current decoding data is output, and the decoding tree is updated.

[0067] Application Example 2

[0068] It is assumed that the length of the Polar code block to be decoded is 2048, and the decoding process is as follows:

[0069] In the first step, the LLR calculation unit is configured to calculate the LLR of the Polar code. In this application example, 8 LLR units are configured, of which 4 LLR units can calculate the code block with a length of 256, and 4 LLR units can calculate the code block with a length of 2. The LLR data of the Polar code block to be decoded are written into the memory, and the writing address is recorded. The decoding parameters are configured, including the LLR writing address of each code block, the code length of each code block and the decoding accompanying parameters.

[0070] In the second step, the decoding is started, and the decoding parameters configured above are read.

[0071] The third step involves continuously checking whether the four LLR computation units, each with a length of 256, are idle. If they are idle, the data sent to each LLR computation unit is {A0[8i], A0[8i-4]}, {A0[8i-1], A0[8i-5]}, {A0[8i-2], A0[8i-6]}, {A0[8i-3], A0[8i-7]}, i = 1, 2... 256. Otherwise, the process continues until all LLR computation units are idle.

[0072] Taking one LLR calculation unit as an example, assuming that the LLR calculation unit receives data {A0[8i], A0[8i-4]}: First, complete the LLR data calculation for A0[8i], i = 1, 2...256, and cache the output of one calculation result; Second, complete the LLR data calculation for A0[8i-4], i = 1, 2...256, and cache the output of one calculation result; Input the cached two calculation results into an LLR calculation unit with a length of 2, and output the final one calculation result. The calculation process of the other three LLR calculation units with a length of 256 is the same, and will not be described in detail here. Figure 4 As shown;

[0073] The fourth step involves taking one calculation result from each LLR calculation unit of length 2, forming 4 LLR data sequences, and performing path expansion based on the accompanying information such as freeze bits, information bits, and check bits, and outputting the path metric value; performing decoding decision based on the path metric value, outputting the currently decoded 4-bit data, and updating the decoding tree until all data has been decoded.

[0074] For polar code decoding with a length of 2048, the logic in the LLR calculation unit with a length of 2 can be directly reused from the logic in the LLR calculation unit with a length of 256, without setting up a new LLR calculation unit.

[0075] This application also provides a system for decoding Polar codes, such as... Figure 5 As shown, the system includes:

[0076] The control module 501 is used to divide a Polar code of length N into S groups, where each group contains Polar code data extracted from the Polar code of length N according to a preset rule, and to distribute each group of Polar codes to S calculation modules in sequence; where S is an integer power of 2.

[0077] Each computation module 502 is used to perform log-likelihood ratio (LLR) calculation on each received Polar code group;

[0078] The decoding module 503 is used to perform joint decoding on the LLR calculation results obtained from each calculation module.

[0079] The application groups long code blocks of Polar codes, separately decodes each group of data by using the characteristic that there is no coupling relationship between each group, and then jointly decodes the decoding results of each group. Compared with the prior art of decoding Polar of the entire long code block, the decoding delay is reduced.

[0080] As an implementation manner, the control module 501 is configured to divide a Polar code with a length of N into S groups, each group of Polar codes being data extracted from the Polar code with the length of N according to a preset rule, and includes:

[0081] The Polar code with the length of N is divided into S groups, a starting point of each group being one of S continuous Polar codes selected from the Polar code with the length of N, and data other than the starting point of each group being data obtained by extracting the Polar code with the length of N with a step length of S starting from the starting point, wherein the length of each group of Polar codes is N / S. For example, when S is 2, two groups of Polar codes are A0[2i] and A0[2i-1], i=1,2...N / 2, and the length of each group of Polar codes is N / 2; when S is 4, four groups of Polar codes are A0[4i], A0[4i-1], A0[4i-2] and A0[4i-3], i=1,2...N / 4, and the length of each group of Polar codes is N / 4.

[0082] As an implementation manner, the control module 503 is further configured to divide each group of Polar codes in the S groups into M groups, M being an integer power of 2, and sequentially send each group of the M groups to the calculation module.

[0083] The calculation module 502 is further configured to perform LLR calculation on each group of Polar codes in the M groups, perform LLR calculation on M LLR calculation results, and take the LLR calculation results of the M groups of Polar codes as the LLR calculation results of one group of Polar codes in the received S groups.

[0084] As an implementation manner, the control module 503 is further configured to divide each group of Polar codes in the S groups into M groups, and includes:

[0085] For each group of Polar codes with length of N / S, the group of Polar codes is further divided into M groups, the starting point of each group in the M groups is one Polar code selected from the M continuous Polar codes in the Polar codes with length of N / S, the data of each group in the M groups except the starting point is the data obtained by decimating the Polar codes with length of N / S with M as the step length from the starting point, the length of each group of Polar codes divided into the M groups is N / (S*M). For example, the Polar codes with code length of 2048 are divided into 4 groups, the first group of Polar codes is {A0[8i], A0[8i-4]}, the second group of Polar codes is {A0[8i-1], A0[8i-5]}, the third group of Polar codes is {A0[8i-2], A0[8i-6]}, and the fourth group of Polar codes is {A0[8i-3], A0[8i-7]}, i=1, 2, …, 256, and each group of Polar codes is further divided into 2 groups, after the first group of Polar codes is divided into 2 groups, the first group of Polar codes is {A0[8i]} and {A0[8i-4]}, after the second group of Polar codes is divided into 2 groups, the second group of Polar codes is {A0[8i-1]} and {A0[8i-5]}, after the third group of Polar codes is divided into 2 groups, the third group of Polar codes is {A0[8i-2]} and {A0[8i-6]}, and after the fourth group of Polar codes is divided into 2 groups, the fourth group of Polar codes is {A0[8i-3]} and {A0[8i-7]}. Taking the first group as an example, the LLR calculation of A0[8i] is completed, and the output 1-way calculation result is cached; the LLR calculation of A0[8i-4] is completed, and the output 1-way calculation result is cached; the cached 2-way calculation result is subjected to LLR calculation, and the output 1-way calculation result is taken as the final result of the first group of LLR calculation. The LLR calculation processes of the other three groups are consistent with the LLR calculation process of the first group, which will not be repeated here.

[0086] As an implementation manner, the calculation module 502 is configured to perform LLR calculation on each group of Polar codes, and the calculation module 502 comprises:

[0087] The LLR calculation on each group of Polar codes is performed in parallel.

[0088] Compared with the prior art, the embodiment of the present application performs bit-serial decoding on Polar, and adopts a sample parallel decoding manner, so that the decoding delay can be reduced.

[0089] The embodiment of the present application further provides a computer readable and writable storage medium, the medium stores computer executable instructions, and the computer executable instructions are executed by a processor to implement the steps of the decoding method of the Polar code.

[0090] The embodiment of the present application further provides a decoding terminal of a Polar code, which comprises:

[0091] a memory for storing computer executable instructions;

[0092] a processor for executing the computer executable instructions to implement the steps of the decoding method of a Polar code as described in the preceding embodiments.

[0093] It is understood by those of ordinary skill in the art that all or some of the steps in the methods disclosed above and the functional modules / units in the systems and apparatuses can be implemented as software, firmware, hardware, or an appropriate combination thereof. In hardware implementation, the division between the functional modules / units referred to in the above description does not necessarily correspond to the physical division of the components; for example, one physical component can have multiple functions, or one function or step can be performed by several physical components in cooperation. Some or all of the components can be implemented as software executed by a processor, such as a digital signal processor or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on computer readable media, which can include computer storage media (or non-transitory media) and communication media (or transitory media). As is well known to those of ordinary skill 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 storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Further, it is understood by those of ordinary skill in the art that communication media typically 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 can include any information delivery media.

Claims

1. A method for decoding polar codes, comprising: The Polar codes of length N are divided into S groups that are not coupled. The Polar codes in each group are data extracted from the Polar codes of length N according to a preset rule; S is an integer power of 2. After calculating the log-likelihood ratio (LLR) for each Polar code in the S groups, the results for each group are then jointly decoded. Specifically, dividing the Polar codes of length N into S groups without coupling relationships, with each group containing Polar codes extracted from the Polar codes of length N according to a preset extraction rule, includes: The Polar codes of length N are divided into S groups. The starting point of each group is one of the S consecutive Polar codes selected from the Polar codes of length N. The data in each group, excluding the starting point, is the data obtained by extracting the Polar codes of length N in steps of S starting from the starting point. The length of each Polar code group is N / S.

2. The decoding method for polar codes according to claim 1, characterized in that, Also includes: Divide the Polar code of length N into S groups. The Polar code in each group is the data extracted from the Polar code of length N according to a preset extraction rule. Then divide the Polar code of each group into M groups, where M is an integer power of 2. After performing LLR calculation on each Polar code in the M groups, perform LLR calculation on the M LLR calculation results, and use the LLR calculation results of the M Polar codes as the LLR calculation results of one Polar code in the S groups.

3. The decoding method for polar codes according to claim 2, characterized in that, The Polar code of each group is then divided into M groups, including: For each group of Polar codes of length N / S, the group of Polar codes is further divided into M groups. The starting point of each group in the M groups is one of the M consecutive Polar codes selected from the Polar codes of length N / S. The data in each group in the M groups, excluding the starting point, is the data obtained by extracting the Polar codes of length N / S in steps of M from the starting point. The length of each Polar code in the M groups is N / (S*M).

4. The decoding method for polar codes according to claim 1 or 2, characterized in that, Perform LLR calculations on each Polar code group, including: LLR calculations are performed on each group of Polar codes in parallel.

5. A decoding system for polar codes, characterized in that, include: The control module is used to divide the Polar code of length N into S groups that are not coupled. The Polar code in each group is data extracted from the Polar code of length N according to a preset rule. The control module then distributes each group of Polar codes to S computing modules in sequence, where S is an integer power of 2. Each computation module is used to perform log-likelihood ratio (LLR) calculations on each received Polar code group; The decoding module is used to jointly decode the LLR calculation results obtained from each calculation module; The control module is used to divide the Polar codes of length N into S groups that are not coupled. Each group contains Polar codes extracted from the Polar codes of length N according to a preset rule, including: The Polar codes of length N are divided into S groups. The starting point of each group is one of the S consecutive Polar codes selected from the Polar codes of length N. The data in each group, excluding the starting point, is the data obtained by extracting the Polar codes of length N in steps of S starting from the starting point. The length of each Polar code group is N / S.

6. The polar code decoding system according to claim 5, characterized in that, The control module is also used to further divide each Polar code in the S group into M groups, where M is an integer power of 2, and send each group in the M groups to the calculation module in sequence; The calculation module is also used to perform LLR calculation on each group of Polar codes in the M groups, and then perform LLR calculation on the M LLR calculation results, and use the LLR calculation results of the M groups of Polar codes as the LLR calculation results of a group of Polar codes in the received S groups.

7. The polar code decoding system according to claim 6, characterized in that, The control module is further configured to divide each group of Polar codes in the S groups into M groups, including: For each group of Polar codes of length N / S, the group of Polar codes is further divided into M groups. The starting point of each group in the M groups is one of the M consecutive Polar codes selected from the Polar codes of length N / S. The data in each group in the M groups, excluding the starting point, is the data obtained by extracting the Polar codes of length N / S in steps of M from the starting point. The length of each Polar code in the M groups is N / (S*M).

8. A computer-readable and writable storage medium, characterized in that, The medium stores computer-executable instructions that, when executed by a processor, implement the steps of the decoding method for polar codes as described in any one of claims 1 to 4.

9. A decoding terminal for polar codes, characterized in that, include: Memory is used to store executable instructions for a computer; A processor for executing the computer-executable instructions to implement the steps of the decoding method for polar codes as described in any one of claims 1 to 4.

Images