A CONVERGENCE ANALYSIS OF LDPC DECODING BASED ON EIGENVALUES Neha Ashok Kharate Thesis Prepared for the Degree of MASTER OF SCIENCE UNIVERSITY OF NORTH TEXAS August 2017 Kharate, Neha Ashok. A Convergence Analysis of LDPC Decoding based on Eigenvalues

[1]  Yuan Zhou,et al.  The serial message-passing schedule for LDPC decoding algorithms , 2015, International Conference on Graphic and Image Processing.

[2]  Yong Liang Guan,et al.  Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling , 2015, IEEE Communications Letters.

[3]  Kamesh Namuduri,et al.  A link between consensus building and Low Density Parity Check decoding , 2015, 2015 49th Annual Conference on Information Sciences and Systems (CISS).

[4]  Brijesh Vala,et al.  Design of Hard and Soft Decision Decoding Algorithms of LDPC , 2014 .

[5]  Nguyen Tung Hung,et al.  A New Decoding Algorithm based on Equivalent Parity Check Matrix for LDPC Codes , 2013 .

[6]  Yan Wan,et al.  The impact of multi‐group multi‐layer network structure on the performance of distributed consensus building strategies , 2013 .

[7]  M. Islam.  Linear programming decoding: The ultimate decoding technique for low density parity check codes , 2013 .

[8]  Tuan Ta.  A Tutorial on Low Density Parity-Check Codes , 2009 .

[9]  Deepak Sridhara,et al.  Pseudocodewords of Tanner Graphs , 2005, IEEE Transactions on Information Theory.

[10]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.

[11]  Shashi Kiran Chilappagari,et al.  Error Floors of LDPC Codes on the Binary Symmetric Channel , 2006, 2006 IEEE International Conference on Communications.

[12]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[13]  Daniel A. Spielman,et al.  Accelerated Gossip Algorithms for Distributed Computation , 2006 .

[14]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[15]  Hyuncheol Park,et al.  Fast convergence decoding scheme for regular LDPC codes , 2004, Proceedings of 2004 International Symposium on Intelligent Signal Processing and Communication Systems, 2004. ISPACS 2004..

[16]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[17]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[18]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[19]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[20]  M. Mesbahi.  On a dynamic extension of the theory of graphs , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[21]  Tamio Arai,et al.  A distributed control scheme for multiple robotic vehicles to make group formations , 2001, Robotics Auton. Syst..

[22]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[23]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[24]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.