Results 1 to 10 of about 45,321 (190)
A Neural Network Empowered Belief Propagation Algorithm Optimized for Short-Cycles in Tanner Graph [PDF]
IEEE Transactions on Machine Learning in Communications and Networking, 2023 Short-cycles in Tanner graphs have a direct impact on the accuracy and effectiveness of the belief propagation (BP) algorithm, as they diverge the BP algorithm by disrupting the independency of message transmission.
Hao Xu, Ying Li, Bin Tan, Jun Wu, Die Hu
doaj +2 more sources
A novel soft information algorithm for closest point search in lattices with Tanner graph representations [PDF]
IEEE Transactions on Information Theory, 2006 15 pages, 6 figures, 2 tables, uses IEEEtran ...
D.M. Ionescu, Haidong Zhu
+6 more sources
Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs [PDF]
2021 11th International Symposium on Topics in Coding (ISTC), 2021 This paper gives necessary and sufficient conditions for the Tanner graph of a quasi-cyclic (QC) low-density parity-check (LDPC) code based on the all-one protograph to have girth 6, 8, 10, and 12, respectively, in the case of parity-check matrices with column weight 4.
Anthony Gómez-Fonseca +2 more
+6 more sources
Pseudocodeword-Free Criterion for Codes with Cycle-Free Tanner Graph [PDF]
Designs, Codes and Cryptography, 2017 Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a ...
Wittawat Kositwattanarerk
openalex +4 more sources
Computing the Stopping Distance of a Tanner Graph Is NP-Hard [PDF]
IEEE Transactions on Information Theory, 2007 Summary: Two decision problems related to the computation \(f\) stopping sets in Tanner graphs are shown to be NP-complete. It follows as a consequence that there exists no polynomial time algorithm for computing the stopping distance of a Tanner graph unless P \(=\) NP.
Karunakaran Murali Krishnan +1 more
exaly +4 more sources
Improved Construction of Irregular Progressive Edge-Growth Tanner Graphs [PDF]
IEEE Communications Letters, 2010 The progressive edge-growth algorithm is a well-known procedure to construct regular and irregular low-density parity-check codes. In this paper, we propose a modification of the original algorithm that improves the performance of these codes in the waterfall region when constructing codes complying with both, check and symbol node degree distributions.
Jesús Martínez-Mateo +2 more
openalex +5 more sources
Algorithms for Enumerating Balanced Tanner Graphs [PDF]
, 2011 This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic Permutation Groups have been developed in this paper. A constrained enumeration algorithm that enumerates Balanced Tanner
Vivek S. Nittoor, Reiji Suda
openalex +3 more sources
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds [PDF]
, 2011 Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph ...
Smarandache, Roxana, Vontobel, Pascal O.
core +2 more sources
A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth [PDF]
IEEE Transactions on Information Theory, 2021 This paper presents a unifying framework to construct low-density parity-check (LDPC) codes with associated Tanner graphs of desired girth. Towards this goal, we highlight the role that a certain square matrix that appears in the product of the parity-check matrix with its transpose has in the construction of codes with graphs of desired girth and ...
Roxana Smarandache, David G. M. Mitchell
openalex +3 more sources
A Mathematical Approach to Balanced Tanner Graph Enumeration [PDF]
, 2011 This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have been presented followed by various enumeration theorems, and finally our approach for enumeration of Balanced ...
Vivek S. Nittoor, Reiji Suda
openalex +3 more sources