登录
首页 » matlab » classical_music_2

classical_music_2

于 2013-09-15 发布 文件大小:1KB
0 210
下载积分: 1 下载次数: 2

代码说明:

  MUSIC算法[1]是一种基于矩阵特征空间分解的方法。从几何角度讲,信号处理的观测空间可以分解为信号子空间和噪声子空间,显然这两个空间是正交的。信号子空间由阵列接收到的数据协方差矩阵中与信号对应的特征向量组成,噪声子空间则由协方差矩阵中所有最小特征值(噪声方差)对应的特征向量组成。(MUSIC algorithm [1] is a feature space based on matrix decomposition method. From the geometric point of view, the signal processing can be decomposed observation space the signal subspace and the noise subspace, it is clear that the two spaces are orthogonal. Signal Subspace data received by the array covariance matrix and eigenvectors corresponding to the signal component, the noise subspace from the covariance matrix of all the smallest eigenvalue (noise variance) eigenvector components.)

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

发表评论

0 个回复

  • c18_cdmasim
    实现CDMA的matlab程序,程序很完整,需要的自己来看啦(CDMA-matlab program to achieve the program is very complete look at the needs of their own啦)
    2009-11-27 08:36:48下载
    积分:1
  • MP3Stego_1_1_15
    MPEG-1 Layer-3 simulation
    2010-05-22 21:55:25下载
    积分:1
  • R001.m
    贝叶斯回归分析,以二维图像线性拟合为例,解决过度拟合问题(Bayes regression)
    2013-12-13 13:13:25下载
    积分:1
  • 3D-yee
    3D cubic-cell yee space lattice with simple outer boundary conditions (PEC sheets). the time-step relation cdt=d/sqrt(3)
    2015-04-09 01:03:50下载
    积分:1
  • chaos
    混沌的经典书籍,课件以及上课的时候上交的作业(some books and algorithm about chaos )
    2010-10-26 20:27:48下载
    积分:1
  • FnnSimu
    source code of simlate function of fuzzy bp neural network
    2009-06-07 15:00:08下载
    积分:1
  • Adaptive-LBP
    an other image retrival matlab code
    2011-02-08 22:56:14下载
    积分:1
  • CDMA
    this a code about CDMA
    2012-06-08 21:23:08下载
    积分:1
  • face-towards
    LVQ神经网络的预测——人脸朝向识别,MATLAB的经典算法(LVQ neural network prediction- face towards the identification, MATLAB classical algorithm)
    2013-10-20 00:01:43下载
    积分:1
  • ACO
    TSP问题的人工蚁群算法中,假设m只蚂蚁在图的相邻节点间移动,从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定:1、信息素质,也称信息素痕迹。2、可见度,即先验值。(Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem solution. Each ant transition probability is determined by the figure of two kinds of parameters for each edge: 1, the quality of information, also called pheromone trails. 2, visibility, ie priors.)
    2016-10-10 20:51:31下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载