Polar code list decoding method and system for outputting soft information

Abstract

The present invention provides a polar code list decoding method, system, electronic device and storage medium for outputting soft information. The polar code list decoding method for outputting soft information includes: performing an initialization operation on an information transfer binary tree based on soft cancellation, and dividing information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; for all paths in the list, determining a first soft information vector based on soft cancellation, the first soft information vector respectively indicating the received soft information vector from a superior node; determining a second soft information vector based on the first soft information vector, the second soft information vector indicating the output soft information vector transmitted to the superior node; selecting a first path with the highest reliability from all paths; and ending decoding and outputting the second soft information vector of the first path as the soft information provided to a previous module.

Description

Technical Field

[0001] The present invention relates to the field of satellite network communication, and particularly to a polar code list decoding method, system, electronic device and storage medium for outputting soft information. Background Art

[0002] At present, polar codes have become the standard coding scheme for control channels in the 5G eMBB scenario. Thanks to the relatively low computational complexity, the successive cancellation (SC) based decoding algorithm has become the mainstream decoding scheme. When concatenated with cyclic redundancy check (CRC) codes, the decoding performance of the SC list (SCL) decoder can outperform that of LDPC codes. In the 5G standardization process of polar codes, the SCL decoder with a list size of 8 is adopted as the benchmark scheme. With the further increase of the list size, CRC-aided SCL decoding is expected to meet the stringent performance requirements of the 5G URLLC scenario. On the other hand, for low-power scenarios, serial flipping-based decoding can be achieved by reusing a single SC decoder, which is called SC flip (SCF) decoding, and its error-correction performance can reach that of SCL decoding. Although the above decoders can provide accurate estimates at the bit level, they cannot provide soft information at the codeword level, so it is difficult to be used in the design of iterative receivers. Another decoding algorithm is the belief propagation (BP) algorithm. For polar codes, BP decoding performs message passing and updating on the factor graph based on the generator matrix. In circuit implementation, the message update of all processing elements (PEs) in one layer can be completed within one clock cycle. Therefore, compared with SC decoding, the throughput of one iteration of BP decoding is extremely high. The error-correction performance of BP decoding can be improved by increasing the number of iterations or the number of candidate codewords, but this increases the total number of iterations. Although the average throughput can reach the Gbps level at high signal-to-noise ratios, the throughput in the worst case drops significantly. In addition, the soft cancellation (SCAN) decoding algorithm is a combination of SC decoding and BP decoding. It uses the serial traversal mechanism of SC decoding and the message passing formula of BP decoding for message passing and updating. Its advantage is that, compared with BP decoding, the SCAN decoding algorithm has a faster convergence speed; compared with SC decoding, the SCAN decoding algorithm can output soft information at the codeword side. Since SCAN decoding can be regarded as a serial BP decoding, the existing BP list (BPL) and BP flip (BPF) decoding ideas can also be applied to SCAN decoding to improve the error-correction performance. However, the error-correction performance of these existing schemes in the prior art is still difficult to reach that of the CRC-aided SCL decoding algorithm. In addition, there is no single polar code decoder that can have good error-correction performance while outputting soft information.

[0003] In the prior art, the decoding scheme that can simultaneously have the above two features is to perform SCL decoding and one-iteration BP decoding independently, and then, based on the hard decision result of the codeword of the optimal path in SCL decoding, forcibly modify the sign value of the soft information on the codeword side of the BP decoder as the soft information of the final output.

[0004] However, the defects of this scheme in the prior art are as follows: (1) Depending on two decoder units will increase the resources, area, and power consumption in circuit implementation; (2) The output soft information cannot represent the actual probabilities of the respective codeword bits of the optimal path, that is, the accuracy of the soft information transmitted by the decoder to the previous module is not high. Summary of the Invention

