192168291162007410165597395939

在matlab环境下用Diriclet与Richardson算法解决偏微分方程的算法实现(In the matlab environment Diriclet and Richardson algorithm used to solve partial differential equations of the algorithm)

harris corner detector test thingy

说明：  MATLAB实现的直接传输通信的统计误码率仿真。(MATLAB realization of the direct transmission of communication statistics BER simulation.)

实现主动频率偏移法的孤岛检测，利用matlab中的S-FUN编写(Frequency offset for active islanding detection method, using matlab written in S-FUN)

ofdm系统的matlab程序设计,详细描述了OFDM系统的整个运行过程。(the design of OFDM communication using MATLAB，the OFDM course is described in detail.)

solution of Electronics and Circuit Analysis Using MATLAB John O.Attia

卷积码编译码的快速实现算法，非常适合初学者迅速上手(Fast convolution code encoding and decoding algorithm is very suitable for beginners to get started quickly)

三相不平衡的补偿方法，simulink环境下实现。(Unbalanced three-phase compensation method, simulink environment to achieve.)

中间包括好几个希尔伯特黄的算法，基于MATLAB软件下运行。有emd-visu,emd-separation,emd-sampling,emd-n,里面还有hht 其他的内容，完整，经过测试。做信息处理，Fourier 是个万金油。HHT的优势所在，HHT是一个超adaptive的方法。

实现了蚁群算法求解TSP问题。注释详细 function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q) ------------------------------------------------------------------------- 主要符号说明 C n个城市的坐标，n×2的矩阵 NC_max最大迭代次数 m蚂蚁个数 Alpha表征信息素重要程度的参数 Beta表征启发式因子重要程度的参数 Rho信息素蒸发系数 Q信息素增加强度系数 R_best各代最佳路线 L_best各代最佳路线的长度 ========================================================================= (Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================)