-
testSigSub
干扰信号估计仿真程序程序，matlab仿真程序(Interference signal estimation procedure simulation program, matlab simulation program)
- 2013-12-07 16:15:59下载
- 积分：1
-
OFDMTechniqueandItsSimulationwithMATLAB
正交频分复用(OFDM)技术及其MATLAB模拟(orthogonal frequency division multiplexing (OFDM) technology and its MATLAB simulation)
- 2007-07-04 00:55:44下载
- 积分：1
-
SER
写了著名的最小均方准则下的自适应算法，在matlab环境下运行(Wrote a well-known least mean square criterion of the adaptive algorithm, running in matlab environment)
- 2007-10-26 23:15:17下载
- 积分：1
-
neton
运用牛顿拉夫逊法编制潮流程序，步骤简单易懂(Prepared using the trend of Newton Raphson procedure, the steps easy to understand)
- 2010-11-16 15:57:18下载
- 积分：1
-
123455
LTE系统中频率调度算法，利用该程序可以实现小区间干扰协调，非常适合初学者。(Frequency scheduling algorithm in LTE system, using the program can realize the inter cell interference coordination, very suitable for beginners.)
- 2014-08-20 13:14:02下载
- 积分：1
-
Kalman-Filter-Object-Tracking-master
bhkdsbjfglitgbkhkjghsdjghositgjos;itnjvgj,hjfd
- 2018-12-30 18:08:27下载
- 积分：1
-
FDFD_pc
This MATLAB code demonstrates the finite-difference frequency-domainmethod by modeling transmission and reflectance from a photonic crystal.(This MATLAB code demonstrates the finite-difference frequency-domain method by modeling transmission and reflectance from a photonic crystal.)
- 2009-10-01 10:26:11下载
- 积分：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
-
SIMULATED-ANNEALING-
这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l
me in classical optimization techniques which are based on linear and nonlin
ogramming. TSP can be described as follows: Given a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases.)
- 2013-12-15 03:26:30下载
- 积分：1
-
codes
1: MSE.m : to perform Mean Square Error between 2 images
2: most.m : to get the most redundant value in a matrix
3: getneighbors.m : to get circular neighbors of pixel
4: ColorSpaceConversion.m : convert an image into different color spaces and shows their channels
5: ImageSlicer : to separate the 8 bit planes of an image(return m*n*8 matrix)
5:
- 2010-11-12 03:58:13下载
- 积分：1
