-
simulation_of_wireless_communication
一些有用的无线通信物理层的matlab代码,每个文件夹内都有代码使用说明。(some useful MATLAB codes about PHY layer of wireless communication.)
- 2010-08-10 19:45:47下载
- 积分:1
-
BPrecognition
BP神经网络识别手写字符验证码,包括10721张字母、数字样本(BP neural network handwritten character recognition codes, including 10,721 letters, numbers, samples)
- 2020-06-29 20:20:02下载
- 积分:1
-
getGLCM
说明: 灰度变16进制包含了多种功能是各种代码中必要的一步(Grayscale variable hexadecimal system contains many functions, which is a necessary step in various codes.)
- 2020-06-24 03:00:02下载
- 积分:1
-
庞加莱截面图法
说明: 庞加莱截面法,用于非线性动力学分析,可运行!(Applications of Poincare map in nonlinear dynamics)
- 2019-12-18 16:46:49下载
- 积分:1
-
files2
MATLAB程序设计教程》源代码-2660 MATLAB程序设计教程》源代码-2660 MATLAB程序设计教程》源代码-2660 MATLAB程序设计教程》源代码-2660(MATLAB Programming Guide, )
- 2007-08-07 15:01:19下载
- 积分:1
-
introc++
Intro for c++ from MIT
- 2010-11-23 20:46:39下载
- 积分:1
-
emd
EMD的程序要用到matlab的时频工具箱
matlab的工具箱的安装步骤:
1.解压下载的文件包,将tft/mfile复制到matlab的toolbox文件夹下
2.建立搜索路径,matlab->file->Set Path->Add Folder
->选择mfile文件夹复制到matlab的toolbox的路径->save->close
3.测试是否建立搜索路径成功,在matlab命令窗口打入:which fmsin
返回的结果是你放mfile的正确路径说明建立搜索路径成功。此时就完成了安装工具包的工作。(EMD program to use when the frequency of matlab toolbox
matlab toolbox installation steps:
Unzip the downloaded file package, copy tft/mfile to the toolbox matlab file folder
2 established the search path, matlab-> file-> Set Path-> Add Folder
-> Select mfile folder to the toolbox matlab path-> save-> close
3 test whether to establish a successful search path in matlab command window enter: which fmsin
The result returned is the correct path you put mfile instructions to establish a successful search path. This time to complete the installation kit work.)
- 2014-09-03 10:03:01下载
- 积分:1
-
非相干信号子空间宽带测向算法 wideband-direction-finding-algorithm
改进的非相干信号子空间宽带测向算法(最大功率频点选择)(Improved non-coherent signal subspace wideband direction finding algorithm (maximum power frequency selection))
- 2015-03-16 15:02:02下载
- 积分:1
-
Travelling-salesman-problem-algorithm
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
- 2013-12-30 00:26:10下载
- 积分:1
-
dctcode
hide message inside image and retrive it from image using dct
- 2014-02-05 14:27:57下载
- 积分:1