-
OFDM
说明： 对OFDM（正交频分复用）的调制和解调过程的仿真(On OFDM (Orthogonal Frequency Division Multiplexing) modulation and demodulation process simulation)
- 2011-02-24 10:13:30下载
- 积分：1
-
Iluminamento
Calculates the luminance of a square using Matlab.
- 2011-05-25 04:47:21下载
- 积分：1
-
signal-piex
单像素的源文件，在matlab中打开，对重构单像素图像很有帮助(Single pixel of the source file in matlab open, single-pixel images on the reconstructed helpful)
- 2013-11-19 10:13:09下载
- 积分：1
-
InputDemo
daqaxis help for national instruments
- 2009-05-24 20:16:40下载
- 积分：1
-
radar
线性调频信号 雷达发射接收 匹配滤波 等等，一些基本的代码(Linear frequency modulated radar signal transmit receive matched filtering and so on, some of the basic code
)
- 2014-10-28 16:13:55下载
- 积分：1
-
prony1
一种重要的辨识方法，主要用于对电力系统中低频振荡和其他运行方式的辨识(An important recognition method, mainly used for the identification of low-frequency oscillations in the power system and other running)
- 2021-02-03 01:19:59下载
- 积分：1
-
SFBC-analyze-
2发1收天线和2发2收天线仿真，误码率，AWGN信道个SISO瑞利衰落信道(1 2 receive antenna and 2 2 receive antenna)
- 2015-05-23 22:28:22下载
- 积分：1
-
Aer
说明： 一种改进的时钟定时抖动估计方法An improved estimation of clock timing jitter(An improved estimation of clock timing jitter)
- 2011-04-05 08:55:47下载
- 积分：1
-
Ukf
UKF code for Unscented Kalman Filter sigma calculation(UKF code)
- 2014-08-29 16:41:48下载
- 积分：1
-
2
说明： 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。
现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。
可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入：
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数，每组有一对数字。
输出：
可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分：1
