搜索资源列表
PEG_LDPC.rar
- 引入PEG（Progressive-edge-growth）算法来构造适合线性时间编码的LDPC校验矩阵，译码时采用简化最小和Min-Sum译码算法实现简化译码．仿真结果表明，该方法能够构造适合LDPC码的线性时间编码的下三角校验矩阵日，并且用此方法构造的LDPC码性能非常接近原来PEG算法构造的LDPC码．同时通过采用最小和Min-Sum算法降低译码复杂度．,The introduction of PEG (Progressive-edge-growth) algorithm to const
LDPC.rar
- LDPC码编译码源程序，可生成任意非规则二进制校验矩阵，并可进行LLR BP译码,LDPC codec source code can be generated non-arbitrary rules binary check matrix, LLR BP decoding can be carried out
几种编码误码率性能的测试程序
- 生成多项式为（561，753）的（2，1，8）卷积码的编码、译码、ＡＷＧＮ信道下的误码率性能的测试程序,Q matrix to solve the problem, according to input parameters can be calculated as a Q band random matrices, satisfy the following conditions, each row of the matrix, each row, each diagonal are a nu
kmplot
- LDPC codes BER simulation under AWGN channel. MacKay-Neal based LDPC matrix. Message encoding uses sparse LU decomposition. There are 4 choices of decoder: hard-decision/bit-flip decoder, probability-domain SPA decoder, log-domain SPA decoder, and si
H_1024x2048
- LDPC 码二进制规则码生成矩阵1024*2048，效果很理想-LDPC code rules binary code matrix to generate 512* 1024, the effect is very satisfactory
H_2048x4096
- LDPC 码二进制规则码生成矩阵2048*4096，效果很理想-LDPC code rules binary code generated matrix 2048* 4096, the effect is very satisfactory
Girth-twelveQC-LDPC
- The program constructs girth-twelve column-weight QC-LPDC codes. The rate can be changed by changing k(row-weight), size is changed by varying m(sub-matrix size).
Girth-eightQC-LDPC
- The algorith divides rows in to four equal groups. The rows are then used to from a distance graph which is then transformed into a matrix. girth of eight is maintained by avoiding six-cycles in the graph construction
generate_G
- 数字电视标准矩阵及其生成矩阵源代码（LDPC)-Digital TV standard matrix and matrix to generate the source code (LDPC)
H_512x1024
- LDPC 码二进制规则码生成矩阵512*1024，效果很理想-LDPC code rules binary code matrix to generate 512* 1024, the effect is very satisfactory
matrix_generation
- Matlab packet for generating G and H matrix for RS codes in binary form
Chapter9
- 现代通信原理第九章程序代码，不错的程序，初学习者很好的程序-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative scheme that implements the idea of compress-and-forward. Through the exploitation of efficient distributed source coding (
Chapter10
- 现代通信原理第十章程序代码，不错的程序，初学习者很好的程序-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative scheme that implements the idea of compress-and-forward. Through the exploitation of efficient distributed source coding (
const_ldpccc_mat
- Low density parity check matrix-Descr iption A program written for generating LDPC matrix in the as pattern as discussed in the research paper , " Time varying periodic convolutional codes with low density parity check matrix" by Alberto
girth6_shifter
- Flexible construction of girth-six QC-LDPC Codes-The program constructs girth-six QC-LDPC codes given row-weight,k, column-weight,j, and sub-matrix size,m. The obtained parity-check matrix is stored in H. The construction has flexibility in that j,k
viterbiDecoderConvolutionalCode
- Viterbi decoder for nonsystematic convolutional code. The encoder could be designed arbitrary through the generate matrix and parameter k. The number of row of generate matrix is output bits, and collom is constraint length. Parameter k is the number
skyplot
- SKYPLOT for a given receiver position Y=skyplot(X,PRN,C,O) draws the skyplot for the receiver position. The required inputdata for the calculation of the skyplot X is N-by-3*M matrix, where N are the timesteps and M is the number of the Sat
checkcycle6
- 查找ldpc校验矩阵中的6环，并将其记录到txt文件中-Find ldpc check matrix of the six rings, and its records to a txt file
da1
- HELP: coherent_ML_receiver function [separated_data]=coherent_ML_receiver(received_signal,H,code_name,rate,num_code,modulator) Perform Maximum Likelihood Space Time Decoding. The function can be computionnaly expensive if the modulation
matlab代码
- LM 算法最小二乘法的概念，最小二乘法要关心的是对应的cost function是线性还是非线性函数，不同的方法计算效率如何，要不要求逆，矩阵的维数。(The concept of the least square method of the lm algorithm, the least square method should be concerned whether the corresponding cost function is a linear or nonlinear funct