[0005] The present invention provides a polar code list decoding method, system, electronic device, and storage medium for outputting soft information, aiming to overcome the defects in the prior art: (1) Depending on two decoder units will increase the resources, area, and power consumption in circuit implementation; (2) The output soft information cannot represent the actual probabilities of the respective codeword bits of the optimal path, that is, the accuracy of the soft information transmitted by the decoder to the previous module is not high.

[0006] Specifically, the embodiments of the present invention provide the following technical solutions:

[0007] In a first aspect, an embodiment of the present invention provides a polar code list decoding method for outputting soft information, including:

[0008] Perform an initialization operation on the information transfer binary tree based on the soft cancellation, and divide the information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits;

[0009] For all paths in the list, determine a first soft information vector based on the soft cancellation, where the first soft information vector respectively indicates the soft information vector received from the upper-level node;

[0010] Based on the first soft information vector, determine a second soft information vector, where the second soft information vector indicates the soft information vector output and transmitted to the upper-level node;

[0011] Select the first path with the highest reliability from all the paths; and

[0012] End the decoding and output the second soft information vector of the first path as the soft information provided to the previous module.

[0013] Further, the polar code list decoding method for outputting soft information further includes:

[0014] Determining a second soft information vector based on the first soft information vector includes:

[0015] If the current bit is a frozen bit, update the path metric value PM of all paths and return that the prior information of the current bit is equal to ∞.

[0016] Furthermore, the polar code list decoding method for outputting soft information further includes:

[0017] Determining the second soft information vector based on the first soft information vector further includes:

[0018] If the current bit is not a frozen bit, further determine whether the current bit is the first reliable information bit. Furthermore, the polar code list decoding method for outputting soft information further includes:

[0019] Determining whether the current bit is the first reliable information bit further includes:

[0020] If the current bit is the first reliable information bit, return that the prior information of the current bit is equal to 0;

[0021] If the current bit is not the first reliable information bit, perform path extension on the original paths in the current list to obtain multiple sub-paths, update the path metric values PM of the multiple sub-paths, perform path sorting based on the magnitudes of the path metric values PM of the multiple sub-paths from low to high, retain the paths with the largest number of paths as new paths, copy the first soft information vector and the second soft information vector of the original paths to the new paths, and return that the prior information of the current bit is equal to ∞ or -∞ according to the estimation of whether the bit corresponding to each path is 0 or 1.

[0022] Furthermore, the polar code list decoding method for outputting soft information further includes:

[0023] The initialization operation includes:

[0024] Set the bit index to 0, the number of paths in the list to 1, the path metric value PM to 0, and the values of the second soft information vectors at each level to 0.

[0025] Furthermore, the polar code list decoding method for outputting soft information further includes:

[0026] Selecting the first path with the highest reliability from all the paths includes:

[0027] If it is a polar code concatenated outer code, select the first path with the highest reliability from the paths that pass the outer code check;

[0028] If only the polar code exists, a first path with the highest reliability is selected from all the paths.

[0029] Furthermore, the polar code list decoding method for outputting soft information further includes:

[0030] The outer code includes: CRC code, BCH code, LDPC code.

[0031] In a second aspect, an embodiment of the present invention further provides a polar code list decoding system for outputting soft information, including:

[0032] An initialization unit for performing an initialization operation on the information passing binary tree based on the soft cancellation, and dividing information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits;

[0033] A first soft information vector determination unit for determining, for all paths in the list, a first soft information vector based on the soft cancellation, where the first soft information vector respectively indicates the soft information vectors received from the upper nodes;

[0034] A second soft information vector determination unit for determining a second soft information vector based on the first soft information vector, where the second soft information vector indicates the soft information vectors output and transmitted to the upper nodes;

[0035] A path selection unit for selecting a first path with the highest reliability from all the paths; and

[0036] A soft information output unit for ending the decoding and outputting the second soft information vector of the first path as the soft information provided to the previous module.

[0037] In a third aspect, an embodiment of the present invention further provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that when the processor executes the program, the steps of the above-mentioned polar code list decoding method for outputting soft information are implemented.

