-
hcs302
Keeloq编解码例程包含解码编码源程序及应用笔记.rar(KEELOQ decoder codec routines contains source code and application notes. Rar)
- 2007-09-16 20:07:15下载
- 积分：1
-
video_processing
视频处理有关MATLAB源程序，包括视频定位，视频模板匹配，视频分割，视频滤波，视频捕捉等(MATLAB source video processing, including video positioning, video template matching, video segmentation, video filtering)
- 2010-09-01 20:36:55下载
- 积分：1
-
31500385OSTBC_OFDM
在空时分组码的MIMO-OFDM系统条件下，对信道，子载波，比特和功率进行分配，仿真结果表明，系统有良好的吞吐量性能(Space-time block codes in MIMO-OFDM system under the conditions of the channel, subcarrier, bit, and power allocation, simulation results show that the throughput of the system has good performance)
- 2011-01-09 17:20:46下载
- 积分：1
-
chuandongxitong
双馈感应风力发电机组传动链系统simulink仿真模型...................(wind turbine drive chain system simulink model........)
- 2013-12-26 09:38:39下载
- 积分：1
-
1-s2.0-S1878029613000716-main
Photovoltaic module modeling using simulink/matlab
- 2014-01-16 18:38:42下载
- 积分：1
-
FDM_circular
提供一种利用有限差分法matlab求解雷诺方程的方法(A method for solving Reynolds equations using the finite difference method MATLAB is presented)
- 2017-06-25 20:41:56下载
- 积分：1
-
hilbert
说明： 希尔伯特变换代码，用于求解超声波形包络线。并且有平滑处理(Hilbert transform code for solving ultrasonic envelopes. And smoothing)
- 2019-05-13 15:37:40下载
- 积分：1
-
m_seqU
产生m序列，应用于扩频你通信技术，非常实用。(Including pseudo-code tracking and using Matlab implementation of direct sequence spread spectrum signal tracking procedures.)
- 2013-02-02 20:53:17下载
- 积分：1
-
K-meanCluster
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
- 2007-11-15 01:49:03下载
- 积分：1
-
chanels-simulation
这个是对各种信道，如awgn、rayleigh、rice等的一个仿真。简单易懂，意义较大(This is a variety of channels, such as awgn, rayleigh, rice, etc. a simulation. Easy to understand, the larger significance)
- 2013-09-03 15:54:17下载
- 积分：1
