boumao_v73

说明：  包括直接序列扩频CDMA的调制和解调函数(Including direct sequence spread spectrum CDMA modulation and demodulation function)

卡尔曼滤波方法解决雷达数据融合问题，本程序针对同步融合。还附有红外数据融合(Asynchronism_Radar.Asynchronism_IR.)

书名：[MATLAB语言常用算法程序集].(龚纯).清晰版 内容：插值，函数逼近，特征值计算，数值微分，数值积分，方程求根，非线性方程组求解，线性方程组的直接法，线性方程组的的迭代法，随机数生成，特殊函数计算，常微分方程的初值问题，偏微分方程的数值解法，数据统计和分析。(Title: [MATLAB algorithms commonly used in assembly language]. (Gong pure). Clearer view of the contents: interpolation, function approximation, eigenvalue calculation, numerical differentiation, numerical integration, finding roots of equations, nonlinear equations, linear equations group, direct, linear equations of the iterative method, random number generation, calculation of special functions, initial value problems for ordinary differential equations, numerical solution of partial differential equations, statistics and analysis.)

说明：  LMS算法的MATlab仿真分析，结果表明LMS算法有较好的噪声消除效果！(LMS algorithm MATlab simulation results show that the LMS algorithm has better noise reduction effect!)

由于实际信道中的多径和阴影效应，单个认知用户频谱感知的性能受到影响，因此需要靠不同用户间的协同频谱感知来对抗多径和阴影效应。本设计要求在文中采用一种协作机制，即两用户进行协作频谱感知，提高主用户的检测率，减少检测时间，并且得到捷变增益。要求给出仿真结果。(As the actual channel of the multi-path and shadow effect, a single user of spectrum sensing of cognitive performance are affected, it needs to depend on collaboration between different users of spectrum sensing to combat multipath and shadow effects. The design requirements in the text using a cooperation mechanism, namely, two user collaborative spectrum sensing, to improve the detection rate of the primary users, reducing detection time, and get agility gain. Required to give simulation results.)

This is a computer vision project implemented in matlab to remove radial distortion from the image This is a computer vision project implemented in matlab to remove radial distortion from the image

this paper talks about ofdm synchronization,hope it to be of help to evrybody

电磁场与电磁波基于matlab的FDTD一维算法实现(Electromagnetic fields and electromagnetic waves matlab-based algorithm for one-dimensional FDTD)

This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...

parity encoder test bench