登录
首页 » matlab » dwesprit

dwesprit

于 2012-08-31 发布 文件大小:1KB
0 257
下载积分: 1 下载次数: 12

代码说明:

   用ESPRIT算法对面阵(平行线阵)方位角与俯仰角进行联合估计( Estimated jointly with the ESPRIT algorithm the opposite array (parallel linear array) azimuth and pitch angle)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • logistic
    matlab解决logistic模型代码(matlab code to solve logistic model)
    2020-10-14 09:07:30下载
    积分:1
  • EKF
    已知地震加速度记录,运用快速傅里叶变换求加速度的傅里叶谱。(Known earthquake acceleration records, the use of a fast Fourier transform seek acceleration Fourier spectrum.)
    2012-09-11 20:53:41下载
    积分:1
  • fft
    fft,本代码主要介绍fft的主要步骤,非常简单有很明了,非常适合阅读 (FFT, the code describes the main steps of FFT are very clear, very simple, very suitable for reading)
    2015-04-20 10:00:27下载
    积分:1
  • DS_SS
    说明:  讲述的直接序列扩频通信系统从信号产生,发射,信道传输,接收整个系统的程序(this is matlab for DS_SS system)
    2011-02-17 22:53:52下载
    积分:1
  • nonparametric-time-analysis
    这个文章系统详细的介绍了 非线性模型的一种确定P的阶数的方法(This article describes in detail the system as a nonlinear model to determine the order of method P)
    2013-10-25 09:42:28下载
    积分:1
  • AdaBoost
    ada boost分类器的matlab实现函数,有详细的注释(ada boost classifier matlab realize the function, detailed notes)
    2013-04-05 20:48:28下载
    积分:1
  • maiya
    信号为调频信号,实现对调频信号的脉冲压缩,获得距离像(FM signal, the signal on the FM signal pulse compression to get the distance like)
    2012-11-14 20:37:00下载
    积分: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 &lt = L &lt = 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 &lt = M &lt = 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 &lt = L &lt = 10000) and M (1 &lt = M &lt = 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
  • MATLABfortran
    MATLAB与fortran混编的案例代码,可运行,是学习的好例子(MATLAB mixed case with fortran code can be run, is a good example of learning)
    2014-01-29 17:42:38下载
    积分:1
  • Dijkf
    狄杰斯特拉算法matlab代码,用于计算最短路径(狄杰斯特拉 algorithm matlab code, used to calculate the shortest path)
    2014-02-05 15:51:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载