-
DSP_C
用c语言程序编写的一些算法程序,非常宝贵,吐血奉献。(gsdahhdfdsahdhfuj5r4wytryu56urteryertrt)
- 2009-10-12 10:22:59下载
- 积分:1
-
flocking--MALTLAB
多智能体蜂拥控制MATLAB基本仿真程序,帮助新手学习交流(multi-agent system of flocking matlab simulation programa )
- 2021-04-19 14:38:51下载
- 积分:1
-
solution
Steven M. Kay统计信号处理基础一书的解答(The solution of Fundamentals_Of_Statistical_Signal_Processing)
- 2010-09-03 16:27:27下载
- 积分:1
-
VBKONGJIAN
VB函数的三方控件函数调用和使用方法等(VB function tripartite function call, use the methods of)
- 2009-10-18 18:43:24下载
- 积分:1
-
Viterbi_Tst
这是用itpp库编写的卷积码的解码程序。由于用C++库和Intel的MKL库,所以速度飞快。同样的仿真点数,
Matlab2012下用了15分半钟,而这个程序仿真只用了半分钟,相当于是matlab速度的30多倍。(This is itpp prepared for the convolutional code decoding process. Because with C++ libraries and Intel' s MKL library, so fast. The same simulation points under Matlab2012 spent 15 and a half minutes, and this program simulation with only half a minute, the equivalent of 30 times the speed of matlab.)
- 2014-01-08 14:41:50下载
- 积分:1
-
OFDM
详细描述了在LTE中用到了OFDM技术,对于LTE初学者有很大的帮助。(Described in detail in the OFDM technology used in LTE, the LTE is very helpful for beginners.)
- 2010-08-19 22:23:47下载
- 积分:1
-
Moments-simulation
基于矩量法仿真的笼形天线宽带化设计 (Method of Moments simulation cage antenna design is based on broadband)
- 2013-11-24 10:15:51下载
- 积分:1
-
Decoupled-load-flow
采用稀疏矩阵的PQ分解法潮流计算程序(依据《电力系统计算》一书附录用C语言编写,使用方法、变量名称都与书上一致)(Decoupled load flow)
- 2013-12-07 13:33:07下载
- 积分:1
-
Heed-matlab.m
HEED的分簇算法的matlab代码,注释详细,对初学WSN协议的同学很大帮助。(HEED clustering algorithm matlab code, detailed notes for the students of great help beginners WSN protocol)
- 2014-01-20 17:18:56下载
- 积分:1
-
Recursive_integer_division
递归法求解整数划分。
整数划分,是指把一个正整数n写成如下形式:
n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分:1