-
saa
good simulink program for ldpc
- 2012-06-25 21:58:47下载
- 积分:1
-
alamouti_Turbo
Work has started in the 3GPP to define a long-term evolution for 3G, sometimes referred to as Super-3G, which will stretch the performance of 3G technology.
- 2010-06-21 22:03:48下载
- 积分:1
-
RayleighFading_generation
说明: 程序实现了瑞利衰落信道的matlab仿真!给出了matlab源码程序!(The program perform the simulation of RayleighFading in matlab!the code in matlab is avalible!)
- 2010-04-21 23:17:48下载
- 积分:1
-
Rayleigh
移动通信系统中,Rayleigh衰落信道的matlab仿真(Mobile communication systems, Rayleigh fading channel matlab simulation)
- 2013-11-01 15:20:03下载
- 积分:1
-
sinc_smpl
任意采样率变换,使用sinc()函数作为理想插值系数,可以设置滤波器延迟(阶数)(Arbitrary sample rate conversion, the use of sinc () function as an ideal interpolation coefficients, the filter delay can be set manually inside the program(order Taps))
- 2011-12-01 11:37:46下载
- 积分:1
-
ELM_MatlabClass-master
说明: 极限学习机一种单隐层神经网络,用于数据分类,故障诊断等(ELM is A single hidden layer neural network for data classification, fault diagnosis, etc)
- 2020-09-22 19:20:50下载
- 积分:1
-
untitled
num=[2 1.4 -0.9 -0.158 0.4104 0.0294 -0.0668]
den=[1]
figure(1)
zplane(num,den)
num1=[1 2.7 -12.61 -24.757 66.301 62.072 -126.786]
den1=[1]
figure(2)
zplane(num1,den1)
num2=[0.2 -0.26 1.934 10.413 1.934 -0.26 0.2]
den2=[1]
figure(3)
zplane(num2,den2)
num3=[1.25 0.5 -2.1 -2.1 0.5 1.25]
den3=[1]
figure(4)
zplane(num3,den3)
num4=[1.1 3.12 -2.5 0.6 0.5 0.006 1]
den4=[1]
figure(5)
zplane(num4,den4) (good)
- 2010-11-03 09:48:25下载
- 积分:1
-
Solvers
some sparse solvers sparselab
OMP,BP,BPDN,...
- 2014-11-09 04:53:36下载
- 积分:1
-
ex9_14
ex9_14 雷达的恒虚警处理(CFAR)。在雷达的数据中有很多的杂波,会造成虚警。所以我们必须进行处理,这里我们采用了慢门处理和快门处理,并且对处理后的结果进行比较(ex9_14 radar CFAR processing (CFAR). The radar data have a lot of clutter, this will result in false alarms. Therefore, we must deal with, here we have adopted a slow shutter door handle and deal with, and after the results were compared)
- 2009-07-16 18:10:18下载
- 积分:1
-
code-methodMATLAB
Bairstow s approach is to use Newton s method to adjust the coefficients u and v in the quadratic x2 + ux + v until its roots are also roots of the polynomial being solved. The roots of the quadratic may then be determined, and the polynomial may be divided by the quadratic to eliminate those roots. This process is then iterated until the polynomial becomes quadratic or linear, and all the roots have been determined, bisection and other
- 2011-05-11 11:35:49下载
- 积分:1