-
shudu2
计算数独的好方法,能够快速解决问题,使用方便(Good way to calculate the number of independent, able to quickly solve the problem, easy to use)
- 2010-06-19 00:10:03下载
- 积分:1
-
Digital_Signal_Processing_Using_Matlab_-_Proakis
digital signal processing and matlab
- 2010-06-28 09:08:47下载
- 积分:1
-
RS
说明: RS的编码以及迭代译码,是【7,3 5】的RS码,希望对大家有帮助(it can work well~hope can help you)
- 2010-07-30 12:00:27下载
- 积分:1
-
DigitalEqualizer
Digital Equalizer in MATLAB7.0CODE,you can open a .wav file to play. And,you can adjust EQ arameters as your will. It also include two test files. One is a rock song. The other one is classic music.
- 2011-01-02 21:49:20下载
- 积分:1
-
OFDMChannelest
经典的信道估计方法。比较详细,可以运行。主要是LS估计(Classic channel estimation method. In more detail, you can run. LS estimate)
- 2013-04-30 03:29:01下载
- 积分:1
-
2008-model--title-race
2008国赛数模a题关于双目识别照相机的源代码1.m1.m,moni.m,moni2.m,moni3.m,gongqiexian.m为可执行代码,直接运行即得结果(当然必须保证代码即本文件中的图片pictrue.bmp在matlab的当前工作区)
2.执行m1.m时程序会将每个圆的像的边缘点以excel文件保存在D盘,而执行gongqiexian.m需要这些文件(2008 model a number of national title race
)
- 2011-06-27 16:20:18下载
- 积分:1
-
BasedonMATLABQuadratureAmplitudemodulationanddemod
本文介绍了利用MATLAB进行正交振幅调制与解调的仿真分析,仿真结果验证了该方法的正确性和可行性。(This paper describes the use of MATLAB Quadrature Amplitude modulation and demodulation of the simulation analysis, The simulation results show that the method is correct and feasible.)
- 2007-05-24 13:18:15下载
- 积分:1
-
wang
运筹学里的优化算法,源代码,而且经过matlab运行过了(Operations Research in the optimization algorithm, source code, and after a run Matlab)
- 2013-09-01 09:50:18下载
- 积分:1
-
MATLABSTFT
说明: 短时傅立叶变换程序,可得信号时频曲线,希望对大家有所帮助(Short time Fourier transform procedure can be time-frequency curve, we hope to help)
- 2011-03-31 22:45:45下载
- 积分:1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分:1