cs

it could make a point on the map , which is the image you edit

说明：  主要通过几种准正交空时码的性能曲线仿真，比较分析了这几种准正交空时码的优势(Mainly through several quasi-orthogonal space-time codes performance curve simulation, a comparative analysis of these types of quasi-orthogonal space-time codes advantage)

Training Artificial Neural Network. XOR Problem. Summation Units, Log-Sigmoid Neurons with Biases. Input Layer: 2, Hidden Layer: 2, Output Layer: 1 neurons. Returns mean square error between desired and actual outputs. Reference Papers: D. Karaboga, B. Basturk Akay, C. Ozturk, Artificial Bee Colony (ABC) Optimization Algorithm for Training Feed-Forward Neural Networks, LNCS: Modeling Decisions for Artificial Intelligence, 4617/2007, 318-329, 2007. D. Karaboga, C. Ozturk, Neural Networks Training by Artificial Bee Colony Algorithm on Pattern Classification, Neural Network World, 19(3), 279-292, 2009. */

自适应滤波的代码和文档，毕业设计论文以及用户文档(Adaptive filtering of code and documentation, graduation thesis design and user documentation)

《matlab编程百例》光盘代码31-35("Matlab programming hundred cases" CD-ROM code 31-35)

A color image is DCT transformed watermark embedded into the intermediate frequency coefficients to the effect of a good algorithm is the classic reference value has a strong image of yourself for the

先进PIDmatlab仿真程序，模糊PID控制仿真程序(Advanced simulation program PIDmatlab, fuzzy PID control simulation program)

用于水声通信的pattern通信体制的matlab源代码 4bits量化 常规解码(The pattern used for underwater acoustic communication system, communication matlab source code for 4bits quantitative conventional decoding)

说明：  pso粒子群算法的matlab程序.实现了第一个函数的优化.其他函数类似.比较简单明了(PSO PSO algorithm Matlab procedures. The first realization of a function optimization. Other similar function . relatively simple to understand)

说明：  快速傅里叶变换 (FFT) 实现，给定信号x(t)=sin(2πf0t)，f0=50Hz，对x(t)以fs=200Hz进行抽样，抽样点数为N=16。编写程序实现对x(n)的快速傅里叶变换，求得相应的X(K)。(Fast Fourier Transform (FFT) to achieve a given signal x (t) = sin (2πf0t), f0 = 50Hz, for x (t) with fs = 200Hz sampling, the sampling points is N = 16. Procedures for the preparation of x (n) of the fast Fourier transform, obtained by the corresponding X (K).)