Results 251 to 260 of about 651,900 (282)
Some of the next articles are maybe not open access.
Progressive edge-growth Tanner graphs
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002We 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 +2 more
openaire +2 more sources
On Tanner graphs of lattices and codes
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002The 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 +2 more
openaire +1 more source
Codes with girth 8 Tanner graph representation
Designs, Codes and Cryptography, 2009\textit{T. Halford} et al [IEEE Trans. Inform. Theory 52, No. 9, 4219--4223 (2006)] gave a necessary condition for a code to be represented by a 4-cycle-free Tanner graph. Here the authors extend this condition for 4 and 6 cycle-free Tanner graphs. They found a new necessary condition for codes having Tanner graph representation with girth 8.
Amin Sakzad +2 more
openaire +2 more sources
Stopping sets and the girth of Tanner graphs
Proceedings IEEE International Symposium on Information Theory,, 2003Recent 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 +3 more
openaire +1 more source
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 +3 more
openaire +2 more sources
Analysis of the relation between properties of LDPC codes and the tanner graph
Problems of Information Transmission, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Victor V. Zyablov, Pavel S. Rybin
openaire +2 more sources
Analysis of practical LDPC decoders in tanner graphs with absorbing sets
2017 IEEE Information Theory Workshop (ITW), 2017Abstract--Absorbing sets (ASs) cause the error floor phenomenon in many Low-Density Parity-Check (LDPC) codes. A recent, simplified system model for Min-Sum (MS) LDPC decoding [1] predicts that ASs exhibit a threshold behavior: if all variable nodes in an AS have channel messages above the threshold, the AS cannot trap the decoder.
Marco Ferrari +2 more
openaire +3 more sources
Generating random Tanner-graphs with large girth
2009 IEEE Information Theory Workshop, 2009We present a simple and efficient algorithm for randomly generating Tanner-graphs with given symbol-node and check-node degrees and without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. Our algorithm generates a graph by sequentially adding the edges to an empty graph.
Mohsen Bayati +4 more
openaire +1 more source
Tanner graphs for group block codes and lattices: construction and complexity
IEEE Transactions on Information Theory, 2001Summary: We develop a Tanner graph (TG) construction for an Abelian group block code \(L\) with arbitrary alphabets at different coordinates, an important application of which is the representation of the label code of a lattice. The construction is based on the modular linear constraints imposed on the code symbols by a set of generators for the dual ...
Amir H. Banihashemi +1 more
openaire +3 more sources
Girth of the Tanner graph and error correction capability of LDPC codes
2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2008We 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.
Shashi Kiran Chilappagari +3 more
openaire +2 more sources