pashload是應(yīng)用在linux下的網(wǎng)絡(luò)帶寬測(cè)試源程序精確度比較高
/////////////////////////////////////
Pathload is a tool for estimating the available bandwidth
of an end-to-end path from a host S (sender) to a host R (receiver).
The available bandwidth is the maximum IP-layer
throughput that a flow can get in the path from S to R,
without reducing the rate of the rest of the traffic in the path.
用Fourier變換求取信號(hào)的功率譜---周期圖法
用Fourier變換求取信號(hào)的功率譜---分段周期圖法
用Fourier變換求取信號(hào)的功率譜---welch方法
功率譜估計(jì)----多窗口法（multitaper method ,MTM法）
功率譜估計(jì)----最大熵法（maxmum entmpy method,MEM法）
功率譜估計(jì)----多信號(hào)分類法（multiple signal classification,music法）Fourier transform to strike a signal to the power spectrum - the cycle of plans
Fourier transform to strike a signal to the power spectrum - Sub-cycle Method
Fourier transform to strike a signal to the power spectrum --- welch method
Power spectrum estimated more than window ---- Law (multitaper method, MTM)
---- Power spectrum estimate of maximum entropy (maxmum entmpy method, MEM)
---- More than the estimated power spectrum signal classification (multiple signal classification, music)
實(shí)現(xiàn)8比特字節(jié)的RS糾錯(cuò)編碼，可以指定極性校驗(yàn)字節(jié)數(shù)目，能產(chǎn)生的最大校驗(yàn)序列長(zhǎng)度為255字節(jié)（含極性校驗(yàn)字節(jié)）.This is an implementation of a Reed-Solomon code with 8 bit bytes, and a configurable number of parity bytes. The maximum sequence length (codeword) that can be generated is 255 bytes, including parity bytes.
包括使用修正Gram-Schmit算法實(shí)現(xiàn)QR分解，自編LU分解、利用冪法和反冪法計(jì)算矩陣最大和最小特征值的程序。例外附有使用這些算法的例子供參考。 QR decomposition algorithm based on modified Gram-Schmit LU decomposition algorithm algorithm used to find maximum and minimum eigenvalue based on power and inverse power method and some examples are also included.
ClustanGraphics聚類分析工具。提供了11種聚類算法。
Single Linkage (or Minimum Method, Nearest Neighbor)
Complete Linkage (or Maximum Method, Furthest Neighbor)
Average Linkage (UPGMA)
Weighted Average Linkage (WPGMA)
Mean Proximity
Centroid (UPGMC)
Median (WPGMC)
Increase in Sum of Squares (Ward s Method)
Sum of Squares
Flexible (ß space distortion parameter)
Density (or k-linkage, density-seeking mode analysis)
A novel met hod t o p artially compensate sigma2delta shap ed noise is p rop osed. By injecting t he comp en2
sation cur rent int o t he p assive loop f ilte r during t he delay time of t he p hase f requency detect or ( PFD) , a maximum
reduction of t he p hase noise by about 16dB can be achieved. Comp a red t o ot he r compensation met hods , t he tech2
nique p rop osed he re is relatively simple and easy t o implement . Key building blocks f or realizing t he noise cancel2
lation , including t he delay va riable PFD and comp ensation cur rent source , a re sp ecially designed. Bot h t he behavior
level and circuit level simulation results a re p resented.
WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a manner so as to ensure maximum coverage and connectivity with minimal or optimal number of nodes and furthermore elongate network lifetime with maximum energy utilization.
The problem addressed has been tackled for 1-D linear array and further extended to 2-Dimensions as stated in the next slides.
使用INTEL矢量統(tǒng)計(jì)類庫(kù)的程序,包括以下功能:
Raw and central moments up to 4th order
Kurtosis and Skewness
Variation Coefficient
Quantiles and Order Statistics
Minimum and Maximum
Variance-Covariance/Correlation matrix
Pooled/Group Variance-Covariance/Correlation Matrix and Mean
Partial Variance-Covariance/Correlation matrix
Robust Estimators for Variance-Covariance Matrix and Mean in presence of outliers
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum
pre-defined torque, without collision with any obstacle in the robot workspace.
The Hilbert Transform is an important component in communication systems, e.g. for single sideband modulation/demodulation, amplitude and phase detection, etc. It can be formulated as filtering operation which makes it possible to approximate the Hilbert Transform with a digital filter. Due to the non-causal and infinite impulse response of that filter, it is not that easy to get a good approximation with low hardware resource usage. Therefore, different filters with different complexities have been implemented.
The detailed discussion can be found in "Digital Hilbert Transformers or FPGA-based Phase-Locked Loops" (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4629940).
The design is fully pipelined for maximum throughput.
