资源列表
ten_qn81
- AHP层次分析法计算判断矩阵的最大特征值,包括脚本文件和函数文件形式，对信号进行频谱分析及滤波。- Calculate the maximum eigenvalue judgment matrix of AHP, Including scr ipt files and function files in the form, The signal spectral analysis and filtering.
xr537
- esprit算法对有干扰的信号频率进行估计,AHP层次分析法计算判断矩阵的最大特征值,借鉴了主成分分析算法（PCA）。- esprit algorithm signal frequency interference can be assessed Calculate the maximum eigenvalue judgment matrix of AHP, It draws on principal component analysis algorithm (PCA).
id532
- 能量熵的计算，信号维数的估计，鲁棒性好，性能优越。- Energy entropy calculation, Signal dimension estimates, Robustness, superior performance.
0870
- 一种基于多文档得图像合并技术，仿真效果非常好，采用加权网络中节点强度和权重都是幂率分布的模型。- Based on multi-document image obtained combining technique, Simulation of the effect is very good, Using weighted model nodes in the network strength and weight are power law distribution.
mvbrb
- 迭代自组织数据分析，到达过程是的泊松过程，采用的是脉冲对消法。- Iterative self-organizing data analysis, Arrival process is a Poisson process, It uses a pulse of consumer law.
nui_pu77
- 对HARQ系统的吞吐量分析，双向PCS控制仿真，雅克比迭代求解线性方程组课设。- HARQ throughput analysis of the system, Two-way PCS control simulation, Jacobi iteration for solving linear equations class-based.
kou_wn25
- LDPC码的完整的编译码，考虑雨衰 阴影 和多径影响，欢迎大家下载学习。- Complete codec LDPC code, Consider shadow rain attenuation and multipath effects Welcome to download the study.
7520
- ICA（主分量分析）算法和程序，计算加权加速度,matlab开发工具箱中的支持向量机。- ICA (Principal Component Analysis) algorithm and procedures, Weighted acceleration, matlab development toolbox support vector machine.
LTEgr
- 一种在通信中的协调算法，基于FFR与优先级的论文，希望对大家有帮助。-A coordination algorithm in communication, based on FFR and priority papers, is expected to help.
FM2018-380-Datasheet-v1.9
- FM2018-380 Datasheet v1.9
ye581
- LCMV优化设计阵列处理信号，可以广泛的应用于数据预测及数据分析,意信号卷积的运算,并且绘制图象。- LCMV optimization design array signal processing, Can be widely used in data analysis and forecast data, Convolution operation is intended to signal and image rendering.
kkkk
- 实现无向图的限制条件下的最短路径的代码，该算法比较精炼，适合java爱好者认真研究反复玩味-To achieve the unrestricted constraints under the conditions of the shortest path of the code, the algorithm more refined, suitable for java enthusiasts to study repeatedly