zishiying-

matlab的函数大全，按字母排序分类，是初学者的最佳选择。(matlab a function of Guinness, in alphabetical order classification, is the best choice for beginners.)

说明：  qpsk调制解调的生成程序，用MATLAB语言实现(keying modulation and demodulation production procedures, using Matlab)

无线传感器网络中应用leach算法来识别恶意节点和剔除恶意节点。从而保证网络系统的寿命最长。(In wireless sensor network，cluster algorithm of nodes is all effective approach and key technology to implement energy saving and flexible management．To improve security and lifetime of clustering network，a secure clustering was pro— posed based on the random and parallel cluster header election algorithm and pre—distributed key scheme．In hypothetical network model，it can elect the cluster header nodes and identify and get rid of malicious nodes，and in data telecommuni— cations，the communication security Can be achieved by using encryption algorithm and thus the network lifetime Call be prolonged．)

GPIB material881234231

SVPWM算法MATLAB仿真，采用S函数实现(SVPWM algorithm MATLAB simulation, using the S-function realization)

We can generate simple histogram programs using this code in matlab

小波图像去噪的matlab程序，实现多种阀值之间的比较(Wavelet image denoising Matlab program, a variety of threshold comparison between)

最小二乘法（又称最小平方法）是一种数学优化技术。它通过最小化误差的平方和寻找数据的最佳函数匹配。利用最小二乘法可以简便地求得未知的数据，并使得这些求得的数据与实际数据之间误差的平方和为最小。最小二乘法还可用于曲线拟合。其他一些优化问题也可通过最小化能量或最大化熵用最小二乘法来表达。 (Least-squares method (also known as least squares) is a mathematical optimization techniques. It does this by minimizing the square error of the data and find the best match function. The least square method can easily obtain the unknown data, and makes these data and the actual data obtained between the square and the smallest error. Least-squares curve fitting method can also be used. Other optimization problems can be maximized by minimizing the energy or entropy of the least square method to express. )

BER_QPSK QPSK MODULATION ANALYZE IN BER

格式：[huffcodes，氢，領 ，电子] = huffmancoding（磷，氮） ％输入：p是每个字母符号的概率 （如：对= [0.3 0.2 0.2 0.2 .06 .04]） n是一个整数，决定在每个帧的符号数量 （默认：n = 1时） ％输出：huffcodes：huffmancodes 答：源熵 甲肝：平均熵编码 电子邮件：科丁效率(format : [huffcodes,H,Hav,e]=huffmancoding(p,n) inputs: p is the probability of each alphabet symbol ( eg:p=[.3 .2 .2 .2 .06 .04] ) n is an integer that determines number of symbols at each frame (default:n=1) outputs: huffcodes: huffmancodes H: source entropy Hav: average entropy for coding e: codding efficiency )