[0038] In a fourth aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, characterized in that when the computer program is executed by a processor, the steps of the above-mentioned polar code list decoding method for outputting soft information are implemented.

[0039] As can be seen from the above technical solution, the polar code list decoding method for outputting soft information provided by the embodiments of the present invention is an extension based on the SCAN decoding algorithm. In this solution, retaining equiprobable prior information for reliable bits can enable the decoder to output soft information, and performing path extension on unreliable bits can enable the decoder to approach or achieve the error correction performance of SCL decoding. Compared with the existing technical solutions, the polar code list decoding method for outputting soft information provided by the embodiments of the present invention only needs to design a set of decoder units, and the soft information output by the optimal path reflects the true probability of each codeword bit on this path. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the accompanying drawings required for the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0041] Figure 1 It is a flowchart of the polar code list decoding method for outputting soft information provided by an embodiment of the present invention;

[0042] Figure 2 It is a schematic diagram of the SCAN decoding message passing binary tree provided by an embodiment of the present invention;

[0043] Figure 3 It is a specific flowchart of the polar code list decoding method for outputting soft information provided by an embodiment of the present invention;

[0044] Figure 4 It is a schematic structural diagram of the polar code list decoding system for outputting soft information provided by an embodiment of the present invention; and

[0045] Figure 5 It is a schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0046] To make the objectives, technical solutions, and advantages of the present invention clearer, the following will clearly and completely describe the technical solutions in the present invention with reference to the accompanying drawings in the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art without creative efforts based on the embodiments of the present invention fall within the protection scope of the present invention.

[0047] The various terms or phrases used in the present invention have the general meanings well-known to those of ordinary skill in the art. Even so, the present invention still hopes to provide a more detailed description and explanation of these terms or phrases herein. If the terms and phrases involved herein are inconsistent with the well-known meanings, the meanings expressed in the present invention shall prevail; and if they are not defined in this application, they shall have the meanings commonly understood by those of ordinary skill in the art.

[0048] In the prior art, the decoding scheme that can simultaneously possess the above two features is to independently perform SCL decoding and one-iteration BP decoding, and then, based on the hard decision result of the codeword on the optimal path in SCL decoding, forcibly modify the sign value of the soft information on the codeword side of the BP decoder as the finally output soft information. However, the deficiencies of this scheme in the prior art are as follows: (1) It depends on two decoder units, which will increase the resources, area, and power consumption in circuit implementation; (2) The output soft information cannot represent the actual probabilities of the respective codeword bits of the optimal path, that is, the accuracy of the soft information transmitted by the decoder to the previous-stage module is not high.

[0049] In view of this, on the first aspect, an embodiment of the present invention proposes a polar code list decoding method for outputting soft information

[0050] The following combines Figure 1 to describe the polar code list decoding method for outputting soft information of the present invention.

[0051] Figure 1 is a flowchart of the polar code list decoding method for outputting soft information provided by an embodiment of the present invention.

[0052] In this embodiment, it should be noted that the polar code list decoding method for outputting soft information may include the following steps:

[0053] S1: Perform an initialization operation on the information-passing binary tree based on soft cancellation, and divide the information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits;

[0054] S2: For all paths in the list, determine a first soft information vector based on soft cancellation, and the first soft information vector respectively indicates the soft information vector received from the upper-level node;

[0055] S3: Based on the first soft information vector, determine a second soft information vector, and the second soft information vector indicates the soft information vector output and transmitted to the upper-level node;

[0056] S4: Select the first path with the highest reliability from all paths; and

[0057] S5: End decoding and output the second soft information vector of the first path as the soft information provided to the previous module.

