Improved weighted bit-flipping algorithm for decoding LDPC Codes

Shan, Mengxiao; Zhao, Chunming; Jiang, Ming

doi:10.1049/ip-com:20045118

Cited by 33 publications

(29 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [3], a BF function was devised wherein both the most and the least reliable bits involved in one check sum are taken into account. Further improvement was reported by weighting each term in the BF function [4]. A drawback of above BF variants is that only one bit is flipped per iteration, which is adverse to fast convergence.…”

Section: Introductionmentioning

confidence: 96%

“…As an extension to [7], we adopt the BF function [4] in the proposed improved parallel weighted bit flipping (IPWBF) algorithm. Since he introduction of the delay-handling procedure [7] may increase the average number of decoding iterations, to mitigate this negative effect, the flipping criterion of [5] is attempted per iteration, and the chosen bits are flipped only when they meet all check sums.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved parallel weighted bit flipping decoding of finite geometry LDPC codes

Wang

et al. 2009

2009 Fourth International Conference on Communications and Networking in China

View full text Add to dashboard Cite

To seek a decoding scheme with good performance, low complexity and fast convergence, we present an improved parallel weighted bit flipping (IPWBF) algorithm for finite geometry low-density parity-check codes whose parity check matrix is of heavy row and column weights. In the IPWBF, a bit flipping (BF) function and two parallel BF criteria, all of which scatter in the literature, are exploited jointly to serve our purpose. Meanwhile, differential evolution is used to optimize the involved parameters. Simulation results show that the proposed algorithm achieves an observable performance gain over its counterparts without any complexity penalty. Furthermore, with respect to other known low complexity decodings such as normalized BPbased, the IPWBF yields a new performance versus complexity tradeoff, that is, higher throughput at the expense of moderate performance loss.

show abstract

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

Improved parallel weighted bit flipping decoding of finite geometry LDPC codes

Wang

et al. 2009

2009 Fourth International Conference on Communications and Networking in China

View full text Add to dashboard Cite

show abstract

“…On the other hand, the Two-Dimensional (2D) correction scheme [5] achieved a good tradeoff between performance and complexity by normalizing the outgoing belief messages from both check and bit nodes. To further reduce the complexity, many weighted Bit-Flipping (BF) variants [6][7][8][9][10][11] were devised and proved to be especially effective in decoding a class of Finite Geometry (FG) LDPC codes, which are known to be encodable in linear time.…”

Section: Introductionmentioning

confidence: 99%

Application of Beam Search for the decoding of one class of LDPC codes

Feng

2008

J. Electron.(China)

View full text Add to dashboard Cite

For one class of Low-Density Parity-Check (LDPC) codes with low row weight in their parity check matrix, a new Syndrome Decoding (SD) based on the heuristic Beam Search (BS), labeled as SD-BS, is put forward to improve the error performance. First, two observations are made and verified by simulation results. One is that in the SNR region of interest, the hard-decision on the corrupted sequence yields only a handful of erroneous bits. The other is that the true error pattern for the nonzero syndrome has a high probability to survive the competition in the BS, provided sufficient beam width. Bearing these two points in mind, the decoding of LDPC codes is transformed into seeking an error pattern with the known decoding syndrome. Secondly, the effectiveness of SD-BS depends closely on how to evaluate the bit reliability. Enlightened by a bit-flipping definition in the existing literature, a new metric is employed in the proposed SD-BS. The strength of SD-BS is demonstrated via applying it on the corrupted sequences directly and the decoding failures of the Belief Propagation (BP), respectively.

show abstract

“…BF is simple and easy to be implemented, but has only limited decoding performance. The weighted BF decoding (WBF) algorithm uses both the check relationships and the reliability of receive message, therefore obtains a better decoding performance when compared with BF algorithm [2]. Furthermore, an improved weighted BF algorithm (IWBF) [3] was introduced by Zhang et al, which further thought over the effect of message reliability on the error metric, and thus gained better decoding performance.…”

Section: Introductionmentioning

confidence: 99%

New Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Dong¹,

Song

2013

Proceedings of the 2nd International Symposium on Computer, Communication, Control and Automation

View full text Add to dashboard Cite

Abstract-Several Weighted BF (WBF) algorithms are investigated in this paper, and a novel modified reliability-ratio based WBF (MRWBF) decoding algorithm for LDPC codes is proposed. WBF algorithm considers the influence of parity information on the error metric. Based on WBF, the improved WBF (IWBF) algorithm further uses the feature of message reliability on the symbol decision. The reliability-ratio based WBF (RRWBF) can eliminate the defect of requiring off-line pre-processing in IWBF. Our proposed MRWBF further removes the step of calculating normalized weighted parameters in RRWBF and achieves more reduction in decoding complexity. The results of simulations show that the proposed algorithm is feasible, effective, and can achieve good decoding performance.

show abstract

Improved weighted bit-flipping algorithm for decoding LDPC Codes

Cited by 33 publications

References 5 publications

Improved parallel weighted bit flipping decoding of finite geometry LDPC codes

Improved parallel weighted bit flipping decoding of finite geometry LDPC codes

Application of Beam Search for the decoding of one class of LDPC codes

New Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Contact Info

Product

Resources

About