CN107528597A - A kind of LDPC code post processing interpretation method based on CRC check code - Google Patents
A kind of LDPC code post processing interpretation method based on CRC check code Download PDFInfo
- Publication number
- CN107528597A CN107528597A CN201710871770.7A CN201710871770A CN107528597A CN 107528597 A CN107528597 A CN 107528597A CN 201710871770 A CN201710871770 A CN 201710871770A CN 107528597 A CN107528597 A CN 107528597A
- Authority
- CN
- China
- Prior art keywords
- node
- check
- decoding
- crc check
- crc
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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
- H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
- H03M13/1125—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using different domains for check node and bit node processing, wherein the different domains include probabilities, likelihood ratios, likelihood differences, log-likelihood ratios or log-likelihood difference pairs
-
- 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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
Abstract
The invention discloses a kind of LDPC code based on CRC check code to post-process interpretation method, it is characterized in that, comprise the following steps：1）Perform LBP interpretation methods；2）CRC check：3）LLR value sorts；4）The selection of destination node；5）Node is overturn；6）CRC check again：CRC check is performed to decoding court verdict again in post-processing stages, if verifying successfully, adjudicates successfully decoded and stops decoding, otherwise jump to step 5）Continue to overturn.This method can overturn error bit successively in the subsequent processing stage to erroneous frame, destroy potential trap collection, while relatively low decoding complexity is ensured, improve error floor.
Description
Technical field
The present invention relates to communication technical field, is specially that one kind is based on CRC (CRC Cyclic
Redundancy Check, abbreviation CRC) code LDPC (low-density checksum Low Density Parity-Check, referred to as
LDPC) code post processing interpretation method.
Background technology
LDPC code is a kind of linear block codes proposed first in 1962 by doctor Gallager, due to it possess it is close
The excellent specific property of shannon limit and low decoding complexity, it is widely used in a variety of communication marks such as DVB-S2, WiMax and deep space communication
In standard, but the error floor as caused by trap collection causes LDPC code can not obtain the very low bit error rate in high s/n ratio region,
The serious application for constraining LDPC code and high reliability data transmission occasion being required in data storage and optical communication system etc..For this
One problem, domestic and international researcher begins attempt to use different methods to reduce error floor, and has been achieved for some and grind
Study carefully achievement.
The relation of eight rings and small trap collection in Tan Natu is analyzed from the angle, Tao X etc. of construction LDPC code, is found
By avoiding specific eight ring that small trap collection can be completely eliminated, and then the LDPC code of low error floor is constructed, but added
The big design complexities of code.The decoding based on the elimination of trap collection is proposed from decoding algorithm, T.R.Halford et al. is improved
Algorithm, reach elimination trap collection by adding a small amount of odd degree number check-node, improve the purpose of error floor, but try to search for
It is a np complete problem to go out all trap collection, while also results in the loss of code check.E.Ryan etc. design bit mode,
Tri- kinds of decoder architectures of bit padding and general LDPC are to reduce error floor, but design decoder needs to learn trap collection in advance
Internal information, it is only applicable to certain types of code word.A kind of traceback decoding is proposed in order to solve this problem, Kang J et al.
(Backtracking decoding) strategy, without understanding trap collection relevant information, as long as can in an iteration before look-ahead
Can cause the information bit of decoding failure, by the preliminary log likelihood ratio of its variable node (Log-Likelihood Ratio,
LLR) value overturns and decoded again, but if mistakenly having overturn safe node is possible to that decoding failure can be caused.S.Beomkyu
Et al. propose a kind of post processing scheme, retransmit and read again without data, by adjudicating the change of symbol and LLR amplitudes in code word,
Trap structure set is destroyed, is effectively reduced error floor.But when reaching maximum iteration, the overall decoding of the algorithm is multiple
Miscellaneous degree increased.Zhang X etc. be based on two steps decoding (Two-Stage decoding) method, to the first step decode in not into
The code word of work(decoding is decoded again, and error floor is reduced with this.E.Likhobabin et al. proposes what variable node was deleted
Method, the variable node that symbol changes in iteration twice before and after directly deleting, error floor is reduced with this, but the algorithm
There is certain loss in low signal-to-noise ratio region performance, the error floor under high s/n ratio is still not ideal enough, and the bit error rate needs
Further reduce.
The content of the invention：
The purpose of the present invention is in view of the shortcomings of the prior art, and to locate after providing a kind of LDPC code based on CRC check code
Manage interpretation method.This method can overturn error bit successively in the subsequent processing stage to erroneous frame, destroy potential fall into
Trap collection, while relatively low decoding complexity is ensured, improve error floor.
Realizing the technical scheme of the object of the invention is：
A kind of LDPC code post processing interpretation method based on CRC check code, comprises the following steps：
1) LBP (layered belief propagation Layered Belief-Propagation, abbreviation LBP) interpretation method is performed；
2) CRC check：CRC check is performed to decoding court verdict at the end of step 1) LBP interpretation methods, performs CRC
Verification judgement, if verifying successfully, adjudicates successfully decoded and stops decoding, otherwise perform next step；
3) LLR (log-likelihood ratio, Log-Likelihood Ratio, abbreviation LLR) value sorts：To variable section in erroneous frame
The posteriority LLR value of point is arranged by ascending order, obtains orderly sequence node；
4) selection of destination node：Several destination nodes composition BN (bad sections before being chosen from ordering sequence node
Point, Bad Nodes, abbreviation BN) collection；
5) node is overturn：The initial LLR value of information node in BN collection is overturn successively；
6) CRC check again：CRC check is performed to decoding court verdict again in post-processing stages, if verifying successfully,
Adjudicate successfully decoded and stop decoding, otherwise jump to step 5) and continue to overturn.
LBP interpretation methods described in step 1) comprises the following steps：
(1) initialize：Assuming that matrix HM×NFor the check matrix of LDPC code, M is check-node number, and N is variable node number,
Code word c=(c after coding1,c2,...,cn) transmitted codewords x=(x are mapped as after BPSK is modulated1,x2,...,xn), wherein xn
=1-2cn, n=1,2 ..., N, the signal y=(y after through awgn channel plus making an uproar1,y2,...,yn), wherein yn=xn+nn, ynIt is
Average is x, variance σ2Gaussian noise；HmnThere is a line to be connected between=1 expression check-node m and variable node n, make M
(n) and M (n) m represent variable node n adjacent node and all adjacent nodes except check-node m exogenousd variables nodes n respectively；
Make N (m) and N (m) n represent respectively check-node m adjacent node and in addition to variable node n check-node all adjacent segments
Point, the initial message of signaling channel is L (Pn), then the initial message that variable node passes to check-node is L(0)(qmn)=L (Pn)
=2yn/σ2, and be 0 by all layers of check-node message initialization；
(2) information updating：To all inspection node m and inspection node n ∈ N (m) adjacent thereto, in the l times iteration
When, the message that variable node is transmitted to check-node is：
To all variable node n and inspection node m ∈ M (n) adjacent thereto, in the l times iteration, check-node passes
It is to the message of variable node：L(l)(qmn)=L(l-1)(qn)-L(l-1)(rmn),
Hard decision message is calculated to all variable nodes：L(l)(qn)=L(l-1)(qn)-L(l-1)(rmn)+L(l)(rmn)；
(3) decoding judgement：By L(l)(qn) value made comparisons with zero, if L(l)(qn)<0, thenOtherwise it is 0；
(4) syndrome is adjudicated：If syndrome HMxNcT=0 or reach maximum iteration, then terminate to decode, otherwise return
Return step (2) and continue iteration.
Compared with prior art, the technical program combines the post processing decoding side of CRC check during LDPC decodings
Method, CRC check is performed to the court verdict of LBP decodings first, if verification failure, to the posteriority of variable node in erroneous frame
LLR value ascending order arranges, and several destination nodes composition bad set of node, overturns BN before then being chosen from ordering sequence node
In collection the initial LLR value of information node and continue decoding until CRC check success, so as to break potential pitfall collection, improve
Node point reliability.
This method can overturn error bit successively in the subsequent processing stage to erroneous frame, destroy potential trap
Collection, while relatively low decoding complexity is ensured, improve error floor.
Brief description of the drawings：
Fig. 1 show the method flow schematic diagram of embodiment；
Fig. 2 is (3,1) trap collection in embodiment；
Fig. 3 is CRC encoding schemes in embodiment；
Fig. 4 is that characteristic curve of error code of the CRC-LBP interpretation methods under different P values compares in embodiment；
Fig. 5 is that the bit error rate of the PEG-LDPC codes under five kinds of different decoding algorithms compares in embodiment；
Fig. 6 is that the bit error rate of the QC-LDPC codes under three kinds of different decoding algorithms compares in embodiment；
Fig. 7 is that the bit error rate of the Mackay codes under three kinds of different decoding algorithms compares in embodiment.
Embodiment：
Present invention is further elaborated with reference to the accompanying drawings and examples, but is not limitation of the invention.
Embodiment：
A kind of reference picture 1, LDPC code post processing interpretation method based on CRC check code, comprises the following steps：
1) LBP interpretation methods are performed；
2) CRC check：CRC check is performed to decoding court verdict at the end of step 1) LBP interpretation methods, performs CRC
Verification judgement, if verifying successfully, adjudicates successfully decoded and stops decoding, otherwise perform next step；
3) LLR value sorts：The posteriority LLR value of variable node in erroneous frame is arranged by ascending order, obtains orderly node sequence
Row；
4) selection of destination node：Several destination nodes composition BN collection before being chosen from ordering sequence node；
5) node is overturn：The initial LLR value of information node in BN collection is overturn successively；
6) CRC check again：CRC check is performed to decoding court verdict again in post-processing stages, if verifying successfully,
Adjudicate successfully decoded and stop decoding, otherwise jump to step 5) and continue to overturn.
LBP interpretation methods described in step 1) comprises the following steps：
(1) initialize：Assuming that matrix HM×NFor the check matrix of LDPC code, M is check-node number, and N is variable node number,
Code word c=(c after coding1,c2,...,cn) transmitted codewords x=(x are mapped as after BPSK is modulated1,x2,...,xn), wherein xn
=1-2cn, n=1,2 ..., N, the signal y=(y after through awgn channel plus making an uproar1,y2,...,yn), wherein yn=xn+nn, ynIt is
Average is x, variance σ2Gaussian noise；HmnThere is a line to be connected between=1 expression check-node m and variable node n, make M
(n) and M (n) m represent variable node n adjacent node and all adjacent nodes except check-node m exogenousd variables nodes n respectively；
Make N (m) and N (m) n represent respectively check-node m adjacent node and in addition to variable node n check-node all adjacent segments
Point, the initial message of signaling channel is L (Pn), then the initial message that variable node passes to check-node is L(0)(qmn)=L (Pn)
=2yn/σ2, and be 0 by all layers of check-node message initialization；
(2) information updating：To all inspection node m and inspection node n ∈ N (m) adjacent thereto, in the l times iteration
When, the message that variable node is transmitted to check-node is：
To all variable node n and inspection node m ∈ M (n) adjacent thereto, in the l times iteration, check-node passes
It is to the message of variable node：L(l)(qmn)=L(l-1)(qn)-L(l-1)(rmn),
Hard decision message is calculated to all variable nodes：L(l)(qn)=L(l-1)(qn)-L(l-1)(rmn)+L(l)(rmn)；
(3) decoding judgement：By L(l)(qn) value made comparisons with zero, if L(l)(qn)<0, thenOtherwise it is 0；
(4) syndrome is adjudicated：If syndrome HMxNcT=0 or reach maximum iteration, then terminate to decode, otherwise return
Return step (2) and continue iteration.
Specifically：Fig. 3 is CRC encoding schemes in embodiment, and LDPC code is divided into data bit, CRC bit and parity check bit,
CRC codings are first passed through to effective data bit, then carry out LDPC codings.
CRC codings are the accurate detections that the erroneous frame to occurring in decoding is realized using the principle of division and remainder.
In practical application, crc value is calculated according to original code word sequence in message sending end, is sent to simultaneously with the new information of transmission
Receiving terminal is decoded, receiving terminal recalculates crc value and compared with the crc value received to decoding result, if two crc values not phase
Together, then there is mistake in decoding；
As shown in Fig. 2 (3,1) trap collection in embodiment：
Definition：The set that (w, v) trap collection is made up of w variable node, the subgraph induced by the set include v
Odd Degree check-node and any even number degree check-node,
Especially, in the decoding algorithm based on information updating, small trap collection is to cause the key of error floor phenomenon former
Cause, this is due to that itself w and v value is relatively small, and the probability that w node malfunctions simultaneously is larger, and w error node can not be from v
Enough reliable news are obtained in the check-node of Odd Degree to correct its LLR value, it is straight that decoder is in " trap " state all the time
To reaching maximum iteration.
In high s/n ratio region, due to the presence of trap collection, correctly translated although most of bit node can be realized
Code, but still have partial error node, it can not be also repaired even if increase iterations.The error floor phenomenon as caused by trap collection
Mainly there are two features：1) node shakes, i.e., in front and rear iteration twice, the phenomenon of oscillation on large scale occurs for the LLR value of part of nodes；
2) mistake restrains, and decoding converges to a certain error condition, and no longer changes in follow-up iteration.Generally, the symbol of error node
Number frequently change and LLR amplitude very littles, the informational influence easily passed over by adjacent node, so choose these nodes carry out weight
New decoding, destroys trap collection.It should be noted that variable node of the selected destination node not necessarily in trap collection,
It is also possible to cause decoding failure to produce error bit for external node.
CRC encoding schemes are illustrated in figure 3,
The CRC used in the present embodiment is a kind of error check code the most frequently used in data communication field,
Multinomial operation is carried out to transmitted codewords, after obtained redundant code is attached into data bit, it is more that decoding performs identical after terminating
Item formula computing, to ensure the correctness of codeword transmission and integrality, whether the present embodiment judges LBP methods by CRC check
It is successfully decoded, if CRC check fails, perform post processing part.The CRC international standards version that the present embodiment is chosen is CRC-16
=X16+X15+X2+ 1, corresponding verification binary sequence is 110,000,000 00000101, and information bit is divided into data bit and CRC
Two sections, CRC codings first are carried out to valid data position, then carry out LDPC codings.Why the present embodiment, which chooses CRC check, replaces passing
The syndrome decision rule of system, decoding is primarily due to after certain iterations is reached, error node number will not be with iteration
The increase of number and reduce, but concussion state is presented, thus the very possible error node when reaching maximum iteration
Highest is arrived in number concussion, if now using syndrome judgement, now state exports for final decoding, not only brings extra decoding
Iteration, increase decoding complexity, can also have a strong impact on decoding performance.
It is illustrated in figure 4 characteristic curve of error code of the CRC-LBP algorithms under different P values.
If the destination node number chosen is P, optimal value is determined by Computer Simulation, be to BN in follow-up decoding processing
P destination node in collection is overturn one by one, therefore need to generate 2P- 1 upset is vectorial (except full null vector), when P values are too small,
The initial information of partial error bit is caused not to be reversed, the improvement unobvious to error floor；When P values are excessive more than a certain
It is not only limited in the lifting of high s/n ratio region decoding performance during thresholding, and cause a large amount of consumption of hardware resource, therefore, P values
Selection, which need to trade off, considers error performance and decoding complexity.
Under conditions of BPSK modulation and awgn channel, from IEEE 802.16e (576,288) LDPC code, P values difference
Take [8,11,12,14].
As seen from Figure 4, as the increase of P values, the performance of the present embodiment method are gradually being lifted, not excessive P>After 11,
Error performance is absorbed in bottleneck, if now continuing to increase P values, has a small amount of correct node and is selected into BN collection, not only to error performance
Lifting it is little, can also bring the index of complexity to rise, to sum up, P values, which are chosen, 11 to be advisable.
As shown in Fig. 5,6,7, when carrying out simulating, verifying using PEG-LDPC codes, QC-LDPC codes and Mackay codes, show
CRC-LBP interpretation methods in the present invention can obtain the lower bit error rate in high s/n ratio region.
Claims (2)
1. a kind of LDPC code post processing interpretation method based on CRC check code, it is characterized in that, comprise the following steps：
1) LBP interpretation methods are performed；
2) CRC check：CRC check is performed to decoding court verdict at the end of step 1) LBP interpretation methods, performs CRC check
Judgement, if verifying successfully, adjudicates successfully decoded and stops decoding；Otherwise next step is performed；
3) LLR value sorts：The posteriority LLR value of variable node in erroneous frame is arranged by ascending order, obtains orderly sequence node；
4) selection of destination node：Several destination nodes composition BN collection before being chosen from ordering sequence node；
5) node is overturn：The initial LLR value of information node in BN collection is overturn successively；
6) CRC check again：CRC check is performed to decoding court verdict again in post-processing stages, if verifying successfully, adjudicated
It is successfully decoded and stop decoding, otherwise jump to step 5) and continue to overturn.
2. the LDPC code post processing interpretation method of combination CRC check code according to claim 1, it is characterized in that, step 1)
Described in LBP interpretation methods comprise the following steps：
(1) initialize：Assuming that matrix HM×NFor the check matrix of LDPC code, M is check-node number, and N is variable node number, coding
Code word c=(c afterwards1,c2,...,cn) transmitted codewords x=(x are mapped as after BPSK is modulated1,x2,...,xn), wherein xn=1-
2cn, n=1,2 ..., N, the signal y=(y after through awgn channel plus making an uproar1,y2,...,yn), wherein yn=xn+nn, ynIt is average
For x, variance σ2Gaussian noise；Hmn=1 expression check-node m and variable node n between there is a line to be connected, make M (n) and
M (n) m represent variable node n adjacent node and all adjacent nodes except check-node m exogenousd variables nodes n respectively；Make N
(m) and N (m) n represent respectively check-node m adjacent node and in addition to variable node n check-node all adjacent nodes,
The initial message of signaling channel is L (Pn), then the initial message that variable node passes to check-node is L(0)(qmn)=L (Pn)=
2yn/σ2, and be 0 by all layers of check-node message initialization；
(2) information updating：To all inspection node m and inspection node n ∈ N (m) adjacent thereto, in the l times iteration, become
Amount node is transmitted to the message of check-node and is：
To all variable node n and inspection node m ∈ M (n) adjacent thereto, in the l times iteration, check-node is transmitted to change
Amount node message be：L(l)(qmn)=L(l-1)(qn)-L(l-1)(rmn),
Hard decision message is calculated to all variable nodes：L(l)(qn)=L(l-1)(qn)-L(l-1)(rmn)+L(l)(rmn)；
(3) decoding judgement：By L(l)(qn) value made comparisons with zero, if L(l)(qn)<0, thenOtherwise it is 0；
(4) syndrome is adjudicated：If syndrome HMxNcT=0 or reach maximum iteration, then terminate to decode, otherwise return to step
(2) iteration is continued.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710871770.7A CN107528597B (en) | 2017-09-25 | 2017-09-25 | LDPC code post-processing decoding method based on CRC code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710871770.7A CN107528597B (en) | 2017-09-25 | 2017-09-25 | LDPC code post-processing decoding method based on CRC code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107528597A true CN107528597A (en) | 2017-12-29 |
| CN107528597B CN107528597B (en) | 2020-12-08 |
Family
ID=60736193
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710871770.7A Active CN107528597B (en) | 2017-09-25 | 2017-09-25 | LDPC code post-processing decoding method based on CRC code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107528597B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107241105A (en) * | 2017-06-06 | 2017-10-10 | 北京邮电大学 | Coding method, device, electronic equipment and the medium of low density parity check code |
| CN108199722A (en) * | 2018-01-10 | 2018-06-22 | 桂林电子科技大学 | A kind of BIBD-LDPC code constructing methods based on matrix lattice |
| CN108566213A (en) * | 2018-04-25 | 2018-09-21 | 东南大学 | The serial counteracting list bit-flipping decoding method of polarization code |
| CN109302267A (en) * | 2018-09-26 | 2019-02-01 | 西安科技大学 | Interpretation method, equipment and the storage medium of mimo system based on LDPC |
| CN110022158A (en) * | 2018-01-09 | 2019-07-16 | 华为技术有限公司 | A kind of interpretation method and device |
| CN110932824A (en) * | 2020-02-11 | 2020-03-27 | 网络通信与安全紫金山实验室 | Polarization code belief propagation algorithm based on two-way graph with bit reversal |
| CN111510161A (en) * | 2020-05-14 | 2020-08-07 | 中国科学院微电子研究所 | L DPC code and CRC combined parallel check decoding method and device |
| CN111917517A (en) * | 2020-08-06 | 2020-11-10 | 上海海事大学 | Over-distance maritime communication method |
| CN114421972A (en) * | 2022-01-27 | 2022-04-29 | 石家庄市经纬度科技有限公司 | Decoding method of multi-system LDPC code |
| CN116073958A (en) * | 2023-03-14 | 2023-05-05 | 南京创芯慧联技术有限公司 | Decoding method, decoding device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101803205A (en) * | 2008-08-15 | 2010-08-11 | Lsi公司 | RAM list-decoding of near codewords |
| US8190962B1 (en) * | 2008-12-30 | 2012-05-29 | Qualcomm Atheros, Inc. | System and method for dynamic maximal iteration |
| CN102648596A (en) * | 2009-10-02 | 2012-08-22 | 夏普株式会社 | Devices, methods and computer-readable mediums for coding a control message with determined data code block repetition |
| US8286048B1 (en) * | 2008-12-30 | 2012-10-09 | Qualcomm Atheros, Inc. | Dynamically scaled LLR for an LDPC decoder |
-
2017
- 2017-09-25 CN CN201710871770.7A patent/CN107528597B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101803205A (en) * | 2008-08-15 | 2010-08-11 | Lsi公司 | RAM list-decoding of near codewords |
| US8190962B1 (en) * | 2008-12-30 | 2012-05-29 | Qualcomm Atheros, Inc. | System and method for dynamic maximal iteration |
| US8286048B1 (en) * | 2008-12-30 | 2012-10-09 | Qualcomm Atheros, Inc. | Dynamically scaled LLR for an LDPC decoder |
| CN102648596A (en) * | 2009-10-02 | 2012-08-22 | 夏普株式会社 | Devices, methods and computer-readable mediums for coding a control message with determined data code block repetition |
Non-Patent Citations (2)
| Title |
|---|
| 李伟华 焦熏立: "一种基于分段CRC的LDPC译码的改进算法", 《电子与信息学报》 * |
| 陈自强 王广耀: "结合CRC校验的LDPC码后处理译码算法", 《桂林电子科技大学学报》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107241105B (en) * | 2017-06-06 | 2020-03-20 | 北京邮电大学 | Encoding method, encoding device, electronic device, and medium for low-density parity-check code |
| CN107241105A (en) * | 2017-06-06 | 2017-10-10 | 北京邮电大学 | Coding method, device, electronic equipment and the medium of low density parity check code |
| CN110022158B (en) * | 2018-01-09 | 2021-04-09 | 华为技术有限公司 | Decoding method and device |
| CN110022158A (en) * | 2018-01-09 | 2019-07-16 | 华为技术有限公司 | A kind of interpretation method and device |
| US11171673B2 (en) | 2018-01-09 | 2021-11-09 | Huawei Technologies Co., Ltd. | Decoding method and apparatus |
| CN108199722A (en) * | 2018-01-10 | 2018-06-22 | 桂林电子科技大学 | A kind of BIBD-LDPC code constructing methods based on matrix lattice |
| CN108199722B (en) * | 2018-01-10 | 2021-07-20 | 桂林电子科技大学 | BIBD-LDPC code construction method based on matrix lattice |
| CN108566213A (en) * | 2018-04-25 | 2018-09-21 | 东南大学 | The serial counteracting list bit-flipping decoding method of polarization code |
| CN108566213B (en) * | 2018-04-25 | 2022-05-27 | 东南大学 | Serial offset list bit flipping decoding method of polarization code |
| CN109302267A (en) * | 2018-09-26 | 2019-02-01 | 西安科技大学 | Interpretation method, equipment and the storage medium of mimo system based on LDPC |
| CN110932824A (en) * | 2020-02-11 | 2020-03-27 | 网络通信与安全紫金山实验室 | Polarization code belief propagation algorithm based on two-way graph with bit reversal |
| CN111510161A (en) * | 2020-05-14 | 2020-08-07 | 中国科学院微电子研究所 | L DPC code and CRC combined parallel check decoding method and device |
| CN111510161B (en) * | 2020-05-14 | 2023-01-13 | 中国科学院微电子研究所 | Parallel check decoding method and device combining LDPC code and CRC |
| CN111917517A (en) * | 2020-08-06 | 2020-11-10 | 上海海事大学 | Over-distance maritime communication method |
| CN114421972B (en) * | 2022-01-27 | 2022-11-22 | 石家庄市经纬度科技有限公司 | Decoding method of multi-system LDPC code |
| CN114421972A (en) * | 2022-01-27 | 2022-04-29 | 石家庄市经纬度科技有限公司 | Decoding method of multi-system LDPC code |
| CN116073958A (en) * | 2023-03-14 | 2023-05-05 | 南京创芯慧联技术有限公司 | Decoding method, decoding device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107528597B (en) | 2020-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107528597A (en) | A kind of LDPC code post processing interpretation method based on CRC check code | |
| CN102077173B (en) | Error-floor mitigation of codes using write verification | |
| US8132072B2 (en) | System and method for providing H-ARQ rate compatible codes for high throughput applications | |
| US8700973B1 (en) | Post-processing decoder of LDPC codes for improved error floors | |
| EP2768146B1 (en) | Apparatus and method for transmitting and receiving data in communication/broadcasting system | |
| US9214958B2 (en) | Method and decoder for processing decoding | |
| EP2573943B1 (en) | Power-optimized decoding of linear codes | |
| US11652498B2 (en) | Iterative bit flip decoding based on symbol reliabilities | |
| Jing et al. | Blind recognition of binary cyclic codes | |
| US20170279466A1 (en) | Hybrid soft decoding algorithm for multiple-dimension tpc codes | |
| US20150372695A1 (en) | Method and apparatus of ldpc decoder with lower error floor | |
| CN110830167A (en) | Multi-bit flipping-based polar code Fast-SSC decoding algorithm | |
| JP6533039B2 (en) | Decoding of correction code using message passing, especially decoding improvement method of LDPC code or turbo code | |
| US8019020B1 (en) | Binary decoding for correlated input information | |
| CN112491422A (en) | Gauss optimization-based bit flipping serial elimination list decoding method and system | |
| US8935601B1 (en) | Post-processing methodologies in decoding LDPC codes | |
| US11251809B2 (en) | Soft-aided decoding of staircase codes | |
| Brown et al. | Improved decoding of interleaved AG codes | |
| Bellorado et al. | Soft-input, iterative, Reed-Solomon decoding using redundant parity-check equations | |
| Lee et al. | Pattern-flipping chase-type decoders with error pattern extracting viterbi algorithm over partial response channels | |
| Soltanpur et al. | Lowering error floors by concatenation of low-density parity-check and array code | |
| CN112152642A (en) | Sliding window decoding method and system with retransmission mechanism | |
| Altin | New decoding methods for LDPC codes on error and error-erasure channels | |
| ur Rehman et al. | Impact of Bit-Flip Combinations on Successive Soft Input Decoding of Reed Solomon Codes | |
| Shayegh et al. | A low complexity iterative technique for soft decision decoding of Reed-Solomon codes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |