Results 271 to 280 of about 651,900 (282)

Structured LDPC codes with low error floor based on PEG tanner graphs

2008 IEEE International Symposium on Circuits and Systems (ISCAS), 2008
Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach to design good LDPC codes. However, the Tanner graph constructed by PEG algorithm is non-structured which leads the positions of l's of the corresponding parity check matrix fully random.
Yi-Kai Lin, Chin-Lung Chen, Yen-Chin Liao, Hsie-Chia Chang   +3 more
openaire   +2 more sources

Adaptive Image Deblurring via Tanner Graph Representation and Belief Propagation

2011 Data Compression Conference, 2011
In 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

2016
The 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, Rukavina, Sanja, Crnković, Dean   +2 more
openaire   +1 more source

Tanner-Graph-Based Massive Multiple Access—Transmission and Decoding Schemes

IEEE Transactions on Wireless Communications, 2023
Jiaai Liu, Xiaodong Wang 0001
openaire   +1 more source

Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis

Problems of Information Transmission, 2020
exaly  

Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds

IEEE Transactions on Information Theory, 2012
Roxana Smarandache
exaly  

A Transformer Decoder with Tanner Graph-based Positional Encoding

ICC 2026 - IEEE International Conference on Communications
Xiang Shi, Chin Wa Ken Lau, Nian Guo
openaire   +1 more source

Iterative soft decoding of binary linear codes using a generalized Tanner graph

2011
Eirik Rosnes
exaly  

Which codes have cycle-free Tanner graphs?

Alexander Vardy, T Etzion
exaly  

Tanner-graph-assisted belief propagation decoding for large kernel polar codes: low-complexity design and enhancement method

Science China Information Sciences
Lixia Xiao, Guanghua Liu, Jiaxi Zhou
exaly