clean

It is an algorithm of knn.

说明：  香农第一定理指出了平均码长与信源之间的关系，同时也指出了可以通过编码使平均码长达到极限值，这是一个很重要的极限定理。(Shannon first theorem that the average yards long with the letter of the relationship between the source, it has also pointed out the code can make the average yards long reach limits, this is a very important Limit Theorem.)

sliding mode atiti. for help you in programming

OFDM载波同步算法的研究，验证后顺利运行，仿真效果好(After the OFDM carrier synchronization algorithm research, validation run smoothly, good simulation effect)

MATLAB的M文件编译成dll文件供VC6调用(VC6 Debug the dll folder from the MATLAB S m-file)

求时间序列的功率谱，包括周期图法和自相关函数法(Find the power spectrum of the time series, including periodogram and autocorrelation function method)

在matlab运行环境下 实现霍夫曼编码及霍夫曼译码(Huffman coding matlab implementation)

11n物理层最后达成的联合草案，Joint Proposal: High throughput extension to the 802.11 Standard: PHY(Joint Proposal: High throughput extension to the 802.11 Standard: PHY)

主要用途是对抗多径衰落。由于多径衰落的存在，使得同一个帧由于路径不同，到达用户端的时延有先有后。在相关的频域上的会造成子载波之间的相互干扰，影响 性能。另外，由于有了循环前缀，使得IFFT FFT操作把原来的线性卷积变成循环卷积，大大简化了相应的信号处理复杂度(The main purpose is to fight against multipath fading. Due to the presence of multipath fading, the first after they have the same frame different paths to reach the client delay. Would cause mutual interference between sub-carriers in the frequency domain, affecting performance. In addition, thanks to the cyclic prefix, so IFFT FFT operation to the linear convolution of the original into a circular convolution, greatly simplifying the corresponding signal processing complexity)

简介：IFP_FCM,改进型FCM(模糊C均值)聚类算法,由Frank Hoppner与Frank Klawonn于2003年提出,解决了FCM算法对初始值设定较为敏感、训练速度慢、在迭代时容易陷入局部极小的问题。并附带了Box和Jenkins煤气炉数据模型辨识实例。 文件清单： IFP_FCM算法原始论文： Improved fuzzy partitions for fuzzy regression models.pdf 程序清单： IFP_FCM.m - IFP_FCM算法主函数 initifp_fcm.m - initifp_fcm子函数 stepifp_fcm.m - stepifp_fcm子函数 distifp_fcm.m - distifp_fcm子函数 IFP_FCM_T_S_box_test.m - IFP_FCM测试实例：Box和Jenkins煤气炉数据T-S模糊模型辨识 数据文件： box_data.mat - Box和Jenkins煤气炉数据(IFP_FCM, modified FCM (Fuzzy C-Means) clustering algorithm, in 2003, proposed by Frank Hoppner and Frank Klawonn, FCM algorithm to solve the initial value setting is more sensitive, slow training, while iterating easy to fall into local minimum problem. And comes with Box and Jenkins gas furnace model identification data instance.)