CN113162630B - Self-adaptive code length high-rate BP decoder - Google Patents
Self-adaptive code length high-rate BP decoder Download PDFInfo
- Publication number
- CN113162630B CN113162630B CN202110450260.9A CN202110450260A CN113162630B CN 113162630 B CN113162630 B CN 113162630B CN 202110450260 A CN202110450260 A CN 202110450260A CN 113162630 B CN113162630 B CN 113162630B
- Authority
- CN
- China
- Prior art keywords
- decoding
- code length
- iteration number
- column
- decoder
- 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
- 238000000034 method Methods 0.000 claims abstract description 31
- 230000003044 adaptive effect Effects 0.000 claims description 20
- 239000011159 matrix material Substances 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 241000169170 Boreogadus saida Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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/11—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 using multiple parity bits
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a self-adaptive code length high-speed BP decoder, which comprises an input code length and a pre-iteration number item pre And maximum iteration number iter max The method comprises the steps of carrying out a first treatment on the surface of the Selecting a scheduling scheme according to the code length; according to the iteration of the traditional BP decoder, judging whether t=0 is smaller than the pre-iteration number iter or not pre The method comprises the steps of carrying out a first treatment on the surface of the If yes, iterating again, and if not, iterating according to the selected scheduling scheme; judging whether t is smaller than the maximum iteration number item max The method comprises the steps of carrying out a first treatment on the surface of the If yes, iterating again, and if not, ending decoding. The invention can ensure the speed of the decoder and the performance after decoding.
Description
Technical Field
The invention relates to the technical field of 5 Gpole decoding research, in particular to a self-adaptive code length high-rate BP decoder.
Background
Polar is a coding scheme which has proven to reach shannon's limit, and has been paid much attention in recent years due to its good performance, wherein Polar codes are mainly decoded in two modes, SC decoding (successive cancellation) and BP decoding (belief propagation), and SC decoding performance is superior to BP decoding, but SC decoding has a longer delay due to the serial characteristic of SC decoding, and BP decoding has a parallel characteristic, so that it is more suitable for low-delay applications.
The present scheduling scheme of BP decoding includes halfway-schedule, dividing basic BP decoding into two parallel segments, and quarter-schedule dividing each segment of the decoding method into two segments based on halfway-schedule, that is, quarter-schedule divides the whole decoding process into four segments to run in parallel, which greatly increases the decoding speed, but since the decoding performance is reduced due to non-uniformity of information in the decoding process, the performance is reduced more significantly with the increase of segments, so we propose a BP decoder with adaptive code length and high rate in order to improve this characteristic.
Disclosure of Invention
This section is intended to outline some aspects of embodiments of the invention and to briefly introduce some preferred embodiments. Some simplifications or omissions may be made in this section as well as in the description summary and in the title of the application, to avoid obscuring the purpose of this section, the description summary and the title of the invention, which should not be used to limit the scope of the invention.
The present invention has been made in view of the above-described problems occurring in the prior art.
Therefore, the invention provides a self-adaptive code length high-speed BP decoder, which can solve the problem of reduced decoding performance caused by uneven information and increased segmentation performance in the decoding process.
In order to solve the technical problems, the invention provides the following technical scheme: includes inputting code length and pre-iteration number item pre And maximum iteration number iter max The method comprises the steps of carrying out a first treatment on the surface of the Selecting a scheduling scheme according to the code length; according to the iteration of the traditional BP decoder, judging whether t=0 is smaller than the pre-iteration number iter or not pre The method comprises the steps of carrying out a first treatment on the surface of the If yes, iterating again, and if not, iterating according to the selected scheduling scheme; judging whether t is smaller than the maximum iteration number item max The method comprises the steps of carrying out a first treatment on the surface of the If yes, iterating again, and if not, ending decoding.
As a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: the method comprises selecting a quater-schedule to divide the whole decoding process into 4 segments, performing the previous iteration times according to the traditional BP decoding scheme, and performing the later iteration times according to a quarter schedule until the maximum iteration times iter are reached max When the decoding is finished; in eighth scheduling, each sub-loop requires m/4 cycles to complete one iteration; in quarter scheduling, only m/2 cycles are required for one iteration, while 2m cycles are required for one iteration in round trip scheduling.
As a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: includes, opening the storage of two matrices, L N×n+1 And R is N×n+1 The initial values of the elements in the matrix are all 0.
As a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: taking the received LLR as input data at the rightmost side in a factor graph, and filling the n+1th column of L; the a priori LLR of the source bit is used as the input data for the leftmost column in the factor graph, filled in the first column of R, as follows,
L i,n+1 ＝LLR,1≤i≤N
as a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: comprises a length of N=2 n The column of the leftmost 2 x 2 block of the pole code is denoted as the first column, and similarly, the column of the rightmost 2 x 2 block is denoted as the nth column; N/2X 2 modules are arranged in each column, and the 1 st, 2 nd and … th modules and the N/2 nd modules are marked from top to bottom in sequence; (i, j), 1.ltoreq.i.ltoreq.N/2, 1.ltoreq.j.ltoreq.n represents the ith 2X 2 module in the j.
As a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: the method comprises the step of selecting the scheduling scheme according to the corresponding code length.
As a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: comprises the steps of setting the pre-iteration number item in advance pre The method comprises the steps of carrying out a first treatment on the surface of the When decoding is carried out, firstly carrying out the traditional BP decoding iteration; when the iteration number reaches the item pre And then, executing the scheduling scheme selected according to the code length until the maximum iteration number is reached, and ending the decoding.
As a preferred embodiment of the adaptive code length high rate BP decoder of the present invention, wherein: comprises performing hard decision according to the following formula to obtain a source sequence (u 1 ,u 2 ,…,u N ) And codeword sequence (x 1 ,x 2 ,…,x N ) The method comprises, as follows,
the invention has the beneficial effects that: the invention selects the corresponding decoding scheduling scheme according to the input code length, if the code length is N=256, namely eight layers are shared on the factor graph of BP, so the invention selects the eighth-schedule scheduling scheme, divides the decoding process into eight parallel sections, reduces the period of the whole decoding process and improves the running speed of the decoder; the parallel processing is carried out on the whole decoding process, so that the decoding performance is reduced finally, and particularly the performance is obviously reduced as the number of the divided segments is increased, the iteration of the first few times is set to be the traditional BP decoding iteration in the decoding process, then the decoding is segmented, and the parallel processing is carried out, so that the speed of a decoder can be ensured, and the performance after the decoding can be ensured.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art. Wherein:
fig. 1 is a flowchart of an adaptive code length high rate BP decoder according to an embodiment of the present invention;
fig. 2 is a factor diagram of a polar code of n=8 of an adaptive code length high rate BP decoder according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a quarter-scheduling of an adaptive code length high rate BP decoder according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a fifth-th scheduling of an adaptive code length high rate BP decoder according to an embodiment of the present invention;
fig. 5 is a schematic diagram illustrating an eighth-rate scheduling of an adaptive code length high-rate BP decoder according to an embodiment of the present invention.
Detailed Description
So that the manner in which the above recited objects, features and advantages of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to the embodiments, some of which are illustrated in the appended drawings. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, but the present invention may be practiced in other ways other than those described herein, and persons skilled in the art will readily appreciate that the present invention is not limited to the specific embodiments disclosed below.
Further, reference herein to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic can be included in at least one implementation of the invention. The appearances of the phrase "in one embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments.
While the embodiments of the present invention have been illustrated and described in detail in the drawings, the cross-sectional view of the device structure is not to scale in the general sense for ease of illustration, and the drawings are merely exemplary and should not be construed as limiting the scope of the invention. In addition, the three-dimensional dimensions of length, width and depth should be included in actual fabrication.
Also in the description of the present invention, it should be noted that the orientation or positional relationship indicated by the terms "upper, lower, inner and outer", etc. are based on the orientation or positional relationship shown in the drawings, are merely for convenience of describing the present invention and simplifying the description, and do not indicate or imply that the apparatus or elements referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention. Furthermore, the terms "first, second, or third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
The terms "mounted, connected, and coupled" should be construed broadly in this disclosure unless otherwise specifically indicated and defined, such as: can be fixed connection, detachable connection or integral connection; it may also be a mechanical connection, an electrical connection, or a direct connection, or may be indirectly connected through an intermediate medium, or may be a communication between two elements. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
Example 1
Referring to fig. 1, for a first embodiment of the present invention, there is provided an adaptive code length high rate BP decoder, specifically including:
s1: input code length, number of pre-iterations iter pre And maximum iteration number iter max ；
S2: selecting a scheduling scheme according to the code length;
s3: according to the iteration of the traditional BP decoder, judging whether t=0 is smaller than the pre-iteration number iter or not pre ；
S4: if yes, iterating again, and if not, iterating according to the selected scheduling scheme;
s5: judging whether t is smaller than the maximum iteration number item max ；
S6: if yes, iterating again, and if not, ending decoding.
Preferably, the embodiment further needs to specify that the steps further specifically include selecting a squarer-schedule to divide the whole decoding process into 4 segments, performing the early iteration count according to the conventional BP decoding scheme, and performing the later iteration count according to a quarter schedule until the maximum iteration count iter is reached max When the decoding is finished; in eighth scheduling, each sub-loop requires m/4 cycles to complete one iteration; in quarter scheduling, only m/2 cycles are required for one iteration, while 2m cycles are required for one iteration in round trip scheduling.
Further, two matrices are stored, L N×n+1 And R is N×n+1 In a matrixThe initial values of the elements are all 0; taking the received LLR as input data at the rightmost side in the factor graph, and filling the input data into the n+1th column of L; the a priori LLR of the source bit is used as the input data for the leftmost column in the factor graph, filled in the first column of R, as follows,
L i,n+1 ＝LLR,1≤i≤N
length n=2 n The column of the leftmost 2 x 2 block of the pole code is denoted as the first column, and similarly, the column of the rightmost 2 x 2 block is denoted as the nth column;
N/2X 2 modules are arranged in each column, and the 1 st, 2 nd and … th modules and the N/2 nd modules are marked from top to bottom in sequence;
(i, j), 1.ltoreq.i.ltoreq.N/2, 1.ltoreq.j.ltoreq.n representing the ith 2X 2 module in the j;
presetting the pre-iteration number item pre When decoding is carried out, the traditional BP decoding iteration is carried out firstly; when the iteration number reaches iter pre Then, executing the scheduling scheme selected according to the code length until the maximum iteration number is reached, and ending decoding; hard decision is made according to the following equation to obtain the source sequence (u 1 ,u 2 ,…,u N ) And codeword sequence (x 1 ,x 2 ,…,x N ) The method comprises, as follows,
it will be understood that, in the conventional BP decoder, the code length N and the information bit K are set, a random generating function is used to generate a K-bit information bit sequence, K better channels are selected from the N channels to transmit information bits through a channel selecting function, and the rest channels transmit frozen bits, so as to form a code with the length N.
According to the formulaEncoding a code of length N, wherein +.>Is the information sequence to be transmitted, G N That is, generating a matrix->n＝log 2 N, get the transmission codeword->Then, BPSK modulation is performed to obtain the sequence +.>Randomly generating a noise sequence->Add->Transmitted in a channel.
Receiving a message from a sender at a receiverDecoding is started with a log-likelihood ratio of +.>
The decoding process is as follows:
length n=2 n Decoding of the polar code is performed by "side-to-side propagation";
(1) Open storage of two matrices, L N×n+1 And R is N×n+1 The initial values of the elements in the matrix are all 0;
(2) Taking the received LLR as the rightmost input data in the factor graph, filling the n+1st column of L, taking the prior LLR of the source bit as the leftmost input data in the factor graph, filling the first column of R
L i,n+1 ＝LLR,1≤i≤N
(3) Length n=2 n The column of leftmost 2 x 2 modules of the pole code is denoted as the first column, and similarly, the column of rightmost 2 x 2 modules is denoted as the nth column, there are N/2 x 2 modules in each column, and the N/2 modules are labeled 1,2, …, N, from top to bottom in sequence, where (i, j) 1.ltoreq.i.ltoreq.n/2, and 1.ltoreq.j.ltoreq.n represents the ith 2 x 2 module in the j.
(4) Starting all 2×2 modules on the nth column for left operation, performing operation according to the following formula,
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
at this time, L i,j ，L i,j+N/2 The LLR received is the LLR received, where for each 2 x 2 block, only the data in two L are calculated, and the data for R is not calculated to the right.
(5) To the right, all 2 x 2 blocks on the first column are started, the operation is performed according to the following formula,
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
at this time, for each 2×2 module, only the data in two R are calculated to the right, and the data in L is not calculated to the left.
(6) The two iterations are combined into a complete BP decoding iteration, and generally, a correct decoding result cannot be obtained by one iteration basically, so that the iteration needs to be continued until the set maximum iteration number is reached, and BP decoding is stopped.
(7) A source sequence (u) is obtained according to 1 ,u 2 ,…,u N ) And codeword sequence (x 1 ,x 2 ,…,x N ) Their decision formula is:
preferably, this embodiment also needs to be explained that, where the decoder proposed in the present invention is different from the conventional BP decoder in the scheduling scheme when information is transferred, the conventional BP decoding uses round-trip scheduling (round-trip scheduling), and the decoder first calculates R information from left to right in its entirety, then calculates L information from right to left, so as to complete an iteration, and then makes a right decision; the adaptive high-rate BP decoder provided by the invention needs to set the code length N in advance and the pre-iteration number item pre And a maximum number of iterations iter max 。
Selecting a proper scheduling scheme according to the set code length N, such as N=2 8 Because the code length factor graph has 8 layers, the choice of the light-schedule divides the whole decoding process into eight segments, the front candidates pre The next is performed according to the traditional BP decoding scheme, and the subsequent iteration is performed according to eighth scheduling until the maximum iteration number iter is reached max Ending decoding; again as n=2 4 Because the code length factor graph has 4 layers, the squarer-schedule is chosen to divide the whole decoding process into 4 segments, the preamble pre The next is performed according to the traditional BP decoding scheme, and the subsequent iteration is performed according to the quarter scheduling until the maximum iteration number iter is reached max And (5) finishing decoding.
In the eighth scheduling, each sub-loop requires m/4 cycles to complete one iteration (m/8 cycles for unidirectional propagation), since the two sub-loops are parallel, in the eighth scheduling, one iteration only requires m/4 cycles, in the fourth scheduling, each sub-loop requires m/2 cycles to complete one iteration (m/4 cycles for unidirectional propagation), since the two sub-loops are parallel, in the fourth scheduling, one iteration only requires m/2 cycles, and one iteration requires 2m cycles for round trip scheduling.
Example 2
Referring to fig. 2 to 5, a second embodiment of the present invention, which is different from the first embodiment, provides verification of an adaptive code length high rate BP decoder, specifically including:
(1) Open storage of two matrices, L N×n+1 And R is N×n+1 The initial values of the elements in the matrix are all 0;
(2) Taking the received LLR as input data at the rightmost side in the factor graph, and filling the n+1th column of L;
the a priori LLR of the source bit is used as the input data for the leftmost column in the factor graph, filled in the first column of R, as follows,
L i,n+1 ＝LLR,1≤i≤N
(3) Length n=2 n The column of the leftmost 2 x 2 block of the pole code is denoted as the first column, and similarly, the column of the rightmost 2 x 2 block is denoted as the nth column;
N/2X 2 modules are arranged in each column, and the 1 st, 2 nd and … th modules and the N/2 nd modules are marked from top to bottom in sequence;
(i, j), 1.ltoreq.i.ltoreq.N/2, 1.ltoreq.j.ltoreq.n representing the ith 2X 2 module in the j;
(4) Selecting a corresponding scheduling scheme according to the set code length, wherein the scheduling scheme corresponding to the code length is shown in table 1, and n=256 is assumed, and the selection of the right-schedule is known from table 1, and the information exchange of eighth scheduling is known from fig. 3 to occur at N/8, N/4,3N/8, N/2,5N/8,3N/4,7N/8, respectively, wherein n=log 2 The updating of the information about N is specifically as follows:
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
table 1: scheduling schemes corresponding to different code lengths.
| Code length N | Selection of scheduling scheme |
| N＝2 4 ＝16 | quarter-schedule |
| N＝2 5 ＝32 | fifth-schedule |
| N＝2 6 ＝64 | sixth-schedule |
| N＝2 7 ＝128 | seventh-schedule |
| N＝2 8 ＝256 | eighth-schedule |
| N＝2 9 ＝512 | ninth-schedule |
| N＝2 10 ＝1024 | tenth-schedule |
(5) Pre-iteration number item set in advance pre When decoding, the traditional BP decoding iteration is carried out, and when the iteration number reaches the item pre Then, executing the scheduling scheme selected according to the code length until the maximum iteration number is reached, and ending decoding;
(6) Hard decision is made according to the following equation to obtain the source sequence (u 1 ，u 2 ，…，u N ) And codeword sequence (x 1 ,x 2 ,…,x N ) Their decision formula is:
the invention selects the corresponding decoding scheduling scheme according to the input code length, if the code length is N=256, namely eight layers are shared on the factor graph of BP, so the invention selects the eighth-schedule scheduling scheme, divides the decoding process into eight parallel sections, reduces the period of the whole decoding process and improves the running speed of the decoder; the parallel processing is carried out on the whole decoding process, so that the decoding performance is reduced finally, and particularly the performance is obviously reduced as the number of the divided segments is increased, the iteration of the first few times is set to be the traditional BP decoding iteration in the decoding process, then the decoding is segmented, and the parallel processing is carried out, so that the speed of a decoder can be ensured, and the performance after the decoding can be ensured.
It should be noted that the above embodiments are only for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that the technical solution of the present invention may be modified or substituted without departing from the spirit and scope of the technical solution of the present invention, which is intended to be covered in the scope of the claims of the present invention.
Claims (4)
1. An adaptive code length high rate BP decoder, characterized by: comprising the steps of (a) a step of,
setting the pre-iteration number iter pre And maximum iteration number iter max ；
An input code length of n=2 n Polar code of (a);
selecting a scheduling scheme according to the factor graph layer number of the code length, wherein the factor graph layer number is determined by n;
firstly, iterating according to a traditional BP decoder, and judging whether the iteration number t is smaller than the pre-iteration number iter or not pre ；
If yes, iterating again; if not, iterating according to the selected scheduling scheme;
judging whether t is smaller than the maximum iteration number item max ；
If yes, iterating again, and if not, ending decoding;
the decoding process is as follows:
(1) Opening two matrices L N×n+1 And R is N×n+1 Store data and store the matrix L N×n+1 And R is N×n+1 The initial values of the internal elements are all set to 0;
(2) Taking the obtained LLR as rightmost input data in the factor graph, and filling the input data into a matrix L N×n+1 N+1 column (L) i，n+1 LLR, 1.ltoreq.i.ltoreq.N; taking the prior LLR of the source bit as the input data of the leftmost column in the factor graph, and filling the matrix R N×n+1 Is a first column of (a);
(3) Length n=2 n The column formed by the leftmost 2 x 2 modules of the pole code is marked as the first column, and the like, the column formed by the rightmost 2 x 2 modules is marked as the nth column, N/2 x 2 modules are arranged in each column, and the N/2 modules are marked as 1,2, … and N/2 modules from top to bottom in sequence, so that (i, j) represents the ith 2 x 2 module in the jth column, wherein i is more than or equal to 1 and less than or equal to N/2, and j is more than or equal to 1 and less than or equal to N;
(4) Starting all 2×2 modules on the nth column by left operation according to the formula
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 Performing operation;
(5) Right operation, start all 2×2 modules on 1 st column according to formula 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 Performing operation;
(6) Combining the two iterations of steps (4) and (5) as a complete BP decoding iteration;
(7) Pre-iteration number item set in advance pre When decoding, the traditional BP decoding iteration is carried out, and when the iteration number reaches the item pre Then, executing the scheduling scheme selected according to the code length, when the iteration number reaches the maximum iteration number item max And (5) ending decoding;
wherein iterating through the conventional BP decoding comprises: according to the formulaEncoding a code of length N, wherein +.>Representing the sequence of information to be transmitted G N Generating a matrix; get the transmission codeword->After that, BPSK modulation is performed on the transmission codeword to obtain the sequence +.>Randomly generating a noise sequence->Adding said sequence->Transmitting in a channel; and receiving the information transmitted by the transmitting end at the receiving end, starting decoding, and acquiring the log likelihood ratio LLR of the transmitted information.
2. The adaptive code length high rate BP decoder of claim 1, wherein: the traditional BP decoding uses round-trip scheduling scheme, the decoder integrally calculates R information from left to right, then calculates L information from right to left, thereby completing one iteration, and then making right judgment.
3. The adaptive code length high rate BP decoder of claim 2, wherein: when the code length n=2 4 When the four-quarter scheduling scheme is selected, the whole decoding process is divided into 4 sections, and during decoding, the traditional BP decoding iteration is performed first, and when the iteration number reaches the preset iteration number iter pre Thereafter, a quarter scheduling scheme is performed until the maximum iteration number iter is reached max At this time, decoding ends.
4. The adaptive code length high rate BP decoder of claim 2, wherein: comprises, when the code length n=2 8 Because the code length factor graph has 8 layers, the eighth scheduling scheme eight-schedule is selected to divide the whole decoding process into eight segments, and when decoding, the front item pre Iterating according to the traditional BP decoding, and when the iteration number reaches a preset iteration number item pre Then, executing according to the eighth scheduling scheme until reaching the maximum iteration number iter max And (5) finishing decoding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110450260.9A CN113162630B (en) | 2021-04-25 | 2021-04-25 | Self-adaptive code length high-rate BP decoder |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110450260.9A CN113162630B (en) | 2021-04-25 | 2021-04-25 | Self-adaptive code length high-rate BP decoder |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113162630A CN113162630A (en) | 2021-07-23 |
| CN113162630B true CN113162630B (en) | 2024-04-09 |
Family
ID=76870452
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110450260.9A Active CN113162630B (en) | 2021-04-25 | 2021-04-25 | Self-adaptive code length high-rate BP decoder |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113162630B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009225325A (en) * | 2008-03-18 | 2009-10-01 | Sony Corp | Decoding method and decoding apparatus, and program |
| CN108092672A (en) * | 2018-01-15 | 2018-05-29 | 中国传媒大学 | A kind of BP interpretation methods based on folding scheduling |
| CN111313913A (en) * | 2020-04-08 | 2020-06-19 | 山东科技大学 | Low-delay cross-scheduling polarization code BP decoding method and device |
| CN111431543A (en) * | 2020-05-13 | 2020-07-17 | 东南大学 | Variable code length and variable code rate QC-L DPC decoding method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9176927B2 (en) * | 2011-11-08 | 2015-11-03 | The Royal Institution For The Advancement Of Learning/Mcgill University | Methods and systems for decoding polar codes |
-
2021
- 2021-04-25 CN CN202110450260.9A patent/CN113162630B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009225325A (en) * | 2008-03-18 | 2009-10-01 | Sony Corp | Decoding method and decoding apparatus, and program |
| CN108092672A (en) * | 2018-01-15 | 2018-05-29 | 中国传媒大学 | A kind of BP interpretation methods based on folding scheduling |
| CN111313913A (en) * | 2020-04-08 | 2020-06-19 | 山东科技大学 | Low-delay cross-scheduling polarization code BP decoding method and device |
| CN111431543A (en) * | 2020-05-13 | 2020-07-17 | 东南大学 | Variable code length and variable code rate QC-L DPC decoding method and device |
Non-Patent Citations (2)
| Title |
|---|
| LDPC 码在 5G 数据信道中实现技术;陈路;《中国优秀硕士论文全文数据库 信息科技辑》;全文 * |
| Pipelined Belief Propagation Polar Decoders;Junmei Yang等;《2016 IEEE International Symposium on Circuits and Systems (ISCAS)》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113162630A (en) | 2021-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106571831B (en) | LDPC hard decision decoding method and decoder based on deep learning | |
| EP2239854B1 (en) | Shortening and puncturing of low-density parity-check (LDPC) codes for channel decoding | |
| CN105637767B (en) | Method and device for processing rate matching of codes | |
| CA2405119C (en) | Apparatus and method for generating codes in communication system | |
| US10608667B2 (en) | Method of low complexity SCL decoding for polar codes and apparatus thereof | |
| EP2099135B1 (en) | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes | |
| US20060136799A1 (en) | LDPC decoding apparatus and method with low computational complexity algorithm | |
| CN107612560B (en) | Polarization code early iteration stopping method based on partial information bit likelihood ratio | |
| US7458011B2 (en) | Low complexity hybrid ARQ scheme based on rate compatible zigzag codes | |
| JP2008172824A (en) | Apparatus and method for coding/decoding block low density parity check code in mobile communication system | |
| KR20090057415A (en) | Method and apparatus for encoding and decoding data | |
| CN108809518B (en) | Method for constructing cascade Spinal code for reducing error performance | |
| CN107395319A (en) | Code-rate-compatible polarization code encoding method and system based on punching | |
| EP3443677B1 (en) | Communication device and communication method using polar codes | |
| CN111050291A (en) | High-coding-sign-degree value broadcasting method based on system online fountain codes | |
| CN113162630B (en) | Self-adaptive code length high-rate BP decoder | |
| CN114285419A (en) | Self-adaptive code length low-complexity BPL (binary Pattern) decoder | |
| JP2001292131A (en) | Device and method for matching transmission rate of next generation mobile communication system | |
| KR101503653B1 (en) | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes | |
| CN111313913B (en) | Low-delay cross-scheduling polarization code BP decoding method and device | |
| CN1254923C (en) | Decoding method and appts. | |
| CN110752851A (en) | Polarization code periodic puncturing pattern construction method based on layered odd-even rearrangement | |
| CN110798284B (en) | Polarization code transmission method based on double BP decoding graph parallel decoding technology | |
| KR101552355B1 (en) | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes | |
| EP1404023A2 (en) | Channel decoder for a european DAB receiver and channel decoding method thereof |
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 |