viterbi_qpsk

Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.

this file is to solve the problem of the tridiagonal and banded systems

说明：  结构分析中的有限元法利用matlab实现的教材(Structural analysis of the finite element method using matlab implementation of teaching materials)

对EKF、UKF、PF算法进行比较分析，适用于初学者对三种算法的掌握(A comparative analysis of the EKF, UKF, the PF algorithm, for beginners grasp of the three algorithms)

基于离散余弦变换的数字水印提取嵌入技术应用(Based on the discrete cosine transform digital watermark embedding technology to extract)

牛顿法，一种高效的优化方法，对于无约束的优化问题有效(Newton, an efficient optimization method for unconstrained optimization problems effectively)

matlab 源程序、仿真模拟、编写的S函数(matlab 源程序)

无线传感网络一种分布式定位算法的简介，介绍详细，并带有MATLAB仿真。(A distributed wireless sensor network localization algorithms brief description in detail, and simulation with MATLAB.)

Simulink Design For Sound AutoScaling and Curve Fitting

In the 80′s most companies did not improve their service level because of the Economy Model in exercise and because of financial reasons. In this brief paper i try to demonstrate this statement.