AMRITA SCHOOL OF ENGINEERING

VARIABLE RELIABILITY BASED MODIFIED

WEIGHTED BIT FLIPPING ALGORITHM FOR
DECODING LDPC CODES
By
CHARAN R CB.EN.U4ECE13018
JAYA NITHISH K G CB.EN.U4ECE13024
VEL MURUGAN M CB.EN.U4ECE13065
AJITH KUMAR S CB.EN.U4ECE13071
Guided By : Mr. Pargunarajan M
PROJECT ID - 13ECE_A_SPC02
 Motivation

 Parity Check is simple but powerful logic in error detection and correction.

 Using this simple method extra parity bits are added while sending message data.

(message + parity bits) = code word

 Due to noise in channel code words are affected.

 Major challenge lies in:

(i) Efficient constraint distribution i.e.,distribution of parity checks

(ii) Decoding algorithm-Take Proper Decision to find which bit is

erroneous and correct it.
 Objective

 To make use of the soft information received before quantization

to make more accurate decisions.

 Modifying the decision making expression to improve the

performance/complexity ratio.
 Types Of decoding

Decision making Algorithm Description

Complete-Hard Decision Basic BFA • Static Reliability
• Low complexity

Partial Soft Decision Modified BFA • Use of Soft Values

• Simple Calculations
• Medium Complexity
Complete-Soft Decision Sum Product • Use of Soft Values
Algorithm • Complex Calculations
• High Complexity
 BASIC ALGORITHM FLOW

Check all
Receive Soft Hard Calculate If all Are
Syndrome
Values Decision Syndrome zero END
Values

Calculate Flip bits with

If Non Zeros Continue Till all syndromes are
Reliability of maximum
Exist zero or Max Iterations is Reached
Bits unreliability
 BASIC COMPLEXITY CALCUATIONS

 Consider ‘ n ’ bits code word & m x n size H matrix

For each Iteration :

 Syndrome : m x n multiplications and m x (n-1) additions

 Check is all Syndromes are zero : n checks

 Calculate Reliability : n x (n checks + n additions/subtractions)

 Check for maximum Unreliability : n checks

 RELIABILITY METRIC

 ‘E’ is the reliability metric, its values gives an idea of how erroneous
each bit is. E is a real number.
 E is calculated by primarily using syndrome and soft values in Modified
BF algorithms whereas in SPA its calculated using message passing and
complex calculations.
 By convention the algorithm is designed in such that :

larger value ‘E’ means less reliable is that bit.

 Expression For Extrinsic Information From SPA

1 1
+ ς
2 2 𝑖′ ∈𝐵𝑗 ,𝑖′ ≠𝑖
tanh 𝑀𝑗,𝑖′ Τ2
 𝐸𝑗,𝑖 = 𝑙𝑜𝑔 1 1
− ς
2 2 𝑖′ ∈𝐵𝑗 ,𝑖′ ≠𝑖
tanh 𝑀𝑗,𝑖′ Τ2

 𝐸𝑗,𝑖 ≈ ς𝑖 ′ 𝑠𝑖𝑔𝑛 𝑀𝑗,𝑖 ′ min

′
𝑀𝑗,𝑖 ′
𝑖

 Mj,i’ is the information obtained from other nodes excluding the node for which Ej,i

is calculated.

 Mji calculation requires feedback of probability values from previous iterations in

SPA.
 RELIABILTY EXPRESION OF ALGORITHMS

 Basic En = σ𝑖∈𝑀(𝑛) 2×𝑠 𝑚 −1 ∀ 𝑛 ∈ 1,2, … . . , 𝑁

 Weighted En = σ𝑖∈𝑀(𝑛) 2 × 𝑠 𝑚 − 1 |𝑦𝑚𝑖𝑛| ∀ 𝑛 ∈ {1,2, … . . , 𝑁}

 Modified En = σ𝑖∈𝑀(𝑛) 2 × 𝑠 𝑚 − 1 |𝑦𝑚𝑖𝑛′ | ∀ 𝑛 ∈ {1,2, … . . , 𝑁}

 Types of Information

 Intrinsic information : The information about the reliability of the bit

already known at the bit nodes i.e.,the received soft values of each bit.
 Extrinsic information : The information about the reliability of a bit
