CN108092671A - A kind of NB-LDPC code coding methods of high-performance low complex degree - Google Patents
A kind of NB-LDPC code coding methods of high-performance low complex degree Download PDFInfo
- Publication number
- CN108092671A CN108092671A CN201711499749.5A CN201711499749A CN108092671A CN 108092671 A CN108092671 A CN 108092671A CN 201711499749 A CN201711499749 A CN 201711499749A CN 108092671 A CN108092671 A CN 108092671A
- Authority
- CN
- China
- Prior art keywords
- node
- check
- decoding
- emsa
- information
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 238000012545 processing Methods 0.000 claims abstract description 11
- 230000008602 contraction Effects 0.000 claims abstract description 4
- 230000009977 dual effect Effects 0.000 claims abstract description 4
- 238000004422 calculation algorithm Methods 0.000 claims description 9
- 238000006073 displacement reaction Methods 0.000 claims description 4
- 108010042833 7,8-diaminopelargonic acid aminotransferase Proteins 0.000 abstract description 5
- 238000004891 communication Methods 0.000 abstract description 5
- 238000005516 engineering process Methods 0.000 abstract description 3
- 230000009467 reduction Effects 0.000 abstract description 3
- 230000008901 benefit Effects 0.000 abstract description 2
- 230000008569 process Effects 0.000 description 9
- 238000004364 calculation method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 4
- 238000012937 correction Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 229910002056 binary alloy Inorganic materials 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000003339 best practice Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000010287 polarization Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000002834 transmittance 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
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
- H04L1/0063—Single parity check
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a kind of nonbinary low-density checksum of high-performance low complex degree (NB LDPC) code coding methods, belong to field of communication technology.This method realizes the target of high-performance low complex degree in terms of two：1) first, combine simplified minimum and method (SMSA) with high performance and extension minimum and method (T EMSA) respective advantage based on grid, propose improved minimum and method (IT MSA) based on grid, under the same conditions, IT MSA obtain the reduction of the performance slightly more excellent than original method and complexity；2) in addition, will be applied to based on dual threshold contraction method (DTBS) in IT MSA, further computation complexity is greatly reduced, and decoding performance is held essentially constant.By the processing of the two steps, the performance of interpretation method of the invention and optimal extension it is minimum and (EMSA) quite, and complexity is greatly reduced compared with EMSA, SMSA and T EMSA.
Description
Technical field
The present invention relates to a kind of interpretation methods of field of communication technology；Particular in communication system be based on NB-LDPC codes
Interpretation method.
Background technology
In digital communication systems, various noise jammings are inevitably subject to when signal transmits in the channel,
If directly sending signal, the information of mistake is typically received, therefore, in signals transmission, it will usually add in certain
Redundancy correct the error message in transmittance process, forward error correction (FEC) is one of currently used error correcting system, is entangled
It after miscoding, is being decoded after noisy communication channel, a degree of error correction can be carried out.Common error correcting code bag
It includes：Low-density checksum (LDPC) code, Turbo code, BCH code, RS codes, polarization (Polar) code etc..
LDPC code was proposed earliest by doctor Gallager in 1962, and was detailed its coding in its doctoral thesis and translated
Code process, demonstrating this yard has the decoding performance for approaching shannon limit, and since design conditions limited at that time, which sinks
Quiet nearly 30 years ability is lifted and is paid attention to again.Nonbinary LDPC (NB-LDPC) code most prior to 1998 by Davey and
Mackey is proposed, because the code has better decoding performance in middle short code length than binary LDPC code, and is possessed wider
General application scenarios, such as high order modulation, middle short code length, burst-error-correction etc., but do not obtain as binary system LDPC code fast
Speed is promoted, main reason is that the decoding complexity of this yard is always the bottleneck of its application.Confidence level based on most original passes
Broadcasting method q bases and product method (QSPA), the various methods for not changing decoding performance and making complexity reduction are suggested, such as：
With product method (FFT-SPA), based on logarithm and product method (log-SPA) based on Fourier transformation etc., these methods are still
It is not suitable for practical application.Hereafter, some second best measures based on log-domain are suggested, such as：The minimum and method of extension
(EMSA), minimax value method (MMA) etc. in these methods, has been completely abolished complicated multiplication and division arithmetic, has only been included
Addition and comparison operation, this greatly reduces computation complexity, but compared with binary system LDPC decoding algorithms, these soft decoding sides
Case complexity is still very high.In order to obtain the reduction of the complexity of big good fortune degree, part researcher has focused onto hard decoder
In method, based on large-number logical decoding method and bit reversal method, it is proposed that the low interpretation method of some complexities, but these
The decoding performance of method is seriously affected, therefore is lost the necessity and practicability of research.
The main calculation amount of foregoing suboptimum soft decoding method is concentrated in code check node processing (CNP), the letter based on CNP
Change scheme can be mainly divided into two classes：1) the simplification method (FBA) based on forward-backward algorithm；With the simplification method 2) based on grid
(TBA).The former greatest problem is that serial computing is excessive, seriously affects decoding handling capacity, and the latter mainly has at present to be simplified most
Small and method (SMSA), the extension minimum based on grid and method (T-EMSA), the minimax value method (T- based on grid
MMA), when maximum deviation number is selected where appropriate, the decoding performance of SMSA and T-EMSA is suitable, slightly inferior to EMSA, hence it is evident that better than T-
MMA。
It is further noted that in existing interpretation method, decoding process carries out on complete galois field,
That is in order to find out a correct code word, it is necessary to which the symbolic information all received is accounted for, q is also implied that
When larger, it will there are more redundancies to be included, scholar before is but big it is also noted that the presence of the problem
Family has focused on sight on CNP, by the way that the information of each check-node update input is compressed, obtains complexity drop
Low purpose, such as：Improved EMSA, X-EMSA, μ-EMSA etc., these methods have two：1) just for EMSA
CNP simplified；2) when each iteration inputs, be required to additional input information processing operation (such as：It blocks, compress
Deng), output information afterwards will also carry out corresponding inversely processing, this is again so that calculation amount adds.
In order to which simple, intuitive describes, the decoding process of NB-LDPC codes can represent that Tanner figures are one with Tanner figures
Kind of bipartite graph, in its figure, two groups of vertex are called check-node and variable node, correspond respectively to parity matrix row and
Row, the line between two groups of vertex are that row is known as check-node more to operation come definite based on the non-zero position in matrix
Newly, similarly, it will arrange to operation and be known as variable node update.
The content of the invention
Based on the problem present on, emphasis of the present invention carries out comparative study to SMSA and T-EMSA, and on it into one
Step improve, obtain performance on keep not suffering a loss and so that the interpretation method that complexity is greatly reduced, the specific content of the invention include：
A kind of NB-LDPC code coding methods of high-performance low complex degree, the described method includes：
1) initial phase, including check-node and variable node input information initializing；
2) the iteration more new stage, specially：
A) check-node updates：According to initialization information, check-node information is updated, is updated for variable node；
B) variable node updates：With reference to the output information of check-node and channel initialization information, variable node is updated；
C) exploratory decoding：According to variable node output and channel information, carry out exploratory decoding and judge, if meeting odd even
Check equations then return to decoding value；
D) maximum iteration judges：If exploratory decoding is failed, it is made whether that maximum iteration judges, if reaching
To maximum iteration, then decoding failure is announced；
E) normalized：If decoding is not over yet, variable node update output is normalized, will be handled
The message crossed inputs information back to check-node update step as it.
The initial phase employs the contraction scheme based on dual threshold for check-node and variable node processing, i.e.,
By two threshold values T1 and T2, channel information two incomplete Jia Luohua have been retracted to from original complete galois field
On domain.
All input/output informations of the iteration more new stage are confined in two endless integral domains；
Check-node update employs the calculation based on grid, by galois field value into line displacement so that most
Galois field value in excellent configuration is 0, is the configuration of 0 rank, and the scheme that 0 rank of maximum deviation has been selected to configure 4 times is preceding inclined twice
From the update scheme employed in the extension minimum-sum algorithm (T-EMSA) based on grid, after deviate to employ twice and simplify minimum
With the update scheme in algorithm (SMSA)；Normalized is after maximum iteration judgment step.
Technical solution provided by the invention has the beneficial effect that：
While interpretation method of the present invention can be obtained close to the decoding performance of best practice, it is multiple that calculating can be substantially reduced
Miscellaneous degree effectively increases its practical application competitiveness.
Description of the drawings
Fig. 1 is the decoding overview flow chart of the method for the present invention；
Fig. 2 is the check-node update partial process view of the method for the present invention；
Fig. 3 is the check-node update block diagram of the embodiment of the present invention；
Fig. 4 is the check-node update part procedural block diagram of the embodiment of the present invention；
Fig. 5 is the performance simulation graph of the embodiment of the present invention.
Specific embodiment
To make the purpose of the present invention, technical solution and becoming apparent from a little, below in conjunction with attached drawing to the specific of the present invention
Implementation is further described.Implementation below with reference to attached drawing description is exemplary, it is intended to for explaining the present invention,
And it is not considered as limiting the invention.
Referring to Fig. 1, the present invention provides a kind of interpretation method of NB-LDPC codes, including：
101：Initialization：Initiation verification node and variable node input information；
Wherein check-node and variable node processing employs the contraction scheme (DTBS) based on dual threshold, that is, passes through two
Channel information has been retracted to from original complete galois field on two incomplete galois fields by threshold value T1 and T2, it
All input/output informations of the more new stage of iteration afterwards are confined in two endless integral domains, when TI and T2 selections are suitable
In the case of, it is ensured that decoding complexity is greatly reduced under conditions of performance is unaffected.
102：Check-node updates：According to the variable node information that initialization information or last iteration export, update verification
Nodal information updates for variable node；
The step employs the calculation based on grid, by galois field value into line displacement so that in allocation optimum
Galois field value is 0, is that 0 rank configures, and the scheme that 0 rank of maximum deviation has been selected to configure 4 times, preceding deviation twice employs base
Update scheme in the extension minimum-sum algorithm (T-EMSA) of grid, after twice deviate employ simplified minimum-sum algorithm
(SMSA) update scheme in, referring to Fig. 2, step can specifically be divided into：
102a：2 rank Mesh expansions are minimum and method (T-EMSA) is handled：It is 2 to set maximum deviation number, by the variable of input
Nodal information is calculated using T-EMSA；
102b：2 ranks simplify minimum and scheme (SMSA processing)：The input exported as this step that will be calculated in 102a,
It is 2 to set maximum deviation number, is calculated using SMSA, obtains the final output information of check-node.
103：Variable node updates：With reference to the output information of check-node and channel initialization information, variable node is updated；
104：Exploratory decoding：It according to variable node output and channel information, carries out exploratory decoding and judges, if meeting strange
Even parity check equation, then return to decoding value；
105：Maximum iteration judges：If exploratory decoding is failed, it is made whether that maximum iteration judges, if
Reach maximum iteration, then announce decoding failure；
106：Normalized：If decoding is not over yet, variable node update output is normalized, will be located
The message managed inputs information back to 102 check-nodes update step as it.
Wherein, normalized is after maximum iteration judgment step, it is possible to reduce once its number calculated.
Embodiment 1
The embodiment of the present invention proposes the interpretation method that a kind of decoding performance is constant or more excellent but complexity is greatly reduced,
Realize that this method is divided into two steps and completes：1) advantage of comprehensive SMSA and T-EMSA obtains IT-MSA methods, this method tool
There is the characteristics of high decoding performance low complex degree；2) DTBS methods are applied in IT-MSA, into one on the premise of performance is ensured
Step reduces computation complexity.Because in NB-LDPC interpretation methods, most complicated part is check-node update, in the present embodiment
In, it is main to illustrate to check-node renewal process, referring specifically to Fig. 3 and Fig. 4, wherein having chosen a check-node to be shown
Example, the degree (row weight dc) of check-node is 4, and galois field value is 4.
Fig. 3 is the embodiment of the present invention using SMSA and T-EMSA to the result block diagram of code check node processing (CNP), and 201 are
Input information by migration processing, the allocation optimum that T-EMSA is used when the value that solid line connects in figure is a=2, dotted line connection
Value be SMSA select allocation optimum；202 be the output information (not deviating inversely processing) after being treated by SMSA；203 are
T-EMSA treated output informations (not into line displacement inversely processing)；201st, 202 and 203 Far Lefts one are classified as galois field value,
It is represented with variable a；The difference of two methods handling result is shown in overstriking italic numerical value in 202 and 203, and reason exists
The difference of the allocation optimum selected in foregoing 201.It is concluded that：Under equal conditions, property of the T-EMSA than SMSA
It can be a shade better.Additionally by the analysis of complexity to its calculating process：With the increase of maximum deviation number, the calculating of T-EMSA is answered
Miscellaneous degree exponentially rises, and SMSA is gently increased every time with the speed of the increased half of last time；The complexity of SMSA is initial
When about dc/4 times of T-EMSA.Therefore, comprehensive decoding performance and the considerations of complexity, check-node is more in the present invention
It is new employ it is preceding select twice T-EMSA, after select SMSA twice, can obtain that decoding performance is optimal and complexity significantly drops
It is low.
Fig. 4 is the partial routine block diagram that DTBS methods are applied to check-node in IT-MSA methods by the embodiment of the present invention,
It primarily illustrates in node is examined, due to the appearance in incomplete domain, the rational approximation done.Numerical value in 301 and 201
In it is identical, as deviate after input information；Value in 302 is left after for the T2 threshold values in DTBS, input signal is blocked
Value；In 303, in addition to the first row, the numerical value in 302, other values often gone represent respectively：Minimum value (m1), it is minimum
It is worth column (I1), sub-minimum (m2) and sub-minimum column (I2), if in the absence of minimum value or sub-minimum, its approximation is set
Into T2, corresponding minimum value position is set to 0, and as marking signal, the value in 303 will be sent in 102a, as calculating
The input information of additional matrix.Calculating process from 301 to 302 is completed in initialization procedure, and 302 to 303 be every
It is carried out in secondary iterative process, after blocking, it is possible to reduce the complexity minimized with sub-minimum, in configuration process afterwards
In, if it is 0 to run into column position, the configuration can be skipped, so can also reduce computation complexity.The new decoding algorithm obtained
Referred to as TIT-MSA.
Embodiment 2
The interpretation method of proposition has been carried out simulating, verifying by the embodiment of the present invention, and is compared with multiple methods.For
(256,203) NB-LDPC codes, galois field exponent number are 256, the row weight (degree of check-node) of parity matrix for 16,
Row weight (degree of variable node) is 4, and by awgn channel after being modulated using BPSK, the signal of receiving terminal is log-likelihood ratio.It will
(inclined 4), TIT-MSA (final scheme of the present invention) and IT-MSA (first step result of the invention) carry out emulation pair by EMSA, SMSA
Than simulation curve is referring to Fig. 5.Because the maximum deviation numbers of T-EMSA in the literature are only to 3 (notes：In view of the original of complexity
Cause), therefore be not included in this simulation comparison embodiment.It is the optimal value after adjustment that parameter is noted in figure, bent from figure
Line can show that the method proposed can obtain and the comparable decoding performance of EMSA methods.Because EMSA decoding performance by
It turns out to be close to shannon limit, therefore can draw：The method of the present invention has the performance close to shannon limit.
Above example provide technical solution in all or part of content can be realized by software programming,
Software program is stored in the storage medium that can be read, and storage medium includes：Hard disk, CD or floppy disk in computer etc..
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, for the general of the art
For logical technical staff, without departing from the principle of the present invention, several improvement, equivalent substitution, retouching etc. can also be made, this
A little improvements and modifications also should be regarded as protection scope of the present invention.
Claims (5)
1. a kind of NB-LDPC code coding methods of high-performance low complex degree, which is characterized in that the described method includes：
1) initial phase, including check-node and variable node input information initializing；
2) the iteration more new stage, specially：
A) check-node updates：According to initialization information, check-node information is updated, is updated for variable node；
B) variable node updates：With reference to the output information of check-node and channel initialization information, variable node is updated；
C) exploratory decoding：According to variable node output and channel information, carry out exploratory decoding and judge, if meeting even-odd check
Equation then returns to decoding value；
D) maximum iteration judges：If exploratory decoding is failed, it is made whether that maximum iteration judges, if reaching most
Big iterations, then announce decoding failure；
E) normalized：If decoding is not over yet, variable node update output is normalized, it will be processed
Message inputs information back to check-node update step as it.
2. according to the method described in claim 1, it is characterized in that, the initial phase is for check-node and variable node
Processing employs the contraction scheme based on dual threshold, i.e., by two threshold values T1 and T2, by channel information from original complete gal
It has been retracted on Luo Hua domains on two incomplete galois fields.
3. according to the method described in claim 1, it is characterized in that, all input/output informations of the iteration more new stage are equal
It is confined in two endless integral domains described in claim 2.
4. according to the method described in claim 1, it is characterized in that, check-node update employs the calculating based on grid
Mode, by galois field value into line displacement so that the galois field value in allocation optimum is 0, is the configuration of 0 rank, selects
0 rank of maximum deviation configures the scheme of 4 times, and preceding deviation twice is employed in the extension minimum-sum algorithm (T-EMSA) based on grid
Update scheme, after deviate employ update scheme in simplified minimum-sum algorithm (SMSA) twice.
5. according to the method described in claim 1, it is characterized in that, normalized maximum iteration judgment step it
Afterwards.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711499749.5A CN108092671A (en) | 2017-12-27 | 2017-12-27 | A kind of NB-LDPC code coding methods of high-performance low complex degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711499749.5A CN108092671A (en) | 2017-12-27 | 2017-12-27 | A kind of NB-LDPC code coding methods of high-performance low complex degree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108092671A true CN108092671A (en) | 2018-05-29 |
Family
ID=62180999
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711499749.5A Pending CN108092671A (en) | 2017-12-27 | 2017-12-27 | A kind of NB-LDPC code coding methods of high-performance low complex degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108092671A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108880564A (en) * | 2018-06-26 | 2018-11-23 | 清华大学 | A kind of low density parity check code decoding method having caching fault-tolerant ability |
| CN109586844A (en) * | 2018-10-30 | 2019-04-05 | 北京航空航天大学 | A kind of nonuniform protection interpretation method and system based on set |
| CN109802688A (en) * | 2018-12-28 | 2019-05-24 | 杭州中科微电子有限公司 | A kind of m-ary LDPC decoding system and method |
| CN112118013A (en) * | 2019-06-20 | 2020-12-22 | 南京大学 | High-performance low-complexity iterative large number logic decoding method suitable for multi-system LDPC code |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1791855A (en) * | 2003-05-16 | 2006-06-21 | 阿纳洛格装置公司 | Compound galois field engine and galois field divider and square root engine and method |
| CN101542913A (en) * | 2006-12-01 | 2009-09-23 | 原子能委员会 | Method and device for decoding LDPC codes and communication apparatus including such device |
| CN101707489A (en) * | 2009-02-03 | 2010-05-12 | 天津博微科技有限公司 | Oscillation-based m-ary LDPC decoding method |
| CN104052496A (en) * | 2013-03-15 | 2014-09-17 | Lsi公司 | Min-sum Based Hybrid Non-binary Low-density Parity Check Decoder |
| CN106066784A (en) * | 2015-04-23 | 2016-11-02 | 阿尔特拉公司 | For realizing circuit and the method for galois field yojan |
-
2017
- 2017-12-27 CN CN201711499749.5A patent/CN108092671A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1791855A (en) * | 2003-05-16 | 2006-06-21 | 阿纳洛格装置公司 | Compound galois field engine and galois field divider and square root engine and method |
| CN101542913A (en) * | 2006-12-01 | 2009-09-23 | 原子能委员会 | Method and device for decoding LDPC codes and communication apparatus including such device |
| CN101707489A (en) * | 2009-02-03 | 2010-05-12 | 天津博微科技有限公司 | Oscillation-based m-ary LDPC decoding method |
| CN104052496A (en) * | 2013-03-15 | 2014-09-17 | Lsi公司 | Min-sum Based Hybrid Non-binary Low-density Parity Check Decoder |
| CN106066784A (en) * | 2015-04-23 | 2016-11-02 | 阿尔特拉公司 | For realizing circuit and the method for galois field yojan |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108880564A (en) * | 2018-06-26 | 2018-11-23 | 清华大学 | A kind of low density parity check code decoding method having caching fault-tolerant ability |
| CN108880564B (en) * | 2018-06-26 | 2021-09-24 | 清华大学 | Low-density parity check code decoding method with cache fault-tolerant capability |
| CN109586844A (en) * | 2018-10-30 | 2019-04-05 | 北京航空航天大学 | A kind of nonuniform protection interpretation method and system based on set |
| CN109586844B (en) * | 2018-10-30 | 2020-08-04 | 北京航空航天大学 | Set-based unequal protection decoding method and system |
| CN109802688A (en) * | 2018-12-28 | 2019-05-24 | 杭州中科微电子有限公司 | A kind of m-ary LDPC decoding system and method |
| CN109802688B (en) * | 2018-12-28 | 2023-05-26 | 杭州中科微电子有限公司 | Multilevel LDPC decoding system and method |
| CN112118013A (en) * | 2019-06-20 | 2020-12-22 | 南京大学 | High-performance low-complexity iterative large number logic decoding method suitable for multi-system LDPC code |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lian et al. | Learned belief-propagation decoding with simple scaling and SNR adaptation | |
| US8473806B1 (en) | Layered quasi-cyclic LDPC decoder with reduced-complexity circular shifter | |
| US20140229792A1 (en) | Systems and methods for bit flipping decoding with reliability inputs | |
| CN107370490B (en) | Method and device for encoding and decoding structured LDPC (Low Density parity check) | |
| CN108092671A (en) | A kind of NB-LDPC code coding methods of high-performance low complex degree | |
| US10790857B1 (en) | Systems and methods for using decoders of different complexity in a hybrid decoder architecture | |
| US8799742B1 (en) | QC-LDPC decoder with list-syndrome decoding | |
| CN108988872B (en) | LDPC decoding method based on hierarchical minimum sum algorithm | |
| WO2018179246A1 (en) | Check bit concatenated polar codes | |
| Kamenev et al. | A new permutation decoding method for Reed-Muller codes | |
| WO2007085653A1 (en) | Check-irregular ldpc codes for uep | |
| US9614548B1 (en) | Systems and methods for hybrid message passing and bit flipping decoding of LDPC codes | |
| KR102075946B1 (en) | Method and apparatus for decoding of nonbinary parity-check codes in broadcasting and communication systems | |
| CN105556851A (en) | Method and apparatus for identifying first and second extreme values from among a set of values | |
| CN100539441C (en) | A kind of interpretation method of low density parity check code | |
| US20170134048A1 (en) | Message-passing based decoding using syndrome information, and related methods | |
| CN107615666A (en) | The interpretation method and decoding equipment of LDPC shortened codes | |
| CN111034055A (en) | Simplified check node processing in non-binary LDPC decoders | |
| CN112929035A (en) | Coding and decoding method for non-binary polarization code | |
| Mirrezaei et al. | Towards fountain codes | |
| Tsimbalo et al. | CRC error correction for energy-constrained transmission | |
| CN210075203U (en) | Decoding device of LDPC code | |
| US11476870B2 (en) | Variable node processing methods and devices for message-passing decoding of non-binary codes | |
| CN108173550A (en) | A kind of general simplified method suitable for nearly all NB-LDPC interpretation methods | |
| Trifonov | Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180529 |
|
| WD01 | Invention patent application deemed withdrawn after publication |