[0058] Specifically, the polar code list decoding method for outputting soft information proposed by the present invention is based on the SCAN decoding algorithm. For a polar code with a code length of N, the message passing of SCAN decoding is performed in a binary tree with a depth of n + 1 (n = log2N), where N is a natural number not less than 1. The root node in the decoding binary tree represents a codeword with a length of N, and the N leaf nodes represent N transmitted bits. For the i-th node at the s-th level, the soft information vector received from the upper level is denoted as , and the soft information vector output and passed to the upper level is denoted as , where s ∈ [0, n], i ∈ [0, N / 2 s - 1].

[0059] The following further describes the polar code list decoding method for outputting soft information of the present invention in conjunction with Figure 2 and Figure 3 .

[0060] Figure 2 is a schematic diagram of the SCAN decoding message passing binary tree provided by an embodiment of the present invention;

[0061] Figure 3 is a specific flowchart of the polar code list decoding method for outputting soft information provided by an embodiment of the present invention.

[0062] As Figure 2 shown, Figure 2 shows a decoding binary tree with a code length of 8 and a depth of 4.

[0063] Regarding S1, in this embodiment, it should be noted that the polar code list decoding method for outputting soft information may include: The initialization operation includes: setting the bit index to 0, setting the number of paths in the list to 1, setting the path metric value PM to 0, and setting the values of the second soft information vectors at each level to 0.

[0064] Regarding S1, the decoder may select the most reliable T bits as high-reliability information bits according to, but not limited to, the reliability of the polarization channels of each information bit, where T is a positive integer. In addition, according to the channel polarization property, high-reliability information bits may also be selected according to the information bit distribution. For example, for a continuously distributed information bit cluster, the last several information bits are selected as high-reliability information bits.

[0065] More specifically, the number T of high-reliability information bits determines the decoding performance and the quality of the output soft information. The larger T is, the smaller the amplitude of the output soft information is, and the worse the decoding performance is; the smaller T is, the larger the amplitude of the output soft information is, and the better the decoding performance is. When T = 0, the decoding performance is equivalent to that of SCL decoding, and the output soft information is an infinite value, which is equivalent to the hard decision of the SCL decoding codeword; when the value of T is the same as the number of information bits, the decoding is equivalent to SCAN decoding.

[0066] For S2 and S3, for the i-th node at the s-th level, the soft information vector received from the upper level is denoted as and the soft information vector output and transmitted to the upper level is denoted as where the update formula (1) of the λ soft information vector (i.e., the first soft information vector) is as follows:

[0067]

[0068] The update formula (2) of the β soft information vector (i.e., the second soft information vector) is as follows:

[0069]

[0070] Specifically, in combination with Figure 3 , the λ soft information vector is calculated based on the update formula (1) in S12, and the β soft information vector is calculated based on the update formula (2) in S18.

[0071] Furthermore, in this embodiment, it should be noted that the polar code list decoding method for the output soft information may include: determining the second soft information vector based on the first soft information vector, including: if the current bit is a frozen bit, update the path metric value PM of all paths and return that the prior information of the current bit is equal to ∞.

[0072] Correspondingly, in this embodiment, it should be noted that the polar code list decoding method for the output soft information may further include: determining the second soft information vector based on the first soft information vector, and further including: if the current bit is not a frozen bit, further determine whether the current bit is the first reliable information bit.

[0073] Specifically, in combination with Figure 3 in S13, if the current bit i is a frozen bit, update the PM values of all paths according to the PM calculation formula (3), and then proceed to step S17. Otherwise, if the current bit i is a high-reliability information bit, directly jump to step S17. For each path, the PM value calculation formula (3) is as follows:

[0074]

[0075] where is the estimated value of the i-th bit, and hard() represents the hard decision function of soft information. Specifically, when When When

[0076] More specifically, the smaller the PM value, the higher the path reliability.

