Costantini_RR_IP07

a file for fft (fast Fourier transform)

说明：  图像灰度变换、图像的锐化、⑴直方图均衡化（histogram equalization），⑵直方图匹配（histogram matching），⑶邻域平均（neighborhood averaging），⑷局域增强（local enhancement）， ⑸中值滤波（median filtering）。源码(Image gray-scale transformation, image sharpening, ⑴ histogram equalization (histogram equalization), ⑵ histogram matching (histogram matching), ⑶ average neighborhood (neighborhood averaging), ⑷ enhanced local (local enhancement), ⑸ Value filtering (median filtering). Source)

基于MATLAB用神经网络控制的一阶倒立摆模型，效果良好！(MATLAB-based control using neural networks first-order inverted pendulum model, the effect is good!)

仿真BPSK调制在AWGN信道下分别使用卷积码和不使用卷积码的性能。(Simulation BPSK modulation in the AWGN channel with a convolutional code, respectively, and not using the performance of the convolutional code.)

全自由度空时自适应处理,加载数据后可以直接运行(Full freedom of space-time adaptive processing, loading data can be run directly)

This project provides matlab class for implementation of convolutional neural networks. This networks was developed by Yann LeCun and have sucessfully used in many practical applications, such as handwritten digits recognition, face detection, robot navigation and others (see references for more info). Because of some architectural features of convolutional networks, such as weight sharing it is imposible to implement it using Matlab Neural Network Toolbox without it s source modifications.

多目标仿真的脉冲压缩雷达的有关程序，包括脉冲压缩，性能分析(failed to translate)

这是matlabdaima,用来计算RBF输出值很有效(This is matlabdaima, used to calculate the RBF output is valid)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

inverted pendulum fuzzy control