node calculated at the check nodes.
- For eg : if bits [1 3 5] participates in jth check then the Ej,1 = some
function of( 3rd,5th bits ) is called the extrinsic information transmitted to
the bit node 1.
Tanner Graph
 Proposed new method

 yn received soft values range from -1 to 1

 If yn is affected by noise its magnitude decreases

 If noised constructively interferes its doesn't affect syndrome hence doesn't

affect the decision making.

 Considering only the magnitude values of the sent and received signals we

can approximately say that lower the magnitude higher the noise and less
reliable is the value obtained for that bit.

 Higher the noise ,lower the the resulting magnitude hence less reliable is the

bit.
 Proposed En Expression

 if 𝑆(𝑚) = 1 then use expression

En = σ𝑖∈𝑀(𝑛) 2×𝑠 𝑚 −1 × (1 − 𝑦 𝑛 ) ∀ 𝑛 ∈ {1,2, … . . , 𝑁}

 else use expression

En = σ𝑖∈𝑀(𝑛) 2×𝑠 𝑚 −1 × (− 𝑦 𝑛 ) ∀ 𝑛 ∈ {1,2, … . . , 𝑁}

 𝑦 𝑛 is proportional to reliability….. higher value means more

reliability
 WORK DONE

 Simple Bit Flipping Algorithm

 Weighted Bit flipping algorithm

 Modified Weighted Bit flipping algorithm

 Gradient Descent Bit flipping algorithm

 Proposed Modification in basic Bit flipping algorithm

 Proposed Modification to form a variant of Modified Weighted Bit

flipping algorithm
 SIMULATIONS AND RESULTS

 Simulation of the algorithms were done in MATLAB using

n=4095,m=3368

 Code words were generated from a open source code published for LDPC

research.

 Added with AWGN noise for several SNR values.

 Each resultant code word was decoded with the above discussed

algorithms.
 SIMULATIONS AND RESULTS

 The predicted codeword was compared with the original transmitted

codeword and the number of bit errors calculated.

 At the end Avg.BER for each SNR was calculated and plotted .

 Avg. iterations required to converge was calculated for each SNR and

plotted.
Performance Comparison
 Performance Analysis

 As we can see from the BER graph the Proposed Variable Reliability Based

BFA shows better performance than the simple BFA.

 Also,the Proposed Variable Reliability based MWBF which takes into

account the extrinsic information from check nodes performs better than
simple BFA,MWBF,WBF,and GDBF.
 Gain Comparison

CONVENTIONAL ALGORITHM PROPOSED ALGORITHM SNR GAIN(dB)

Basic BFA using only hard decision Proposed BFA 1.4 dB

Basic BFA using only hard decision Proposed WBFA 1.5 dB

Basic BFA using only hard decision Proposed MWBFA 1.5 dB

MWBFA Proposed BFA 0.5 dB
MWBFA Proposed WBFA 0.6 dB
MWBFA Proposed MWBFA 0.6 dB
GDBF Proposed BFA 0.6 dB
GDBF Proposed WBFA 0.6 dB
GDBF Proposed MWBFA 0.6 dB
 GNU RADIO IMPLEMENTATION

 GNU Radio is open source software which provides signal processing blocks
for Software Defined Radio.
 Custom Blocks were created for Simple BFA and Proposed BFA

 Text File was used as message .It was unpacked to form message bits.

 These message bits were encoded to add redundant parity bits.

 They were transmitted and received using USRP.

 The Received erroneous bits were decoded using both algorithms.

 Proposed BFA gave more performance than Simple BFA.

 Uncertainty Theory

 The received value of 𝑦 𝑛 has intrinsic uncertainty in it.

 The calculations made from 𝑦 𝑛 also posses some uncertainty.

 Extrinsic info. also posses uncertainty as the calculations are based on 𝑦 𝑛

 Uncertainty at 𝑦 𝑛 base level is like chain reaction passed on to other levels.

 Reason why our algorithm works better is it focuses on decreasing the

uncertainty at the base level 𝑦 𝑛 Hence the performance is improved by

manifold.
 Conclusion

 From the above analysis the Proposed algorithms showed better

performance than others with simple modifications in expressions which

can be easily adopted in existing prototypes.

 FUTURE MODIFICATIONS-----FEEDBACK
