Results 261 to 270 of about 651,900 (282)
Some of the next articles are maybe not open access.
On the Performance of Tanner Graph Based and Viterbi Decoding for Erasure Recovery
2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall), 2015We address the utilization of short erasure correcting codes to recover the erased data in opportunistic spectrum access (OSA) due to collisions among multiple users. The main application of using short codes over long codes is to avoid long delays in the network.
Muhammad Moazam Azeem +2 more
openaire +1 more source
Irregular progressive edge-growth (PEG) Tanner graphs
Proceedings IEEE International Symposium on Information Theory,, 2003A 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.
null Xiao-Yu Hu +2 more
openaire +1 more source
Construction of LDPC Codes with Cycles Hold in Tanner Graph
2007 International Conference on Wireless Communications, Networking and Mobile Computing, 2007This paper presents a algebraic method for constructing LDPC codes. It uses a parity-check matrix of a short LDPC code with given degree distribution as mother matrix, upon which a long LDPC code is constructed by circulant permutation matrices. The number of cycles of given length in the Tanner graph of constructed codes is equal to or less than that ...
Binbin Liu, Shunliang Mei, Dong Bai
openaire +1 more source
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
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 +3 more
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 +2 more sources
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
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.
Wei Lei +3 more
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 +2 more sources