-
可用于地震勘探信号处理中的地震盲反褶积 FastICA25
可用于地震勘探信号处理中的地震盲反褶积的FastICA25代码。( FastICA25 code！ Can be used in seismic exploration signal processing of seismic blind deconvolution .)
- 2011-10-16 16:44:30下载
- 积分：1
-
Saliency_Map
Itti算法和他的文章。Itti提出的显著图模型是一种模拟生物体视觉注意机制的选择性注意模型,比较适合处理自然图像。(Itti algorithms and his article. Itti saliency map model proposed is a simulation of selective attention model organism visual attention mechanism, more suitable for processing natural images.)
- 2015-03-20 10:17:40下载
- 积分：1
-
RFID-in-matlab
关于rfid射频技术的实现方式的软件研究，并通过matlab进行了仿真(Theory of rfid programming，similation in matlab environment)
- 2011-05-27 08:59:27下载
- 积分：1
-
psat
潮流计算，电力系统的潮流计算，非常有用，是一个可视化的应用程序(powerflow)
- 2010-06-19 12:33:48下载
- 积分：1
-
16QAM-OFDM
说明： 基于16QAM调制解调的OFDM信道估计，计算了不同信噪比下的误码性能曲线，并画出了图。(Comb based on the OFDM pilot channel estimation, calculation of the BER performance under different signal to noise ratio curve, and draw the map.)
- 2010-04-29 09:30:01下载
- 积分：1
-
fdtd1D
一维光子晶体的FDTD 分析法MATLAB程序(One-dimensional FDTD analysis of photonic crystals MATLAB program)
- 2010-05-08 09:57:39下载
- 积分：1
-
FOChS
可以模拟大部分分数阶混沌系统的matlab代码，如分数阶Duffing方程，分数阶Lorenz方程等(The matlab code of most fractional order chaotic systems can be simulated, such as fractional Duffing equation, fractional Lorenz equation and so on.)
- 2021-04-10 18:38:58下载
- 积分：1
-
Simple_Fitness_Function
How to coding fitness function.
- 2010-01-05 16:28:34下载
- 积分：1
-
Alamouti-MIMO-MRC
Alamouti code, 2*1 MIMO, 2 transmitter 1 reciever, use MRC techniques.(Alamouti code, 2* 1 MIMO, 2 transmitter 1 reciever, use MRC techniques.)
- 2014-02-20 03:14:03下载
- 积分：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
