(2, 1, 3) Convolutional code and a QC-LDPC code decoding performance comparison

In the previous article, under
BPSK modulation (2,1,3), (2,1,6) convolutional code and QC-LDPC code decoding performance and burst noise suppression performance comparison (implemented by MATLAB)

The code for comparing the decoding performance of the (2,1,3) convolutional code and a QC-LDPC code is rewritten, and the parallel calculation of the CPU in MATLAB is also used, which can improve the running speed of the program.

The results are as follows: the
Insert picture description here
code is as follows:

clear; close all; clc
%% 信源模块-生成0、1等概的二进制随机序列
% Nb = 100000; % 信源比特数
% rng('shuffle');
% bit_ori = randi([0,1],1,Nb); % 生成二进制0、1随机序列
SBRdB = 0:1:12;
%% 信道编码模块-(2,1,3)卷积码编码
m=3;g=[17 11];
trellis=poly2trellis(m+1,g); 
% 将码多项式转换为网格图描述,m+1为卷积码的约束长度,g为卷积码的生成多项式系数矩阵
% bit_con = convenc(bit_ori,trellis); % 卷积码编码
tblen = 1; % Traceback length

times = 1000; bit_ad = 0; SNRdB = 0:1:12;
Nb

Guess you like

Origin blog.csdn.net/wlwdecs_dn/article/details/113774134