qpskd

这是在matlab环境下 开发的一个运用遗传算法进行的优化。(This is the Matlab environment developed by using a genetic algorithm optimization.)

CBIR on matlab,using access and matlab code.

马氏距离是一种有效地计算两个样本集之间相似度的算法（数据之间协方差距离），与欧式距离相比，它考虑了各种特征之间的联系。本实验旨在通过给出的样本数据，设计一个最小马氏距离分类器并对测试点进行分类，然后将其与最小欧式距离分类器进行比较，实验得出当协方差矩阵为单位阵时，最小马氏距离分类器将与最小欧式距离分类器等价。本实验还根据实验样本设计贝叶斯分类器进行分类，并与最小马氏距离分类器进行比较，比较两种分类器的分类效果。(Markov distance is an effective method to compute the similarity between the two samples (data covariance distance), compared with the Euclidean distance, which takes into account the link between different characteristics. This experiment aimed at through the given sample data, design a minimum Mahalanobis distance classifier and classify the test points, and then compare it with the minimum Euclidean distance classifier. Experimental results showed that when the covariance matrix is a unit matrix, minimum Mahalanobis distance classifier with the minimum Euclidean distance classifier equivalent.In this experiment, according to the experimental design of the Bias classifier, and compared with the minimum distance classifier, the classification results of the two classifiers are compared.)

本文主要介绍频域均衡在LTE项目上SC_FDMA上行链路上的应用(In this paper, frequency domain equalization projects in the LTE uplink SC_FDMA Application are introduced)

this is the simulation of the relaying technique in all the channels using the amplify and forward and decode and forward protocols. it is also in the channels such as AWGN and also in the raileigh channels.the file also consists of the output graphs of all the simulations which are present in it.

G-P算法计算关联维数，可以运用在混沌时间序列的瓦斯浓度预测研究中(GP algorithm to calculate the correlation dimension, you can use the gas concentration in the prediction of chaotic time series in)

完整的蚁群算法，可以参考使用。。。。。。。。。。。。。。。(Ant colony algorithm)

图像预处理 字符识别实例(I&II) 有助于处理验证码(图像预处理——字符识别实例(I&II))

Code program of Esprit offset of OFDM Simulation with matlab

The mobile robot has to find the optimal path which reduces the number of steps to be taken between the starting point and the target ending point. GAs can overcome many problems encountered by traditional search techniques such as the gradient based methods. The proposed controlling algorithm allows four-neighbor movements, so that path-planning can adapt with complicated search spaces with