登录
首页 » matlab » optimum-array-processing

optimum-array-processing

于 2014-09-09 发布 文件大小:960KB
0 253
下载积分: 1 下载次数: 158
我要下载

代码说明：

  最优阵列处理随书程序，最全版本,包含课后习题程序(matlab code of optimum array processing)

文件列表：

最优阵列处理
............\Ch2figs_version1
............\................\fig2_1516.asv,1051,2010-07-28
............\................\fig2_1516.m,1038,2010-07-28
............\................\fig2_17.m,757,2010-07-19
............\................\fig2_18.m,2471,2001-10-04
............\................\fig2_19.m,2598,2001-10-04
............\................\fig2_20.asv,910,2010-07-28
............\................\fig2_20.m,902,2010-07-28
............\................\fig2_22.m,744,2010-07-28
............\................\fig2_23.m,568,2001-06-25
............\................\fig2_24.m,1649,2001-10-17
............\................\fig2_26.m,558,2001-06-25
............\................\fig2_29.m,499,2001-10-04
............\................\polardb.m,4910,2000-08-30
............\................\sinc.m,259,2000-08-31
............\Ch2figs_version1.zip,8967,2003-06-02
............\Ch2figs_version2
............\................\fig2_15_16.m,1085,2008-01-17
............\................\fig2_17.m,757,2012-09-13
............\................\fig2_18.m,2471,2001-10-04
............\................\fig2_19.m,2598,2001-10-04
............\................\fig2_20.m,910,2001-10-04
............\................\fig2_22.m,757,2001-10-04
............\................\fig2_23.m,568,2001-06-25
............\................\fig2_24.m,1649,2001-10-17
............\................\fig2_26.m,558,2001-06-25
............\................\fig2_29.m,496,2010-07-29
............\................\polardb.m,4910,2000-08-30
............\................\sinc.m,259,2000-08-31
............\Ch2figs_version2.zip,8949,2008-01-18
............\Ch3figs
............\.......\cheby.m,385,2000-09-15
............\.......\DPSS.m,392,2000-09-06
............\.......\fig3_01.m,952,2001-09-30
............\.......\fig3_02.m,1039,2001-09-30
............\.......\fig3_03.m,1091,2001-09-30
............\.......\fig3_04.m,1239,2001-09-30
............\.......\fig3_05_06_13.m,2629,2001-09-30
............\.......\fig3_07.m,1477,2001-09-30
............\.......\fig3_08.m,1246,2001-09-30
............\.......\fig3_10.m,569,2001-09-30
............\.......\fig3_11.m,1347,2001-10-17
............\.......\fig3_12.m,1253,2001-09-30
............\.......\fig3_17_18.m,1494,2001-09-30
............\.......\fig3_19_20.m,2617,2001-09-30
............\.......\fig3_21.m,2950,2001-09-30
............\.......\fig3_23.m,968,2001-09-30
............\.......\fig3_24.m,1023,2001-09-30
............\.......\fig3_25.m,797,2001-09-30
............\.......\fig3_26.m,1203,2001-10-17
............\.......\fig3_27.m,1867,2001-10-17
............\.......\fig3_28.m,1727,2001-09-30
............\.......\fig3_29a.m,1433,2001-09-30
............\.......\fig3_29b.m,1369,2001-09-30
............\.......\fig3_30.m,3137,2001-09-30
............\.......\fig3_31.m,2099,2001-09-30
............\.......\fig3_32.m,2363,2001-09-30
............\.......\fig3_33.m,2205,2001-09-30
............\.......\fig3_37.m,2436,2001-09-30
............\.......\fig3_38.m,1751,2001-09-30
............\.......\fig3_39.m,2223,2001-10-17
............\.......\fig3_40.m,1002,2001-09-30
............\.......\fig3_41.m,1189,2001-09-30
............\.......\fig3_42.m,1196,2001-09-30
............\.......\fig3_43.m,953,2001-09-30
............\.......\fig3_46.m,1939,2001-09-30
............\.......\fig3_47.m,1296,2001-09-30
............\.......\fig3_48.m,610,2001-09-30
............\.......\fig3_49.m,1013,2001-09-30
............\.......\fig3_50.m,6032,2001-09-30
............\.......\fig3_51.m,6045,2001-09-30
............\.......\fig3_52.asv,1123,2011-09-14
............\.......\fig3_52.m,1130,2011-09-14
............\.......\fig3_53.m,1108,2001-10-23
............\.......\fig3_56.m,913,2011-09-14
............\.......\fig3_57_59_61.m,2191,2001-09-30
............\.......\fig3_58.m,2025,2001-09-30
............\.......\fig3_60.m,1843,2001-10-17
............\.......\polardb.m,4910,2000-08-30
............\.......\sinc.m,259,2000-08-31
............\Ch3figs.zip,38612,2003-06-02
............\Ch3figs_version2
............\................\cheby.m,385,2000-09-15
............\................\DPSS.m,392,2000-09-06
............\................\fig3_01.m,952,2001-09-30
............\................\fig3_02.m,1039,2001-09-30
............\................\fig3_03.m,1091,2001-09-30
............\................\fig3_04.m,1239,2001-09-30
............\................\fig3_05_06_13.m,2629,2001-09-30
............\................\fig3_07.m,1477,2001-09-30
............\................\fig3_08.m,1246,2001-09-30
............\................\fig3_10.m,569,2001-09-30
............\................\fig3_11.m,1347,2001-10-17
............\................\fig3_12.m,1253,2001-09-30
............\................\fig3_17_18.m,1494,2001-09-30
............\................\fig3_19_20.m,2617,2001-09-30
............\................\fig3_21.m,2950,2001-09-30
............\................\fig3_23.m,968,2001-09-30
............\................\fig3_24.m,1023,2001-09-30

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • lsqr_b
    此算法为用于解反问题的lsqr算法，对Ax=b，输入矩阵A，列向量b，以及迭代步数，求得列向量x(This algorithm is used for solution of the inverse problem lsqr algorithm, Ax = b, the input matrix A, the column vector b, as well as the number of iterative steps, to seek the column vector x)
    2009-09-04 10:46:28下载
    积分：1
  • time_series
    matlab time series 模型
    2010-02-18 05:47:33下载
    积分：1
  • utilities
    基于SVM的快速极小化SMO化算法程序，程序清晰易懂，易理解，可读性强，希望对同行有所帮助 (SVM-based fast minimization algorithm SMO program, the program clear and easy to understand, easy to understand, readable, and want to help peers)
    2011-11-16 21:18:16下载
    积分：1
  • vmd
    说明：  VMD是通过迭代搜寻变分模型（具体怎么搜寻，请亲们自己看，我主要讲他的大概）最优解， 来确定我们所知的模态uk(t)及其对应的中心频率ωk和带宽。 每个模态都是具有中心频率的有限带宽（就是在频域中有在一定的宽度）。所有模态之和为源信号。(VMD is to determine the modal UK (t) and its corresponding central frequency, k and bandwidth by iteratively searching for the optimal solution of the variational model (see dear friends for details, and I will mainly talk about his approximate solution). Each mode is a finite bandwidth with a central frequency (that is, a certain width in the frequency domain).The sum of all modes is the source signal.)
    2020-05-22 17:09:22下载
    积分：1
  • calibration_pattern
    有关matlab摄像机标定的工具箱，可直接标记摄像机的外参和内参(Camera calibration toolbox for matlab, directly outside the parameters of the camera and mark internal reference)
    2011-07-29 10:08:31下载
    积分：1
  • AboutVLABS
    Abstract— We propose a simple speech compression algorithm using subband division and ADPCM (Adaptive Differential Pulse Code Modulation) algorithm. Although speech data are stored in a semiconductor memory device, its capacity and the available network capacity are limited. Therefore, it is necessary to compress the data as much as possible. The first is that the reconstructed datum must be understood correctly. Speech signal is compressed with a ratio of 1/4 using the proposed subband division and ADPCM (Adaptive Differential Pulse Code Modulation) algorithm.
    2013-08-14 22:58:20下载
    积分：1
  • C-C
    C-C方法用于计算相空间重构的参数，有注释(CC method is used to calculate the phase space reconstruction parameters comment)
    2021-04-06 14:59:02下载
    积分：1
  • AMI
    matlab实现AMI编码的代码，自己写的，大家小心下载，如果有错，请大家指正.matlab实现AMI编码的代码，自己写的，大家小心下载，如果有错，请大家指正(matlab code to implement AMI coding, write, and everyone will take to download, if there is wrong, please correct me )
    2010-11-21 21:04:45下载
    积分：1
  • paper5
    基于压缩感知的随机噪声成像雷达.pdf 一篇关于压缩感知应用文章(Random Noise Imaging Radar Based on Compressed Sensing)
    2012-10-03 10:03:18下载
    积分：1
  • Lorenz-chaos
    实现Lorenz混沌的simulink 程序。利用matlab的模块设计，可以很好的实现lorenz混沌。(Simulink realization of Lorenz chaotic process. Using matlab modular design, can achieve a good lorenz chaotic.)
    2013-11-22 08:28:07下载
    积分：1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！