ForestFire

记忆多项式查找表的实现，用于功率放大器的建模(Memory polynomial realization of look-up table for power amplifier modeling)

智能天线技术是第三代移动通信系统的关键技术之一，也是国内外热门的研究课题。由于无线移动通信的信道传输环境具有复杂性和不确定性，存在多径衰落和时延扩展，因此造成了符号间串扰、同信道干扰、多址干扰等，这些干扰降低了链路性能和系统容量，智能天线技术是解决以上问题的方法之一。 本文首先阐述了智能天线和白适应波束形成的基本理论，然后对自适应算法进行了研究。对一些基本的自适应算法最小均方算法、恒模算法及递推最小均方算法进行了分析讨论，用计算机仿真的结果论证了算法的性能。针对相干干扰介绍了空间平滑技术，对传统的相干干扰抑制方法-空间平滑法进行了分析，采用改进算法有效降低了空间平滑算法的运算量。对信号波达方向(DOA)的估计是智能天线研究的另一关键问题。第四章在介绍了阵列信号处理方法的基础上，先简单介绍了Bartlett、Capon、MUSIC等空间谱估计算法，分析了信源数目过估计与欠估计情况下的MUSIC算法性能，提出一种改进算法，在信源数目有误差的情况下该算法的性能良好。第五章针对多径干扰环境，在分析MMUSIC算法的基础上，本文提出了基于低秩矩阵逼近法的改进MUSIC算法(In this paper, firstly, the author illustrates the principles of smart antenna and adaptive beam forming, and then introduces some typical adaptive algorithms, the LMS ,CMA and RLS algorithms are analyzed and discussed and simulate them in the computer to prove their capability. but they have the disadvantage of high complexity, so they are not fit for practice. The paper analyses the conventional method rejecting spatial smoothing coherent interfering signals, which is spatial smoothing technique)

用matlab实现简单的图像的放大和缩小(use matlab)

粒子滤波算法，非常管用的运动估计和运动预测，mat源代码

mini projet matlab engineering

Algorithm used for Monte Carlo simulations.

comparaison de vecteurs aléatoires

omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点(omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high complexity)

一种间接的估计信号的1.5维谱的方法，1.5维谱可以有效的抑制高斯噪声，加强低频分量。(An indirect estimate of the signal spectrum of 1.5-dimensional method, 1.5-dimensional spectrum can effectively suppress Gaussian noise, to enhance low frequency components.)

In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite.