Location:
Search - tanner graph
Search list
Description: The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator
matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is
introduced. The method is based on a rigorous approach to spin glasses developed by Francesco
Guerra. It allows to construct lower bounds on the entropy of the transmitted message conditional
to the received one. Based on heuristic statistical mechanics calculations, we conjecture
such bounds to be tight. The result holds for standard irregular ensembles when used over
binary input output symmetric channels.
The method is first developed for Tanner graph ensembles with Poisson left degree distribution.
It is then generalized to ‘multi-Poisson’ graphs, and, by a completion procedure, to
arbitrary degree distribution.
Platform: |
Size: 457728 |
Author: mike zhou |
Hits:
Description: matlab实现的LDPC编码Tanner图中环的统计算法-matlab achieve Tanner graph of LDPC coding in Central Statistical Algorithm
Platform: |
Size: 3072 |
Author: 杨友福 |
Hits:
Description: 此程序 是一个C++程序. 通过PEG算法来构造 LDPC parity-check 矩正的Tanner 图.-This is a C++ program, which is used to construct Tanner graph of LDPC codes with the famous PEG algorithm.
Platform: |
Size: 6144 |
Author: Jiangxueqin |
Hits:
Description: PEG算法是在编码构造方面的一种有效的方法，它基于Tanner图，能有效的增大围长，使得构造出来的码的性能更好-PEG algorithm is constructed in terms of an effective coding method, based on Tanner graph, which can effectively increase the girth, making the code constructed with better performance
Platform: |
Size: 10240 |
Author: 张小龙 |
Hits:
Description: procedure un matlab to plot Tanner graph, it´ s not useful to wide matrices, can´ t view de edges of de graph
Platform: |
Size: 1024 |
Author: Juan |
Hits:
Description: QC-LDPC码生成矩阵编程，围长为12，无4环-The program searches for a girth 12 QC-LDPC code given size of sub-matrix, row and column weights. The configuration of sub-matrices could also be changed. The program offers flexibility in constructing girth-12 QC-LDPC codes compared to other algorithms. The program builds a Tanner graph by connecting groups of rows and columns. A connection is made if it does not form less than twelve-cycles. The program may fail to find a code given particular parameters. It also does not find the smallest codes compared to other algorithms.
Platform: |
Size: 3072 |
Author: ss |
Hits:
Description: 本文件为Tanner算法的入门文章，读完之后会更好的理解tanner图，希望有帮助啊。-It is about the tanner graph.
Platform: |
Size: 1685504 |
Author: jiangtao |
Hits:
Description: Calculation of Cycle of Tanner Graph in LDPC Codes
LDPC_Cycle6.m
Platform: |
Size: 1024 |
Author: Ting Ya
|
Hits: