资源列表
CV
- its a vending machine code:
langnang_v13
- 包括 MUSIC算法，ESPRIT算法 ROOT-MUSIC算法，结合PCA的尺度不变特征变换(SIFT)算法，用于时频分析算法。- Including the MUSIC algorithm, ESPRIT algorithm ROOT-MUSIC algorithm, Combined with PCA scale invariant feature transform (SIFT) algorithm, For time-frequency analysis algorithm.
MCUseria2
- 单片机串口通信程序集，51单片机串口调试程序一例-Microcontroller serial communication assembly, 51 MCU serial debugger one cases
Wireless-fading-channel
- 连续导频正弦波通过存在Doppler频移的快衰落信道复模型（基带等效模型）的构造-Continuous pilot frequency sine wave by the presence of Doppler shift fast fading channel model (complex baseband equivalent model) structure
II_Baseband_modulation_schemes
- Simulink MATLAB file for basic modulation simulation
iyhvy
- 包含飞行器飞行中的姿态控制，如侧滑角，倾斜角，滚转角，俯仰角，构成不同频率的调制信号，包括单边带、双边带、载波抑制及四倍频。- It comprises aircraft flight attitude control, such as slip angle, tilt angle, roll angle, pitch angle, Constituting the modulated signals of different frequencies, Including single side
FIMM
- FIMM自适应交互多模型的机动目标跟踪，FIMM_PDA.m为主程序-FIMM adaptive interacting multiple model target tracking, FIMM_PDA.m-based program
3205
- 是本科毕设的题目，实现六自由度运动学逆解算法，有详细的注释。- The title of the commercial is undergraduate course you Six degrees of freedom to achieve inverse kinematics algorithm, There are detailed notes.
PELCO-D-P
- PELCO-D与PELCO-P协议介绍，详细描述了协议的实现方法，两种协议的差异，对于代码实现很有帮助-PELCO-D and PELCO-P protocol descr iption, a detailed descr iption of the implementation of the agreement, differences between the two protocols is helpful for code
mkytc
- 实现了图像的加水印，去噪，加噪声等功能，是信号处理的基础，本程序的性能已经超过其他算法。- Realize image watermarking, de-noising, plus noise and other functions, Is the basis of the signal processing, This program has exceeded the performance of other algorithms.
feibuigiu
- matlab实现了五类灰色关联度模型的计算,包含CV、CA、Single、当前、恒转弯速率、转弯模型，用于信号特征提取、信号消噪。- matlab implements five gray correlation degree computing model, It contains CV, CA, Single, current, constant turn rate, turning model, For feature extraction, signal de-noising.
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