-
ContourletSD
一种新的Contoutlet变换，它具有明显频率局部性。上传的是这种新算法的工具箱。(a new Contoutlet transform, it is apparent frequency localized. Upload the new algorithm toolbox.)
- 2007-07-06 13:48:18下载
- 积分：1
-
matlabsf
各种matlab经典算法：插值与拟合 规划问题 绘图 解方程 数据分析(Various matlab classic algorithm: interpolation and fitting graphics solution equation planning data analysis)
- 2008-05-27 08:24:48下载
- 积分：1
-
FFT_and_HARR_spectrum
利用MATLAB分别用FFT和HARR小波进行了信号功率谱的估计，程序简单实用。(FFT, respectively, with the use of MATLAB and a signal HARR wavelet power spectrum estimation, the procedure is simple and practical.)
- 2009-06-08 18:09:49下载
- 积分：1
-
goldstein_filt
针对insar影像的goldstein 相位滤波器(goldstein insar phase filter)
- 2020-11-13 23:29:42下载
- 积分：1
-
deepest
对给定的函数进行最速下降法求最低点的例子(a example for deepest method)
- 2009-09-19 14:28:18下载
- 积分：1
-
DCT
数字水印系统的实现——基于DCT的鲁棒水印。图像中数字水印的嵌入，分块DCT反变换(Image digital DCT)
- 2021-03-25 10:19:15下载
- 积分：1
-
erjnzhibianma
snrz.m 本函数实现将输入的一段二进制码编为相应的单极性非归零码输出
snr.m 本函数实现将输入的一段二进制码编为相应的单极性归零码输出
dnrz.m 本函数实现将输入的一段二进制码编为相应的双极性非归零码输出
dnr.m 本函数实现将输入的一段二进制码编为相应的双极性归零码输出(snrz.m achieve this function the input of a binary code compiled for the corresponding unipolar NRZ output snr.m functions for the input of the binary code compiled for the corresponding period of the unipolar NRZ output dnrz.m The functions for the input of a binary code compiled for the corresponding bipolar NRZ output dnr.m achieve this function the input of a binary code compiled for the corresponding output bipolar RZ)
- 2011-06-03 21:58:30下载
- 积分：1
-
11111
广义预测控制（GPC）仿真广义预测控制（GPC）仿真广义预测控制（GPC）仿真(GPC)
- 2020-11-19 19:59:38下载
- 积分：1
-
_MATLAB_(Proakis)
现代通信系统——使用MATLAB源码，该书提供了利用MATLAB的普及型学生版本在计算机上解决“现代通信系统”这门课程中涉及的几乎所有方面的问题的分析思路、方法、MATLAB脚本文件和处理结果的范例以及供学生自主学习研讨的习题。(This book is written for senior-level undergraduate and graduate students in electrical engineering, computer engineering, and computer science. It is intended to serve as a supplement to any of the comprehensive textbooks in communication systems.)
- 2009-03-06 12:21:24下载
- 积分：1
-
Bisection
he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial interval.) We then iteratively bisect the interval, generating a sequence of intervals [ak,bk] that is guaranteed to converge to a solution to f(x) = 0.
- 2009-03-20 04:30:16下载
- 积分：1