NORMAL BF ALGORITHM

Syndrome Initialize Calculate Bit

Calculation ‘E’ to zeros Reliability Flipping

SUM PRODUCT ALGORTIHM

Calculate
Syndrome No Reliability Bit Flipping
Calculation Initilization
Feedback
 FUTURE MODIFICATIONS- ---MULTI-BIT FLIPPING USING
THRESHOLD

 Instead of flipping a single bit corresponding to index of max ( E (n) ).

 Thresholds values Θ(n) are calculated based on different concepts and

all bits whose reliability metrics ‘E’ are > than that value are Flipped.
 If E (n) > Θ(n) then bits are flipped.

 Convergence of multibit flipping are faster as compared to other

discussed algorithms.
 Multi Bit model can be used with all the above algorithms discussed.
 REFERENCES

 R. G. Gallager, “low-density parity-check codes”, IRE Trans. Inf. Theory, vol. 8, pp. 21-28, Jan. 1962.

 G. Sundararajan et al., “Noisy Gradient Descent Bit-Flip Decoding for LDPC Codes”, Communications IEEE Transactions on, vol. 62, no.

10, pp. 3385-3400, Oct. 2014.

 J. Zhang, M. Fossorier, “A modified weighted bit-flipping decoding of low-density parity-check codes”, IEEE commun. Lett., vol. 8, no. 3,

pp. 165-167, Mar. 2004.

 M. Jiang, C. Zhao, Z. Shi, Y. Chen, “An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes”, IEEE

commun. Lett., vol. 9, no. 9, pp. 814-816, Sep. 2005.

 Sarah J. Johnson, “Encoding,” in Introducing Low-Density Parity-Check Codes, vol. 1, Wiley Encyclopaedia of Telecommunications, 2003,

pp.17-20.

 Haigang Zhangi , Dongfeng Yuani , and Cheng-Xiang WangH, “A Modified Weighted Bit-Flipping Algorithm for LDPC Codes”,

ICWMMN200B Proceedings, Oct. 2008, DOI: 10.1049/cp:20080978.

 Julian Webber, Toshihiko Nishimura, Takeo Ohgane and Yasutaka Ogawa “Investigation of simple threshold shifting for bit-flip

decoding” 14th International Symposium on Wireless Personal Multimedia Communications (WPMC) , Oct.2011 , INSPEC Accession

Number: 12386910.
 REFERENCES

 F. Guo and L. Hanzo, “Reliability ratio based weighted bit-flipping decoding for LDPC codes,” IEE Electron. Lett., vol. 40, no. 21, pp. 1356- 1358, Oct.
2004.

 Juntan Zhang and Marc P. C. Fossorier, Senior Member, IEEE, “A Modified Weighted Bit-Flipping Decoding of Low-Density Parity-Check Codes”
, IEEE Communications Letters , Volume: 8, Issue: 3, March 2004, INSPEC Accession Number: 7916871

 Dajun Qian, Ming Jiang, Chunming Zhao and Xiaofu Wu ,“A Modification to Weighted Bit-Flipping Decoding Algorithm for LDPC Codes based on
Reliability Adjustment”, IEEE International Conference on Communications,May 2008, INSPEC Accession Number: 10041289.

 Chunli Wang, Xiaofu Wu, and Wei-Ping Zhu, “A Self-Normalized Weighted Bit-Flipping Decoding Algorithm for LDPC Codes”, 8th International
Conference on Wireless Communications & Signal Processing (WCSP), Oct. 2016, INSPEC Accession Number: 16497754

 Haiyi Huang, Yige Wang and Gang Wei, “Combined Modified Weighted Bit-Flipping Decoding of Low-Density Parity-Check Codes” , International
Conference on Wireless Communications and Signal Processing (WCSP),Oct. 2012, INSPEC Accession Number: 13596702

 Gaoyuan Zhang, Liang Zhou, Hong Wen , “Modified channel-independent weighted bit flipping decoding algorithm for low-density-parity-check
codes” , IET Communications, December 2013 , doi: 10.1049/iet-com.2013.0753

 Haiyi Huang, Yige Wang, Gang Wei , Mixed modified weighted bit-flipping decoding of low-density parity-check codes , IET Communications ,

September 2014 , doi: 10.1049/iet-com.2014.0192s