[0077] Furthermore, in this embodiment, it should be noted that the polar code list decoding method for outputting soft information may include: determining whether the current bit is a first reliable information bit, and further including: if the current bit is a first reliable information bit, then return that the prior information of the current bit is equal to 0; if the current bit is not a first reliable information bit, then perform path extension on the original paths in the current list to obtain multiple sub-paths, update the path metric values PM of the multiple sub-paths, perform path sorting based on the magnitudes of the path metric values PM of the multiple sub-paths from low to high, retain the paths with the largest number of paths as the new paths, copy the first soft information vector and the second soft information vector of the original path to the new paths, and return that the prior information of the current bit is equal to ∞ or -∞ according to the estimation that the bit corresponding to each path is 0 or 1.

[0078] Based on the steps of this method, the embodiments of the present invention can achieve the following technical effects: retaining equally probable prior information for reliable bits can enable the decoder to output soft information; and performing path extension on unreliable bits can enable the decoder to approach or achieve the error correction performance of SCL decoding.

[0079] Specifically, in combination with Figure 3 of S14, if the current bit is an information bit but does not belong to the high-reliable information bits, considering both cases where the bit is 0 and 1, perform path extension on the original paths in the current list to obtain l = l×2 sub-paths, and update the PM values of the sub-paths according to the above PM calculation formula (3).

[0080] Specifically, in combination with Figure 3 of S15, sort the extended sub-paths from low to high according to the PM values. If the current number of sub-paths is greater than the maximum number of paths L in the list, retain the L most reliable paths as the new paths.

[0081] Specifically, in combination with Figure 3 of S16, copy the λ and β soft information data of the original path to the new paths.

[0082] Specifically, in combination with Figure 3 of S17, return the prior information of the current bit If i is a frozen bit, return If i is a high-reliable information bit, return Otherwise, according to the estimation that the bit corresponding to each path is 0 or 1, return or -∞.

[0083] Specifically, in combination with Figure 3 S18, for all paths in the list, update the corresponding β soft information vector according to the update formula (2) of the SCAN decoded β soft information vector.

[0084] Furthermore, for S4, in this embodiment, it should be noted that the polar code list decoding method for outputting soft information may include: if there is a polar code concatenated with an outer code, select the most reliable first path from the paths that pass the outer code check; if there is only a polar code, select the most reliable first path from all paths.

[0085] Specifically, in combination with Figure 3 S19, increment the value of the bit index i by 1. When i = N, the message passing terminates. If there is a path that passes the CRC check, select the most reliable path that passes the CRC check as the optimal path. If all paths do not pass the CRC check, select the most reliable path as the optimal path; if i < N, execute step 2.

[0086] However, the present invention is not limited thereto. In this embodiment, it should be noted that the polar code list decoding method for outputting soft information may include: the outer code includes: CRC code, BCH code, LDPC code.

[0087] Furthermore, for S5, in combination with Figure 3 S20, the decoding terminates, and the of the optimal path is output as the soft information provided to the previous module.

[0088] In summary, in the polar code list decoding method for outputting soft information provided in an embodiment of the present invention, when the message passing proceeds to the bit level, if the reliability of the polarization channel where an information bit is located is high, it is consistent with the SCAN decoding scheme, and the prior information of equally probable transmission of 0 or 1 is retained for this bit (manifesting as prior information of 0 in the log-likelihood ratio domain); if the reliability of the polarization channel where an information bit is located is low, both cases where this bit is 0 and this bit is 1 are considered simultaneously (manifesting as prior information of positive infinity and negative infinity in the log-likelihood ratio domain), and path expansion and optimal selection are performed on the paths in the list. Based on the above concept of the present invention, retaining equally probable prior information for reliable bits can enable the decoder to output soft information, and performing path expansion on unreliable bits can enable the decoder to approach or achieve the error correction performance of SCL decoding.

[0089] Based on the same inventive concept, on the other hand, an embodiment of the present invention proposes a polar code list decoding system for outputting soft information.

[0090] Next, in combination with Figure 4The system provided by the present invention is described. The polar code list decoding system for outputting soft information described below can be correspondingly referred to the polar code list decoding method for outputting soft information described above.

