-
Performance_Analysis_of_PN_Code_Acquisition
文章中主要阐述了PN码的捕获，并对以前的各种捕获方法进行了改进。得出了基于FFT的快速捕获算法！(Abstract-A FFT-based parallel acquisition algorithm for Direct
Sequence/Spread Spectrum radio navigation system is studied to
solve long PN code acquisition using serial method. Frequency
domain analysis of FFT to acquire signal is applied in this paper
and state transfer function is used to derive the expression of
average acquisition time.)
- 2010-12-08 22:03:29下载
- 积分：1
-
CHBPWM
三相电流滞环控制，适合初学者理解，可以直接运行(Hysteresis control，CHBPWM)
- 2015-03-26 13:38:28下载
- 积分：1
-
mie_scattering
说明： 通过mie级数计算球体的消光截面，散射截面，吸收截面(Mie series by calculating the extinction cross section sphere, scattering cross section, absorption cross section)
- 2011-04-11 16:27:32下载
- 积分：1
-
mpc_demo_example_20p5
demo MPC function !!!
using Matlab MPC function to control a system based on DMC method.
- 2013-12-09 04:37:26下载
- 积分：1
-
Wilson
wilson_sita法求解振动方程的解，近似计算线性方程动态响应(Wilson sita method to solve the solution of vibration equation, the approximate linear equation of dynamic response)
- 2016-06-23 11:33:38下载
- 积分：1
-
analysis
用matlab对离散系统的时域分析，得到其特性曲线(Using matlab for time-domain analysis of discrete systems, by their characteristic)
- 2011-07-08 22:20:26下载
- 积分：1
-
guihua
用matlab编写的经典算法程序——规划问题，供大家参考(Classical algorithm using matlab program- planning issues, for your reference)
- 2013-01-24 22:28:36下载
- 积分：1
-
iterative-method
包含Jacobi和Seidel两种迭代法，用于求解线性方程，计算简单，收敛快(Contains two kinds of Jacobi and Seidel iterative method for solving linear equations, computing simple, fast convergence)
- 2013-11-29 22:49:26下载
- 积分：1
-
displaylet
matlab内显示图形的子程序，可以方便的显示各种图形，能够识别图形中任意点的轨迹(matlab display graphics within the subroutine, you can easily display a variety of graphics, can identify any point in the track graph)
- 2009-12-10 21:34:42下载
- 积分：1
-
0-1programming
0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
- 2006-07-01 10:33:18下载
- 积分：1
