-
Min2_gy_KBJS-FIR
基于广义最小二乘法的可变分数延时FIR滤波器设计(Delay FIR filter design based on the generalized least squares method of variable scores)
- 2013-11-25 19:37:54下载
- 积分：1
-
sb2sl.2010a.win32
Rake receiver with ds-ss
- 2010-06-21 11:27:26下载
- 积分：1
-
sweep_coverage
wsn 轮询覆盖算法 同学做的 还行，需要用的可以来看看(wsn algorithm)
- 2012-05-06 23:31:34下载
- 积分：1
-
students-practice-report-La-Tien-Dung-telecommuni
Report of student interns Technology Institute of Post and Telecommunication electronics and telecommunications industries, Hanoi, Vietnam
- 2014-09-26 03:26:08下载
- 积分：1
-
city_Dijkstra.m
数学建模中的图论知识来研究最短路径的问题，利用Dijkstra算法matlab实现(Graph theory knowledge in mathematical modeling is used to study the shortest path problem, which is realized by using Dijkstra algorithm matlab.)
- 2019-05-27 18:21:32下载
- 积分：1
-
deltamodulation
modulation and demodulation used in lte systems
including qpsk 16-qam 64-qam
- 2012-06-23 01:54:27下载
- 积分：1
-
signalcompress
给出了信号压缩通常的变换-量化-编码函数。DHT函数为离散DHT变换，是FFT变换的近似，其正反变换相同，克服了FFT复系数不利于存储的缺点。LLMAX函数给出了某x序列在固定比特下的最佳量化输出。熵编码函数为霍夫曼编码。(Gives the signal compression usually transform- quantitative- coding function. DHT DHT discrete transform function, the FFT transform approximation, the same positive and negative transformation, overcoming complex FFT coefficient is not conducive to storage shortcomings. LLMAX function x is given a fixed bit sequence in the optimum quantized output. Entropy coding function as Huffman coding.)
- 2013-07-27 10:40:54下载
- 积分：1
-
Monte Carlo
对仿真弹道进行3个参数偏差的蒙特卡罗打靶分析，然后给出置信区间高度等等(THE REAL EXAMPLES)
- 2016-04-26 11:40:43下载
- 积分：1
-
bstrap
bootstrp 抽样方法，可以用于进行一些统计量误差的估计(bootstrp sampling methods, can be used to carry out some statistics of the estimated error)
- 2007-08-07 10:31:43下载
- 积分：1
-
adapQuad
迭代自适应Simpson，Lobatto积分
In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.
We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)
- 2008-08-14 22:44:04下载
- 积分：1
