CN113014271B - Polarization code BP decoding method for reducing turnover set - Google Patents
Polarization code BP decoding method for reducing turnover set Download PDFInfo
- Publication number
- CN113014271B CN113014271B CN202110249080.4A CN202110249080A CN113014271B CN 113014271 B CN113014271 B CN 113014271B CN 202110249080 A CN202110249080 A CN 202110249080A CN 113014271 B CN113014271 B CN 113014271B
- Authority
- CN
- China
- Prior art keywords
- decoding
- bit
- error rate
- fine
- crc
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
Abstract
The invention belongs to the technical field of mobile communication, and relates to a polarization code BP decoding method for reducing a turnover set, which comprises the following steps: calculating the variance by utilizing the continuous S log-likelihood ratios on the left side of the factor graph; displaying the stability of the data according to the variance of the data to determine unreliable points, and constructing a coarse turning set; then, calculating the log-likelihood ratio of the received bits and the corresponding expected value in the rough flip set; calculating a bit error rate of the received bits using the log-likelihood ratio; by comparing the bit error rate before and after decoding, a precise turning set is constructed, so that the range of error-prone bits is reduced, the turning set is more accurately constructed, and then the turning is gradually turned by a belief propagation decoding algorithm. The invention achieves the effects of improving the decoding performance, reducing the calculation complexity, reducing the decoding time delay and reducing the power consumption.
Description
Technical Field
The invention relates to the technical field of mobile communication, in particular to a polarization code BP decoding method for reducing a turnover set.
Background
The polar code proposed by e.arika is the first coding scheme in the world that can be strictly justified by shannon limits. The core idea of the design of the polarization code is to polarize the channels, in this process, the capacity of one part of the channels is close to 1, and the capacity of the other part of the channels is close to 0. Meanwhile, e.arikan also proposes two decoding algorithms for polarization codes, namely a Successive Cancellation (SC) decoding algorithm and a Belief Propagation (BP) decoding algorithm.
SC decoding algorithms and their derived algorithms, such as Sequential Cancellation List (SCL) decoding methods and Sequential Cancellation Flip (SCF) decoding algorithms, have become the focus of most people, and meanwhile, the tandem cyclic redundancy check (CA-SCL) decoding algorithm has become the standard decoding algorithm for 5G polarization codes. In contrast, the belief propagation coding algorithm (BP List, BPL) has a greater advantage in high-throughput application scenarios through parallel iterative computations than the serial SC coding algorithm. However, the performance of the BP decoding algorithm is not as good as that of SCL decoding, and thus a Belief Propagation List (BPL) decoding algorithm appears, which, like SCL, generates a list of size L from a factor graph and selects the best decoding combination according to euclidean distance. In addition, a method for improving the BP decoding performance is bit flipping, and a part of bits with a higher error probability are selected in a targeted manner to flip by using a log-likelihood ratio generated in a decoding process, so that the purpose of improving the decoding performance is achieved. (in the process of improving BP decoding performance through bit flipping, the improvement of decoding performance is limited because of the inaccuracy of the flipping set)
Disclosure of Invention
In order to solve the problems of multiple iteration times, low throughput, large time delay and inconvenience for engineering implementation of the conventional decoding method, the invention provides a polarization code BP decoding method aiming at a 5G control channel and a broadcast channel.
A polar code BP decoding method for reducing a turnover set comprises the following steps:
s1, carrying out common BP decoding, receiving the log-likelihood ratio value from the channel by the decoder, and setting the prior LLR of all non-frozen bits as 0;
s2, stopping iteration when the iteration decoding process reaches the maximum iteration times M, and obtaining a decoding result u i Recording the left information value S times before the iteration is finished, and calculating the average value AVE _ S and the variance VAE _ S of the left information value;
s3, decoding result u i Performing CRC, if the CRC fails, selecting the T value with the maximum variance VAE _ S to construct a coarse turning set FS;
s4, calculating the bit error rate aiming at the T bits of the rough turnover set FS to obtain the bit error rate estimated value P obtained after passing through the Gaussian channel E And bit error rate P of BP decoded information bit BP Then compare P E And P BP If P is the size of E (i)＜P BP (i) Then u after BP decoding is carried out i Bringing the fine turning set into a fine turning set, and finally obtaining a fine turning set FS';
s5, performing single-bit upset decoding on the fine upset set FS', performing M times of iteration process of common BP decoding after the single-bit upset decoding is completed to obtain a decoding result, performing CRC (cyclic redundancy check) on the decoding result, repeating the single-bit upset decoding operation if the CRC fails until the CRC passes or the number of bit upsets reaches the size of the fine upset set, and outputting the decoding result; if the final number of bit flips reaches the size of the fine flip set and none of the CRCs passes, go to step S6;
s6, carrying out multi-bit overturning, combining bits in the fine overturning set FS 'by omega to form a new overturning set FS', enabling omega to be 1 initially and sequentially increasing in sequence, namely enabling omega to be omega +1, carrying out multi-bit overturning on the overturning set FS 'by taking omega bits as a unit, carrying out M times of iteration of common BP decoding after multi-bit overturning to obtain a decoding result, and carrying out CRC (cyclic redundancy check) on the decoding result until the CRC passes or omega is more than T', and outputting the decoding result; if the CRC does not pass, continuing to execute the multi-bit overturning process until the CRC passes or the overturning times reach the size of a fine overturning set FS'; if the number of flips reaches the size of the fine flip set FS ″ and the CRC check fails, let ω be ω +1, and the process of step S6 is executed again.
Further, in a preferred embodiment, the estimated value P of the bit error rate is obtained after passing through a gaussian channel E The calculation formula is as follows:
wherein erfc (·) represents a complementary error function, and is used for solving the bit error rate;
indicating the expectation of the log-likelihood ratio value LLR for the ith bit, N the code length, Y the received signal,
which represents the result of the ideal decoding process,
representing the actual decoding result.
In a preferred embodiment, BP translation is usedActual bit error rate P of coded information bits BP The calculation formula is as follows:
wherein the content of the first and second substances,
is the average of the S LLR iteration information, P BP Is the actual bit error rate after BP decoding,
the result of the decoding is represented by,
indicating the actual decoding result, Y the received signal, and i the ith bit.
In a preferred embodiment, the expression of the fine flip set is FS ∈ a | P BP (i)>P E (i) The size is T', the fine turning sets are arranged in descending order of error rate difference, A represents the index of the sub-channel, P represents the index of the sub-channel BP (i) Representing the bit error rate, P, of the BP decoded information bits E (i) Representing the estimated value of bit error rate after passing through Gaussian channel.
Has the advantages that:
the invention utilizes the log-likelihood ratio to calculate the variance and the bit error rate of the received bits to construct the turnover set, thereby reducing the range of error-prone bits, more accurately constructing the turnover set, and gradually turning over by a belief propagation decoding algorithm, thereby achieving the effects of improving decoding performance, reducing calculation complexity, reducing decoding time delay and reducing power consumption.
Drawings
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
Fig. 1 is a flowchart of a bit flipping BP decoding process provided in this embodiment;
fig. 2 is a BP coding factor graph when N ═ 8;
fig. 3 is a flowchart of a method for decoding a polarization code BP with a reduced flip set according to this embodiment.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment provides a polarization code BP decoding method for reducing a flip set, which mainly relates to the increase of decoding rate in a 5G control channel and a broadcast channel to meet the 5G real-time requirement. As shown in fig. 1-3, in a preferred embodiment, the following steps are included, but not limited to:
before starting the iteration, channel information is input from the rightmost node, and information is input from the leftmost node after freezing.
At the receiving end, the Log Likelihood Ratio (LLR) value of each received prior information is calculated by the following formula:
where y denotes the received signal, σ 2 Representing the noise variance, x the encoded codeword, and p (-) the prior probability.
S1, presetting the maximum iteration number M of the BP decoder, initializing, carrying out common BP decoding, receiving the log-likelihood ratio from the channel, and setting the prior LLR of all non-frozen bits as 0.
Specifically, during the decoding process, information transferred from left to right and information transferred from right to left are transferred and updated in adjacent nodes. Information is firstly transmitted from the rightmost node to the leftmost node, left information of each column is sequentially updated from right to left according to the following formula, and then the left information is updated from the leftmost node in the opposite direction and is transmitted to the rightmost node, so that one iteration is completed. The update formula in the iterative process is:
L i,j ＝g(L i+1,2j-1 ,L i+1,2j +R i,j+N/2 )
L i,j+N/2 ＝g(R i,j ,L i+1,2j-1 )+L i+1,2j
R i+1,2j-1 ＝g(R i,j ,L i+1,2j +R i,j+N/2 )
R i+1,2j ＝g(R i,j ,L i+1,2j-1 )+R i,j+N/2
in the formula (I), the compound is shown in the specification,
where s, t ∈ R, i denotes a row, j denotes a column, and N denotes a code length.
S2, carrying out M (M is 50) times of iteration operation on the step S1, and obtaining a decoding result according to the following formula after the iteration is finished
And simultaneously recording the left information values of S times (where S takes a value of 20) before the iteration is finished, and calculating the average value AVE _ S and the variance VAE _ S of the left information values of the previous S times of iteration.
S3, decoding the obtained result
And performing CRC check, if the CRC check is not passed, selecting a T (T takes the value as 1/2 of the information bits) value with the maximum variance VAE _ S, and constructing a coarse flip set FS.
S4, calculating the bit error rate aiming at the T bits in the rough flip set FS to obtainBit error rate estimated value P after passing through Gaussian channel E And bit error rate P of BP decoded information bit BP Then compare P E And P BP If P is the size of E (i)＜P BP (i) We can conclude u after BP decoding i Has larger error probability and is included in the fine flip set, so as to construct the fine flip set FS ∈ A | P BP (i)>P E (i) H, size T', and arranged in descending order of error rate difference, wherein a denotes an index of a sub-channel, P BP (i) Representing the bit error rate, P, of the BP decoded information bits E (i) Representing the estimated value of the bit error rate after passing through the gaussian channel.
Wherein, the error rate calculation firstly needs to calculate the expected E [ L ] of LLR i N ]As follows:
wherein the content of the first and second substances,
representing the log-likelihood ratio of the ith bit of level n-1,
represents the log-likelihood ratio value of the nth stage,
the following formula:
bit error rate estimated value P obtained after passing through Gaussian channel E The calculation formula is as follows:
wherein erfc (·) represents a complementary error function, and is used for solving bit error rate;
indicating the expectation of the log-likelihood ratio LLR, Y indicates the received signal,
which represents the result of the ideal decoding process,
representing the actual decoding result.
Meanwhile, calculating the bit error rate of the information bits after BP decoding as follows:
wherein the content of the first and second substances,
is the average of the S LLR iteration information, P BP Is the actual bit error rate after BP decoding,
the result of the decoding is represented by,
indicating the actual decoding result and Y the received signal. Then compare P E And P BP If P is the size of E (i)＜P BP (i) Then u is BP decoded i With a high error probability, u is determined i And (5) bringing the mixture into a fine turning set.
S5, firstly, performing single-bit flipping decoding on the fine flipping set FS', and the basic steps are as follows:
s51, making a list of the fine flip set FSBit flipping: firstly, sequentially single flipping bit of a fine flipping set FS', specifically as follows: u. of i LLR < 0 is set to- ∞, otherwise it is set to + ∞, i.e.:
and S52, after the single bit is turned over, performing M times of iteration process of common BP decoding on the single bit to obtain a decoding result, performing CRC (cyclic redundancy check) on the decoding result, and if the CRC fails, repeating the operation of S51 until the CRC passes or the bit turning number reaches the size of the fine turning set. If the final number of bit flips reaches the size of the fine flip set and none of the CRCs passes, step S6 is performed.
S6, carrying out multi-bit flipping, wherein the multi-bit flipping process comprises the following steps:
s61, combining the bits in the fine flip set FS ' by omega to form a new flip set FS ', wherein the initial omega is 1, and traversing all elements of the flip set FS ' once to form an omega-bit flip set FS ";
s62, aiming at the omega-bit reversal set FS ', then carrying out multi-bit reversal on the reversal set FS' by taking the omega-bit as a unit;
s63, after multi-bit overturning, performing M times of iteration of common BP decoding to obtain a decoding result, then performing CRC check on the decoding result, and if the CRC check passes or omega is more than T', outputting the decoding result; if the CRC check does not pass, the process of step S62 is continuously executed until the CRC check passes or the number of flips reaches the size of the fine flip set FS ″, and if the number of flips reaches the size of the fine flip set FS ″ and the CRC check does not pass, ω is made ω +1, and the process of step S61 is returned to.
In the polarization code BP decoding method for reducing the inverse set provided in this embodiment, the method for constructing the inverse set includes: and firstly constructing a coarse flip set FS by using a variance method BPF-LLR, and then constructing a fine flip set FS' by using a difference value of bit error rates, thereby realizing a BER-BPF-omega decoding algorithm. Specifically, the variance is calculated by using S log-likelihood ratios on the left side of the factor graph; the variance of one data can show the stability of the data, if the variance of the likelihood ratio information of a certain data is larger, the stability of the data is worse, namely the data point is an unreliable point, and therefore a coarse turning set is constructed; then, calculating the log-likelihood ratio of the received bits and the corresponding expected value in the rough flip set; calculating a bit error rate of the received bits using the log-likelihood ratio; the bit error rate before and after decoding is compared to construct a fine turning set; therefore, the range of error-prone bits is narrowed, the overturning set is more accurately constructed, and then the belief propagation decoding algorithm is adopted to gradually overturn, so that the effects of improving decoding performance, reducing calculation complexity, reducing decoding time delay and reducing power consumption are achieved.
When introducing various embodiments of the present application, the articles "a," "an," "the," and "said" are intended to mean that there are one or more of the elements. The terms "comprising," "including," and "having" are intended to be inclusive and mean that there may be additional elements other than the listed elements.
It should be noted that, as one of ordinary skill in the art would understand, all or part of the processes of the above method embodiments may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when executed, the computer program may include the processes of the above method embodiments. The storage medium may be a magnetic disk, an optical disk, a Read-0nly Memory (ROM), a Random Access Memory (RAM), or the like.
The foregoing is directed to embodiments of the present invention and it will be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (4)
1. A polar code BP decoding method for reducing a turnover set is characterized by comprising the following steps:
s1, carrying out common BP decoding, receiving the log-likelihood ratio value from the channel by the decoder, and setting the prior LLR of all non-frozen bits as 0;
s2, stopping iteration when the iteration decoding process reaches the maximum iteration times M, and obtaining a decoding result u i Recording the left information value S times before the iteration is finished, and calculating the average value AVE _ S and the variance VAE _ S of the left information value;
s3, decoding result u i Performing CRC, if the CRC fails, selecting the T value with the maximum variance VAE _ S to construct a coarse turning set FS;
s4, calculating the bit error rate aiming at the T bits of the rough turnover set FS to obtain the bit error rate estimated value P obtained after passing through the Gaussian channel E And bit error rate P of BP decoded information bit BP Then compare P E And P BP If P is the size of E (i)＜P BP (i) Then u after BP decoding is carried out i Bringing the fine turning set into a fine turning set, and finally obtaining a fine turning set FS'; wherein i represents the ith bit;
s5, performing single-bit upset decoding on the fine upset set FS', performing M times of iteration process of common BP decoding after the single-bit upset decoding is completed to obtain a decoding result, performing CRC (cyclic redundancy check) on the decoding result, repeating the single-bit upset decoding operation if the CRC fails until the CRC passes or the number of bit upsets reaches the size of the fine upset set, and outputting the decoding result; if the final number of bit flips reaches the size of the fine flip set and none of the CRCs passes, go to step S6;
s6, carrying out multi-bit overturning, combining bits in the fine overturning set FS 'by omega to form a new overturning set FS', enabling omega to be 1 initially and sequentially increasing in sequence, namely enabling omega to be omega +1, carrying out multi-bit overturning on the overturning set FS 'by taking omega bits as a unit, carrying out M times of iteration of common BP decoding after multi-bit overturning to obtain a decoding result, and carrying out CRC (cyclic redundancy check) on the decoding result until the CRC passes or omega is more than T', and outputting the decoding result; if the CRC does not pass, continuing to execute the multi-bit overturning process until the CRC passes or the overturning times reach the size of a fine overturning set FS'; if the number of times of the roll-over reaches the size of the fine roll-over set FS ″ and the CRC check fails, let ω be ω +1, and re-execute the process of step S6; wherein T' represents the size of the fine flip set.
2. The BP decoding method according to claim 1, wherein the estimated value P of the bit error rate is obtained after passing through Gaussian channel E The calculation formula is as follows:
wherein erfc (·) represents a complementary error function, and is used for solving the bit error rate;
indicating the expectation of the log-likelihood ratio value LLR for the ith bit, N the code length, Y the received signal,
which represents the result of the ideal decoding process,
representing the actual decoding result.
3. The BP decoding method according to claim 1, wherein the actual bit error rate P of the BP decoded information bits is BP The calculation formula is as follows:
wherein the content of the first and second substances,
is the average of the S LLR iteration information, P BP Is the actual bit error rate after BP decoding,
the result of the decoding is represented by,
indicating the actual decoding result, Y the received signal, and i the ith bit.
4. The method of claim 1, wherein the expression of the fine flip set is FS' { i e a | P £ BP (i)>P E (i) The size is T', the fine turning sets are arranged in descending order of error rate difference, A represents the index of the sub-channel, P represents the index of the sub-channel BP (i) Representing the bit error rate, P, of the BP decoded information bits E (i) Representing the estimated value of the bit error rate after passing through the gaussian channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110249080.4A CN113014271B (en) | 2021-03-08 | 2021-03-08 | Polarization code BP decoding method for reducing turnover set |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110249080.4A CN113014271B (en) | 2021-03-08 | 2021-03-08 | Polarization code BP decoding method for reducing turnover set |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113014271A CN113014271A (en) | 2021-06-22 |
| CN113014271B true CN113014271B (en) | 2022-08-12 |
Family
ID=76407803
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110249080.4A Active CN113014271B (en) | 2021-03-08 | 2021-03-08 | Polarization code BP decoding method for reducing turnover set |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113014271B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113572577B (en) * | 2021-07-28 | 2022-04-26 | 北京邮电大学 | Novel method and system for shortening polarization code |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5602878A (en) * | 1994-09-23 | 1997-02-11 | Intel Corporation | Method of delivering stable data across an asynchronous interface |
| CN107078989A (en) * | 2014-09-29 | 2017-08-18 | 阿尔卡特朗讯 | The selection that the wave filter sideband of channel quality in the multicarrier of general filtering suppresses |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN109586730A (en) * | 2018-12-06 | 2019-04-05 | 电子科技大学 | It is a kind of based on the polarization code BP decoding algorithm intelligently post-processed |
| CN110719110A (en) * | 2019-09-19 | 2020-01-21 | 东南大学 | Noise gradient descent decoding method of LDPC code based on single bit inversion |
| CN111416624A (en) * | 2020-03-27 | 2020-07-14 | 网络通信与安全紫金山实验室 | Polarization code belief propagation decoding method, equipment and storage medium |
| CN111970009A (en) * | 2020-08-21 | 2020-11-20 | 东南大学 | Cascaded polarization code bit reversal belief propagation coding and decoding method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7099400B2 (en) * | 2003-01-22 | 2006-08-29 | Agere Systems Inc. | Multi-level pulse amplitude modulation receiver |
| US7240273B2 (en) * | 2004-05-13 | 2007-07-03 | Industrial Technology Research Institute | Cyclic redundancy check modification for message length detection and error detection |
| US8468431B2 (en) * | 2010-07-01 | 2013-06-18 | Densbits Technologies Ltd. | System and method for multi-dimensional encoding and decoding |
| EP3648378B1 (en) * | 2018-10-31 | 2023-07-26 | MaxLinear Asia Singapore Private Limited | Method and apparatus for binary signal reception, clock data recovery, and soft decoding |
-
2021
- 2021-03-08 CN CN202110249080.4A patent/CN113014271B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5602878A (en) * | 1994-09-23 | 1997-02-11 | Intel Corporation | Method of delivering stable data across an asynchronous interface |
| CN107078989A (en) * | 2014-09-29 | 2017-08-18 | 阿尔卡特朗讯 | The selection that the wave filter sideband of channel quality in the multicarrier of general filtering suppresses |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN109586730A (en) * | 2018-12-06 | 2019-04-05 | 电子科技大学 | It is a kind of based on the polarization code BP decoding algorithm intelligently post-processed |
| CN110719110A (en) * | 2019-09-19 | 2020-01-21 | 东南大学 | Noise gradient descent decoding method of LDPC code based on single bit inversion |
| CN111416624A (en) * | 2020-03-27 | 2020-07-14 | 网络通信与安全紫金山实验室 | Polarization code belief propagation decoding method, equipment and storage medium |
| CN111970009A (en) * | 2020-08-21 | 2020-11-20 | 东南大学 | Cascaded polarization code bit reversal belief propagation coding and decoding method |
Non-Patent Citations (3)
| Title |
|---|
| Improved Segmented SC-Flip Decoding of Polar Codes Based on Gaussian Approximation;Ying Fang等;《2019 4th International Conference on Smart and Sustainable Technologies (SpliTech)》;20190801;全文 * |
| 一种格基约减辅助的改进球形译码检测算法;王华华等;《光通信研究》;20191203(第6期);52-57 * |
| 极化码编译码算法的研究其仿真;朱晓峰等;《电子测量技术》;20200823;第43卷(第16期);82-86 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113014271A (en) | 2021-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108282264B (en) | Polar code decoding method based on bit flipping serial elimination list algorithm | |
| CN109660264B (en) | High performance polar code decoding algorithm | |
| USRE44421E1 (en) | Decoding apparatus for low-density parity-check codes using sequential decoding, and method thereof | |
| CN110278002B (en) | Bit-flipping-based polarization code belief propagation list decoding method | |
| CN109286405B (en) | Low-complexity polarization code progressive bit flipping SC decoding method | |
| CN110233628B (en) | Self-adaptive belief propagation list decoding method for polarization code | |
| CN111490796B (en) | Belief propagation decoding method based on dynamic flip bit | |
| TW202145723A (en) | A method of decoding the polar codes based on belief propagation | |
| CN111988045B (en) | Improved polarization code SCF decoder based on genetic algorithm | |
| CN110661533B (en) | Method for optimizing decoding performance of decoder for storing polarization code | |
| CN112332864A (en) | Polar code decoding method and system for self-adaptive ordered mobile pruning list | |
| CN113014271B (en) | Polarization code BP decoding method for reducing turnover set | |
| CN110995279A (en) | Polarization code combined SCF spherical list overturning decoding method | |
| CN110830167A (en) | Multi-bit flipping-based polar code Fast-SSC decoding algorithm | |
| CN114285419A (en) | Self-adaptive code length low-complexity BPL (binary Pattern) decoder | |
| CN110730007B (en) | Polarization code SSCL decoding path splitting method, storage medium and processor | |
| CN116614142A (en) | Combined decoding method based on BPL decoding and OSD decoding | |
| CN111130567A (en) | Polar code belief propagation list decoding method adding noise disturbance and bit reversal | |
| CN113315526B (en) | Cascade polarization code bit freezing belief propagation decoding method | |
| CN112104379B (en) | Polarization code confidence propagation dynamic overturning decoding method based on key set | |
| CN112929036A (en) | Confidence propagation dynamic flip decoding method based on log-likelihood ratio | |
| CN112737600B (en) | Decoding method and decoder | |
| CN113556135A (en) | Polarization code belief propagation bit flipping decoding method based on frozen flipping list | |
| CN113114274A (en) | Simplified polar code continuous elimination list decoder based on segmented key set | |
| Hu et al. | Flexible and simplified multi-bit successive-cancellation list decoding for polar codes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |