-
Power_Law_Transformation
Histrogram Power Law Transformation
- 2010-02-14 01:20:31下载
- 积分：1
-
MTI-radar-system-delay-cancellation
雷达系统MTI延迟对消器实现程序，对理解雷达动目标检测很有帮助(MTI radar system delay cancellation in implementation process, is of great help to understand the radar moving target detection
)
- 2013-12-25 22:41:42下载
- 积分：1
-
m_sequence
压缩感知中基于m序列的测量矩阵的构成，代码在matlab上进行了仿真，效果好于传统高斯矩阵。代码有详细注释，易懂(This codes described measurement matrix based on m sequences in Compressed sensing. It has good result in matlab environment and the effect is better than the traditional Gaussian matrix. Code has detailed notes, so ti is easy to understand.)
- 2015-03-24 21:39:51下载
- 积分：1
-
DTFT-Transform
数字信号处理中的基本DTFT变换代码，有非常详尽的解说和推导过程(Digital Signal Processing DTFT fundamental transformation code, a very detailed explanation and derivation)
- 2015-04-13 11:18:32下载
- 积分：1
-
4.Unsharp-Masking
Use Laplacian filter to enhance the picture.
- 2013-01-14 16:14:41下载
- 积分：1
-
FFT
1．用Matlab产生正弦波,矩形波,以及白噪声信号，并显示各自时域波形图
2．进行FFT变换，显示各自频谱图，其中采样率，频率、数据长度自选
3．做出上述三种信号的均方根图谱,功率图谱,以及对数均方根图谱
4．用IFFT傅立叶反变换恢复信号，并显示恢复的正弦信号时域波形图(1. Produce sine wave, square wave, and the white noise signal with Matlab, and their time-domain waveform display
2. FFT transform, display each spectrum, where the sampling rate, frequency, length optional data
3. RMS to make maps of the three signals, power spectrum, as well as the number of RMS map
4. Restored by inverse Fourier transform IFFT signal and displays the time domain waveforms sinusoidal signal recovery)
- 2013-12-02 16:18:48下载
- 积分：1
-
jaibui
采用加权网络中节点强度和权重都是幂率分布的模型，wolf 方法计算李雅普诺夫指数,GSM中GMSK调制信号的产生。( Using weighted model nodes in the network strength and weight are power law distribution, wolf calculated Lyapunov exponent, GSM is GMSK modulation signal generation.)
- 2016-05-09 13:39:47下载
- 积分：1
-
MSK
msk demodulation technique using OQPSK
- 2009-06-16 00:30:26下载
- 积分：1
-
fusion
说明： 配电网规划必须满足辐射性和连通性，配电网扩展规划问题随机产生的初始群体中往往存在大量不可行解，采用根节点融合法可确保方案的可行性。(Distribution network planning must meet radiation and connectivity, distribution network expansion planning problem with randomly generated initial population there is often a large number of infeasible solutions, use of root fusion method to ensure feasibility.)
- 2010-05-04 09:37:43下载
- 积分：1
-
cebk_tsp
用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。
(Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
- 2011-05-22 08:12:37下载
- 积分：1
