Results 151 to 160 of about 45,321 (190)
Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
Problems of Information Transmission, 2020 Aleksei Kharin +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Tanner Graph Based Image Interpolation
2010 Data Compression Conference, 2010This 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), 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 +1 more source
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
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
Probabilistic analysis of cycles in random Tanner graphs
2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013), 2013Cycles in bipartite graphs (also called Tanner graphs in channel coding field) are of particular interest in modern coding theory, especially in capacity-achieving low-density parity-check (LDPC) codes. In this paper, the expected number of cycles of various lengths in randomly constructed regular and irregular Tanner graphs are calculated. For a given
Xiaopeng Jiao, Jianjun Mu
openaire +1 more source
On the Complexity of finding stopping set size in Tanner Graphs
2006 40th Annual Conference on Information Sciences and Systems, 2006The problem of determining whether a tanner graph for a linear block code has a stopping set of a given size is shown to be NP-complete.
K. Murali Krishnan 0001, Priti Shankar
openaire +1 more source
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 +1 more source
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 +2 more sources