Results 211 to 220 of about 3,564 (250)

Calculation of Mutual Information between Messages in Loops of a Tanner Graph

2006 IEEE International Symposium on Information Theory, 2006
This 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), 2013
The 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 Broulím, Vjačeslav Georgiev
exaly   +2 more sources

Girth of the Tanner graph and error correction capability of LDPC codes

2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2008
We investigate the relation between the girth and the guaranteed error correction capability of gamma-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm.
Michael Marcellin, Bane Vasić, Dung Viet Nguyen   +2 more
exaly   +2 more sources

Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs

IEEE Communications Letters, 2007
This 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

GPU based fast algorithm for tanner graph based image interpolation

2011 IEEE 13th International Workshop on Multimedia Signal Processing, 2011
In 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

Tanner Graph Based Image Interpolation

2010 Data Compression Conference, 2010
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variable node and the local image structure around each pixel as a check node.
Ruiqin Xiong, Wen Gao 0001
openaire   +1 more source

Progressive edge-growth Tanner graphs

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
We propose a general method for constructing Tanner (1981) graphs with large girth by progressively establishing edges or connections between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) construction. Lower bounds on the girth and on the minimum distance of the resulting low-density parity-check (LDPC) codes ...
Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold   +2 more
openaire   +1 more source

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, Keith M. Chugg
openaire   +1 more source

On Tanner graphs of lattices and codes

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002
The problem of finding a low-complexity Tanner graph for a general lattice /spl Lambda/ is studied. The problem is divided into two subproblems: (1) Finding an orthogonal sublattice /spl Lambda/' of /spl Lambda/ which minimizes the complexity of the label code of the quotient group /spl Lambda///spl Lambda/'.
A.H. Banihashemi, F.R. Kschischang, P.G. Gulak   +2 more
openaire   +1 more source

Stopping sets and the girth of Tanner graphs

Proceedings IEEE International Symposium on Information Theory,, 2003
Recent work has related the error probability of iterative decoding over erasure channels to the presence of stopping sets in the Tanner graph of the code used. In particular, it was shown that the smallest number of uncorrected erasures is the size of the graph's smallest stopping set. Relating stopping sets and girths, we consider the size /spl sigma/
A. Orlitsky, R. Urbanke, K. Viswanathan, J. Zhang   +3 more
openaire   +1 more source