-
proposed_method
在阵列天线自适应信号处理中,经常会出现因为阵元位置信号角度估计等误差引起的,天线性能急剧下降的问题,在此运用稳健性的方法提出一种稳健的自适应阵列天线波束合成方法,来解决此问题(In the adaptive array antenna signal processing, often occur because the sensor position signal angle estimation error caused a sharp decline in the performance of the antenna problem, a robust adaptive array antenna beam synthesis method in this application of the robustness of the method to solve this problem)
- 2014-09-25 10:53:31下载
- 积分:1
-
SADFSA
这是21寸定位压合源代码(it s very inportent)
- 2013-11-15 19:37:11下载
- 积分:1
-
PMAC-Executive-Pro2-Suite_4_4_0_0
pmac应用软件 主要用于PMAC运动控制卡的开发(application of pmac)
- 2021-03-06 12:09:30下载
- 积分:1
-
1.-PPI
在EFI架構下寫一隻PPI sample(PEIM to PEIM Interface),使兩隻PEIM可透過此PPI互相傳遞資料.
Write a PPI sample to make two PEIMs able to communicate each other.(Write a PPI sample to make two PEIMs able to communicate each other.)
- 2013-12-26 15:01:10下载
- 积分:1
-
netlab
这是包含pca和ppca等诸多源程序的工具箱,希望大家喜欢。(This is the PCA and PPCA includes many source code of the toolbox, I hope everyone likes.)
- 2007-11-08 21:04:08下载
- 积分:1
-
ex18
1. 设计在数组中查找数据模板函数
函数名: SeqSearch
参数名及顺序: 数组:list, 数据:key, 个数:n
返回: 成功:数据在数中的下标,失败: -1(1 designed to find the data in the array template function function name: SeqSearch parameter names and order: Array: list, data: key, number: n Returns: Success: Data on the number of the next standard, failed:-1)
- 2014-10-24 19:38:06下载
- 积分:1
-
com
利用COM组建的实现VC++与MATLAB的混合编程(COM realize the use of established VC++ Mixed with MATLAB Programming)
- 2008-05-07 13:21:55下载
- 积分:1
-
Quick-Jack
audio jack communication
- 2014-11-05 10:28:39下载
- 积分:1
-
hunhebiancheng
matlab C++混编程序,用C++处理数据,由matlab显示画图(matlab C++ mixed program, with C++ process the data displayed by the matlab drawing)
- 2013-07-22 16:11:19下载
- 积分: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