模塊
zujiusheng
这个作者很懒,什么都没留下…
展开
-
均匀量化函数
function [F] = quant_bit(bit)lon =pi;F = [0:2^bit-1]*(2*lon/2^bit)-lon+2*lon/2^(bit+1);end原创 2022-05-19 19:00:40 · 128 阅读 · 0 评论 -
LT_BP_Gauss
clc;clear;K = 5000;m = K;u = 0;degree = 100; %迭代次數sigema =sqrt(0.5); % %(0.5/r)*10^(-0.1*(Eb_N0));% Eb_N0 = 1 ; %单位:dB % n = 10;% r = m/n;%sum_1= [0.007969,0.501539,0.6677...原创 2021-01-04 17:10:54 · 81 阅读 · 0 评论 -
LT码在BI-AWGN信道下的译码算法
clc;clear; K = 500; m = K; u = 0; degree = 40; %迭代次數 sigema =sqrt(0.5); % %(0.5/r)*10^(-0.1*(Eb_N0));% Eb_N0 = 1 ; %单位:dB % n = 10;% r = m/n;% P = ...原创 2021-01-04 17:32:26 · 446 阅读 · 0 评论 -
LT_柱状图
clc;clear;K = 10000;%%%%%%%%%%%%%m = K;c = 0.01;o = 0.5;x = ones(1,m);S = c*sqrt(K)*log(K/o); for cou_num = 1:100 %½yÓ‹ %%%%%%%%% x_1 = rand(1,m)<0.5 ; %ÐÅÔ´´...原创 2019-08-23 21:43:13 · 120 阅读 · 0 评论 -
冒泡法排序
clear;clc%************冒泡法排序開始**************A = [3 1 4 7];n = length(A)for i = 1:n-1 %定值 for j = i+1:n %查找最小值 if A(i)>A(j) %交換 t = A(i); ...原创 2019-07-25 21:06:30 · 162 阅读 · 0 评论 -
選擇法排序
clear;clc%************選擇法排序開始**************A = [6 7 9 0 4 9 3 3 9 5];n = length(A)for i = 1:n %定值 for j = i:n %查找最小值 if A(i)>A(j) %交換 t = A(i);...原创 2019-07-25 21:04:09 · 125 阅读 · 0 评论 -
判斷素數
clear;clc%************判斷一個數是否是最小公倍數開始**************input =115if input <= 1 disp('請輸入大於2的整數');elseif input==2 disp('素數:yes');else n = input-1; for i = 2:n record(i-1) = ...原创 2019-07-25 20:48:10 · 93 阅读 · 0 评论 -
求最小公倍數
最小公倍數等於兩數之機除以最大公約數原创 2019-07-25 20:24:33 · 99 阅读 · 0 评论 -
求最大公約數
clc%************求兩個整數最大公約數,最小公倍數開始**************m = 188;n = 188;while(1) r = mod(m,n); if r == 0 n disp('是最大公約數'); break; else m = n; n = r; ...原创 2019-07-25 20:22:32 · 98 阅读 · 0 评论 -
LT(7.21,Sun)于圖書館
clc;clear;m = 5000;K = 10000;n = 10000;c = 0.01;o = 0.5;x_1 = rand(1,m)<0.5; %信源碼字Pgenerate = rand(1,K); %隨機生成K個數count = 1;% for d = 1:K% index_d = 2...原创 2021-01-04 17:31:54 · 69 阅读 · 0 评论 -
噴泉碼小程序
clc;clear;K = 10000;c = 0.2;o = 0.05;S = fix(c*sqrt(K)*log(K/o));for d = 1:50 %*******************************P(d)開始************************************ index_d = 2:K; if find(index...原创 2021-01-04 17:28:55 · 115 阅读 · 0 评论 -
LT_BP_performance
clc;clear;m = 500;K = 500;overhead = [550 600 700 800];i_ii =10000;for iii = 1:4 n = overhead(iii); for i_i = 1:i_ii if mod(i_i,100)==0 i_i end c = 0.0...原创 2021-01-04 17:29:29 · 175 阅读 · 0 评论 -
稀疏矩陣壓縮存儲與還原
#1.模塊clc;clear;H = [1 1 1 1 0 1 0 1 1 0 1 0 1 0 1 1 0 1 1 1 0 1 1 1]C = [1 2 3 4 5 6];[m,n] = size(H);for i = 1:m k = 1; for j = 1:n if H(i,j)~=0 index_co...原创 2021-01-04 17:28:39 · 108 阅读 · 0 评论