Simplified Soft Decision Decoding of LDPC codes

Simplified Soft Decision decipher of LDPC commandmentsMARUTHI L NK S GURUMURTHYAbstractLDPC codes gained importance since its re-discovery by Mackay and Neil based on Tanner Graph. This paper presents the implementation of forward faulting bailiwick soft-input, soft-output decipherment process that competently decodes the received set of in takeation under low signal-to-noise ratios due to which the errors atomic bod 18 trim and thereof infection time is greatly reduced. The implemented algorithm is less Byzantine and does not require knowledge of signal-to-noise-ratio of the received data-path.INTRODUCTION actus reus chastisement cryptograph techniques came into existence after existence of contrast capacity theorem by Shannon, the father of information theory in 1948 on reliable communicating over noisy transmission railway lines. Thereafter, many coding techniques were positive for efficient coding techniques, like Hamming, Golay and many other techniques were stoped. Though Gallagher in 1962 create LDPC codes, the rule employed was not optimal. Hence it was not reviewed for last 3 decades, until 1992, when a paper bordering Shannon limit error correcting coding and decryption turbo codes presented by Berrou, Glavieux and Thitimajshima changed the trend followed by researchers for the past 5 decades. And now, we be aiming to develop such codes through another strategy. The coding gain provided by this method is much higher when compared to other coding systems. The LDPC codes are becoming more(prenominal) popular because of their reduced power for transmission and less interwoven system of logic to achieve low BERs which is very essential for reliable transmission over noisy channels.LDPC CODES modest Density check bit Check (LDPC) codes are a powerful class of forward error rectification codes developed by Gallagher in 1962, practically implemented by MacKay in 1995. Low Density refers to less number of 1s in the conservation o f parity Check Matrix (H) of Block Codes.Block codes are a casing of Error Correction Codes which uses a Generator Matrix(G) to produces a Code-word of length n for message(D) of length k, where n-k is the wordiness bits added to make a Code-word of length n, higher the diffuseness higher the error correction capability and higher the Bandwidth. Hence, there is a trade-off between error correction capability and bandwidth.C=D.GThe size of the Matrix G is (n, n-k) and the size of the Matrix H is (n-k, n).Usually redundancy is defined by the term code rate which is given byR=k/nThis varies from to 1/6.The Encoder produces a Code-word which satisfy the configurationC.HT=0If R is the received data from the Transmitter then the realisation of the correct data received is given by the Syndrome(S).S=R.HTThe esteem of S obtained by the above calculation determines whether the received data is escaped from error or not, i.e. if S=0 then the received data is free from error, otherwis e the received data has an error.Since this property is very efficacious to reduce the calculation time if we receive the data correctly as soon as we receive data. The probability that the received data unavoidably to be retransmitted which in the range of 10-6 to 10-8.Encoding the data as mandatory is an easy process, but decode the data effectively and efficiently is a very hard process.The proposed algorithm uses the basic concept of block codes, i.e.R=C+EWhere R=noise corrupted vectorC=Code vector transmitted over noisy channelE=Error vector.The receiver does not know C and E its suffice is to decode C from R, and the message D from C.PROPOSED ALGORITHMThe base for LDPC decoding algorithm proposed is as described by MacKay and Neil in 1997.Following are the steps that briefly describe the algorithmSTEP 1 initializationLet rj be the received vector, i.e. the data received from the Gaussian channelWe calculate the components of the vectors d02( j), and d12( j) asd02( j)= (rj +1)2d12( j)= (rj-1)2 j = 1, 2, . . . , n (1)These first soft estimates of the code symbols are utilize to initialise the algorithm by setting the pursuance coefficients q0ij and q1ij at each symbol nodeq0ij= d02( j)q1ij= d12( j) j = 1, 2, . . . , n,i = 1, 2. . . , . n-k, (2)To quench the effect of zero in the calculation the expressions for the calculations can be reduced as shown belowln(em+en) = max(m,n) + ln(1+ e-m-n)log2(2m+2n) = max(m,n) + ln(1+ 2-m-n)(3)The tables required for calculations are computed victimization the above formula. The complexity is greatly reduced and the reliability of the transmission of signal is increased.STEP 2 HORIZONTAL STEPaij= f+(q0ij , q1 ij )bij= f(q0ij , q1ij)if (q 0ij ) (q1ij )sij= 0 elsesij= 1cij= ikikif ik is charger0n,ij= f+(0, cij )r1n,ij= f(0, cij )if ik is oddr0n,ij= f(0, cij )r1n,ij= f+(0, cij )STEP 3 VERTICAL STEPq0ij= d02 (j) + 0n,ijq1ij= d12 (j) + 1n,ijSTEP 4 DECISIONrm0ij=r0n,ij+ q0ijrm1ij=r1n,ij+ q1ijif rm02(j)12(j) thenc(j) = 1elsec(j) = 0The LUT entries use in the proposed algorithm for equation (3) and the exact entertain obtained will vary as shown in the figure.Comparison of BER performance of (8 * 12) LDPC SSD decipherer (10 iterations)Comparison of BER performance of (8 * 12) LDPC SSD decoder (50 iterations)As explained above, for higher precision the number of iterations is increased to obtain the same performance of the exact equation.The obtained results approach towards the complex algorithm developed by Gallagher with simple iterative approach and provides a high coding gain compared to uncoded signal. And it provides higher performance at bigger iterations. This algorithm provides even higher performance for large length codes. resultIn this paper we have described Low Density Parity Check (LDPC) codes and decoding of these codes using low complexity algorithms. LDPC codes are used now-a-days in communication systems that take advantage of parallelism, nice error correction and high throu gh put. This led to the new algorithm which could decode the errors and provided give similar BER performance as the complex algorithms without the knowledge of the channel noise parameters like variance. This new algorithm is based on reiterate use of an antilog-sum operation, and has been simulated on the Tanner graph representation of some(prenominal) LDPC codes and this algorithm can be regarded as a generalized form of belief propagation, where the belief propagated is Euclidean outer space estimate rather than a probability estimate. The advantages of the new algorithm are that the performance is as good as the complex algorithm provided the value of base of the logarithm is used properly that knowledge of noise is not required and that in the alter form the algorithm needs only additions/subtractions, comparisons and both look-up tables avoiding the use of quotients and products operations that are of high complexity in practical implementations especially using FPGA te chnology.REFERENCES1 R.G. Gallager, Low Density Parity Check Codes, IRE Trans. Information Theory, IT-8, 21-28 (1962).2 D.J.C. Mackay and R.M. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters, vol. 33, pp 457-458 (1997).3 L. Arnone, C. Gayaso, C. Gonzalez and J. Castineira, Sum-Subtract touch on Point LDPC Decoder, Latin American Applied Research, vol. 37, pp 17-20 (2007).4 Castineira Moreira, Farrell P.G. Essentials of error control coding, Wiley (2006).5 Castineira Moreira J., Farrell, P.G. Soft-decision SISO decoding of error-control codes, Proc. 13th Int. Conf. on telecommunications (SENACITEL 08), Valdivia, Chile, 12-15 November 2008.6 L. Arnone, Castineira Moreira, Farrell P.G. FPGA implementation of a Euclidean distance metric SISO decoder, Int. Symposium on communication theory and applications (ISCTA09), Ambleside, UK, July 2009.7 P.G. Farrell, L.Arnone, J. Castineira Moreira Euclidean distance soft-input soft-output decoding algo rithm for low density parity check codes, IET comm. Vol.5, Iss. 16, pp. 2364-2370, (2011).8 J. Castineira Moreira, M. Rabini, C. Gonzalez, C. Gayaso, L. Arnone FPGA implementation of two very low complexity LDPC decoders, IEEE papers, (2011).9 Simon Haykin Digital communications, John Wiley sons (2006).10 Bernard Sklar, Pabitra K. irradiation Digital communications fundamentals and applications, 2nd edn. Pearson education (2009).11 Shu Lin, Daniel J. Costello Jr. Error Control coding, 2nd edn. Pearson education (2004).12 Moon T. K. Error correction coding- mathematical methods and algorithms, Wiley (2005).