bilixiezhen

说明：  一个数如果恰好等于它的因子之和，这个数就称为“完数”。例如6=1＋2＋3.编程 　　　 找出1000以内的所有完数。 (If a number is just equal to the sum of its factors, this number is called &quot End of a few.&quot For example 6 = 1+2+3. Programmatically find all finished within a number of 1000.)

ASM 主动形状模型 MATLAB代码 （用于分割）(The ASM active shape model MATLAB code (for split))

脉冲多普勒雷达的GO,SO-CFAR处理程序(PD radar go-cfar(so-cfar) program.)

扩频通信的一篇好论文，文件比较齐全比较齐全(A spread spectrum communication papers, documents a relatively complete and relatively complete)

说明：  R语言入门教程，中文版，注：由于以上选项没有R语言选项，所以分为类似的matlab类(R Language Tutorial, Chinese, Note: Due to the above option is not R language options, so the class is divided into similar matlab)

In his 1960 famous publication (“A new approach to linear filtering and prediction problems”, Trans.ASME J. Basic Engineering., vol 82, March 1960, pp 34-45), Rudolf Kalman based the construction of the state estimation filter on probability theory, and more specifically, on the properties of conditional Gaussian random variables. The criterion he proposed to minimize is the state vector covariance norm, yielding to the classical recursion : the new state estimate is deduced from the previous estimation by addition of a correction term proportional to the prediction error (or the innovation of the measured signal).

MATLAB7.0 中的模拟仿真软件Simulink 仿真设计AM、DSB、SSB调制与解调系统。完成调制信号分析，并绘制相关的波形图及频谱图。(The simulation MATLAB7.0 simulation software Simulink design AM, DSB, SSB modulation and demodulation system. Complete modulation signal analysis, and draw the waveform and spectrum diagram related figure.)

This file gives the main function for the implementation of the hybridized version of the cuckoo search algorithm by combining it with the Nelder Mead Simplex algorithm. The method is designed to minimize functions with a low number of dimensions in a low number of iterations.

几种esprit算法分析和研究的matlab源码(Several esprit algorithm matlab source code analysis and research)

Block-interleaver/deinterleaver according to the IEEE 802.11-2007 Defined by two step-permutation : The first permutation ensures that adjacent coded bits are mapped onto nonadjacent sub-carriers. The second ensures that adjacent coded bits are mapped alternately onto less and more significant bits of the constellation and, thereby, long runs of low reliability (LSB) bits are avoided. Tested and works well