GPC-matlab

说明：  压缩包内含有VC++中调用Matlab .m函数编译后的动态链接库和VC++中调用Matlab .m函数编译后的对应c函数(Compressed packets contain VC++ Calling Matlab. M function compiled dynamic link library and VC++ Calling Matlab. M function compiled function corresponds to c)

matlab的一些波束形成的算法 多种方法。。(the matlab the beamforming algorithm a variety of methods. .)

这是一个关于阵列信号处理的信源数估计MDL算法MATLAB程序(This is a number of sources on the array signal processing algorithm based on MATLAB program is estimated MDL)

OFDM的在瑞利信道下的与单载波信号的识别算法，本人原创(OFDM in Rayleigh channel with single-carrier signal of the recognition algorithm, I am original)

查找ldpc校验矩阵中的6环，并将其记录到txt文件中(Find ldpc check matrix of the six rings, and its records to a txt file)

自己写的几个matlab的函数，自己处理数据是常用。有滤波函数、平移函数等。处理后新生成的数组和原数组大小相同，行列特性也相同。(Himself wrote several matlab functions, deal with their own data is commonly used. There are filtering function, translation function, and so on. The new array is generated after treatment and the original array the same size, the ranks of features are the same.)

说明：  分析亥姆霍兹线圈轴线磁场分布现象的数学模型基础上, 运用MATLAB对亥姆霍兹线圈轴线磁场均匀分布进行验证及仿真的方法。(Axis Helmholtz coil magnetic field distribution of the mathematical model of the phenomenon, based on the use of MATLAB on the axis of the Helmholtz coil magnetic field uniform method of verification and simulation.)

粒子群优化算法代码，用于matlab优化计算(Particle swarm optimization algorithm code)

MATLAB Simulink程序，OFDM的仿真，FFT实现，有信道估计和均衡，信道估计采用LS估计(MATLAB Simulink program, OFDM simulation, FFT implementation, there are channel estimation and equalization, channel estimation using LS estimation)

分形的练习一 ①Koch曲线 用复数的方法来迭代Koch曲线 clear i 防止i被重新赋值 A=[0 1] 初始A是连接（0，0）与（1，0）的线段 t=exp(i*pi/3) n=2 n是迭代次数 for j=0:n A=A/3 a=ones(1,2*4^j) A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a] end plot(real(A),imag(A)) axis([0 1 -0.1 0.8]) ②Sierpinski三角形 A=[0 1 0.5 0 0 1] 初始化A n=3 迭代次数 for i=1:n A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2 A=[A A+[c b] A+[c/2 c]] end for i=1:3^n patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数 end (Fractal Exercise One The ① Koch curve Plural iteration Koch curve clear i to prevent i is reassigned A = [0 1] initial A is a connection (0,0) and (1,0) of the segments t = exp (i* pi/3) n = 2 n is the number of iterations for j = 0: n A = A/3 a = ones (1,2* 4 ^ j) A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a] end plot (real (A), imag (A)) axis ([0 1-0.1 0.8])   ② Sierpinski triangle A = [0 1 0.5 0 0 1] initialized A n = 3 the number of iterations. for i = 1: n A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2 A = [A A+ [c b] A+ [c/2 c]] end for i = 1:3 ^ n patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function end)