2014
DOI: 10.1016/j.dsp.2014.01.011
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid weighted bit flipping low density parity check decoding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…Where the non-linear function (10) 3) Column processing or variable node update: Compute  ij messages using channel information ( j ) and incoming a messages from all other check nodes connected to variable node Vj, excluding check node Ci.…”
Section: Sum -Product Decodingmentioning
confidence: 99%
See 1 more Smart Citation
“…Where the non-linear function (10) 3) Column processing or variable node update: Compute  ij messages using channel information ( j ) and incoming a messages from all other check nodes connected to variable node Vj, excluding check node Ci.…”
Section: Sum -Product Decodingmentioning
confidence: 99%
“…The performance of these WBF algorithms is greatly improved compared to simple WBF, RRWBF and BF algorithms variants, at the expense of a significant increase in complexity. The essence of such algorithms is to exploit the performances presented by the algorithms used in the combinations, which leads to the design of a more efficient algorithm by comparing with the basic algorithms [9,10]. Several algorithms can also be found in the literature that improves performance or simplifies complexity [11,12].…”
Section: Introductionmentioning
confidence: 99%
“…These novel WBF algorithms have significantly better performance than the basic WBF, RRWBF and BF algorithms, but at the cost of increased complexity. The essence of such algorithms is to exploit the performances presented by the algorithms used in the combinations, which leads to the design of a more efficient algorithm by comparing with the basic algorithms [9,10]. Several algorithms can also be found in the literature that improves performance or simplifies complexity [11,12].…”
Section: Introductionmentioning
confidence: 99%