[0091] Figure 4 It is a schematic structural diagram of a polar code list decoding system for outputting soft information provided by an embodiment of the present invention.

[0092] In this embodiment, it should be noted that the polar code list decoding system 1 for outputting soft information includes: an initialization unit 10, configured to perform an initialization operation on an information transfer binary tree based on soft cancellation, and divide information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; a first soft information vector determination unit 20, configured to determine, for all paths in the list, a first soft information vector based on soft cancellation, where the first soft information vector respectively indicates the soft information vector received from a superior node; a second soft information vector determination unit 30, configured to determine a second soft information vector based on the first soft information vector, where the second soft information vector indicates the soft information vector output and transferred to a superior node; a path selection unit 40, configured to select a first path with the highest reliability from all paths; and a soft information output unit 50, configured to end decoding and output the second soft information vector of the first path as the soft information provided to a previous module.

[0093] Since the system provided by the embodiment of the present invention can be used to execute the method described in the above embodiment, and its working principle and beneficial effects are similar, details are not described herein again. For specific content, reference can be made to the introduction of the above embodiment.

[0094] In this embodiment, it should be noted that each unit in the system of the embodiment of the present invention can be integrated into one body or separately deployed. The above units can be combined into one unit or further split into multiple sub-units.

[0095] On the other hand, based on the same inventive concept, another embodiment of the present invention provides an electronic device.

[0096] Figure 5 It is a schematic diagram of an electronic device provided by an embodiment of the present invention.

[0097] In this embodiment, it should be noted that the electronic device may include: a processor 510, a communications interface 520, a memory 530, and a communication bus 540. Among them, the processor 510, the communication interface 520, and the memory 530 complete mutual communication through the communication bus 540. The processor 510 may call the logical instructions in the memory 530 to execute a method, which includes: performing an initialization operation on an information transfer binary tree based on soft cancellation, and dividing information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; for all paths in the list, determining a first soft information vector based on soft cancellation, where the first soft information vector respectively indicates the received soft information vector from the upper-level node; based on the first soft information vector, determining a second soft information vector, where the second soft information vector indicates the output soft information vector transmitted to the upper-level node; selecting the first path with the highest reliability from all paths; and ending decoding and outputting the second soft information vector of the first path as the soft information provided to the previous module.

[0098] In addition, when the logical instructions in the above-mentioned memory 530 are implemented in the form of software functional units and sold or used as independent products, they may be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, may be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs, and other various media that can store program codes.

[0099] In another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it implements an execution method, which includes: performing an initialization operation on an information transfer binary tree based on soft cancellation, and dividing information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; for all paths in the list, determining a first soft information vector based on soft cancellation, where the first soft information vector respectively indicates the received soft information vector from the upper-level node; based on the first soft information vector, determining a second soft information vector, where the second soft information vector indicates the output soft information vector transmitted to the upper-level node; selecting the first path with the highest reliability from all paths; and ending the decoding and outputting the second soft information vector of the first path as the soft information provided to the previous module.

[0100] The system embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment. A person of ordinary skill in the art can understand and implement it without creative labor.

[0101] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0102] In addition, in the present invention, relative terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprising", "including" or any other variant thereof are intended to cover non-exclusive inclusion, such that a process, method, article or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or device. Without further limitation, an element defined by the phrase "comprising an..." does not exclude the presence of additional identical elements in the process, method, article or device comprising said element.

[0103] In addition, in the present invention, descriptions referring to terms such as "embodiment", "the present embodiment", "another embodiment", etc. mean that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, without contradiction, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples.

