Results 231 to 240 of about 3,564 (250)
Some of the next articles are maybe not open access.
The construction of Tanner graph for iterative PN sequence acquisition
IET International Communication Conference on Wireless Mobile & Computing (CCWMC 2009), 2009This paper proposes an improved algorithm of PEG, CPEG (Constrained Progressive Edge Growth), for constructing tanner graphs to represent the constraints of PN sequence, which makes the iterative acquisition method applicable for general PN sequences. And simulation results show that the performance of iterative acquisition using CPEG graph is improved
null Yanchao Kang, null Kai Niu
openaire +1 more source
Codes that have tanner graphs with non-overlapping cycles
2008 5th International Symposium on Turbo Codes and Related Topics, 2008The sum-product algorithm (SPA) for the decoding of low density parity check (LDPC) codes produces exact posterior probabilities when the underlying Tanner graph is cycle-free. However, it has been shown that cycle-free Tanner graphs cannot support good codes as they have poor minimum distance properties.
S. Srimathy, Andrew Thangaraj
openaire +1 more source
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory, 1999Summary: If a linear block code \(C\) of length \(n\) has a Tanner graph without cycles, then maximum-likelihood soft-decision decoding of \(C\) can be achieved in time \(O(n^2)\). However, we show that cycle-free Tanner graphs cannot support good codes. Specifically, let \(C\) be an \((n, k,d)\) linear code of rate \(R=k/n\) that can be represented by
Tuvi Etzion +2 more
openaire +1 more source
Binary representation of cycle Tanner-graph GF(2/sup b/) codes
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004We derive the average symbol and Hamming weight spectrum functions of the random ensemble of regular low-density parity-check (LDPC) codes over GF(2/sup b/) when used with the binary-input noisy channel. This work confirms theoretically that the near-Shannon-limit performance of Gallager's binary LDPC codes can be significantly enhanced by moving to ...
Xiao-Yu Hu, Evangelos Eleftheriou
openaire +1 more source
On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018Counting short cycles in bipartite graphs is a fundamental problem of interest in the analysis and design of low-density parity-check (LDPC) codes. The vast majority of research in this area is focused on algorithmic techniques. Most recently, Blake and Lin proposed a computational technique to count the number of cycles of length g in a bi-regular ...
Ali Dehghan 0001, Amir H. Banihashemi
openaire +1 more source
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
2006Tanner 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 0001 +1 more
openaire +1 more source
Adaptive Image Deblurring via Tanner Graph Representation and Belief Propagation
2011 Data Compression Conference, 2011In this paper, we propose a deblurring framework based on a factor graph representation of the image and the image formation process. Each pixel is described by a variable node, while the statistical relation among pixels is formulated by two sets of check nodes, describing the local image structures and the image formation process, respectively ...
openaire +1 more source
Absorbing sets in the Tanner graphs of LDPC codes derived from geodetic graphs
2016The error floor performance of an LDPC code is related with the existence of certain substructures of the corresponding Tanner graph. Substructures that are called trapping sets, and especially absorbing sets as their subclass, determine the iterative decoding performance and are important contributors to the error floor for AWGN channel.
Šimac, Marina +2 more
openaire +1 more source
Tanner-Graph-Based Massive Multiple Access—Transmission and Decoding Schemes
IEEE Transactions on Wireless Communications, 2023Jiaai Liu, Xiaodong Wang 0001
openaire +1 more source
Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
Problems of Information Transmission, 2021exaly