shuangxian

信号系统上机实验代码与指导书，采样、连续卷积、连续运算、连续系统(Machine experimental code and instructions on signal systems, sampling, continuous convolution, continuous operation, continuous system)

可以简单的绘制国旗，基本的绘制国旗的程序，适用于初学者(Can simply draw the national flag, the flag of the basic procedures for the drawing for beginners)

此程序为机器人位置正反解程序，可用此程序求出解析解(This procedure for robot location inverse solution procedures, use this procedure to derive analytical solutions)

雷达回波信号检测，LFM信号，脉冲压缩，MTD，相干积累，长线积累，距离走动，速度模糊(Radar echo signal detection, LFM signals, pulse compression, MTD, coherent accumulation of long term accumulation, walking distance and speed)

Here we prove that as the tier number and path loss factor increases ,The SIR (Signal to Interference Ratio) also increases! Consider a cellular system with hexagonal cells & cluster size N.

PID算法，通过PID控制温度，实现PID自整定(PID algorithm, temperature, PID self-tuning PID control)

针对高精度的畸变图像,提出了一种基于最小二乘影像匹配的高精度畸变图像矫正算 法. 算法首先利用特征提取与边缘检测对图像进行预处理,并且将特征匹配与最小二乘算法相 结合,从而实现了图像与模板之间精确的子像素定位与匹配. 实验表明,该算法较好的解决了目前高精度畸变图像矫正算法中普遍存在的定位和匹配精度较差的缺陷,图像矫正效果良好,是一种有效的畸变图像矫正算法.(Image distortion for high-precision, a least-squares image matching based on high-precision image distortion correction algorithm. First of all, the use of feature extraction algorithm for edge detection and image pre-processing, and will feature matching with a combination of least-squares algorithm in order to achieve the image and the template between the sub-pixel accurate positioning and matching. The experimental results show that the algorithm has better accuracy of the solution to the current distortion prevalent image correction algorithm to match the accuracy of the positioning and less defects, image correction effect well, is an effective algorithm to correct image distortion.)

it will help in tranforming signals....,

matlab图像处理的电子书籍。对想学习matlab的同学比较有用(matlab image processing electronic books. Useful to the students want to learn matlab)

基于greedy DSATUR 的经典着色程序(Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classes there are some positif results. For example by definition we can trivially color a bipartite graph using two colors.)