mallattest

读入视频，将视频转换成JPG格式的图片，并获取所需要的图片。(Read video,convert video to images and capture needed pictures.)

一个较好的蚁群MATLAB程序，附地图。(In this M-file, the implemention of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the iterative playing course.)

GPS码捕获，跟踪代码算法的仿真，这是基于GPS的仿真推导(GPS code acquisition, tracking algorithm simulation code, which is derived based on GPS simulation)

说明：  多目标DE算法，子程序有拥挤距离计算，非支配解排序，模型等，多学习多目标算法很有帮助(multi-objective DE algorithm)

pe to snr for bpsk when we use rectangular modulation on bw=0.025,0.05,0.1

关于Turbo码交织器的设计关于Turbo码交织器的设计关于Turbo码交织器的设计关于Turbo码交织器的设计(About Turbo Code Interleaver Design on Turbo Code Interleaver Design on Turbo Code Interleaver Design on Turbo Code Interleaver Design)

This is a simple position location algorithm using Least Square Estimation algorithm. Timing information is time of flight (TOA) of signal between Tx and Rx. This code generally describes the Positioning method, Also it plots final coordinate of node in 2D. All other information was inlcuded as comments in source code.

模糊神经网络采用matlab编程 o install NEFCON follow these steps: 1. Unpack the tar file NEFCON.TAR into your MATLAB working directory: tar xf NEFCON.TAR 2. Start MATLAB 3. Change to the installation directory. 4. Change to the NEFCON directory. 5. Start the STARTUP M-file to initialize NEFCON.(FNN using Matlab programming o install NEFCON follow these steps : 1. Unpack the tar file NEFCON.TAR MATLAB into your working directory : tar xf NEFCON.TAR 2. Start MATLAB 3. Change to the installation directory. 4. Change to the NEFCON directory. 5. Start the STARTUP M-file to initialize NEFCON.)

说明：  这个程序可以仿真ＦＩＲ滤波器的字长效应对滤波效果的影响(this process simulator can FIR filter the characters respond to long-term effect of filtering)

k最近邻算法，给出训练样本和测试样本，通过样本间欧氏距离或是绝对距离来寻找测试样本的k个近邻，并根据k个实例里多数所属的类将该测试样本归为该类。(k-nearest neighbor algorithm, given the training and testing samples by the Euclidean distance between the samples or the absolute distance to find the k nearest neighbors of the test sample and the test samples according to class k instances where the majority belongs classified as class .)