CN111313913B - Low-delay cross-scheduling polarization code BP decoding method and device - Google Patents
Low-delay cross-scheduling polarization code BP decoding method and device Download PDFInfo
- Publication number
- CN111313913B CN111313913B CN202010269916.2A CN202010269916A CN111313913B CN 111313913 B CN111313913 B CN 111313913B CN 202010269916 A CN202010269916 A CN 202010269916A CN 111313913 B CN111313913 B CN 111313913B
- Authority
- CN
- China
- Prior art keywords
- information
- decoding
- iteration
- factor graph
- sub
- 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
-
- 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2948—Iterative decoding
- H03M13/2951—Iterative decoding using iteration stopping criteria
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention provides a low-delay cross scheduling polarization code BP decoding method and a device, comprising the following steps: presetting the maximum iteration times of a BP decoder and initializing; iterative decoding is carried out on the coding information of the polarization code by adopting a cross scheduling BP decoding algorithm, the parameters of the polarization code are (N, K), N is the code length, K is the information bit length, and the corresponding factor graph comprises N-log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein each order of basic operation module comprises N/2 basic calculation units, and each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right; after each iteration is finished, freezing judgment is carried out on the sub-factor graph contained in the order basic operation module where the newly updated right information is located, and if all the sub-factor graphs contained in the order basic operation module are frozen, decoding iteration is stopped; otherwise, continuing iteration until the maximum iteration times is reached. The invention can effectively reduce the decoding delay and can not cause the loss of the decoding performance.
Description
Technical Field
The invention relates to polar code decoding, in particular to a cross scheduling polar code BP decoding method and device with low time delay.
Background
In the international information theory ISIT conference in 2008, Arikan first proposed the concept of channel polarization, and based on this theory, Arikan proposed a polarization code in 2009, and proved that under any given Binary discrete memoryless channel (B-DMC), when the length of the polarization code tends to infinity, the channel capacity can be reached. Polar codes are the first coding method that can be strictly proven to achieve channel capacity, and their error correction performance has surpassed the widely used Turbo codes and LDPC codes at present. In 11 months 2016, the international mobile telecommunications standardization organization 3GPP finally determined that the coding scheme of the 5G eMBB (enhanced mobile broadband) scene control channel is a polar code at 1#87 meetings held by linuo, nevada.
Among the decoding algorithms of the polar code, a Successive Cancellation (SC) algorithm and a Belief Propagation (BP) algorithm are two common decoding algorithms of the polar code. The SC decoding algorithm adopts serial decoding, and has low calculation complexity but higher decoding time delay. Different from the SC decoding algorithm, the BP algorithm is an iterative algorithm, the data processing process is parallel, the decoding time delay is low, and the error rate is superior to that of the original SC algorithm, so that the BP algorithm has certain superiority in the application scene of low delay.
As another BP decoding algorithm, a Soft Cancellation (SCAN) algorithm is used, and compared with a flood BP decoding algorithm, the SCAN algorithm has low computational complexity and less memory for storing Soft information. Thanks to the SCAN algorithm, the information is more efficiently propagated and converges faster than the flood BP. However, the serial scheduling similar to the SC algorithm is adopted in the SCAN algorithm, and although the decoding computation complexity can be reduced, the decoding delay is high, and the throughput rate is low.
For the traditional BP decoding algorithm, the round-trip updating process of propagating and updating node information in the factor graph from one end of the factor graph to the other end is iteratively scheduled. The iterative scheduling has an important influence on the convergence speed and the decoding time delay of the BP decoding algorithm. In order to reduce decoding delay and iteration times as much as possible, a related scholars provides a quick-way scheduling mode based on CSFG (connected sub-factor graph) freezing, and although decoding delay and energy consumption are reduced, decoding performance still has a certain gap compared with a traditional BP algorithm.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a cross-scheduling polarization code BP decoding method with low time delay, which can reduce the decoding time delay.
The cross scheduling polarization code BP decoding method with low time delay provided by the invention comprises the following steps:
step S1: presetting the maximum iteration times of a BP decoder and initializing the BP decoder;
step S2: iterative decoding is carried out on the coding information of the polarization code by adopting a cross structure scheduling BP decoding algorithm, the parameters of the polarization code are (N, K), N is the code length, K is the length of the information bit, and the corresponding factor graph comprises N-log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein each order of basic operation module comprises N/2 basic calculation units, and each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right;
step S3: every time the first-order right information is updated, freezing judgment is carried out on the sub-factor graph in the basic operation module of the order, and if all the sub-factor graphs contained in the basic operation module of the first order are frozen, decoding iteration is stopped; otherwise, continuing the iteration until reaching the preset maximum iteration times.
Preferably, at the t-th iterationIn the middle, the left information of the ith row and the jth column node is recorded as
Its right information is recorded as
Preferably, at each iteration, the factor graph has left information of n/2 columns of nodes and right information of n/2 columns of nodes updated in parallel, the left information and the right information are updated in a cross mode, and each iteration needs 2 clocks (clock).
Preferably, the j-th order basic operation module comprises 2jIndividual factor graph, corresponding to the input information length of 2n-jAnd the output information length of the sub factor graph is equal to the input information length;
preferably, after each clock finishes updating information, sequentially performing sub-factor graph freezing judgment on the node likelihood information of the order basic operation module where the newly updated right information is located from top to bottom, judging whether all sub-factor graphs contained in the same order basic operation module are frozen after each iteration is finished, stopping the iteration if all sub-factor graphs contained in the same order basic operation module are frozen, and outputting a decoding result; otherwise, continuing the iteration until the iteration reaches the maximum iteration number of the preset value.
Preferably, the sub-factor graph with the input information length being less than 16 is not frozen, meanwhile, the sub-factor graph with the input information length being more than 128 needs to meet the freezing standard twice, and the rest of the sub-factor graphs need to meet the freezing condition after three iterations, so that the sub-factor graph is frozen, otherwise, the sub-factor graph of the basic operation module cannot be frozen.
Preferably, when the condition of stopping iteration in advance based on the freezing of the sub-factor graph is met, the product of the information estimation value of the basic operation module node meeting the freezing condition of the sub-factor graph and the generation matrix is used as a final decoding result to judge whether the decoding is correct; otherwise, iteration is continued until the maximum iteration times is reached, and decoding hard decision is carried out on the likelihood information of the node of the rightmost column in the factor graph, so that whether decoding is correct or not is judged. Preferably, when decoding is started, it will receive To-be-decoded polarization code sequence
Log likelihood ratio sequence of (2)
And (3) transferring the right information of the leftmost column node in the factor graph, and initializing the left information of the (n +1) th column node according to the position information of the leftmost column node.
Preferably, the formula is iteratively updated according to the initialized position information of the left information of the (n +1) th column of nodes and the BP decoding algorithm, the left information of the nth column of nodes is initialized, and the likelihood information of the rest nodes is initialized to 0.
The cross scheduling polarization code BP decoding device with low time delay provided by the invention comprises the following modules:
the BP decoder adopts a cross structure scheduling BP decoding algorithm to carry out iterative decoding on the coding information of the polarization code, and presets the maximum iterative times;
an arithmetic processing module including n log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein N is the code length of a polarization code, each order of basic operation module comprises N/2 basic calculation units, and each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right;
the freezing judgment module is used for freezing and judging the sub-factor graph in the order basic operation module where the newly updated right information is located after each iteration is finished, and stopping decoding iteration if all the sub-factor graphs contained in the order basic operation module are frozen; otherwise, continuing the iteration until reaching the preset maximum iteration times.
Compared with the prior art, the invention has the following beneficial effects:
compared with other traditional scheduling BP decoding algorithms, the improved scheduling polarization code BP decoding method with the cross structure effectively reduces decoding delay and does not cause decoding performance loss; the invention reduces the first-order computing unit, and compared with the traditional decoding algorithm, the invention reduces the computational complexity of decoding and accelerates the convergence of decoding.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts. Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
fig. 1 is a flowchart of a cross-scheduling polarization code BP decoding method with low delay in an embodiment of the present invention;
FIG. 2 is a factor graph of BP decoding with a code length of 8 according to an embodiment of the present invention;
FIG. 3 is a basic computing unit of the BP decoding algorithm according to the embodiment of the present invention;
FIG. 4 is a comparison of decoding performance of the decoding method according to the embodiment of the present invention and the scheduling decoding method according to the prior art;
FIG. 5 is a decoding delay comparison between the decoding method of the present invention and the scheduled decoding method of the prior art;
fig. 6 is a block diagram of a cross-scheduling polarization code BP decoding apparatus with low latency according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that variations and modifications can be made by persons skilled in the art without departing from the spirit of the invention. All falling within the scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
The invention provides a low-delay cross scheduling polarization code BP decoding method, which aims to solve the problems in the prior art.
The following describes the technical solutions of the present invention and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present invention will be described below with reference to the accompanying drawings.
Fig. 1 is a flowchart of a cross scheduling polar code BP decoding method with low time delay in an embodiment of the present invention, and as shown in fig. 1, the cross scheduling polar code BP decoding method with low time delay provided by the present invention includes the following steps:
step S1: presetting the maximum iteration times of a BP decoder and initializing the BP decoder, updating right information of a leftmost column node and left information of a rightmost column node of a polarization code factor graph as a formula (1), and initializing likelihood information of other nodes to be 0;
Step S2: iterative decoding is carried out on the coded information of the polarization code by adopting a cross structure scheduling BP decoding algorithm, the parameters of the polarization code are (N, K), N is the code length, and K is the information bitLength, the corresponding factor graph includes n log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein each order of basic operation module comprises N/2 basic calculation units, each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right, and the left information and the right information of the node can be updated according to an updating formula (2);
step S3: after each iteration is finished, freezing judgment is carried out on the sub-factor graph in the order basic operation module where the newly updated right information is located, and if all the sub-factor graphs of the order basic operation module are frozen, decoding iteration is stopped; otherwise, continuing the iteration until reaching the preset maximum iteration times.
Wherein A is a serial number set of information bits, AcA set of frozen bit sequences; y isiRepresenting the sequence received from the channel, σ2Is the variance of the noise value following a normal distribution, with a mean value of 0.
Where f (a, b) ═ sign (a) sign (b) min (| a |, | b |), α is a scaling factor, and i and j are natural numbers.
FIG. 2 is a factor graph of BP coding with code length of 8 according to the embodiment of the present invention, as shown in FIG. 2, the factor graph includes n ═ log2And 8, each order comprises 4 basic computing units, and each node comprises 12 nodes in the factor graph, wherein each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right.
FIG. 3 is a basic computing unit of the BP decoding algorithm according to the embodiment of the present invention, as shown in FIG. 3, wherein
And
representing the left information updated from right to left and the right information from left to right of the node (i, j) at the time of the t-th iteration. When the decoding is started, the sequence to be decoded is transmitted and received via information
Log likelihood ratio sequence of
And transmitting the right information to the leftmost column node of the factor graph, and initializing the left information of the (n +1) th column node according to the position information of the leftmost column node. At each iteration, L in the update node is propagated from the rightmost side to the lefti,jAnd after reaching the leftmost side, the R in the update node is propagated from right to lefti,j. And after iteration is ended, carrying out decoding hard decision on the likelihood information of the rightmost column so as to judge whether the decoding is correct.
According to the invention, through the position information of the rightmost column node and the BP decoding algorithm iteration updating formula, before decoding starts, the left information of the nth column node is initialized, so that the updating calculation of nth order information is omitted. Compared with the traditional decoding method, the invention can accelerate the decoding convergence speed and reduce the decoding calculation complexity; the rest of the node initialization is the same as the conventional BP decoding initialization.
In the embodiment of the invention, when the decoding is started, the received polarization code sequence to be decoded is decoded
Log likelihood ratio sequence of
And (3) right information transferred to the leftmost column node in the factor graph, and initializing (n +1) th column node left information according to the position information of the leftmost column node.
Iteratively updating a formula according to initialized position information of the left information of the (n +1) th row of nodes and a BP decoding algorithm, initializing the left information of the n-th row of nodes, and initializing the likelihood information of the rest nodes to be 0
In the embodiment of the invention, in each iteration, the left information of n/2 columns of nodes and the right information of n/2 columns of nodes in the factor graph are updated in parallel, the left information and the right information are updated in a cross mode, and each iteration needs 2 clocks (clock). In the t iteration, the left information of the ith row and the jth column node is recorded as
Its right information is recorded as
In the embodiment of the invention, the j-th order basic operation module comprises 2jIndividual factor graph, corresponding sub factor graph input information length is 2n-j；
In the embodiment of the invention, after each clock finishes updating information, the node likelihood information of the order basic operation module where the newly updated right information is located is sequentially subjected to sub-factor graph freezing judgment from top to bottom, whether the sub-factor graphs of the same order basic operation module are all frozen is judged after each iteration is finished, if yes, the iteration is stopped, and a decoding result is output; otherwise, continuing the iteration until the iteration reaches the maximum iteration number of the preset value.
And in each iteration, the sub-factor graph of the basic operation module is frozen until three iterations are continuously performed and the freezing condition is met, otherwise, the sub-factor graph of the basic operation module cannot be frozen.
During each iteration, when a condition of stopping iteration in advance based on sub-factor graph freezing is met, taking the product of the information estimated value of the basic operation module node meeting the sub-factor graph freezing condition and the generated matrix as a final decoding result, and judging whether decoding is correct or not; otherwise, after the maximum iteration times is reached, decoding hard decision is carried out on the likelihood information of the node of the rightmost column in the factor graph, so that whether decoding is correct or not is judged.
When the cross scheduling polar code BP decoding method of middle and low time delay provided by the invention is used, for the polar code with the code length N of 1024 and the information bit K of 512, firstly, the polar code is setDetermining the maximum number of decoding iterations, and then decoding the sequence to be decoded
Log likelihood ratio sequence of
Right information R transferred to leftmost column node of factor graphi,0And initializing the left information of the 10 th row of nodes according to the position information of the leftmost row of nodes and a BP decoding algorithm updating formula, wherein the 11 th row of node information is not updated and calculated subsequently, and the rest of node information is initialized to 0. And starting a BP decoding program of cross structure scheduling, wherein the factor graph has 10-order basic operation units, so that left information of 5 columns of nodes and right information of 5 columns of nodes are sequentially arranged in a cross mode and updated in parallel during each iteration. Each clock (clock) carries out freezing judgment on the sub-factor graph of the column where the newly updated right information is located; and after each iteration is finished, judging the sub-factor graph of each order, stopping decoding iteration if the sub-factor graphs of the first order are all frozen, and otherwise, continuing the iteration until the preset maximum decoding iteration number is reached. Fig. 3 is a flowchart of a BP decoding method of cross-structure scheduling.
Fig. 4 shows the error performance of the decoding method in the embodiment of the present invention and the scheduling decoding method in the prior art in the white gaussian noise channel. The code length of the polarization code is 1024, and the information bits are 512 bits. Where the abscissa Eb/N0 is the signal-to-noise ratio and the ordinate is the frame error rate (BLER) and Bit Error Rate (BER) of the decoder. The figure shows the bit error rate and the frame error rate of the proposed cross scheduling decoder, the double-row parallel decoder and the four-way scheduling decoder. As can be seen from fig. 4, the decoding performance of the present invention is not lost with respect to other scheduled BP decoding methods.
Fig. 5 shows the average decoding delay of the decoding method in the embodiment of the present invention and the scheduling decoding method in the prior art in channels with different snr, where the length of the polar code is 1024 and the number of information bits is 512. In the figure, Eb/N0 is the signal-to-noise ratio, and latency (clock) represents the average iterative decoding clock (clock). It can be seen that the average decoding delay of the method of the invention is obviously lower than that of decoding scheduled by other structures, and the decoding delay is effectively reduced.
Fig. 6 is a schematic block diagram of a cross scheduling polar code BP decoding device with low time delay in an embodiment of the present invention, and as shown in fig. 6, the cross scheduling polar code BP decoding device with low time delay provided by the present invention includes the following modules:
The BP decoder adopts a cross structure scheduling BP decoding algorithm to perform iterative decoding on the coding information of the polarization code, and presets the maximum iterative times;
an arithmetic processing module including n log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein N is the code length of a polarization code, each-order basic operation module comprises N/2 basic calculation units, and each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right;
the freezing judgment module is used for freezing and judging the sub-factor graph in the order basic operation module where the newly updated right information is located after each iteration is finished, and stopping decoding iteration if all the sub-factor graphs contained in the order basic operation module are frozen; otherwise, iteration is continued until a preset maximum iteration frequency is reached.
In the embodiment of the invention, compared with other original scheduling BP decoding algorithms, the improved scheduling polarization code BP decoding method with the cross structure effectively reduces decoding delay without causing decoding performance loss; the invention reduces the first-order computing unit, and compared with the traditional decoding algorithm, the invention reduces the computing complexity of decoding and accelerates the convergence of decoding.
In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The foregoing description has described specific embodiments of the present invention. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes and modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention.
Claims (7)
1. A low-delay cross scheduling polarization code BP decoding method is characterized by comprising the following steps:
Step S1: presetting the maximum iteration times of a BP decoder and initializing the BP decoder;
step S2: iterative decoding is carried out on the coding information of the polarization code by adopting a cross structure scheduling BP decoding algorithm, the parameters of the polarization code are (N, K), N is the code length, K is the information bit length, and the corresponding factor graph comprises N-log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein each order of basic operation module comprises N/2 basic calculation units, and each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right;
step S3: every time the first-order right information is updated, freezing judgment is carried out on the sub-factor graph contained in the first-order basic operation module, and if all the sub-factor graphs contained in the first-order basic operation module are frozen, decoding iteration is stopped; otherwise, continuing iteration until reaching the preset maximum iteration times;
during each iteration, the factor graph has parallel updating of the left information of n/2 columns of nodes and the right information of n/2 columns of nodes, the left information and the right information are updated in a cross mode, and each iteration needs 2 clocks (clocks);
when decoding is started, the received code sequence to be decoded is decoded
Log likelihood ratio sequence of 
Transmitting right information to the leftmost column node in the factor graph, and initializing (n +1) th column node left information according to the position information of the leftmost column node;
and (4) iteratively updating the formula according to the initialized position information of the left information of the (n +1) th row of nodes and the BP decoding algorithm, initializing the left information of the nth row of nodes, and initializing the likelihood information of the rest nodes to be 0.
2. The low-latency cross-scheduling polarization code BP decoding method according to claim 1, wherein in the t-th iteration, left information of the ith row and jth column node is recorded as
Its right information is recorded as
3. The low-latency cross-scheduling polarization code (BP) decoding method according to claim 1, wherein the j-th basic operation module comprises 2jIndividual factor graph, corresponding sub factor graph input information length is 2n-jAnd the length of the output information of the sub-factor graph is equal to that of the input information.
4. The low-delay cross scheduling polarization code BP decoding method according to claim 1, characterized in that after each clock finishes updating information, the node likelihood information of the basic operation module of order where the newly updated right information is located is sequentially judged according to the sub-factor graph freezing standard from top to bottom, after each iteration is finished, whether all the sub-factor graphs included in the same basic operation module are frozen are judged, if yes, the iteration is stopped, and a decoding result is output; otherwise, continuing the iteration until the iteration reaches the maximum iteration number of the preset value.
5. The cross-scheduling polarization code BP decoding method with low time delay of claim 4, wherein the freezing standard judgment is not performed on the corresponding sub-factor graph with the input information length less than 16, and the sub-factor graph with the input information length greater than 128 can be frozen only if the freezing condition is satisfied twice, and the other sub-factor graphs need to be frozen if the freezing condition is satisfied after three iterations, otherwise the sub-factor graph of the basic operation module cannot be frozen.
6. The cross-scheduling polarization code BP decoding method with low time delay of claim 4, wherein when the condition of stopping iteration in advance based on sub-factor graph freezing is satisfied, the product of the information estimation value of the node in the basic operation module satisfying the sub-factor graph freezing condition and the generation matrix is used as the final decoding result to judge whether the decoding is correct; otherwise, continuing iteration until the iteration reaches the maximum iteration times, and then carrying out decoding hard decision on the likelihood information of the nodes of the rightmost column in the factor graph so as to judge whether the decoding is correct.
7. A cross scheduling polarization code BP decoding device of low time delay, characterized by that, including the following module:
the BP decoder adopts a cross structure scheduling BP decoding algorithm to carry out iterative decoding on the coding information of the polarization code, and presets the maximum iterative times;
An arithmetic processing module including n log2The system comprises N-order basic operation modules and (N +1) columns of nodes, wherein N is the code length of a polarization code, each order of basic operation module comprises N/2 basic calculation units, and each node comprises two types of likelihood information, namely left information updated from right to left and right information updated from left to right;
the freezing judgment module is used for freezing and judging the sub-factor graph in the order basic operation module where the newly updated right information is located after each iteration is finished, and stopping decoding iteration if all the sub-factor graphs contained in the order basic operation module are frozen; otherwise, continuing the iteration until reaching the preset maximum iteration times;
during each iteration, the factor graph has parallel updating of the left information of n/2 columns of nodes and the right information of n/2 columns of nodes, the left information and the right information are updated in a cross mode, and each iteration needs 2 clocks (clocks);
when decoding is started, the received code sequence to be decoded is decoded
Log likelihood ratio sequence of (2)
Transmitting right information to the leftmost column node in the factor graph, and initializing (n +1) th column node left information according to the position information of the leftmost column node;
and (4) iteratively updating the formula according to the initialized position information of the left information of the (n +1) th row of nodes and the BP decoding algorithm, initializing the left information of the nth row of nodes, and initializing the likelihood information of the rest nodes to be 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010269916.2A CN111313913B (en) | 2020-04-08 | 2020-04-08 | Low-delay cross-scheduling polarization code BP decoding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010269916.2A CN111313913B (en) | 2020-04-08 | 2020-04-08 | Low-delay cross-scheduling polarization code BP decoding method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111313913A CN111313913A (en) | 2020-06-19 |
| CN111313913B true CN111313913B (en) | 2022-05-24 |
Family
ID=71161012
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010269916.2A Active CN111313913B (en) | 2020-04-08 | 2020-04-08 | Low-delay cross-scheduling polarization code BP decoding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111313913B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113014270B (en) * | 2021-02-22 | 2022-08-05 | 上海大学 | Partially folded polarization code decoder with configurable code length |
| CN113162630B (en) * | 2021-04-25 | 2024-04-09 | 扬州大学 | Self-adaptive code length high-rate BP decoder |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105634507A (en) * | 2015-12-30 | 2016-06-01 | 东南大学 | Assembly-line architecture of polarization code belief propagation decoder |
| CN106936543A (en) * | 2017-03-06 | 2017-07-07 | 东南大学 | The figure of the MIMO of polarization code coding merges detection decoding algorithm and device |
| CN108039891A (en) * | 2017-12-22 | 2018-05-15 | 山东科技大学 | A kind of polarization code BP interpretation methods and device based on multistage more new technological process |
| CN109547035A (en) * | 2018-12-30 | 2019-03-29 | 山东科技大学 | The method for building up and decoder hardware framework of flowing water BP polarization decoder hardware framework |
| CN110535477A (en) * | 2019-08-30 | 2019-12-03 | 山东科技大学 | Parallel polarization code coding method |
| CN110635809A (en) * | 2019-09-19 | 2019-12-31 | 东南大学 | Design method of parallel polarization code BP decoder based on formula language |
| KR102064227B1 (en) * | 2018-10-17 | 2020-01-09 | 고려대학교 산학협력단 | Method and Apparatus for Decoding of Polar Codes |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150333775A1 (en) * | 2014-05-15 | 2015-11-19 | Broadcom Corporation | Frozen-Bit Selection for a Polar Code Decoder |
-
2020
- 2020-04-08 CN CN202010269916.2A patent/CN111313913B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105634507A (en) * | 2015-12-30 | 2016-06-01 | 东南大学 | Assembly-line architecture of polarization code belief propagation decoder |
| CN106936543A (en) * | 2017-03-06 | 2017-07-07 | 东南大学 | The figure of the MIMO of polarization code coding merges detection decoding algorithm and device |
| CN108039891A (en) * | 2017-12-22 | 2018-05-15 | 山东科技大学 | A kind of polarization code BP interpretation methods and device based on multistage more new technological process |
| KR102064227B1 (en) * | 2018-10-17 | 2020-01-09 | 고려대학교 산학협력단 | Method and Apparatus for Decoding of Polar Codes |
| CN109547035A (en) * | 2018-12-30 | 2019-03-29 | 山东科技大学 | The method for building up and decoder hardware framework of flowing water BP polarization decoder hardware framework |
| CN110535477A (en) * | 2019-08-30 | 2019-12-03 | 山东科技大学 | Parallel polarization code coding method |
| CN110635809A (en) * | 2019-09-19 | 2019-12-31 | 东南大学 | Design method of parallel polarization code BP decoder based on formula language |
Non-Patent Citations (2)
| Title |
|---|
| High-Throughput and Energy-Efficient Belief Propagation Polar Code Decoder;Syed Mohsin Abbas等;《 IEEE Transactions on Very Large Scale Integration (VLSI) Systems》;20161114;全文 * |
| 基于FO-BP算法的极化码译码器研究与设计;董雁飞;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20200315;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111313913A (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xu et al. | Improved polar decoder based on deep learning | |
| CN107241106B (en) | Deep learning-based polar code decoding algorithm | |
| US7539920B2 (en) | LDPC decoding apparatus and method with low computational complexity algorithm | |
| Zhang et al. | Reduced-latency SC polar decoder architectures | |
| CN108039891B (en) | Polarization code BP decoding method and device based on multistage updating process | |
| CN107612560B (en) | Polarization code early iteration stopping method based on partial information bit likelihood ratio | |
| USRE44421E1 (en) | Decoding apparatus for low-density parity-check codes using sequential decoding, and method thereof | |
| KR100983692B1 (en) | Communication apparatus and decoding method | |
| CN109586730B (en) | Polarization code BP decoding algorithm based on intelligent post-processing | |
| CN108702290A (en) | Cascade Polarization Coding and sliding window Polarization Coding | |
| CN111313913B (en) | Low-delay cross-scheduling polarization code BP decoding method and device | |
| CN110278001B (en) | Polarization code partition decoding method based on deep learning | |
| CN110233628B (en) | Self-adaptive belief propagation list decoding method for polarization code | |
| Wadayama et al. | Deep learning-aided trainable projected gradient decoding for LDPC codes | |
| CN111835364B (en) | Low-complexity nerve BP decoding method of polarization code | |
| CN109547035B (en) | Method for establishing hardware architecture of pipelined BP polarized decoder and hardware architecture of decoder | |
| Deng et al. | Reduced-complexity deep neural network-aided channel code decoder: A case study for BCH decoder | |
| CN107707333B (en) | Method and device for stopping early iteration of polarization code based on code word estimated value | |
| CN115037315B (en) | Multi-stage flexible self-adaptive SCL pruning method based on Polar codes | |
| JP2005539451A (en) | Method for decrypting data using a data window | |
| CN116505958A (en) | Polarization code decoding method, system, equipment and medium for noise-assisted BPL cascading OSD | |
| Judson et al. | Efficient construction of successive cancellation decoding of polar codes using logistic regression algorithm | |
| CN112332868B (en) | DVB-RCS 2-based turbo parallel decoding method | |
| Che et al. | Overlapped list successive cancellation approach for hardware efficient polar code decoder | |
| CN102164023A (en) | Method for decoding adaptive dynamic quantitative low density parity-check codes (LDPC) |
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 |