CN105680880B - LDPC code dynamic asynchronous update method based on C2V dynamic select strategy - Google Patents
LDPC code dynamic asynchronous update method based on C2V dynamic select strategy Download PDFInfo
- Publication number
- CN105680880B CN105680880B CN201610009679.XA CN201610009679A CN105680880B CN 105680880 B CN105680880 B CN 105680880B CN 201610009679 A CN201610009679 A CN 201610009679A CN 105680880 B CN105680880 B CN 105680880B
- Authority
- CN
- China
- Prior art keywords
- variable node
- node
- residual error
- check
- variable
- 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
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
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention discloses a kind of LDPC code dynamic asynchronous update methods based on C2V dynamic select strategy, in putting in side residual error of the residual sum check-node to variable node for variable node, most unstable variable node is selected using the dynamic select strategy of triple judgements and least reliable side information is updated.It is measurement that the present invention, which does not rely on merely residual error, but it is provided with stability criteria, take full advantage of the dynamic variation characteristic of message during decoding, it is quickly and accurately positioned out least reliable message, more reasonable information updating sequence can be provided for the dynamic asynchronous update method based on variable node and check-node to variable node message residual error, so that the method mentioned can distribute computing resource reasonably to accelerate convergence rate, decoding performance is promoted.
Description
Technical field
The invention belongs to field of communication technology more particularly to a kind of LDPC code dynamic based on C2V dynamic select strategy are different
Walk update method.
Background technique
The sixties in 19th century, Gallager are put forward for the first time LDPC code namely binary low density parity check code.From LDPC
For code after 1996 are rediscovered, LDPC code has just obtained the extensive concern of academia and industry.In this more than ten years
In research process, the excellent properties of LDPC code are gradually shown.LDPC code is a kind of linear block codes with intertexture characteristic,
Just there is good antiburst error performance without introducing interleaver, can avoid time delay.The sparsity of code word itself makes LDPC code
Decoding complexity it is lower, have lower error code it is flat.Decoding algorithm optimization and last performance are configured to from code word
Analysis, LDPC code possess the optimum design method of set of system.LDPC code has highly application prospect, and LDPC code has been at present
Standard code mode is classified as by WiMAX, UWB, satellite digital video, 10G Base-T etc., will also be answered extensively in the following LDPC code
For satellite communication, hydrospace detection, optical transport, quantum secret communication, Hologram Storage etc..
In terms of the interpretation method of LDPC code, from the point of view of the scheduling of information updating, it is broadly divided into three kinds of different message more
New strategy: synchronization message more new strategy, permanent order asynchronous-update strategy and dynamic asynchronous information updating strategy.Dynamic asynchronous disappears
Ceasing more new strategy is that convergence rate is most fast in three kinds of strategies, and error-correcting performance is best, is highly suitable to be applied for needing fast decoding
Occasion.2007, Casado et al. proposed a kind of belief propagation algorithm based on residual error i.e. RBP algorithm, residual values
Size dynamically selects the message to be updated as the measurement in dynamic asynchronous more new algorithm, according to the size of residual error, not solid
Fixed update sequence can update those most unstable node messages with centralized calculation resource priority.RBP algorithm is a greediness
Property higher algorithm, it is every time preferential to update the side information with maximum residul difference.In order to reduce the greediness of RBP algorithm,
Casado proposes greediness lower NWRBP algorithm on the basis of RBP algorithm.Later Kim et al. proposes one kind and is based on
Variable node to check-node VC RBP decoding algorithm, this method using variable node to check-node residual error alternatively
Strategy, to reduce the influence of greediness.Then, Liu et al. people successively proposes a kind of EDS-LBP based on message relative residual degree
Decoding algorithm and Intelligent Dynamic IVC RBP decoding algorithm based on variable node to check-node message residual error, both algorithms
It is all improved in terms of error-correcting performance and convergence rate.Lee et al. is directed to the information updating of dynamic asynchronous more new algorithm
The greediness of unjustness and algorithm has carried out corresponding improvement, although haveing excellent performance, dynamic asynchronous more new algorithm is still deposited
In some shortcomings.Currently, the researcher of LDPC code still carries out in-depth study to dynamic asynchronous more new algorithm, in the hope of
Bigger breakthrough performance.
Dynamic asynchronous more new algorithm dynamically adjusts information updating sequence, and dynamic allocation of resources will lead to information updating not
Fairness.In a decoding iteration, some message can be updated many times and the update times of some message are less or even do not have
It is updated, excessive or very few update can all influence the error-correcting performance and convergence rate of algorithm.Dynamic select strategy decision
The update order of message during decoding is vital a part in dynamic asynchronous more new algorithm, but this respect is ground
Study carefully but seldom.Current most of dynamic asynchronous more new algorithm is all the size according to residual error before and after information updating as message
The measurement that dynamic updates, it is believed that its reliability of the bigger information of residual error is smaller, should preferentially update.In the point based on variable node
Residual sum check-node is into the side residual error of variable node (C2V), and dynamic select strategy is all to select residual error for measurement, still
It is simple to lose accuracy to a certain extent by the dynamic select strategy of residual error, unreliable information can be caused to judge by accident.
Summary of the invention
It is dynamic that in view of the deficiencies of the prior art, the present invention provides a kind of LDPC codes based on C2V dynamic select strategy
State asynchronous refresh method, it takes full advantage of the dynamic variation characteristic of message during decoding, most can not be quickly and accurately positioned
The message leaned on can provide more reasonable information updating sequence, so that method is rationally divided for dynamic asynchronous update method
With computing resource, convergence rate is accelerated, improves decoding performance.
The technical solution adopted by the invention is as follows:
A kind of LDPC code dynamic asynchronous update method (namely V-CVRBP algorithm) based on C2V dynamic select strategy, is becoming
The point residual sum check-node of node is measured into the side residual error of variable node, is selected using the dynamic select strategy of triple judgements
Most unstable variable node and least reliable C2V side information are updated, the dynamic select strategy packet of triple judgements
Include that steps are as follows:
S11. all variable nodes are determined according to stability criteria, unstable variable node is then therefrom if it exists
The maximum unstable variable node of residual error is found out, the variable section with maximum residul difference is otherwise just found out from all variable nodes
Point；Wherein, stability criteria is in the iterative decoding algorithm of LDPC code, if the LLR value symbol of a variable node is continuous
It is remained unchanged after iteration three times, then it is stable for claiming the variable node；
S12. from the variable node of maximum residul difference, the maximum C2V side information of residual error is found；
S13. the maximum unstable variable node of point residual error and will be in dynamic asynchronous more new algorithm when residual error is maximum
Preferentially it is updated；
Wherein, the calculation formula of side residual sum point residual error is r (mk)=| | f (mk)-mk| |, as r (mk) when being side residual error, mk
With f (mk) respectively indicate the side information for updating front and back；As r (mk) when being residual error, mkWith f (mk) respectively indicate the change of update front and back
Measure the LLR value of node.
Based on the dynamic select strategy of triple judgements in the present invention, start to pass through in a wide range of interior unreliable information of search
Search range is reduced after stability criteria condition, is further reduced after the condition filter by variable node maximum point residual error
Search range, final need to only calculate compare side residual error associated with the maximum unstable variable node of residual error to determine least
Stable side information.In addition, front and back is utilized in residual sum point residual error in side, decoding information, stability criteria are utilized continuous three twice
Discriminative information after secondary decoding.New dynamic select strategy takes full advantage of the dynamic characteristic of information during decoding, passes through layer
Layer screening more quickly and accurately provides the update order of message for dynamic asynchronous update method, further speeds up convergence rate,
Improve decoding performance.
Specifically, the present invention verifies the point residual sum that the dynamic select strategy of triple judgements is particularly applicable in variable node
Into the side residual error of variable node, specific steps include the following: node
S21. all variable nodes are determined with stability criteria；It is unsatisfactory for the variable section of stability criteria if it exists
Point, then from unstable variable node set N1In find out the variable node of maximum residul difference；If all variable nodes all meet stabilization
Property criterion, then from stablizing variable node set N2In find out the variable node with maximum residul difference, then execute S21；
S22. the variable node v for finding out and there is maximum residul difference in S21iConnected check-node set Sj, i.e. Sj={ cj|
cj∈N(vi), and find out and set SjIn the connected variable node set V of all check-nodesk, wherein VkInclude variable node
vi；
S23. set of computations SjTo set VkSide residual error, and therefrom find out with the maximum while c in residual errorj2vk；Herein
Side cj2vkNamely the maximum side C2V of the residual error to be found of S12；
S24. the variable node v of the maximum residul difference searched out in S21 to S23iWith the maximum while c in residual errorj2vkAs
Final most unstable variable node and least reliable side, to be preferentially updated in interpretation method.Wherein: N (vi)
It indicates and variable node viThe set of connected all check-nodes.
The update step of an information updating process includes the following: in an iteration
S31. most unstable variable node v is selected according to the dynamic select strategy of triple judgementsiLeast reliable side
cj2vk, update check-node cjTo all and check-node cjConnected variable node N (cj) message, i.e., to all vb∈N
(cj) update message
S32. variable node v is updatedb, and by residual errorWithIt is set to 0；
S33. to all and variable node vkConnected check-node updates variable node vkTo disappearing for these check-nodes
Breath, i.e., to all ca∈N(vk) update message
S34. to all vd∈N(ca)\vi, it is contemplated that calculate residual errorIt prepares for next decoding iteration.
Wherein:Indicate variable node viPoint residual error；Indicate check-node cjTo variable node vk's
Side residual error；N(cj) indicate all and check-node cjThe set of connected variable node；N(ca)\viIt indicates to remove variable node viOutside
All and check-node caThe set of connected variable node；Indicate check-node cjPass to variable node vbLetter
Breath；Indicate variable node vkPass to check-node caInformation.
Compared with prior art, the invention has the benefit that the present invention is not to measure, but set by residual error merely
Stability criteria has been set, the dynamic variation characteristic of message during decoding has been taken full advantage of, most can not be quickly and accurately positioned out
The message leaned on can provide for the dynamic asynchronous update method based on variable node and check-node to variable node message residual error
More reasonable information updating sequence, so that method reasonable distribution computing resource, accelerates convergence rate, improves decoding
Performance.
Detailed description of the invention
Fig. 1: the dynamic select strategic process figure of the triple judgements of the present invention；
Fig. 2: the present invention is based on C2V dynamic select strategic process figures；
Fig. 3: the present invention is based on the selection schematic diagrames that can least keep to the side in C2V dynamic select strategy；
Fig. 4: V-CVRBP decoding algorithm schematic diagram of the present invention；
The error-correcting performance of Fig. 5: 1/2- (576,288) LDPC code compares；
The error-correcting performance of Fig. 6: 1/2- (1152,576) LDPC code compares；
Fig. 7: 1/2- (576,288) LDPC code constringency performance when signal-to-noise ratio is 2.5dB compares.
Specific embodiment
Present invention is further described in detail with reference to the accompanying drawing.
It is that the present invention is based on three major punishments that the LDPC code dynamic asynchronous update method of C2V dynamic select strategy proposes such as Fig. 1
Fixed dynamic select strategic process figure.
S11. all variable nodes are determined according to stability criteria, unstable variable node is then therefrom if it exists
The maximum unstable variable node of residual error is found out, the variable section with maximum residul difference is otherwise just found out from all variable nodes
Point；Wherein, stability criteria is in the iterative decoding algorithm of LDPC code, if the LLR value symbol of a variable node is continuous
It is remained unchanged after iteration three times, then it is stable for claiming the variable node；
S12. from the variable node with maximum point residual error, the C2V side information with maximum side residual error is found；
S13. the maximum unstable variable node of point residual error and will be in dynamic asynchronous more new algorithm when residual error is maximum
Preferentially it is updated；
Wherein, the calculation formula of side residual sum point residual error is r (mk)=| | f (mk)-mk| |, as r (mk) when being side residual error, mk
With f (mk) respectively indicate the side information for updating front and back；As r (mk) when being residual error, mkWith f (mk) respectively indicate the change of update front and back
Measure the LLR value of node.
Such as Fig. 2, according to stability criteria, variable node point residual sum check-node to variable node side residual error this three
The process that a condition is searched for layer by layer finally obtains most unstable variable node and least reliable side information, and in decoding side
Priority processing in method.Specific step is as follows:
S21. all variable nodes are determined with stability criteria；It is unsatisfactory for the variable section of stability criteria if it exists
Point, then from unstable variable node set N1In find out the variable node of maximum residul difference；If all variable nodes all meet stabilization
Property criterion, then from stablizing variable node set N2In find out the variable node with maximum residul difference, then execute S21；
S22. the variable node v for finding out and there is maximum residul difference in S21iConnected check-node set Sj, i.e. Sj={ cj|
cj∈N(vi), and find out and set SjIn the connected variable node set V of all check-nodesk, wherein VkInclude variable node
vi；
S23. set of computations SjTo set VkSide residual error, and therefrom find out with the maximum while c in residual errorj2vk；S24.
The variable node v of the maximum point residual error searched out in S21 to S23iWith the maximum while c in residual errorj2vkAs it is final least
Stable variable node and least reliable side, to be preferentially updated.Wherein: N (vi) indicate and variable node viConnected institute
There is the set of check-node.
In the present invention, all variable nodes have been divided into two parts by stability criteria, are searching for most unstable variable
The variable section with maximum point residual error need to be only selected when node in the part variable node set for being unsatisfactory for stability criteria
Point.Only all variable nodes all meet stability criteria, i.e. in Fig. 2When, it just can be from all stable variables
The maximum variable node of residual error is chosen in node set as the variable node preferentially updated.
By the screening of stability criteria and maximum variable node message point residual error, so that check-node is to variable node
(C2V) calculating of side residual error and comparison range reduce very much.
The present invention when searching for least reliable check-node to variable node (C2V) side information, slightly expand by search range
It is connected in minor structure to most unstable variable node greatly, as shown in Figure 3.The search of maximum side residual error is no longer only and unstable change
Measure node vi3 connected sides, but be expanded to from check-node cjAll sides set out.Although search range slightly expands
A bit, but the greediness of algorithm can be improved to a certain extent in this way.
The update step of an information updating process includes the following: in an iteration
S31. most unstable variable node v is selected according to the dynamic select strategy of triple judgementsiLeast reliable side
cj2vk, update check-node cjTo all and check-node cjConnected variable node N (cj) message, i.e., to all vb∈N
(cj) update messageAs shown in Fig. 4 (a)；
S32. variable node v is updatedb, and by residual errorWithIt is set to 0；
S33. to all and variable node vkConnected check-node updates variable node vkTo disappearing for these check-nodes
Breath, i.e., to all ca∈N(vk) update messageAs shown in Fig. 4 (b)；
S34. to all vd∈N(ca)\vi, it is contemplated that calculate residual errorAs shown in Fig. 4 (c), done for next decoding iteration
Prepare.
Wherein:Indicate variable node viPoint residual error；Indicate check-node cjTo variable node vk's
Side residual error；N(cj) indicate all and check-node cjThe set of connected variable node；N(ca)\viIt indicates to remove variable node viOutside
All and check-node caThe set of connected variable node；Indicate check-node cjPass to variable node vbLetter
Breath；Indicate variable node vkPass to check-node caInformation.
Implement according to the method described above, can realize the present invention well.It is passed after coding codeword is modulated by channel
It is defeated, at decoding end, is decoded using the decoding algorithm proposed, pass through the available information sequence of iterative decoding.
For the performance of dynamic asynchronous more proposed by the present invention more new algorithm, need to carry out Computer Simulation.Specifically,
Transmitted using LDPC code being randomly generated on awgn channel, and using comprising a variety of different decoding algorithms including this algorithm into
Row decoding, maximum number of iterations 5, maximum mistake frame number are set as 100 frames, and modulation system BPSK, BER performance comparison figure is such as
Shown in Fig. 5 to Fig. 6.Eb/N0Indicate Normalized Signal/Noise Ratio, unit is decibel (dB).It is 576 that Fig. 5 and Fig. 6, which has been respectively compared code length,
With 1152, the irregular codes that code rate is 1/2 is compared using the obtained error-correcting performance of seven kinds of different decoding algorithms.For 576
For code word, when compared with high s/n ratio, the error-correcting performance of V-CVRBP algorithm is slightly better than IVC RBP algorithm, and with it is newest
OV-RBP algorithm is compared then slightly almost.In BER=1.0 × 10-5When, V-CVRBP algorithm can obtain compared with IVCRBP algorithm
Obtain the gain of about 0.2dB.Compared with OV-RBP algorithm, in BER=2.0 × 10-6Place, V-CVRBP algorithm have 0.1dB's or so
Performance boost.When code word increase when, the present invention in V-CVRBP algorithm error-correcting performance superior sex expression it is more obvious.By
As can be seen that the present invention proposes that dynamic asynchronous more new algorithm has better error-correcting performance and lower compared to other algorithms in figure
Error code it is flat.The decoding performance for investigating a kind of decoding algorithm, in addition to error-correcting performance and error code are flat, convergence speed of the algorithm
It is an important index.For the convergent for further analyzing decoding algorithm proposed by the invention, (576,288) code word is solid
Determine as shown in Figure 7 using a variety of different decoding algorithm constringency performance comparison diagrams under signal-to-noise ratio.It can be seen from the figure that of the invention
The dynamic asynchronous of middle proposition updates algorithm and shows cracking convergence property, so as to be reduced by reducing the number of iterations
The complexity of decoding algorithm.
Claims (2)
1. a kind of LDPC code dynamic asynchronous update method based on C2V dynamic select strategy, which is characterized in that in variable node
Point residual sum check-node is selected most unstable into the side residual error of variable node using the dynamic select strategy of triple judgements
Variable node and least reliable C2V side information be updated, the dynamic select strategy of triple judgements include step such as
Under:
S11. all variable nodes are determined according to stability criteria, unstable variable node is then therefrom found out if it exists
The maximum unstable variable node of residual error, otherwise just finds out the variable node with maximum residul difference from all variable nodes；
Wherein, stability criteria is in the iterative decoding algorithm of LDPC code, if the LLR value symbol of a variable node is continuously three times
It is remained unchanged after iteration, then it is stable for claiming the variable node；
S12. from the variable node of maximum residul difference, the maximum C2V side information of residual error is found；
S13. the maximum unstable variable node of point residual error and will be preferential in dynamic asynchronous more new algorithm when residual error is maximum
It is updated；
Wherein, the calculation formula of side residual sum point residual error is r (mk)=‖ f (mk)-mk‖, as r (mk) when being side residual error, mkAnd f
(mk) respectively indicate the side information for updating front and back；As r (mk) when being residual error, mkWith f (mk) respectively indicate update front and back variable section
The LLR value of point；
The dynamic select strategy of triple judgements is particularly applicable in the point residual sum check-node of variable node to variable node
In the residual error of side, specific steps include the following:
S21. all variable nodes are determined with stability criteria；It is unsatisfactory for the variable node of stability criteria if it exists,
Then from unstable variable node set N1In find out the variable node of maximum residul difference；Sentence if all variable nodes all meet stability
According to then from stablizing variable node set N2In find out the variable node with maximum residul difference, then execute S22；
S22. the variable node v for finding out and there is maximum residul difference in S21iConnected check-node set Sj, i.e. Sj={ cj|cj∈N
(vi), and find out and set SjIn the connected variable node set V of all check-nodesk, wherein VkInclude variable node vi；
S23. set of computations SjTo set VkSide residual error, and therefrom find out with the maximum while c in residual errorj2vk；
S24. the variable node v of the maximum residul difference searched out in S21 to S23iWith the maximum while c in residual errorj2vkAs final
Most unstable variable node and least reliable side, to be preferentially updated in interpretation method；
Wherein: N (vi) indicate and variable node viThe set of connected all check-nodes.
2. the LDPC code dynamic asynchronous update method according to claim 1 based on C2V dynamic select strategy, feature exist
In the update step of an information updating process includes the following: in an iteration
S31. most unstable variable node v is selected according to the dynamic select strategy of triple judgementsiLeast reliable side cj2vk,
Update check-node cjTo all and check-node cjConnected variable node N (cj) message, i.e., to all vb∈N(cj) update
Message
S32. variable node v is updatedb, and by residual errorWithIt is set to 0；
S33. to all and variable node vkConnected check-node updates variable node vkTo the message of these check-nodes, i.e.,
To all ca∈N(vk) update message
S34. to all vd∈N(ca)\vi, it is contemplated that calculate residual errorIt prepares for next decoding iteration；
Wherein:Indicate variable node viPoint residual error；Indicate check-node cjTo variable node vkSide it is residual
Difference；N(cj) indicate all and check-node cjThe set of connected variable node；N(ca)\viIt indicates to remove variable node viIt is outer all
With check-node caThe set of connected variable node；Indicate check-node cjPass to variable node vbInformation；Indicate variable node vkPass to check-node caInformation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610009679.XA CN105680880B (en) | 2016-01-04 | 2016-01-04 | LDPC code dynamic asynchronous update method based on C2V dynamic select strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610009679.XA CN105680880B (en) | 2016-01-04 | 2016-01-04 | LDPC code dynamic asynchronous update method based on C2V dynamic select strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105680880A CN105680880A (en) | 2016-06-15 |
| CN105680880B true CN105680880B (en) | 2019-06-07 |
Family
ID=56299404
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610009679.XA Active CN105680880B (en) | 2016-01-04 | 2016-01-04 | LDPC code dynamic asynchronous update method based on C2V dynamic select strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105680880B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106330202B (en) * | 2016-08-18 | 2019-10-25 | 中山大学 | Binary system LDPC code update method based on variable node reliability dynamic select strategy |
| CN106330201B (en) * | 2016-08-18 | 2019-10-25 | 中山大学 | Non-Binary LDPC Coded update method based on variable node reliability dynamic select strategy |
| CN106899309B (en) * | 2017-01-06 | 2020-04-03 | 中山大学 | Low-complexity LDPC dynamic scheduling decoding updating method based on variable node reliability |
| CN107104680B (en) * | 2017-03-20 | 2020-06-16 | 中山大学 | LDPC code decoding updating method based on variable node reliability dynamic selection strategy |
| CN110086476B (en) * | 2019-04-02 | 2021-01-26 | 中山大学 | LDPC code decoding method based on dynamic selection strategy with fixed message updating range |
| CN110086568B (en) * | 2019-04-02 | 2020-09-22 | 中山大学 | LDPC code decoding method based on dynamic selection strategy with variable message updating range |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102195655A (en) * | 2011-02-25 | 2011-09-21 | 山东大学 | Quasi-cyclic LDPC (Low Density Parity Check) decoder and decoding method thereof |
| CN102594365A (en) * | 2012-02-29 | 2012-07-18 | 中山大学 | Dynamic asynchronous BP decoding method |
| CN104639178A (en) * | 2015-03-06 | 2015-05-20 | 中山大学 | Dynamic column updating and decoding method based on LDPC (low-density parity-check) code |
| EP2892157A1 (en) * | 2014-01-02 | 2015-07-08 | Alcatel Lucent | Offset Min-Sum decoding of LDPC codes |
-
2016
- 2016-01-04 CN CN201610009679.XA patent/CN105680880B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102195655A (en) * | 2011-02-25 | 2011-09-21 | 山东大学 | Quasi-cyclic LDPC (Low Density Parity Check) decoder and decoding method thereof |
| CN102594365A (en) * | 2012-02-29 | 2012-07-18 | 中山大学 | Dynamic asynchronous BP decoding method |
| EP2892157A1 (en) * | 2014-01-02 | 2015-07-08 | Alcatel Lucent | Offset Min-Sum decoding of LDPC codes |
| CN104639178A (en) * | 2015-03-06 | 2015-05-20 | 中山大学 | Dynamic column updating and decoding method based on LDPC (low-density parity-check) code |
Non-Patent Citations (2)
| Title |
|---|
| "Effective Informed Dynamic Scheduling for Belief Propagation Decoding of LDPC Codes";Yi Gong等;《IEEE TRANSACTIONS ON COMMUNICATIONS》;20111031;第59卷(第10期);第2683-2691页 |
| "Variable-Node-Based Dynamic Scheduling Strategy for Belief-Propagation Decoding of LDPC Codes";Xingcheng Liu等;《IEEE COMMUNICATIONS LETTERS》;20150228;第19卷(第2期);第147-150页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105680880A (en) | 2016-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105680880B (en) | LDPC code dynamic asynchronous update method based on C2V dynamic select strategy | |
| CN105680876B (en) | LDPC code dynamic asynchronous update method based on V2C dynamic select strategy | |
| CN104467874B (en) | A kind of LDPC code dynamic dispatching interpretation method based on oscillatory variation node | |
| CN104639178B (en) | A kind of dynamic column renewal interpretation method based on LDPC code | |
| CN111277277B (en) | Method and device for reducing decoding delay of polarization code continuous cancellation table decoding algorithm | |
| CN106899309B (en) | Low-complexity LDPC dynamic scheduling decoding updating method based on variable node reliability | |
| CN106330201B (en) | Non-Binary LDPC Coded update method based on variable node reliability dynamic select strategy | |
| CN107276725B (en) | Improved threshold-based SCMA low-complexity parallel multi-user detection method | |
| Liu et al. | Informed decoding algorithms of LDPC codes based on dynamic selection strategy | |
| CN110535475A (en) | A kind of layered self-adapting normalization Min-Sum decoding algorithm | |
| Ghaffari et al. | Improving performance of SCMA MPA decoders using estimation of conditional probabilities | |
| CN110830050A (en) | LDPC decoding method, system, electronic device and storage medium | |
| Qi et al. | A factor graph-based iterative detection of faster-than-Nyquist signaling in the presence of phase noise and carrier frequency offset | |
| CN106330202B (en) | Binary system LDPC code update method based on variable node reliability dynamic select strategy | |
| CN110086476B (en) | LDPC code decoding method based on dynamic selection strategy with fixed message updating range | |
| Hadi et al. | A method to enhance the performance of successive cancellation decoding in polar codes | |
| Khan et al. | EXIT chart behaviour for the hybrid FSO/RF communication system | |
| CN104753542B (en) | For the bit reversal of LDPC code and linear programming combination interpretation method | |
| CN107104680B (en) | LDPC code decoding updating method based on variable node reliability dynamic selection strategy | |
| CN113131950A (en) | Self-adaptive continuous elimination priority decoding method for polarization code | |
| CN106603083B (en) | Improved method based on LDPC code node residual degree belief propagation decoding | |
| CN107241104B (en) | Local different-sign dynamic BP decoding method for LDPC code | |
| CN113572482B (en) | LDPC code minimum sum decoding method based on minimum value only | |
| CN107241103B (en) | Local dynamic BP decoding method for LDPC code | |
| Abdulwahab et al. | Reduced Path Successive Cancellation List Decoding for Polar Codes. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |