Results 141 to 150 of about 45,321 (190)
Some of the next articles are maybe not open access.
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory, 2005Summary: We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) algorithm. Lower bounds on the girth of PEG Tanner graphs and on the minimum distance of the resulting low-density parity-check (LDPC)
E Eleftheriou
exaly +2 more sources
Exhaustive Enumeration of Elementary Trapping Sets of an Arbitrary Tanner Graph
IEEE Communications Letters, 2016An effective branch-and-bound (B&B) algorithm for exhaustively enumerating the elementary trapping sets (ETSs) in an arbitrary given Tanner graph is described. Given a Tanner graph $G$ and a positive integer $\nu $ , we introduce a novel 0–1 integer linear programming (ILP) formulation of the $\mathcal{NP}$ -hard problem of finding the ...
Hossein Falsafain
exaly +2 more sources
A practical algorithm for tanner graph based image interpolation
2010 IEEE International Conference on Image Processing, 2010This paper interprets image interpolation as a decoding problem on tanner graph and proposes a practical belief propagation algorithm based on a gaussian autoregressive image model. This algorithm regards belief propagation as a way to generate and fuse predictions from various check nodes. A low complexity implementation of this algorithm measures and
Ruiqin Xiong, Wenpeng Ding, Siwei Ma
exaly +2 more sources
Bounds on the Expansion Properties of Tanner Graphs
IEEE Transactions on Information Theory, 2007 This work focuses on the expansion properties of a Tanner Graph because they are known to be related to the performance of associated iterative message-passing algorithms over various channels. By analyzing the eigenvalues and corresponding eigenvectors of the normalized incidence matrix representing a Tanner Graph, lower bounds on these expansion ...
Mingrui Zhu, K.M. Chugg
openalex +2 more sources
Calculation of Mutual Information between Messages in Loops of a Tanner Graph
2006 IEEE International Symposium on Information Theory, 2006This paper introduces a method for calculating the mutual information between the messages sent to a loop and and returning from a loop in a Tanner graph. This mutual information is defined as the difference between the cases when the loop is open and the loop is closed.
Kalle Ruttik
exaly +2 more sources
LDPC code optimization based on Tanner graph mutations
2013 21st Telecommunications Forum Telfor (TELFOR), 2013The paper presents LDPC error correcting code optimization based on Tanner graph mutations. A statistical experiment focused on a heuristic LDPC code construction was performed with the genetic algorithm. The algorithm used is briefly described. Short wordlength LDPC code optimization was simulated.
Jan Broulim, Vjačeslav Georgiev
exaly +2 more sources
Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs
IEEE Communications Letters, 2007This correspondence presents an approach to the representation of cycles of Tanner graphs on associated parity-check matrices. Several equivalent conditions for the girth of a Tanner graph to be 2k are proposed. An algorithm to determine girth of associated Tanner graphs of parity-check matrices is proposed, also with an algorithm to count shortest ...
Huawei Huang, Guozhen Xiao
exaly +2 more sources
Irregular progressive edge-growth (PEG) Tanner graphs
Proceedings IEEE International Symposium on Information Theory,, 2003 A general method for constructing Tanner graphs having a large girth by progressively establishing edges between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) construction, is proposed. Such an approach is powerful for generating good regular and irregular LDPC codes of short and moderate block lengths.
Xiaoyu Hu +2 more
openalex +2 more sources
GPU based fast algorithm for tanner graph based image interpolation
2011 IEEE 13th International Workshop on Multimedia Signal Processing, 2011In image/video processing software and hardware products, low complexity interpolation algorithms, such as cubic and splines methods, are commonly used. However, these methods tend to blur textures and produce jaggy effect compared with other adaptive methods such as NEDI, SAI.
Ruiqin Xiong, Siwei Ma
exaly +2 more sources
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
, 2006 Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using ...
K. Murali Krishnan, L. Sunil Chandran
openalex +2 more sources