-
MATLAB
移动通信实验MATLAB仿真程序代码,包括1AWGN信道中BPSK调制系统的BER仿真计算,2移动信道建模的仿真分析,3CDMA通信系统仿真(Mobile communication experiment MATLAB simulation program code, including 1AWGN channel BPSK modulation system BER simulation calculation, the mobile channel modeling simulation analysis, 3CDMA communication system simulation)
- 2012-11-13 19:11:26下载
- 积分:1
-
QPSK_16QAM_AWGN_Rayleigh
本程序是用MATLAB编写的用于仿真通信系统中信号经过QPSK和16QAM调制后,通过高斯白噪声和瑞利衰落信道的星座图仿真(This program written by MATLAB is for the students who are studying telecommunication.It s very useful to simulate the signal constellation.)
- 2021-04-10 10:48:58下载
- 积分:1
-
随机信号的自相关函数和互相关函数Matlab
说明: 自相关函数及互相关函数编程(Autocorrelation function and its programming)
- 2020-05-01 17:04:05下载
- 积分:1
-
matlab
matlab的一本很好的资料,含有大量实例,及程序源码(matlab a good information, contains a lot of examples, and program source code)
- 2010-06-29 15:49:02下载
- 积分:1
-
periodicsignal
Noise can be defined as unwanted signal that interferes with the communication or measurement of another signal.
Noise conveys information regarding the source of the noise, e.g. the noise from a car engine conveys information regarding the state of the engine.
- 2010-08-26 03:45:16下载
- 积分:1
-
AplicacaoSVM
Aplication for Matlab, for a problem using SVM
- 2010-11-06 02:25:17下载
- 积分:1
-
Sort_pyramid
Pyramid sort, for 9-elements array (just for main idea)
- 2013-11-12 05:27:24下载
- 积分:1
-
qiantuihoudai-
前推后代潮流计算 把节点按不同类型定义为三类节点,方便计算(Forward offspring flow calculation node according to the different types of definitions for the three types of nodes, to facilitate the calculation)
- 2012-08-29 21:09:14下载
- 积分:1
-
IIR-filter-design
基于matlab的IIR滤波器设计,程序简单易懂(Matlab-based IIR filter design procedures are simple)
- 2013-11-04 21:07:16下载
- 积分:1
-
KNN
K最邻近密度估计技术是一种分类方法,不是聚类方法。
不是最优方法,实践中比较流行。
通俗但不一定易懂的规则是:
1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。
2.选出最小的前K数据个距离,这里用到选择排序法。
3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method.
It is not the best method, but it is popular in practice.
Popular but not necessarily understandable rule is:
1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov).
2. select the minimum distance from the previous K data, where the choice sorting method is used.
3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
- 2020-10-23 14:37:22下载
- 积分:1