[0104] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A polarization code list decoding method for outputting soft information, characterized in that Including: Perform an initialization operation on the information-passing binary tree based on soft cancellation, and divide the information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; For all paths in the list, determine a first soft information vector based on the soft cancellation, where the first soft information vector respectively indicates the received soft information vector from the upper-level node; Based on the first soft information vector, determine a second soft information vector, where the second soft information vector indicates the output soft information vector transmitted to the upper-level node. Determining the second soft information vector includes: if the current bit is a frozen bit, update the path metric value PM of all paths and return that the prior information of the current bit is equal to ∞; if the current bit is not a frozen bit, further determine whether the current bit is the first reliable information bit; Select a first path with the highest reliability from all the paths, including: if the polar code is concatenated with an outer code, select the first path with the highest reliability from the paths that pass the outer code check; if only the polar code exists, select the first path with the highest reliability from all the paths; and End the decoding and output the second soft information vector of the first path as the soft information provided to the previous module.

2. The polar code list decoding method for outputting soft information according to claim 1, wherein The polar code list decoding method for outputting soft information is based on the SCAN decoding algorithm.

3. The method for list decoding of polar codes for outputting soft information according to claim 1, characterized in that The dividing the information bits into first reliable information bits and second reliable information bits includes: dividing the information bits into the first reliable information bits and the second reliable information bits according to the channel polarization property or according to the information bit distribution.

4. The polar code list decoding method for outputting soft information according to claim 1, characterized in that The determining whether the current bit is the first reliable information bit further includes: If the current bit is the first reliable information bit, return that the prior information of the current bit is equal to 0; If the current bit is not the first reliable information bit, perform path extension on the original paths in the current list to obtain multiple sub-paths, update the path metric values PM of the multiple sub-paths, perform path sorting based on the magnitudes of the path metric values PM of the multiple sub-paths from low to high, retain the paths with the largest number of paths as the new paths, copy the first soft information vector and the second soft information vector of the original paths to the new paths, and return that the prior information of the current bit is equal to ∞ or -∞ according to the estimation of whether the bit corresponding to each path is 0 or 1.

5. The polar code list decoding method for outputting soft information according to claim 1, characterized in that The initialization operation includes: Set the bit index to 0, the number of paths in the list to 1, the path metric value PM to 0, and the values of the second soft information vectors at each level to 0.

6. The polarization code list decoding method for outputting soft information according to claim 1, characterized in that The selecting a first path with the highest reliability from all the paths includes: if there is a path passing the CRC check, select the path that passes the CRC check and has the highest reliability as the first path from all the paths; if all paths do not pass the CRC check, select the path with the highest reliability as the first path from all the paths.

7. The polar code list decoding method for outputting soft information according to claim 1, characterized in that, The external codes include: CRC code, BCH code, and LDPC code.

8. A polar code list decoding system for outputting soft information, characterized in that, Comprising: An initialization unit, configured to perform an initialization operation on an information transfer binary tree based on soft cancellation, and divide information bits into first reliable information bits and second reliable information bits, where the reliability of the first reliable information bits is higher than that of the second reliable information bits; A first soft information vector determination unit, configured to, for all paths in the list, determine a first soft information vector based on the soft cancellation, where the first soft information vector respectively indicates the soft information vectors received from the upper-level nodes; A second soft information vector determination unit, configured to determine a second soft information vector based on the first soft information vector, where the second soft information vector indicates the soft information vector output and transmitted to the upper-level node, and the determination of the second soft information vector includes: if the current bit is a frozen bit, update the path metric value PM of all paths and return that the prior information of the current bit is equal to ∞, and if the current bit is not a frozen bit, further determine whether the current bit is the first reliable information bit; A path selection unit, configured to select a first path with the highest reliability from all the paths, and if the polar code is concatenated with an external code, select the first path with the highest reliability from the paths passing the external code check, and if only the polar code exists, select the first path with the highest reliability from all the paths; and A soft information output unit, configured to end the decoding and output the second soft information vector of the first path as the soft information provided to the previous module.

9. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the program, the steps of the polar code list decoding method for outputting soft information according to any one of claims 1-7 are implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, the steps of the polar code list decoding method for outputting soft information according to any one of claims 1-7 are implemented.

Images